The polytope of non-crossing graphs on a planar point set

Discrete and Computational Geometry

Volumn 33, Issue 2, 2005, Pages 275-305

  Orden, David ^a   Santos, Francisco ^b  

^a UNIVERSITY OF ALCALÁ   (Spain)

^b UNIVERSITY OF CANTABRIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 12944273406     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1143-1     Document Type: Article

References (23)

1. P. Agarwal, J. Basch, L. Guibas, J. Hershberger, and L. Zhang. Deformable free space tilings for kinetic collision detection. In B. R. Donald, K. Lynch, and D. Rus, editors, Algorithmic and Computational Robotics: New Directions, 4th International Workshop on Algebraic Foundations of Robotics (WAFR), pages 83-96. A. K. Peters, Boston, MA, 2000.
2. O. Aichholzer, F. Aurenhammer, P. Brass, and H. Krasser. Pseudo-triangulations from surfaces and a novel type of flip. SIAM J. Comput., 32 (2003), 1621-1653.
3. O. Aichholzer, F. Aurenhammer, and H. Krasser. Adapting (pseudo)-triangulations with a near-linear number of edge flips. In Proc. 8th International Workshop on Algorithms and Data Structures (WADS), pp. 12-24. Lecture Notes in Computer Science, volume 2748. Springer-Verlag, Berlin, 2003.
4. S. Bespamyatnikh. Transforming pseudo-triangulations. Inform. Process. Lett., 90(3) (2004), 141-145.
5. L. I. Billera, P. Filliman, and B. Sturmfels. Constructions and complexity of secondary polytopes. Adv. Math., 83 (1990), 155-179.
6. R. Connelly, E. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), Redondo Beach, California, pp. 432-452, 2000.
7. R. Connelly, E. D. Demaine, and G. Rote. Blowing up polygonal linkages. Discrete Comput. Geom., 30(2), (2003), 205-239.
8. J. A. de Loera, S. Hoşten, F. Santos, and B. Sturmfels. The polytope of all triangulations of a point configuration. Doc. Math., 1 (1996), 103-119.
9. K. Fukuda. Software available at http://www.cs.mcgill.ca/~fukuda/soft/ cdd_home/cdd. html.
10. M. Goodrich and R. Tamassia. Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. J. Algorithms, 23 (1997), 51-73.
11. J. Graver, B. Servatius, and H. Servatius. Combinatorial Rigidity. Graduate Studies in Mathematics, volume 2. American Mathematical Society, Providence, RI, 1993.
12. R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu and W. Whiteley. Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom., to appear. Preliminary version in S. Fortune, editor, Proc. Nineteenth Conference on Computational Geometry, San Diego, California, pp. 154-163. ACM Press, New York, 2003.
13. R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, D. Souvaine, I. Streinu and W. Whiteley. Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom., to appear. Preliminary version in S. Fortune, editor, Proc. Nineteenth Conference on Computational Geometry, San Diego, California, pp. 154-163. ACM Press, New York, 2003.
14. D. Kirkpatrick, I. Snoeyink, and B. Speckmann. Kinetic collision detection for simple polygons. Internat. J. Comput. Geom. Appl., 12 (2002), 3-27.
15. C. Lee. The associahedron and triangulations of the n-gon. Eur. J. Combin., 10 (1989), 551-560.
16. D. Orden, F. Santos, B. Servatius, and H. Servatius. Combinatorial pseudo-triangulations. Preprint 2003. http://arxiv.org/abs/math.CO/0307370.
17. M. Pocchiola and G. Vegter. Pseudo-triangulations: theory and applications. In Proc. 12th Annual ACM Symposium on Computational Geometry, pages 291-300. ACM Press, New York, May 1996.
18. M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., 16 (1996) 419-153.
19. M. Pocchiola and G. Vegter. The visibility complex. Int. J. Comput. Geom. Appl., 6 (1996), 279-308.
20. G. Rote, F. Santos, and I. Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. In B. Aronov, S. Basu, J. Pach, and M. Sharir, editors. Discrete and Computational Geometiy - The Goodman-Pollack Festschrift, pp. 699-736. Algorithms and Combinatorics, volume 25. Springer-Verlag, Berlin, 2003.
21. B. Speckmann and C. D. Tóth. Allocating vertex π-guards in simple polygons via pseudo-triangulations. In Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 109-118, 2003.
22. I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, pages 443-453, 2000.
23. G. M. Ziegler. Lectures on Polytopes. Springer-Verlag, New York, 1995.