Kinetic stable Delaunay graphs

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2010, Pages 127-136

  Agarwal, Pankaj K ^a   Gao, Jie ^b   Guibas, Leonidas J ^c   Kaplan, Haim ^d   Koltun, Vladlen ^c   Rubin, Natan ^d   Sharir, Micha ^d  

^a DUKE UNIVERSITY   (United States)

^b STONY BROOK UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

Delaunay triangulation; Kinetic data structures; Voronoi diagram

Indexed keywords

BOUNDED DEGREE; DELAUNAY; DELAUNAY GRAPH; DELAUNAY TRIANGULATION; KINETIC DATA STRUCTURE; MULTIPLICATIVE FACTORS; POLYLOGARITHMIC; SUBGRAPHS; TOPOLOGICAL CHANGES; UPPER BOUND; USEFUL PROPERTIES; VORONOI; VORONOI DIAGRAMS;

DATA STRUCTURES; TOPOLOGY; TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 77954924604     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810959.1810984     Document Type: Conference Paper

References (21)

1. P. K. Agarwal, J. Gao, L. Guibas, H. Kaplan, V. Koltun, N. Rubin and M. Sharir, Kinetic stable Delaunay graphs, http://www.cs.tau.ac.il/~rubinnat/ StableF.pdf.
2. P. K. Agarwal, H. Kaplan and M. Sharir, Kinetic and dynamic data structures for closest pair and all nearest neighbors, ACM Trans. Algorithms 5 (1) (2008), Art. 4.
3. P. K. Agarwal, Y. Wang and H. Yu, A 2D kinetic triangulation with near-quadratic topological changes, Discrete Comput. Geom. 36 (2006), 573-592.
4. N. Amenta and M. Bern, Surface reconstruction by Voronoi filtering, Discrete Comput. Geom., 22 (1999), 481-504.
5. N. Amenta, M. W. Bern and D. Eppstein, The crust and betaskeleton: combinatorial curve reconstruction, Graphic. Models and Image Processing 60 (2) (1998), 125-135.
6. 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.
7. J. Basch, L. J. Guibas and J. Hershberger, Data structures for mobile data, J. Algorithms 31 (1) (1999), 1-28.
8. L. P. Chew, Near-quadratic bounds for the L1 Voronoi diagram of moving points, Comput. Geom. Theory Appl. 7 (1997), 73-80.
9. L. P. Chew and R. L. Drysdale, Voronoi diagrams based on convex distance functions, Proc. First Annu. ACM Sympos. Comput. Geom., 1985, pp. 235-244.
10. 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.
11. H. Edelsbrunner, Geometry and Topology for Mesh Generation, Cambridge University Press, Cambride, 2001.
12. L. J. Guibas, Modeling motion, 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 1117-1134.
13. L. J. Guibas, Kinetic data structures-a state of the art report, In P. K. Agarwal, L. E. Kavraki and M. Mason, editors, Proc. Workshop Algorithmic Found. Robot., pages 191-209. A. K. Peters, Wellesley, MA, 1998.
14. 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.
15. 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.
16. H. Kaplan, N. Rubin and M. Sharir, A kinetic triangulation scheme for moving points in the plane, this proceedings.
17. D. Kirkpatrick and J. D. Radke, A framework for computational morphology, Computational Geometry (G. Toussaint, ed.), North-Holland (1985), 217-248.
18. D. Leven and M. Sharir, Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams, Discrete Comput. Geom. 2 (1987), 9-31.
19. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer Verlag, Berlin 1984.
20. J. Nievergelt and E. M. Reingold, Binary search trees of bounded balance, SIAM J. Comput. 2 (1973), 33-43.
21. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.