Straightening Polygonal Arcs and Convexifying Polygonal Cycles

Discrete and Computational Geometry

Volumn 30, Issue 2, 2003, Pages 205-239

  Connelly, Robert ^a   Demaine, Erik D ^b   Rote, Günter ^c  

^a Department of Obstetrics Gynecology   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037520759     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-0006-7     Document Type: Conference Paper

References (72)

1. [AR1] Leonqrd Asimow and Ben Roth. The rigidity of graphs. Transactions of the American Mathematical Society, 245:279-289, 1978.
2. [AR2] Leonard Asimow and Ben Roth. The rigidity of graphs. II. Journal of Mathematical Analysis and Applications, 68(1):171-190, 1979.
3. [BGR] Brenda S. Baker, Eric Grosse, and Conor S. Rafferty. Nonobtuse triangulation of polygons. Discrete & Computational Geometry, 3(2): 147-168, 1988.
4. [BMR] Marshall Bern, Scott Mitchell, and Jim Ruppert. Linear-size nonobtuse triangulation of polygons. Discrete & Computational Geometry, 14(4):411-428, 1995.
5. [BC] Károly Bezdek and Robert Connelly. Two-distance preserving functions from Euclidean space. Periodica Mathematica Hungarica, 39(1-3):185-200, 1999.
6. +1] Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides. Locked and unlocked polygonal chains in three dimensions. Discrete & Computational Geometry, 26(3):283-287, 2001. The full version is Technical Report 060, Smith College, 1999, and arXiv:cs.CG/9910009, http://www.arXiv.org/abs/cs.CG/9910009
7. +2] Therese Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, and Sue Whitesides. A note on reconfiguring tree linkages: trees can lock. Discrete Applied Mathematics, 117(1-3):293-297, 2002.
8. +] Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, and Michael A. Soss. Convexifying monotone polygons. In Proceedings of the 10th Annual International Symposium on Algorithms and Computation, Chennai, India, volume 1741 of Lecture Notes in Computer Science, pages 415-424, December 1999. An expanded version is Technical Report CS-99-03, Department of Computer Science, University of Waterloo, 1999.
9. [BDST] Therese C. Biedl, Erik D. Demaine, Michael A. Soss, and Godfried T. Toussaint. Straightening visible chains under constraints. Technical Report CS-99-08, Department of Computer Science, University of Waterloo, 1999.
10. [BS] James H. Bigelow and Norman Z. Shapiro. Implicit function theorems for mathematical programming and for systems of inequalities. Mathematical Programming, 6:141-156, 1974.
11. [CJ] Jason Cantarella and Heather Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. Journal of Knot Theory and Its Ramifications, 7(8): 1027-1039, 1998.
12. [Cau] Augustin Louis Cauchy. Deuxième mémoire sur les polygones et polyèdres (Second memoir on polygons and polyhedra). Journal de l'École Polytechnique, 9:87-98, May 1813.
13. [CO1] Roxana Cocan and Joseph O'Rourke. Polygonal chains cannot lock in 4D, Computational Geometry: Theory and Applications, 20:105-129, 2001.
14. [CO2] Roxana Cocan and Joseph O'Rourke. Polygonal chains cannot lock in 4D. Technical Report 063, Smith College, February 2001, http://www.arXiv.org/abs/cs.CG/9908005.
15. [Con1] Robert Connelly. The rigidity of certain cabled frameworks and the second-order rigidity of arbitrarily triangulated convex surfaces. Advances in Mathematics, 37(3):272-299, 1980.
16. [Con2] Robert Connelly. Rigidity and energy. Inventiones Mathematicae, 66(1): 11-33, 1982.
17. [Con3] Robert Connelly. Rigidity. In Peter M. Gruber and Jörg M. Wills, editors, Handbook of Convex Geometry, volume A, pages 223-271. North-Holland, Amsterdam, 1993.
18. [CDR1] Robert Connelly, Erik D. Demaine, and Günter Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, pages 432-442, November 2000.
19. [CDR2] Robert Connelly, Erik D. Demaine, and Günter Rote. Straightening polygonal arcs and convexifying polygonal cycles. Technical Report B02-02, Freie Universität Berlin, 2002.
20. 3, pp. 287-311. Contempory Mathematics, vol. 304, American Mathematical Society, Providence, RI, 2002.
21. [CW1] Robert Connelly and Walter Whiteley. Second-order rigidity and prestress tensegrity frameworks. SIAM Journal on Discrete Mathematics, 9(3):453-491, 1996.
22. [CW2] Henry Crapo and Walter Whiteley. Statics of frameworks and motions of panel structures, a projective geometric introduction (with a French translation). Structural Topology, 6:43-82, 1982.
23. [CW3] Henry Crapo and Walter Whiteley. Autocontraintes planes et polyèdres projetés. I. Le motif de base (Plane self-stresses and projected polyhedra. I. The basic pattern). Structural Topology, 20:55-78, 1993.
24. [CW4] Henry Crapo and Walter Whiteley. Spaces of stresses, projections and parallel drawings for spherical polyhedra. Beiträge zur Algebra und Geometrie, 35(2):259-281, 1994.
25. [Cro] Peter R. Cromwell. Polyhedra, Cambridge University Press, Cambridge, 1997.
26. [DGK] Ludwig Danzer, Branko Grünbaum, and Victor Klee. Helly's theorem and its relatives. In Victor Klee, editor, Convexity, Proceedings of Symposia in Pure Mathematics, volume VII, pages 101-180. American Mathematical Society, Providence, RI, 1963.
27. [Epp] David Eppstein. Faster circle packing with application to nonobtuse triangulation. International Journal of Computational Geometry and Applications, 7(5):485-491, 1997.
28. [Erd] Paul Erdos. Problem 3763. American Mathematical Monthly, 42:627, 1935.
29. +] Hazel Everett, Sylvain Lazard, Steve Robbins, Heiko Schröder, and Sue Whitesides. Convexifying star-shaped polygons. In Proceedings of the 10th Canadian Conference on Computational Geometry, Montréal, August 1998. http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-everett-convexifying.ps.gz.
30. [Fia] Anthony V. Fiacco. Sensitivity analysis for nonlinear programming using penalty methods. Mathematical Programming, 10:287-311, 1976.
31. [FK] Maxim D. Frank-Kamenetskii. Unravelling DNA. Addison-Wesley, Reading, MA, 1997.
32. [Gar1] Martin Gardner. Mathematical games. Scientific American, 202, 1960. The problem is posed in the February issue (number 202) on page 150. A dissection into seven parts appears in the March issue (number 3), pages 177-178.
33. [Gar2] Martin Gardner. New Mathematical Diversions, pages 34 and 39-42. Mathematical Association of America, Washington, DC, 1995.
34. [Glu] Herman Gluck. Almost all simply connected closed surfaces are rigid. In Proceedings of the Geometric Topology Conference, Park City, Utah, volume 438 of Lecture Notes in Mathematics, pages 225-239, February 1974.
35. [GSS] Jack Graver, Brigitte Servatius, and Herman Servatius. Combinatorial Rigidity. American Mathematical Society, Providence, RI, 1993.
36. [GCK] Ulf Grenander, Yunshong Chow, and Daniel MacRae Keenan. Hands: A Pattern Theoretic Study of Biological Shapes. Springer-Verlag, New York, 1991.
37. [Grü] Branko Grünbaum. How to convexify a polygon. Geombinatorics, 5:24-30, July 1995.
38. [HK] John E. Hopcroft and Peter J. Kahn. A paradigm for robust geometric algorithms. Algorithmica, 7(4):339-380, 1992.
39. [KM1] Michael Kapovich and John Millson. On the moduli space of polygons in the Euclidean plane. Journal of Differential Geometry, 42(1):133-164, 1995.
40. [KM2] Michael Kapovich and John Millson. On the moduli space of polygons in the Euclidean plane. Journal of Differential Geometry, 42(2):430-464, 1995.
41. [KM3] Michael Kapovich and John J. Millson. The symplectic geometry of polygons in Euclidean space. Journal of Differential Geometry, 44(3):479-513, 1996.
42. [KM4] Michael Kapovich and John J. Millson. Moduli spaces of linkages and arrangements. In Jean-Luc Brylinski, Ranee Brylinski, Victor Nistor, Boris Tsygan, Ping Xu, editors, Advances in Geometry, volume 172 of Progress in Mathematics, pages 237-270. Birkhäuser, Boston, 1999.
43. [Kir] Rob Kirby. Problems in low-dimensional topology. In William H. Kazez, editor, Geometric Topology: Proceedings of the 1993 Georgia International Topology Conference, Athens, Georgia, volume 2.2 of AMS/IP Studies in Advanced Mathematics, pages 35-473. American Mathematical Society, Providence, RI, and International Press, Somerville, MA, 1997. http://www.math.berkeley.edu/̃kirby/problems.ps.gz.
44. [LW1] William J. Lenhart and Sue H. Whitesides. Turning a polygon inside-out. In Proceedings of the 3rd Canadian Conference on Computational Geometry, Vancouver, pages 66-69, August 1991.
45. [LW2] William J. Lenhart and Sue H. Whitesides. Reconfiguring simple polygons. Technical Report SOCS-93.3, School of Computer Science, McGill University, March 1993.
46. [LW3] William J. Lenhart and Sue H. Whitesides. Reconfiguring closed polygonal chains in Euclidean d-space. Discrete & Computational Geometry, 13:123-140, 1995.
47. [MOS] Neal Madras, Alon Orlitsky, and Lawrence A. Shepp. Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length. Journal of Statistical Physics, 58(1-2): 159-183, 1990.
48. [Man] Wallace Manheimer. Solution to problem E 1406: Dissecting an obtuse triangle into acute triangles. American Mathematical Monthly, 67:923, November 1960.
49. [McM] Frank M. McMillan. The Chain Straighteners. MacMillan, London, 1979.
50. [Mil] Kenneth C. Millett. Knotting of regular polygons in 3-space. Journal of Knot Theory and Its Ramifications, 3(3):263-278, 1994.
51. [Nag] Béla de Sz. Nagy. Solution to problem 3763. American Mathematical Monthly, 46:176-177, March 1939.
52. [O'R] Joseph O'Rourke. Folding and unfolding in computational geometry. In Revised Papers from the Japan Conference on Discrete and Computational Geometry, Tokyo, volume 1763 of Lecture Notes in Computer Science, pages 258-266, December 1998.
53. [RSS] Günter Rote, Francisco Santos, and Ileana Streinu. Expansive motions and the polytope of pointed pseudo-triangulations. To appear in Boris Aronov, Saugata Basu, János Pach, and Micha Sharir, editors, Discrete and Computational Geometry, the Goodman-Pollack Festschrift, Algorithms and Combinatorics, vol. 25, pp. 669-736. Springer-Verlag, Berlin, 2003.
54. [RW] Ben Roth and Walter Whiteley. Tensegrity frameworks. Transactions of the American Mathematical Society, 265(2)-419-446, 1981.
55. [Sal] G. Thomas Sallee. Stretching chords of space curves. Geometriae Dedicata, 2:311-315, 1973.
56. [SZ] Isaac Jacob Schoenberg and Stanislaw Krystyn Zaremba. Cauchy's lemma concerning convex polygons. Canadian Journal of Mathematics, 19(4): 1062-1071, 1967.
57. [SW] Chris E. Soteros and Stuart G. Whittington. Polygons and stars in a slit geometry. Journal of Physics A: Mathematical and General Physics, 21:L857-861, 1988.
58. [SG] Steven D. Stellman and Paul J. Gans. Efficient computer simulation of polymer conformation. I. Geometric properties of the hard-sphere model. Macromolecules, 5:516-526, 1972.
59. [Str] Ileana Streinu, A combinatorial approach to planar non-colliding robot arm motion planning. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, pages 443-453, November 2000.
60. [Tou] Godfried Toussaint. The Erdos-Nagy theorem and its ramifications. In Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, August 1999. http://www.cs.ubc.ca/conferences/CCCG/elec.proc/fp19.ps.gz.
61. [Wal] Wolfgang Walter. Gewöhnliche Differentialgleichungen, 6th edition. Springer-Verlag, Berlin, 1996. English translation: Ordinary Differential Equations, Springer-Verlag, New York, 1998.
62. [Wal] Wolfgang Walter. Gewöhnliche Differentialgleichungen, 6th edition. Springer-Verlag, Berlin, 1996. English translation: Ordinary Differential Equations, Springer-Verlag, New York, 1998.
63. [Weg1] Bernd Wegner. Partial inflation of closed polygons in the plane. Beiträge zur Algebra und Geometrie, 34(1):77-85, 1993.
64. [Weg2] Bernd Wegner. Chord-stretching convexifications of spherical polygons. In Craveiro de Cavalho and Francisco José, editors, Proceedings of the Topology and Geometry Day, Coimbra, volume 10 of Textes de Matemática (Texts in Mathematics), Séra B, pages 42-49. Universidade de Coimbra, Coimbra, May 1996.
65. [Whi1] Walter Whiteley. Motions and stresses of projected polyhedra (with a French translation). Structural Topology, 7:13-38, 1982.
66. [Whi2] Walter Whiteley. Infinitesimally rigid polyhedra. I. Statics of frameworks. Transactions of the American Mathematical Society, 285(2):431-465, 1984.
67. [Whi3] Walter Whiteley. The projective geometry of rigid frameworks. In Finite Geometries, Winnipeg, Manitoba, volume 103 of Lecture Notes in Pure and Applied Mathematics, pages 353-370, 1984.
68. [Whi4] Walter Whiteley. Rigidity and polarity. I. Statics of sheet structures. Geometriae Dedicata, 22(3):329-362, 1987.
69. [Whi5] Walter Whiteley. Infinitesimally rigid polyhedra. II. Modified spherical frameworks. Transactions of the American Mathematical Society, 306(1): 115-139, 1988.
70. [Whi6] Walter Whiteley. Matroids and rigid structures. In Neil White, editor, Matroid Applications, volume 40 of Encyclopedia of Mathematics and its Applications, pages 1-52. Cambridge University Press, Cambridge, 1992.
71. [Whi7] Sue Whitesides. Algorithmic issues in the geometry of planar linkage movement. Australian Computer Journal, 24(2):42-50, May 1992.
72. [Whi8] Stuart G. Whittington. Self-avoiding walks with geometrical constraints. Journal of Statistical Physics, 30(2) :449-456, 1983.