Polygonal chains cannot lock in 4D

Computational Geometry: Theory and Applications

Volumn 20, Issue 3, 2001, Pages 105-129

  Cocan, Roxana ^a   O'Rourke, Joseph ^a  

^a SMITH COLLEGE   (United States)

Author keywords

Bar framework; Knots; Locked chains; Polygonal chain

Indexed keywords

EID: 0035499637     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00013-X     Document Type: Article

References (18)

1. Adams C.C. The Knot Book. 1994;W.H. Freeman, New York.
2. Armstrong M.A. Basic Topology. 1979;McGraw-Hill, London.
3. Biedl T., Demaine E., Demaine M., Lazard S., Lubiw A., O'Rourke J., Overmars M., Robbins S., Streinu I., Toussaint G.T., Whitesides S. Locked and unlocked polygonal chains in 3D. Proc. 10th ACM-SIAM Sympos. Discrete Algorithms. January 1999;866-867. Full version: LANL arXive cs.CG/9910009.
4. Biedl T., Demaine E., Demaine M., Lubiw A., O'Rourke J., Overmars M., Robbins S., Streinu I., Toussaint G.T., Whitesides S. On reconfiguring tree linkages: Trees can lock. Proc. 10th Canadian Conf. Comput. Geom. 1998;4-5. Full version: LANL arXive cs.CG/9910024, to appear in Discrete Math.
5. Cantarella J., Johnston H. Nontrivial embeddings of polygonal intervals and unknots in 3-space. J. Knot Theory Ramifications. 7:(8):1998;1027-1039.
6. R. Cocan, Polygonal chains cannot lock in 4D, Undergraduate Thesis, Smith College, 1999.
7. Cocan R., O'Rourke J. Polygonal chains cannot lock in 4D. Proc. 11th Canadian Conf. Comput. Geom. 1999;5-8.
8. Connelly R., Demaine E.D., Rote G. Straightening polygonal arcs and convexifying polygonal cycles. Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci. November 2000;432-442 IEEE.
9. Crowell R.H., Fox R.H. Introduction to Knot Theory. 1965;Blaisdell Publishing Co. New York, NY.
10. Edelsbrunner H., Guibas L.J., Pach J., Pollack R., Seidel R., Sharir M. Arrangements of curves in the plane: Topology, combinatorics, and algorithms. Theoret. Comput. Sci. 92:1992;319-336.
11. Edelsbrunner H., Seidel R., Sharir M. On the zone theorem for hyperplane arrangements. SIAM J. Comput. 22:(2):1993;418-429.
12. Halperin D. Arrangements. Goodman J.E., O'Rourke J. Handbook of Discrete and Computational Geometry. 1997;389-412 CRC Press, Boca Raton, FL.
13. Hocking J.G., Young G.S. Topology. 1961;Addison-Wesley, Reading, MA.
14. Lenhart W.J., Whitesides S.H. Reconfiguring closed polygonal chains in Euclidean d -space. Discrete Comput. Geom. 13:1995;123-140.
15. Mishra B. Computational real algebraic geometry. Goodman J.E., O'Rourke J. Handbook of Discrete and Computational Geometry. 1997;537-558 CRC Press, Boca Raton, FL.
16. Sallee G.T. Stretching chords of space curves. Geometriae Dedicata. 2:1973;311-315.
17. Samuel P. Projective Geometry. 1988;Springer, New York.
18. Sharir M. Algorithmic motion planning. Goodman J.E., O'Rourke J. Handbook of Discrete and Computational Geometry. 1997;733-754 CRC Press, Boca Raton, FL.