On topological changes in the Delaunay triangulation of moving points

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2012, Pages 1-10

  Rubin, Natan ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Delaunay triangulation; Discrete changes; Kinetic algorithms; Moving points; Voronoi diagram

Indexed keywords

DELAUNAY TRIANGULATION; DISCRETE CHANGES; FOUR-POINT; MOVING POINTS; TOPOLOGICAL CHANGES; UPPER BOUND; VORONOI DIAGRAMS;

TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 84863896096     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2261250.2261252     Document Type: Conference Paper

References (19)

1. U. A. Acar, B. Hudson and D. Türkoglu, Kinetic mesh refinement in 2D, Proc. 27th Annu. Sympos. Comput. Geom., 2011, 341-350.
2. P. K. Agarwal, O. Cheong and M. Sharir, The overlay of lower envelopes in 3-space and its applications, Discrete Comput. Geom. 15 (1996), 1-13.
3. P. K. Agarwal, J. Gao, L. Guibas, H. Kaplan, V. Koltun, N. Rubin and M. Sharir, Kinetic stable Delaunay graphs, Proc. 26th Annu. Symp. on Comput. Geom. (2010), 127-136.
4. P. K. Agarwal, Y. Wang and H. Yu, A 2D kinetic triangulation with near-quadratic topological changes, Discrete Comput. Geom. 36 (2006), 573-592.
5. F. Aurenhammer and R. Klein, Voronoi diagrams, in Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, Eds., Elsevier, Amsterdam, 2000, pages 201-290.
6. 1 Voronoi diagram of moving points, Comput. Geom. Theory Appl. 7 (1997), 73-80.
7. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
8. B. Delaunay, Sur la sphère vide. A la memoire de Georges Voronoi, Izv. Akad. Nauk SSSR, Otdelenie Matematicheskih i Estestvennyh Nauk 7 (1934), 793-800.
9. E. D. Demaine, J. S. B. Mitchell, and J. O'Rourke, The Open Problems Project, http://www.cs.smith.edu/~orourke/TOPP/.
10. H. Edelsbrunner, Geometry and Topology for Mesh Generation, Cambridge University Press, Cambride, 2001.
11. S. Fortune, Voronoi diagrams and Delaunay triangulations, In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, CRC Press, Inc., Boca Raton, FL, USA, second edition, 2004, pages 513-528.
12. L. J. Guibas, J. S. B. Mitchell and T. Roos, Voronoi diagrams of moving points in the plane, Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci., volume 570 of Lecture Notes Comput. Sci., pages 113-125. Springer-Verlag, 1992.
13. D. P. Huttenlocher, K. Kedem and J. M. Kleinberg, Voronoi Diagrams of Rigidly Moving Sets of Points, Inf. Process. Lett. 43 (4) (1992), 217-223.
14. C. Icking, R. Klein, N.-M. Lê and L. Ma, Convex distance functions in 3-space are different, Fundam. Inform. 22 (4) (1995), 331-352.
15. H. Kaplan, N. Rubin and M. Sharir, A kinetic triangulation scheme for moving points in the plane, Comput. Geom. Theory Appl. 44 (2011), 191-205.
16. V. Koltun, Ready, Set, Go! The Voronoi diagram of moving points that start from a line, Inf. Process. Lett. 89 (5) (2004), 233-235.
17. V. Koltun and M. Sharir, 3-dimensional Euclidean Voronoi diagrams of lines with a fixed number of orientations, SIAM J. Comput. 32 (3) (2003), 616-642.
18. N. Rubin, On topological changes in the Delaunay triangulation of moving points, http://page.mi.fu-berlin.de/rubinnat/pubs/KDel2Full.pdf.
19. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.