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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Connelly, R., Demaine, E. & Rote, G. Blowing Up Polygonal Linkages. Discrete Comput Geom 30, 205–239 (2003). https://doi.org/10.1007/s00454-003-0006-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-003-0006-7