Abstract
We discuss two variations of the two-dimensional post-office problem that arise when the post-offices are replaced by n postmen moving with constant velocities. The first variation addresses the question: given a point q o and time t o who is the nearest postman to q o at time t o? We present a randomized incremental data structure that answers the query in expected O(log2 n) time. The second variation views a query point as a dog searching for a postman to bite and finds the postman that a dog running with speed v o could reach first. We show that if the dog is quicker than all of the postmen then the data structure developed for the first problem permits us to solve the second one in O(log2 n) time as well.
This work was partially supported by the ESPRIT Basic Research Actions 7141 (ALCOMII) and 6546 (PROMotion).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Albers and T. Roos. Votonoi diagrams of moving points in higher dimensional spaces. In Proc. 3rd Scand. Workshop Algorithm Theory, LNCS 621:399–409. Springer-Verlag, 1992.
J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Geom., 8:51–71, 1992.
J.-D. Boissonnat and M. Teillaud. A hierarchical representation of objects: the Delaunay tree. In Proc. ACM Sympos. Comput. Geom., 260–268, 1986.
L. P. Chew. Building Voronoi diagrams for convex polygons in linear expected time. Report, Dept. Math. Comput. Sci., Dartmouth College, Hanover, NH, 1985.
K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387–421, 1989.
O. Devillers. Randomization yields simple O(n log* n) algorithms for difficult Ω(n) problems. Internat. J. Comput. Geom. Appl., 2(1):97–111, 1992.
H. Edelsbrunner, L. J. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision. SIAM J. Comput., 15:317–340, 1986.
J.-J. Fu and R. C. T. Lee. Voronoi diagrams of moving points in the plane. Internat. J. Comput. Geom. Appl., 1(1):23–32, 1991.
L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381–413, 1992.
L. Guibas, J. S. B. Mitchell, and T. Roos. Voronoi diagrams of moving points in the plane. In Proc. Workshop Graph-Theoret. Concepts Comput. Sci., LNCS 570:113–125. Springer-Verlag, 1991. (Remark (3), p. 121).
F. P. Preparata. Planar point location revisited. Internat. J. Found. Comput. Sci., 1:71–86, 1990.
T. Roos and H. Noltemeier. Dynamic Voronoi diagrams in motion planning. In Proc. 15th IFIP Conf., LNCIS 180:102–111. Springer-Verlag, 1992.
T. Roos. Voronoi diagrams over dynamic scenes. In Proc. 2nd Canad. Conf. Comput. Geom., pages 209–213, 1990.
T. Roos. Dynamic Voronoi, diagrams. Ph.D. Thesis, Bayerische Julius-Maximilians-Univ., Würzburg, Germany, 1991.
O. Schwarzkopf. Dynamic maintenance of geometric structures made easy. In Proc. IEEE Sympos. Found. Comput. Sci., pages 197–206, 1991.
R. Seidel. Backwards analysis of randomized geometric algorithms. ALCOM School on efficient algorithms design, Århus, Denmark, 1991.
K. Sugihara. Voronoi diagrams in a river. Internat. J. Comput. Geom. Appl., 2(1):29–48, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Devillers, O., Golin, M. (1993). Dog bites postman: Point location in the moving Voronoi diagram and related problems. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_50
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive