Straightening polygonal arcs and convexifying polygonal cycles

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 432-442

  Connelly, Robert ^a   Demaine, Erik D ^b   Rote, Gunter ^c  

^a Department of Molecular Biology and Genetics   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); PIECEWISE LINEAR TECHNIQUES; THEOREM PROVING;

POLYGONAL ARCS; POLYGONAL CYCLES;

COMPUTATIONAL GEOMETRY;

EID: 0034514005     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892131     Document Type: Article

References (44)

1. L. Asimow B. Roth The rigidity of graphs Trans. Amer. Math. Soc. 245 279 289 1978
2. L. Asimow B. Roth The rigidity of graphs. II J. Math. Anal. Appl. 68 1 171 190 1979
3. T. Biedl E. Demaine M. Demaine S. Lazard A. Lubiw J. O'Rourke M. Overmars S. Robbins I. Streinu G. Toussaint S. Whitesides Locked and unlocked polygonal chains in 3D 1999 060 Smith College
4. T. Biedl E. Demaine M. Demaine S. Lazard A. Lubiw J. O'Rourke S. Robbins I. Streinu G. Toussaint S. Whitesides On reconfiguring tree linkages: Trees can lock Proc. 10th Canadian Conf. Comput. Geom. Proc. 10th Canadian Conf. Comput. Geom. Montréal 1998-Aug. http:// cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-reconfiguring.ps.gz
5. T. C. Biedl E. D. Demaine S. Lazard S. M. Robbins M. A. Soss Convexifying monotone polygons Proc. 10th Internat. Sympos. Algorithms and Computation 1741 415 424 Proc. 10th Internat. Sympos. Algorithms and Computation Chennai India 1999-Dec.
6. T. C. Biedl E. D. Demaine M. A. Soss G. T. Toussaint Straightening visible chains under constraints 1999 CS-99-08 U. Waterloo
7. J. Cantarella H. Johnston Nontrivial embeddings of polygonal intervals and unknots in 3-space J. Knot Theory Ramifications 7 8 1027 1039 1998
8. R. Cocan J. O'Rourke Polygonal chains cannot lock in 4D Proc. 11th Canadian Conf. Comput. Geom. Proc. 11th Canadian Conf. Comput. Geom. Vancouver 1999-Aug. http://www.cs.ubc.ca/conferences/CCCG/elec-proc/c17.ps.gz
9. R. Connelly Handbook of Convex Geometry A 223 271 1993 North-Holland Rigidity
10. R. Connelly W. Whiteley Second-order rigidity and prestress tensegrity frameworks SIAM J. Discrete Math. 9 3 453 491 1996
11. H. Crapo W. Whiteley Statics of frameworks and motions of panel structures, a projective geometric introduction Structural Topology 6 43 82 1982
12. H. Crapo W. Whiteley Autocontraintes planes et polyèdres projetés. I. Le motif de base Structural Topology 20 55 78 1993
13. H. Crapo W. Whiteley Spaces of stresses, projections and parallel drawings for spherical polyhedra Beiträge Algebra Geom. 35 2 259 281 1994
14. P. Erdős Problem 3763 Amer. Math. Monthly 42 627 1935
15. H. Everett S. Lazard S. Robbins H. Schröder S. Whitesides Convexifying star-shaped polygons Proc. 10th Canadian Conf. Comput. Geom. Proc. 10th Canadian Conf. Comput. Geom. Montréal 1998-Aug. http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-everett-convexifying.ps.gz
16. M. D. Frank-Kamenetskii Unravelling DNA 1997 Addison-Wesley
17. H. Gluck Almost all simply connected closed surfaces are rigid Proc. Geometric Topology Conference 438 225 239 Proc. Geometric Topology Conference Park City Utah 1974-Feb.
18. J. Graver B. Servatius H. Servatius Combinatorial rigidity 1993 American Mathematical Society
19. B. Grünbaum How to convexify a polygon Geombinatorics 5 24 30 July 1995
20. J. E. Hopcroft P. J. Kahn A paradigm for robust geometric algorithms Algorithmica 7 4 339 380 1992
21. W. J. Lenhart S. H. Whitesides Reconfiguring closed polygonal chains in Euclidean d-space Discrete Comput. Geom. 13 123 140 1995
22. N. Madras A. Orlitsky L. A. Shepp Monte Carlo generation of self-avoiding walks with fixed endpoints and fixed length J. Statist. Phys. 58 1-2 159 183 1990
23. F. M. McMillan The Chain Straighteners 1979 MacMillan Press London
24. K. C. Millett Knotting of regular polygons in 3-space J. Knot Theory Ramifications 3 3 263 278 1994
25. B. Nagy Solution to problem 3763 Amer. Math. Monthly 46 176 177 Mar. 1939
26. J. O'Rourke Folding and unfolding in computational geometry Revised Papers from Japan Conf. Discrete and Comput. Geom. Revised Papers from Japan Conf. Discrete and Comput. Geom. Tokyo 1998-Dec.
27. B. Roth W. Whiteley Tensegrity frameworks Trans. Amer. Math. Soc. 265 2 419 446 1981
28. G. T. Sallee Stretching chords of space curves Geom. Dedicata 2 311 315 1973
29. C. E. Soteros S. G. Whittington Polygons and stars in a slit geometry J. Phys. A 21 L857 861 1988
30. S. D. Stellman P. J. Gans Efficient computer simulation of polymer conformation. I. Geometric properties of the hard-sphere model Macromolecules 5 516 526 1972
31. I. Streinu A combinatorial approach to planar non-colliding robot arm motion planning Proc. 41st IEEE Sympos. Found. Comp. Sci. Proc. 41st IEEE Sympos. Found. Comp. Sci. 2000-Nov.
32. G. Toussaint The Erdős-Nagy theorem and its ramifications Proc. 11th Canadian Conf. Comput. Geom. Proc. 11th Canadian Conf. Comput. Geom. Vancouver 1999-Aug. http://www.cs.ubc.ca/conferences/CCCG/elec-proc/fp19.ps.gz
33. W. Walter Gewöhnliche Differentialgleichungen 6th 1996 Springer-Verlag
34. Ordinary differential equations 1998 Springer
35. B. Wegner Partial inflation of closed polygons in the plane Beiträge Algebra Geom. 34 1 77 85 1993
36. B. Wegner Chord-stretching convexifications of spherical polygons Proc. Topology and Geometry Day, Textos de Matemática (Texts in Mathematics) Proc. Topology and Geometry Day, Textos de Matemática (Texts in Mathematics) Coimbra 1996-May
37. W. Whiteley Motions and stresses of projected polyhedra Structural Topology 7 13 38 1982
38. W. Whiteley Infinitesimally rigid polyhedra. I. statics of frameworks Trans. Amer. Math. Soc. 285 2 431 465 1984
39. W. Whiteley The projective geometry of rigid frameworks Finite geometries 103 353 370 1984
40. W. Whiteley Rigidity and polarity. I. Statics of sheet structures Geom. Dedicata 22 3 329 362 1987
41. W. Whiteley Infinitesimally rigid polyhedra. II. Modified spherical frameworks Trans. Amer. Math. Soc. 306 1 115 139 1988
42. W. Whiteley Mairoid applications 40 1 52 1992 Cambridge University Press Matroids and rigid structures
43. S. Whitesides Algorithmic issues in the geometry of planar linkage movement Australian Computer Journal 24 2 42 50 May 1992
44. S. G. Whittington Self-avoiding walks with geometrical constraints J. Statist. Phys. 30 2 449 456 1983