Voronoi diagrams of moving points

International Journal of Computational Geometry and Applications

Volumn 8, Issue 3, 1998, Pages 365-379

  Albers, Gerhard ^a   Guibas, Leonidas J ^b   Mitchell, Joseph S B ^c   Roos, Thomas ^d  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b Stanford University   (United States)

^c Stony Brook University   (United States)

^d ETH ZURICH   (Switzerland)

Author keywords

Davenport schinzel sequences; Delaunay diagrams; Dynamic computational geometry; Kinematic data structures; Voronoi diagrams

Indexed keywords

EID: 2842584672     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000187     Document Type: Article

References (37)

1. A. Aggarwal, L. Guibas, J. Saxe, and P. Shor, "A linear time algorithm for computing the Voronoi diagram of a convex polygon," Discrete Comput. Geom. 4 (1989) 591-604.
2. A. Aggarwal, M. Sharir, and P.W. Shor, "Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences," Journal of Combinatorial Theory, Series A, 52 (1989) 49-63.
3. G. Albers, "Three-dimensional dynamic Voronoi diagrams," (in German), Diploma thesis, University of Würzburg, July 1991
4. G. Albers and T. Roos, "Voronoi diagrams of moving points in higher dimensional spaces,", Proc. Third Scandinavian Workshop on Algorithm Theory SWAT'92, Helsinki, Finland, July 1992, Springer-Verlag LNCS 621, pp. 399-409.
5. H. Aonuma, H. Imai, K. Imai, and T. Tokuyama, "Maximin locations of convex objects and related dynamic Voronoi diagrams," Proc. 6th ACM Sympos. on Comput. Geom., Berkeley, 1990, pp. 225-234.
6. M.J. Atallah, "Some dynamic computational geometry problems," Computers and Mathematics with Applications, 11 (1985) 1171-1181.
7. F. Aurenhammer, "Voronoi diagrams -A survey of a fundamental data structure," ACM Comput. Surv. 23 (1991) 345-405.
8. K. Brown, "Voronoi diagrams from convex hulls," Info. Proc. Letters 9 (1979) 223-228.
9. B. Chazelle, "An optimal convex hull algorithm in any fixed dimension," Discrete Comput. Geom. 10 (1993) 377-409.
10. 1 Voronoi diagram of moving points," Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 364-369.
11. L.P. Chew, K. Kedem, M. Sharir, B. Tagansky, and E. Welzl, "Voronoi diagrams of lines in 3-space under polyhedral convex distance functions," Proc. Sixth ACMSIAM Sympos. Discrete Algorithms, 1995.
12. K.L. Clarkson, "Safe and effective determinant evaluation," Proc. 31st IEEE Sympos. Found. Comp. Sci., 1992, pp. 387-395.
13. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs in Computer Science, Springer-Verlag, Berlin-Heidelberg, 1987.
14. J-J. Fu and R.C.T. Lee, "Voronoi diagrams of moving points in the plane," Internat. J. Comput. Geom. Appl. 1 (1991) 23-32.
15. L. Guibas, D.E. Knuth, and M. Sharir, "Randomized incremental construction of Delaunay and Voronoi diagrams," Proc. 17th Internat. Colloq. Automata Lang. Program. (ICALP '90), Springer-Verlag LNCS 443, 1990, pp. 414-431.
16. L. Guibas and J. Stolfi, "Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams," ACM Trans. Graphics 4 (1985) 74-123.
17. L. Guibas, J.S.B. Mitchell, and T. Roos, "Voronoi diagrams of moving points in the plane," Proc. 17th Internat. Workshop on Graph-Theoretic Concepts in Comput. Sci., Springer-Verlag LNCS 570, 1991, pp. 113-125.
18. H. Hadwiger and H. Debrunner, Kombinatorische Geometrie in der Ebene. Monographies de L'Enseignement Mathématique, No. 2, Université Genéve, 1959
19. S. Hart and M. Sharir, "Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes," Combinatorica 6 (1986) 151-177.
20. D.P. Huttenlocher, K. Kedem, and J.M. Kleinberg, "On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motions in the plane," Proc. 8th ACM Sympos. on Comput. Geom., Berlin, 1992, pp. 110-119.
21. H. Imai and K. Imai, "Voronoi diagrams of moving points," Proc. Int. Computer Symp., Taiwan, 1990, pp. 600-606.
22. K. Imai, S. Sumino, and H. Imai, "Geometric fitting of two corresponding sets of points," Proc. 5th ACM Symp. on Comput. Geom., 1989, pp. 266-275.
23. N. Katoh, T. Tokuyama, and K. Iwano, "On minimum and maximum spanning trees of linearly moving points," Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci., 1992, pp. 396-405.
24. V. Klee, "On the complexity of d-dimensional Voronoi diagrams," Archiv d. Math., 34 (1980) 75-80.
25. A. Okabe, B. Boots, and K. Sugihara, Spatial Tessellations: Concepts and Appli cations of Voronoi Diagrams, John Wiley & Sons, Chichester, England, 1992.
26. J. O'Rourke, "Computational Geometry Column 12," ACM SIGAGT News 22, No. 2, Spring 1991, 26-29.
27. P.P. Preparata and M.I. Shamos, Computational Geometry - An Introduction, Springer-Verlag, New York, 1985
28. T. Roos, "Voronoi diagrams over dynamic scenes (extended abstract)," Proc. 2nd Canad. Conf. Comput. Geom., Ottawa, 1990, pp. 209-213.
29. T. Roos, "Dynamic Voronoi diagram's," PhD. Thesis, University of Würzburg, Sept., 1991.
30. T. Roos, "Tighter bounds on Voronoi diagrams of moving points," Proc. 5th Canad. Conf. Comput. Geom., Waterloo, 1993, pp. 358-363.
31. T. Roos, "Voronoi diagrams over dynamic scenes," Discrete Appl. Math. 43 (1993) 243-259.
32. T. Roos, "Maintaining Voronoi diagrams in parallel," Proc. 20th Hawaii Internat. Conf. on System Sciences, Maui, 1994.
33. T. Roos and H. Noltemeier, "Dynamic Voronoi diagrams in motion planning: Combining local and global strategies," Proc. 15th IFIP Conf. System Modelling and Optimization, Zurich, 1991, Springer-Verlag LNCIS 180, pp. 102-111.
34. R. Seidel, "The complexity of Voronoi diagrams in higher dimensions," Proc. 20th Annual Allerton Conference, 1982, pp. 94-95.
35. M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
36. K. Sugihara and M. Iri, "Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic," Proc. IEEE 80 (1992) 1471-1484.
37. T. Tokuyama, "Deformation of merged Voronoi diagrams with translations," TRL Research Report TR87-0049, Aug. 1988, IBM Tokyo Research Laboratory.