DocumentCode :
2734975
Title :
Straightening polygonal arcs and convexifying polygonal cycles
Author :
Connelly, Robert ; Demaine, Erik D. ; Rote, Gunter
Author_Institution :
Dept. of Math., Cornell Univ., Ithaca, NY, USA
fYear :
2000
fDate :
2000
Firstpage :
432
Lastpage :
442
Abstract :
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
Keywords :
computational geometry; graph theory; computational geometry; convex cycles; graph theory; piecewise-differentiable motion; planar linkage; polygonal arc straightening; polygonal chains; polygonal cycle convexifying; rule conjecture; symmetry; Bars; Biology computing; Computational geometry; Couplings; Fasteners; Physics computing; Polymers; Robots; Wire;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on
Conference_Location :
Redondo Beach, CA
ISSN :
0272-5428
Print_ISBN :
0-7695-0850-2
Type :
conf
DOI :
10.1109/SFCS.2000.892131
Filename :
892131
Link To Document :
بازگشت