|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| 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
| ASCII Text | x | ||
| R. Connelly, E.D. Demaine, G. Rote, "Straightening polygonal arcs and convexifying polygonal cycles," Foundations of Computer Science, IEEE Annual Symposium on, pp. 432, 41st Annual Symposium on Foundations of Computer Science, 2000. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.2000.892131, author = {R. Connelly and E.D. Demaine and G. Rote}, title = {Straightening polygonal arcs and convexifying polygonal cycles}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {2000}, issn = {0272-5428}, pages = {432}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892131}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Straightening polygonal arcs and convexifying polygonal cycles SN - 0272-5428 SP EP A1 - R. Connelly, A1 - E.D. Demaine, A1 - G. Rote, PY - 2000 KW - 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 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
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.
