Corpus ID: 3036625

Locked and unlocked polygonal chains in 3D

@article{Biedl1999LockedAU,
  title={Locked and unlocked polygonal chains in 3D},
  author={T. Biedl and E. Demaine and Martin L. Demaine and S. Lazard and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. Toussaint and S. Whitesides},
  journal={ArXiv},
  year={1999},
  volume={cs.CG/9910009}
}

T. Biedl, E. Demaine, +8 authors S. Whitesides

Published 1999

Mathematics, Computer Science

ArXiv

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called… CONTINUE READING

View on ACM

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed