Queries on Voronoi diagrams of moving points

Computational Geometry: Theory and Applications

Volumn 6, Issue 5, 1996, Pages 315-327

  Devillers, O ^a   Golin, M ^b   Kedem, K ^c   Schirra, S ^d  

^a INRIA   (France)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Dynamic computational geometry; Parametric search; Persistent data structures; Post office problem; Voronoi diagram

Indexed keywords

EID: 0008755991     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00053-4     Document Type: Article

References (15)

1. P.K. Agarwal and M. Sharir, Davenport-Schinzel Sequences and Their Geometric Applications (Cambridge Univ. Press, Cambridge, UK, 1995).
2. G. Albers and T. Roos, Voronoi diagrams of moving points in higher dimensional spaces, in: Proc. 3rd Scand. Workshop Algorithm Theory, Lecture Notes in Computer Science 621 (Springer, Berlin, 1992) 399-409.
3. R. Cole, Searching and storing similar lists, J. Algorithms 7 (1986) 202-220.
4. O. Devillers and M. Golin, Dog bites postman: Point location in the moving Voronoi diagram and related problems, in: Proc. 1st Annu. European Sympos. Algorithms (ESA '93), Lecture Notes in Computer Science 726 (Springer, Berlin, 1993) 133-144.
5. J.R. Driscoll, N. Sarnak, D.D. Sleator and R.E. Tarjan, Making data structures persistent, J. Comput. Syst. Sci. 38 (1989) 86-124.
6. J.-J. Fu and R.C.T. Lee, Voronoi diagrams of moving points in the plane, Internat. J. Comput. Geom. Appl. 1(1) (1991) 23-32.
7. M. Goodrich and R. Tamassia, Dynamic trees and dynamic point location, in: Proc. 23rd Annu. ACM Sympos. Theory Comput. (1991) 523-533.
8. L. Guibas, J.S.B. Mitchell and T. Roos, Voronoi diagrams of moving points in the plane, in: Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., Lecture Notes in Computer Science 570 (Springer, Berlin, 1991) 113-125.
9. L.J. Guibas, D.E. Knuth and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica 7 (1992) 381-413.
10. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30 (1983) 852-865.
11. T. Roos, Voronoi diagrams over dynamic scenes, in: Proc. 2nd Canad. Conf. Comput. Geom. (1990) 209-213.
12. T. Roos, Dynamic Voronoi diagrams, Ph.D. thesis, Bayerische Julius-Maximilians-Univ. Würzburg, Germany (1991).
13. T. Roos and H. Noltemeier, Dynamic Voronoi diagrams in motion planning, in: Computational Geometry -Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91, Lecture Notes in Computer Science 553 (Springer, Berlin, 1991) 227-236.
14. N. Sarnak and R.E. Tarjan, Planar point location using persistent search trees, Commun. ACM 29 (1986) 669-679.
15. K. Sugihara, Voronoi diagrams in a river, Internat. J. Comput. Geom. Appl. 2(1) (1992) 29-48.