This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
41st Annual Symposium on Foundations of Computer Science
Straightening polygonal arcs and convexifying polygonal cycles
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
R. Connelly, Dept. of Math., Cornell Univ., Ithaca, NY, USA
E.D. Demaine, Dept. of Math., Cornell Univ., Ithaca, NY, USA
G. Rote, Dept. of Math., Cornell Univ., Ithaca, NY, USA
Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or cycle. We prove that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is piecewise-differentiable, does not decrease the distance between any pair of vertices, and preserves any symmetry present in the initial configuration. In particular this result settles the well-studied carpenter's rule conjecture.
Index Terms:
computational geometry; graph theory; polygonal arc straightening; polygonal cycle convexifying; planar linkage; polygonal chains; convex cycles; piecewise-differentiable motion; symmetry; rule conjecture; computational geometry; graph theory
Citation:
R. Connelly, E.D. Demaine, G. Rote, "Straightening polygonal arcs and convexifying polygonal cycles," focs, pp.432, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.