Blowing Up Polygonal Linkages.

Autor: Robert Connelly, Erik D. Demaine, Günter Rote
Předmět:
Zdroj: Discrete & Computational Geometry; Aug2003, Vol. 30 Issue 2, p205-239, 35p
Abstrakt: {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. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index