A two-dimensional kinetic triangulation with near-quadratic topological changes

Discrete and Computational Geometry

Volumn 36, Issue 4, 2006, Pages 573-592

  Agarwal, Pankaj K ^a   Wang, Yusu ^b   Yu, Hai ^a  

^a Duke University   (United States)

^b The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750379563     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1266-7     Document Type: Conference Paper

References (16)

1. P. K. Agarwal, J. Basch, M. de Berg, L. J. Guibas, and J. Hershberger, Lower bounds for kinetic planar subdivisions, Discrete Comput. Geom., 24 (2000), 721-733.
2. P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang, Deformable free space tiling for kinetic collision detection, Internat. J. Robotics Res., 21 (2002), 179-197.
3. P. K. Agarwal et al., Algorithmic issues in modeling motion, ACM Comput. Surveys, 24 (2002), 550-572.
4. P. K. Agarwal, L. J. Guibas, J. Hershberg, and E. Veach, Maintaining the extent of a moving point set, Discrete Comput. Geom., 26 (2001), 253-274.
5. P. K. Agarwal and C. M. Procopiuc, Advances in indexing mobile objects, IEEE Bull. Data Engr., 25 (2002), 25-34.
6. G. Albers, L. J. Guibas, J. Mitchell, and T. Roos, Voronoi diagrams of moving points, Internat. J. Comput. Geom. Appl., 8 (1998), 365-380.
7. M. Atallah, Some dynamic computational geometry problems, Comput. Math. Appl., 11 (1985), 1171-1181.
8. J. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, J. Algorithms, 31 (1999), 1-28.
9. M. W. Bern and D. Eppstein, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry (D.-Z. Du and F. K.-M. Hwang, eds.), 2nd edition, number 4 in Lecture Notes Series on Computing, World Scientific, Singapore, 1995, pp. 47-123.
10. 1 Voronoi diagram of moving points, Comput. Geom. Theory Appl., 7 (1997), 73-80.
11. J. Donea, Arbitrary Lagrangian-Eulerian finite element methods, in: Computational Methods for Transient Analysis (T. B. Belytschk and T. J. R. Hughes, eds.), North-Holland, Elsevier, Amsterdam, 1983, pp. 474-516.
12. H. Edelsbrunner, Triangulations and meshes in computational geometry, Acta Numer., 9 (2000), 133-213.
13. J. Erickson, D. Guoy, J. Sullivan, and A. Üngör, Building space-time meshes over arbitrary spatial domains, Proc. 11th Internat. Meshing Roundtable, 2002, pp. 391-402.
14. L. J. Guibas, Kinetic data structures: a state of the art report, in: Robotics: The Algorithmic Perspective (P. K. Agarwal, L. Kavraki, and M. Mason, eds.), A. K. Peters, Natick, MA, 1998, pp. 191-209.
15. D. Haussler and E. Welzl, B-Nets and simplex range queries, Discrete Comput. Geom., 2 (1987), 127-151.
16. M. Shark and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.