Erratum: Pseudo-triangulations, rigidity and motion planning (Discrete and Computanional Geometry 34:4 (587-635) DOI:10.1007/s00454-005-1184-0);Pseudo-triangulations, rigidity and motion planning

Discrete and Computational Geometry

Volumn 34, Issue 4, 2005, Pages 587-635

  Streinu, Ileana ^a  

^a SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30644462875     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-3300-1     Document Type: Erratum

References (86)

1. Pankaj Agarwal, Julien Basch, Leonidas Guibas, John Hershberger, and Li Zhang. Deformable free space tilings for kinetic collision detection. International Journal of Robotics Research, 21(3):179-197, 2003.
2. Oswin Aichholzer, Franz Aurenhammer, P. Brass, and Hannes Krasser. Pseudo-triangulations from surfaces and a novel type of edge flip. SIAM Journal on Computing, 32:1621-1653, 2003.
3. Oswin Aichholzer, Franz Aurenhammer, Peter Brass, and Hannes Krasser. Spatial embedding of pseudo-triangulations. In Proc. 19th Annual ACM Symposium on Computational Geometry, San Diego, California, volume 19, pages 144-153, 2003.
4. Oswin Aichholzer, Franz Aurenhammer, and Hannes Krasser. Adapting (pseudo)-triangulations with a near-linear number of edge flips. In Proc. 8th International Workshop on Algorithms and Data Structures (WADS), pages 12-24. Lecture Notes in Computer Science 2748. Springer-Verlag, Berlin, 2003.
5. Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, and Bettina Speckmann. Convexity minimizes pseudo-triangulations. Computational Geometry: Theory and Applications, 28(1):3-10, May 2004.
6. Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark Overmars, Michael A. Soss, and Godfried T. Toussaint. Reconfiguring convex polygons. Computational Geometry: Theory and Applications, 20(1-2):85-95, October 2001.
7. Oswin Aichholzer, M. Hoffmann, Bettina Speckmann, and Csaba D. Tóth. Degree bounds for constrained pseudo-triangulations. In Proc. 15th Annual Canadian Conference on Computational Geometry (CCCG 2003), Halifax, Nova Scotia, pages 155-158, 2003.
8. Oswin Aichholzer, David Orden, Francisco Santos, and Bettina Speckmann. On the number of pseudo-triangulations of certain point sets. In Proc. 15th Annual Canadian Conference on Computational Geometry (CCCG 2003), Halifax, Nova Scotia, pages 141-144, 2003.
9. Oswin Aichholzer, Günter Rote, Bettina Speckmann, and Ileana Streinu. The zigzag path of a pseudo-triangulation. In Proc. 8th International Workshop on Algorithms and Data Structures (WADS), pages 377-389. Lecture Notes in Computer Science 2748. Springer-Verlag, Berlin, 2003.
10. Vladimir I. Arnol'd. Ordinary Differential Equations. Springer-Verlag, New York, 1992. Translated from Russian, 3rd edition, 1984.
11. Boris Aronov, Jacob E. Goodman, and Richard Pollack. Convexifying a planar polygon in T2.3. Manuscript, October 1999.
12. L. Asimow and B. Roth. The rigidity of graphs. Transactions of the American Mathematical Society, 245:279-289, 1978.
13. L. Asimow and B. Roth. The rigidity of graphs, II. Journal of Mathematical Analysis and Applications, 68(1):171-190, 1979.
14. Achim Bachem and Walter Kern. Linear Programming Duality, an Introduction to Oriented Matroids. Springer-Verlag, New York, 1992.
15. Julien Basch, Jeff Erickson, Leonidas Guibas, John Hershberger, and Li Zhang. Kinetic collision detection between two simple polygons. In Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 102-111, 1999.
16. Saugata Basu, Richard Pollack, and Marie-Francoise Roy. Computing roadmaps of semi-algebraic sets on a variety. Journal of the AMS, 13:55-82, 2000.
17. Saugata Basu, Richard Pollack, and Marie-Francoise Roy. Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics. Springer-Verlag, New York, 2003.
18. Sergei Bespamyatnikh. Enumerating pseudo-triangulations in the plane. Computational Geometry: Theory and Applications, 30(3):207-222, 2005.
19. Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides. Locked and unlocked polygonal chains in three dimensions. Discrete & Computational Geometry, 26(3):269-281, October 2001.
20. Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides. On reconfiguring tree linkages: trees can lock. Discrete Applied Mathematics, 117:293-297, 2002.
21. Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter Ziegler. Oriented Matroids. Cambridge University Press, Cambridge, 1999.
22. Jürgen Bokowski. Oriented matroids. In Peter Gruber and Jörg Wills, editors, Handbook of Convex Geometry, volumes A and B, pages 555-602. North-Holland, Amsterdam, 1993.
23. Jürgen Bokowski, Susanne Mock, and Ileana Streinu. On the Folkman-Lawrence topological representation theorem for oriented matroids in rank 3. European Journal of Combinatorics, 22(5):601-615, 2001.
24. Ciprian Borcea and Ileana Streinu. The number of embeddings of minimally rigid graphs. Discrete & Computational Geometry, 31:287-303, 2004.
25. Hervé Brönnimann. The pseudo triangulation template toolkit. http:/geometry.poly.edu/pstoolkit/, 2001.
26. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, and Jack Snoeyink. Enumerating and counting pseudo-triangulations with the greedy flip algorithm. In Proc. ALENEX 2005, to appear.
27. John Canny. Complexity of Robot Motion Planning. MIT Press, Cambridge, MA, 1988.
28. Bernard Chazelle. Triangulating a simple polygon in linear time. Discrete & Computational Geometry, 6(5):485-524, 1991.
29. Roxana Cocan and Joseph O'Rourke. Polygonal chains cannot lock in 4d. Discrete & Computational Geometry, 20(3): 105-129, 2001.
30. Robert Connelley, Erik Demaine, and Günter Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), Redondo Beach, California, pages 432-452, 2000.
31. Journal version in Discrete & Computational Geometry, 30(5):205-239, 2003.
32. 3, pages 287-311. American Mathematical Society, Providence, RI, 2002. Collection of papers from the Special Session on Physical Knotting and Unknotting at the AMS Spring Western Section Meeting, Las Vegas, Nevada, April 21-22, 2001.
33. Henri Crapo. Two-tree-three decompositions. Unpublished manuscript, 1990.
34. Henri Crapo and Walter Whiteley. Plane self-stresses and projected polyhedra, I: the basic pattern. Structural Topology, 20:55-77, 1993.
35. Paul Erdös. Problem number 3763. American Mathematical Monthly, 46:627, 1935.
36. Israel Gel'fand, Mikhail Kapranov, and Andrei Zelevinsky. Newton polytopes of principal a-determinants. Soviet Mathematics Doklady, 40:278-281, 1990.
37. Herman Gluck. Almost all simply connected closed surfaces are rigid. In Geometric Topology, pages 225-239. Lecture Notes in Mathematics 438. Springer-Verlag, Berlin, 1975.
38. Jacob E. Goodman and Richard Pollack. Allowable sequences and order types in discrete and computational geometry. In János Pach, editor, New Trends in Discrete and Computational Geometry. Springer-Verlag, New York, 1993.
39. Jack Graver, Brigitte Servatius, and Herman Servatius. Combinatorial Rigidity. Graduate Studies in Mathematics, vol. 2. American Mathematical Society, Providence, RI, 1993.
40. Leonidas J. Guibas, John Hershberger, D. Leven, Micha Sharir, and Robert E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, 2:209-233, 1987.
41. Leonidas Guibas and Jorje Stolfi. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics, 4:74-123, 1985.
42. Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane Souvaine, Ileana Streinu, and Walter Whiteley. Planar minimally rigid graphs and pseudo-triangulations. Computational Geometry: Theory and Applications, 31(1-2):31-61, May 2005.
43. Preliminary version in Proc. ACM Symposium on Computational Geometry (SoCG), San Diego, California, pages 154-163, June 2003.
44. L. Henneberg. Die graphische Statik der starren Systeme. Johnson Reprint 1968. Leipzig, 1911.
45. John Hopcroft, Deborah Joseph, and Sue Whitesides. On the movement of robot arms in 2-dimensional bounded regions. SIAM Journal of Computing, 14:315-333, 1985.
46. Deborah Joseph and W. H. Platinga. On the complexity of reachability and motion planning questions. In Proc. ACM Symposium on Computational Geometry (SoCG), pages 62-66, 1985.
47. Micha Kapovich and John Millson. On the moduli spaces of polygons in the euclidean plane. Journal of Differential Geometry, 42(1): 133-164, 1995.
48. Lutz Kettner. Pseudo triangulation workbench. http:/www.cs.unc.edu/Research/compgeom/pseudoT/, 2001.
49. Lutz Kettner, David Kirkpatrick, Andrea Mantler, Jack Snoeyink, Bettina Speckmann, and Fumihiko Takeuchi. Tight degree bounds for pseudo-triangulations of points. Computational Geometry Theory and Applications, 25:1-12, 2003.
50. Rob Kirby. Problems in low-dimensional topology. http:/www.math.berkeley.edu/~ kirby, 1995.
51. David Kirkpatrick, Jack Snoeyink, and Bettina Speckmann. Kinetic collision detection for simple polygons. International Journal of Computational Geometry and Applications, 12(1 and 2):3-27, 2002.
52. David Kirkpatrick and Bettina Speckmann. Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. In Proc. 18th ACM Symposium on Computational Geometry (SoCG), pages 179-188, 2002.
53. G. Laman. On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics, 4:331-340, 1970.
54. William J. Lenhart and Sue Whitesides. Reconfiguring closed polygonal chains in euclidian d-space. Discrete & Computational Geometry, 13:123-140, 1995.
55. Laszlo Lovasz and Yechiam Yemini. On generic rigidity in the plane. SIAM Journal on Algebraic and Discrete Methods, 3(1):91-98, 1982.
56. Anna Lubiw and Sue Whitesides, editors. Workshop on Folding and Unfolding, Barbados, 1998. McGill University Bellairs Institute. Informal proceedings.
57. James Clerk Maxwell. On reciprocal figures and diagrams of forces. Philosphical Magazine, 27:250-261, 1864.
58. James Clerk Maxwell. On reciprocal figures, frameworks and diagrams of forces. Transactions of the Royal Society Edinburgh, 26:1-40, 1870.
59. James Clerk Maxwell. On Bow's method of drawing diagrams in graphical statics, with illustrations from Peaucellier's linkage. Cambridge Philosophical Society Proceedings, 2:407-414, 1876.
60. R. James Milgram and Jeff C. Trinkle. The geometry of configuration spaces for closed chains in two and three dimensions. Homology Homotopy and Applications, 6(1):237-267, 2004.
61. David Orden, Guenter Rote, Francisco Santos, Brigitte Servatios, Herman Servatius, and Walter Whiteley. Non-crossing frameworks with non-crossing reciprocals. http:/arxiv.org/abs/math.MG/0309156, 2003.
62. David Orden and Francisco Santos. The polytope of non-crossing graphs on a planar point set. Discrete. & Computational Geometry, 33(2):275-305, 2005.
63. David Orden, Brigitte Servatius, Herman Servatius, and Francisco Santos. Combinatorial pseudo-triangulations. http:/arxiv.org/abs/math.CO/0307370, July 2003.
64. Michel Pocchiola and Gert Vegter. Computing the visibility graph via pseudo-triangulations. In Proc. 11th Annual Symposium on Computational Geometry (SoCG), pages 248-257. ACM Press, New York, 1995.
65. Michel Pocchiola and Gert Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete & Computational Geometry, 16(4):419-453, 1996.
66. Franco P. Preparata and Michael I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
67. Dana Randall, Günter Rote, Francisco Santos, and Jack Snoeyink. Counting triangulations and pseudo-triangulations of wheels. In Proc. 13th Canadian Conference on Computational Geometry, pages 149-152, 2001. http:/compgeo.math.uwaterloo.ca/cccg01/proceedings.
68. András Recski. Matroid Theory and Its Applications. Springer-Verlag, New York, 1989.
69. Jürgen Richter-Gebert and Ulrich Kortenkamp. Cinderella, an Interactive Software Package for Geometry. Springer-Verlag, Berlin, 1999.
70. Günter Rote, Francisco Santos, and Ileana Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. In Janos Pach, Boris Aronov, Saugata Basu and Micha Sharir, editors, Discrete and Computational Geometry - The Goodman-Pollack Festschrift, pages 699-736. Algorithms and Combinatorics. Springer-Verlag, Berlin, 2003.
71. Günter Rote, Cao An Wang, Lusheng Wang, and Yinfeng Xu. On constrained minimum pseudo triangulations. In Proc. 9th Annual International Conference on Computing and Combinatorics, COCOON 2003, Big Sky, MT, July 25-28, 2003, pages 445-454. Lecture Notes in Computer Science 2697. Springer-Verlag, Berlin, 2003.
72. Jack Schwartz and Micha Sharir. On the piano mover's problem, II: general techniques for computing topological properties of real algebraic manifolds. Advances in Applied Mathematics, 4:298-351, 1983.
73. Bettina Speckmann and Csaba Tóth. Allocating vertex π-guards in simple polygons via pseudo-triangulations. Discrete & Computational Geometry, 33:345-364, 2005.
74. Ileana Streinu. Clusters of stars. In Proc. Thirteenth Annual Symposium on Computational Geometry, pages 439-441. ACM Press, New York, 1997.
75. Ileana Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. ACM/IEEE Symposium on Foundations of Computer Science, pages 443-453, 2000.
76. Ileana Streinu. Combinatorial pseudo-triangulations and partial oriented matroids. Draft, December 2003.
77. Ileana Streinu. Combinatorial roadmaps in configuration spaces of simple planar polygons. In Saugata Basu and Laureano Gonzalez-Vega, editors, Proc. DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, pages 181-206, 2003.
78. Ileana Streinu. Parallel redrawing mechanisms, pseudo-triangulation, and kinetic planar graphs. To appear in Proc. Graph Drawing, Limerick, Ireland, Sept. 2005.
79. Ileana Streinu and Walter Whiteley. Single-vertex origami and 3-dimensional expansive motions. To appear in Proc. Japan Conference on Discrete and Computational Geometry, Tokai University, Oct. 2004.
80. Tiong-Seng Tay and Walter Whiteley. Generating isostatic graphs. Structural Topology, 11:21-68, 1985.
81. Godfried Toussaint. The Erdös-Nagy theorem and its ramifications. Computational Geometry: Theory and Applications, 31(3):219-236, 2005.
82. Jeff C. Trinkle and R. James Milgram. Complete path planning for closed kinematic chains with spherical joints. International Journal of Robotics Research, 21(9):773-789, 2002.
83. Walter Whiteley. Motions and stresses of projected polyhedra. Structural Topology, 7:13-38, 1982.
84. Walter Whiteley. Some matroids from discrete applied geometry. In J. Oxley, J. Bonin and B. Servatius, editors, Matroid Theory, pages 171-311. Volume 197 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1996.
85. Walter Whiteley. Rigidity and scene analysis. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, 1st edn., pages 893-916. CRC Press, Boca Raton, FL, 1997.
86. Sue Whitesides. Algorithmic issues in the geometry of planar linkage movement. Australian Computer Journal, Special Issue on Algorithms, 24(2):42-50, 1992.