Locked and Unlocked Polygonal Chains in Three Dimensions

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.''
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00098772
Contributor : Sylvain Lazard <>
Submitted on : Friday, November 19, 2010 - 2:12:10 PM
Last modification on : Tuesday, August 13, 2019 - 10:16:02 AM
Long-term archiving on : Sunday, February 20, 2011 - 2:25:17 AM

File

99-R-227.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00098772, version 2

Collections

Citation

Thérèse Biedl, Erik Demaine, Martin Demaine, Sylvain Lazard, Anna Lubiw, et al.. Locked and Unlocked Polygonal Chains in Three Dimensions. Symposium on Discrete Algorithms - SODA'99, Jan 1999, Baltimore, United States. pp.866 - 867. ⟨inria-00098772v2⟩

Share

Metrics

Record views

207

Files downloads

709