Abstract
We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pankaj Agarwal, Julien Basch, Leonidas Guibas, John Hershberger, and Li Zhang, Deformable free space tilings for kinetic collision detection. In Bruce Randall Donald, Kevin Lynch and Daniela Rus (eds.), Algorithmic and Computational Robotics: New Directions, 4th Int. Workshop on Alg. Found. Robotics (WAFR), A K Peters, 2000, pp. 83–96.
[2] David Avis and Komei Fukuda, Reverse search for enumeration. Discrete Appl. Math. 65 (1996), 21–46.
[3] Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, and Jack Snoeyink. Counting and enumerating pseudo-triangulations with the greedy flip algorithm. Manuscript, submitted for publication, 2001.
[4] Rainer E. Burkard, Bettina Klinz, and Rüdiger Rudolf, Perspectives of Monge properties in optimization. Discrete Appl. Math. 70 (1996), 95–161.
[5] Frederic Chapoton, Sergey Fomin, and Andrei Zelevinsky, Polytopal realizations of generalized associahedra, preprint math.CO/0202004, 25 pages, February 2002.
Robert Connelly, Erik D. Demaine, and Günter Rote, Straightening polygonal arcs and convexifying polygonal cycles.Discrete & Computational Geometry, to appear. Preliminary version in Proc. 41st Ann. Symp. on Found. Of Computer Science (FOCS 2000), Redondo Beach, California; IEEE Computer Society Press, Washington, D.C., 2000, pp. 432–442; an extended version is available as technical report B 432–442, Freie Universität Berlin, Institut für Informatik, 2002.
[7] Robert Connelly and Walter Whiteley, Second-order rigidity and prestress tensegrity frameworks. SIAM Journal on Discrete Mathematics 9 (1996), 453–491.
[8] George B. Dantzig, Alan J. Hoffman, T. C. Hu, Triangulations (tilings) and certain block triangular matrices. Math. Programming 31 (1985), 1–14. Expansive Motions and the Pseudo-Triangulation Polytope 735
[9] Komei Fukuda, cdd code. http://www.ifor.math.ethz.ch/staff/fukuda/fukuda.html
[10] Israel M. Gelfand, M. I. Graev, and Alexander Postnikov, Combinatorics of hypergeometric functions associated with positive roots. In: Arnold, V. I. et al. (ed.), The Arnold-Gelfand Mathematical Seminars: Geometry and Singularity Theory. Boston, Birkhäuser. pp. 205–221 (1997)
[11] Israel M. Gel’fand, Andrei V. Zelevinskiĭ, and M. M. Kapranov, Discriminants of polynomials in several variables and triangulations of Newton polyhedra. Leningrad. Math. J. 2 (1991), 449–505, translation from Algebra Anal. 2 (1990), No. 3, 449–505.
[12] Michael Goodrich and Roberto Tamassia, Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. J. Algorithms 23 (1997), 51–73.
[13] Jack Graver, Brigitte Servatius, and Hermann Servatius, Combinatorial Rigidity. AMS Graduate Studies in Mathematics vol. 2, 1993.
[14] David Kirkpatrick, Jack Snoeyink, and Bettina Speckmann, Kinetic collision detection for simple polygons. International Journal of Computational Geometry and Applications 12 (2002), 3–27. Extended abstract in Proc. 16th Ann. Symposium on Computational Geometry, pp. 3–27, 2000.
[15] G. Laman, On graphs and rigidity of plane skeletal structures. J. Engineering Math. 4 (1970), 331–340.
[16] Carl Lee, The associahedron and triangulations of the n-gon. European J. Combinatorics 10 (1989), 551–560.
[17] Jesúus A. de Loera, Serkan Hoşten, Francisco Santos, and Bernd Sturmfels, The polytope of all triangulations of a point configuration. Documenta Mathematica, J. DMV 1 (1996), 103–119.
[18] Michel Pocchiola and Gert Vegter, Topologically sweeping visibility complexes via pseudo-triangulations. Discr. & Comput. Geometry 16 (1996), 419–453.
[19] Michel Pocchiola and Gert Vegter, The visibility complex. Int. J. Comput. Geom. Appl. 6 (1996), 279–308.
[20] Michel Pocchiola and Gert Vegter, Pseudo-triangulations: Theory and applications. In Proc. 12th Ann. ACM Sympos. Comput. Geom., ACM Press, May 1996, pp. 291–300.
[21] Alexander Postnikov, Intransitive trees. J. Combin. Theory, Ser. A 79 (1997), 360–366.
[22] Alexander Postnikov and Richard P. Stanley, Deformations of Coxeter hyperplane arrangements. J. Combin. Theory, Ser. A 91 (2000), 544–597.
[23] B. Speckmann and C. D. T¨®th, Vertex ¦Ð-guards in simple polygons. In Abstracts of the 18th European Workshop on Computational Geometry (EuroCG), April 10–12, 2002, Warszawa, Poland, pp. 10–12. Full version submitted for publication.
[24] Richard Stanley, Enumerative Combinatorics. Vol. 2, Cambridge University Press, 1999. 736 G. Rote, F. Santos, and I. Streinu
[25] Ileana Streinu, A combinatorial approach to planar non-colliding robot arm motion planning, In Proc. 41st Ann. Symp. on Found. of Computer Science (FOCS 2000), Redondo Beach, California, November 2000, pp. 443–453.
[26] Ileana Streinu, A combinatorial approach to planar non-colliding robot arm motion planning, preprint, 2002.
[27] Walter Whiteley, Rigidity and Scene Analysis, in: Jacob E. Goodman and Joseph O’Rourke (eds.) Handbook of Discrete and Computational Geometry, CRC Press, 1997, pp. 893–916.
[28] Günter Ziegler, Lectures on Polytopes (2nd ed.), Springer-Verlag, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rote, G., Santos, F., Streinu, I. (2003). Expansive Motions and the Polytope of Pointed Pseudo-Triangulations. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds) Discrete and Computational Geometry. Algorithms and Combinatorics, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55566-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-55566-4_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62442-1
Online ISBN: 978-3-642-55566-4
eBook Packages: Springer Book Archive