Locked and unlocked polygonal chains in three dimensions

Discrete and Computational Geometry

Volumn 26, Issue 3, 2001, Pages 269-281

  Biedl, T ^a   Demaine, E ^a   Demaine, M ^a   Lazard, S ^b   Lubiw, A ^a   O'Rourke, J ^c   Overmars, M ^d   Robbins, S ^e   Streinu, I ^c   Toussaint, G ^e   Whitesides, S ^e  

^a UNIVERSITY OF WATERLOO   (Canada)

^b INRIA   (France)

^c SMITH COLLEGE   (United States)

^d UTRECHT UNIVERSITY   (Netherlands)

^e MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035601782     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-001-0038-7     Document Type: Article

References (35)

1. C. C. Adams. The Knot Book. Freeman, New York, 1994.
2. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Locked and unlocked polygonal chains in 3D. In Proc. 10th ACM-SIAM Symp. Discrete Algorithms, pp. 866-867, Jan. 1999.
3. T. Biedl, E. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, M. Overmars, S. Robbins, I. Streinu, G. Toussaint, and S. Whitesides. Locked and unlocked polygonal chains in 3D. Archived by arXiv.org as arXiv:cs.CG/9910009 8 Oct. 1999 (see http://xxx.lanl.gov/help/general for information on how to access): also appeared as Smith College Technical Report TR060, 1999, 29 pages.
4. P. Bose, F. Gomez, P. Ramos, and G. T. Toussaint. Drawing nice projections of objects in space. In Graph Drawing (Proc. GD '95). vol. 1027 of Lecture Notes Computer Science, pp. 52-63. Springer-Verlag, Berlin, 1996.
5. J. Canny. The Complexity of Robot Motion Planning. ACM-MIT Press Doctoral Dissertation Award Series. MIT Press, Cambridge, MA, 1987.
6. R. Connelly, E. Demaine, and G. Rote. Straightening polygonal ares and convexifying polygonal cycles. In Proc. IEEE Symp. Foundations of Computer Science (FOCS). Nov. 12-14, 2000, pp. 432-442.
7. G. Crippen and T. Havel. Distance Geometry and Molecular Conformation. Research Studies Press, Letchworth, 1988.
8. J. Cantarella and H. Johnston. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications, vol. 7, pp. 1027-1039, 1998.
9. J. Calvo, D. Krizanc, P. Morin, M. Soss, and G. Toussaint. Convexifying polygons with simple projections. Inform. Process. Lett., to appear.
10. R. Cocan and J. O'Rourke. Polygonal chains cannot lock in 4d. In Proc. 11th Canad. Conf. Computational Geometry, 1999. Extended abstract. Full version: LANL/CoRR paper cs.CG/9908005.
11. P. Cromwell. Polyhedra. Cambridge University Press, Cambridge, 1997.
12. H. Everett, S. Lazard, S. Robbins, H. Schröder, and S. Whitesides. Convexifying star-shaped polygons. In Proc. 10th Canad. Conf. Computational Geometry, pp. 2-3, 1998.
13. P. Erdos. Problem 3763, Amer. Math. Monthly, vol. 42, p. 627, 1935.
14. C. C. Gibson and P. E. Newstead. On the geometry of the planar 4-bar mechanism. Acta Appl. Math., vol. 7, pp. 113-135, 1986.
15. B. Grünbaum. How to convexify a polygon. Geombinatorics, vol. 5, pp. 24-30, July 1995.
16. J. E. Hopcroft, D. A. Joseph, and S. H. Whitesides. Movement problems for 2-dimensional linkages. SIAM J. Comput., vol. 13, pp. 610-629, 1984.
17. J. E. Hopcroft, D. A. Joseph, and S. H. Whitesides. On the movement of robotic arms in 2-dimensional bounded regions. SIAM J. Comput., vol. 14, pp. 315-333, 1985.
18. K. H. Hunt. Kinematic Geometry of Mechanisms. Oxford University Press, Oxford, 1978.
19. V. Kantabutra. Reaching a point with an unanchored robot arm in a square. Internat. J. Comput. Geom., vol. 7, pp. 539-550, 1997.
20. J. U. Korein. A Geometric Investigation of Reach. ACM Distinguished Dissertations Series. MIT Press, Cambridge, MA, 1985.
21. M. van Kreveld, J. Snoeyink, and S. Whitesides. Folding rulers inside triangles. Discrete Comput. Geom., vol. 15, pp. 265-285, 1996.
22. C. Livingston. Knot Theory. The Mathematical Association of America, Washington, DC, 1993.
23. W. J. Lenhart and S. H. Whitesides. Reconfiguration with line tracking motions. In Proc. 4th Canad. Conf. Computational Geometry, pp. 198-203, 1992.
24. W. J. Lenhart and S. H. Whitesides. Reconfiguring closed polygonal chains in Euclidean d-space. Discrete Comput. Geom., vol. 13, pp. 123-140, 1995.
25. J. M. McCarthy. Geometric Design of Linkages. Springer-Verlag, New York, 2000.
26. K. Millett. Knotting of regular polygons in 3-space. J. Knot Theory Ramifications, vol. 3, 1994, pp. 263-278.
27. N. Madras and G. Slade. The Self-Avoiding Walk. Birkhauser, Boston, 1993.
28. B. de Sz. Nagy. Solution to problem 3763, Amer. Math. Monthly, vol. 46, pp. 176-177, 1939.
29. G.T. Sallee. Stretching chords of space curves. Geom. Dedicata, vol. 2, pp. 311-315, 1973.
30. J. T. Schwartz and M. Sharir. On the "piano movers" problem. II: General techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math., vol. 4, pp. 298-351, 1983.
31. I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. IEEE Symp. Foundations of Computer Science (FOCS), Nov. 12-14, 2000, pp. 443-153.
32. G. T. Toussaint. The Erdos-Nagy theorem and its ramifications. In Proc. 11th Canad. Conf. Computational Geometry, 1999. Extended abstract.
33. G. T. Toussaint. A new class of stuck unknots in Pol-6. Beiträge Algebra Geom. (also known as Contrib. Algebra Geom.), to appear, 2001.
34. S. H. Whitesides. Algorithmic issues in the geometry of planar linkage movement. Austral. Comput. J., vol. 24, pp. 42-50, 1992.
35. W. Whiteley. Rigidity and scene analysis. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 49, pp. 893-916, CRC Press, Boca Raton, FL, 1997.