Tight degree bounds for pseudo-triangulations of points

Computational Geometry: Theory and Applications

Volumn 25, Issue 1-2, 2003, Pages 3-12

  Kettner, Lutz ^a   Kirkpatrick, David ^b   Mantler, Andrea ^c   Snoeyink, Jack ^c   Speckmann, Bettina ^d   Takeuchi, Fumihiko ^e  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

^d ETH ZURICH   (Switzerland)

^e UNIVERSITY OF TOKYO   (Japan)

Author keywords

Degree bounds; Face degree; Pseudo triangulation; Vertex degree

Indexed keywords

EID: 84867931246     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00126-8     Document Type: Article

References (14)

1. P.K. Agarwal, J. Basch, L.J. Guibas, J. Hershberger, and L. Zhang Deformable free space tilings for kinetic collision detection B.R. Donald, K. Lynch, D. Rus, Algorithmic and Computational Robotics: New Directions (Proc. 5th Workshop Algorithmic Found. Robotics) 2001 A.K. Peters 83 96
2. G.S. Brodal, and R. Jacob Dynamic planar convex hull with optimal query time and O(logn·loglogn) update time Scandinavian Workshop on Algorithm Theory 2000 57 70
3. T.M. Chan Dynamic planar convex hull operations in near-logarithmic amortized time Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci. 1999 92 99
4. B. Chazelle, H. Edelsbrunner, M. Grigni, L.J. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink Ray shooting in polygons using geodesic triangulations Algorithmica 12 1994 54 68
5. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf Computational Geometry: Algorithms and Applications 1997 Springer-Verlag Berlin
6. M. Goodrich, and R. Tamassia Dynamic ray shooting and shortest paths in planar subdivision via balanced geodesic triangulations J. Algorithms 23 1997 51 73
7. J. Hershberger, and S. Suri Applications of a semi-dynamic convex hull algorithm BIT 32 1992 249 267
8. D. Kirkpatrick, and B. Speckmann Separation sensitive kinetic separation structures for convex polygons Proc. Japan Conference on Discrete and Computational Geometry Lecture Notes Comp. Sci. 2098 2001 Springer-Verlag 222 236
9. D. Kirkpatrick, J. Snoeyink, and B. Speckmann Kinetic collision detection for simple polygons Proc. 16th ACM Sympos. Comp. Geom. 2000 322 330
10. M.H. Overmars, and J. van Leeuwen Maintenance of configurations in the plane J. Comput. Syst. Sci. 23 1981 166 204
11. M. Pocchiola, and G. Vegter Minimal tangent visibility graphs Computational Geometry 6 1996 303 314
12. M. Pocchiola, and G. Vegter Topologically sweeping visibility complexes via pseudo-triangulations Discrete Comput. Geom. 16 1996 419 453
13. D. Randall, G. Rote, F. Santos, and J. Snoeyink Counting triangulations and pseudo-triangulations of wheels Proc. 13th Canad. Conf. Comp. Geom. 2001 117 120
14. I. Streinu A combinatorial approach to planar non-colliding robot arm motion planning Proc. 41st FOGS 2000 443 453