Abstract
This paper studies movements of polygonal chains in three dimensions whose links are not allowed to cross or change length. Our main result is an algorithmic proof that any simple closed chain that initially takes the form of a planar polygon can be made convex in three dimensions. Other results include an algorithm for straightening open chains having a simple orthogonal projection onto some plane, and an algorithm for making convex any open chain initially configured on the surface of a polytope. All our algorithms require only O(n) basic ``moves.''
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received October 9, 1999, and in revised form February 6, 2001, and April 26, 2001. Online publication August 28, 2001.
Rights and permissions
About this article
Cite this article
Biedl, T., Demaine, E., Demaine, M. et al. Locked and Unlocked Polygonal Chains in Three Dimensions. Discrete Comput Geom 26, 269–281 (2001). https://doi.org/10.1007/s00454-001-0038-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-001-0038-7