The zigzag path of a pseudo-triangulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2748, Issue , 2003, Pages 377-388

  Aichholzer, Oswin ^a   Rote, Günter ^b   Speckmann, Bettina ^c   Streinu, Ileana ^d  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c ETH ZURICH   (Switzerland)

^d SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; TRIANGULATION;

DIVIDE AND CONQUER; NOVEL ALGORITHM; POINT SET; PSEUDO-TRIANGULATIONS; ZIG-ZAG PATH;

SURVEYING;

EID: 35248889929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_33     Document Type: Article

References (18)

1. P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. Deformable free space tilings for kinetic collision detection. In B. R. Donald, K. Lynch, and D. Rus (eds.), Algorithmic and Computational Robotics: New Directions (Proc. 5th Workshop Algorithmic Found. Robotics), pages 83-96. A. K. Peters, 2001.
2. O. Aichholzer. The Path of a Triangulation. In Proc. 15th ACM Symp. Computational Geometry, pages 14-23, 1999.
3. ∼avis/C/lrs.html
4. D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Appl. Math., 65:21-46, 1996.
5. S. Bespamyatnikh. Enumerating Pseudo-Triangulations in the Plane. In Proc. 14th Canad. Conf. Comp. Geom., pages 162-166, 2002.
6. S. Bespamyatnikh. An efficient algorithm for enumeration of triangulations. Comp. Geom., Theory Appl., 23(3):271-279, 2002.
7. H. Brönnimann, L. Kettner, M. Pocchiola, and J. Snoeyink. Counting and enumerating pseudo-triangulations with the greedy flip algorithm. Manuscript, 2001.
8. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. Ray shooting in polygons using geodesic triangulations. Algorithmica, 12:54-68, 1994.
9. A. Dumitrescu, B. Gärtner, S. Pedroni, and E. Welzl. Enumerating triangulation paths. Comp. Geom., Theory Appl., 20:3-12, 2001.
10. H. Edelsbrunner and J. O'Rourke and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. In SIAM J. Comput., 15:341-363, 1986.
11. ∼fukuda/soft/cdd_home/cdd.html
12. Michael Goodrich and Roberto Tamassia, Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. J. Algorithms 23:51-73, 1997.
13. D. Kirkpatrick, J. Snoeyink, and B. Speckmann. Kinetic collision detection for simple polygons. Intern. Journal Comp. Geom. Appl., 12(1 & 2):3-27, 2002.
14. David Orden, Francisco Santos The polytope of non-crossing graphs on a planar point set. Manuscript, February 2003, arXiv:math.CO/0302126.
15. M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comp. Geom., 16:419-453, 1996.
16. G. Rote, F. Santos, and I. Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. Manuscript, FU-Berlin, September 2001.
17. B. Speckmann and C. Tóth. Allocating Vertex oπ-guards in Simple Polygons via Pseudo-Triangulations. In Proc. 14th Symp. on Discr. Algor., pages 109-118, 2003.
18. I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. 41st FOCS, pages 443-453, 2000.