3 papers
cs.CG1999
Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine +8
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 stra…
cs.CG1999
On Reconfiguring Tree Linkages: Trees can Lock
Therese Biedl, Erik Demaine, Martin Demaine +7
It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfig…
cs.CG1998
Locked and Unlocked Polygonal Chains in 3D
T. Biedl, E. Demaine, M. Demaine +8
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 stra…