Blowing Up Polygonal Linkages |
| |
Authors: | Robert Connelly, Erik D. Demaine Gü nter Rote |
| |
Affiliation: | (1) Department of Mathematics, Cornell University, Ithaca, NY 14853, USA;(2) Laboratory for Computer Science, Massachusetts Institute of Technology, 200 Technology Square, Cambridge, MA 02139, USA;(3) Institut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin , Germany |
| |
Abstract: | {Consider a planar linkage, consisting of disjoint polygonal arcsand cycles of rigid bars joined at incident endpoints (polygonal chains), withthe property that no cycle surrounds another arc or cycle. We prove that thelinkage can be continuously moved so that the arcs become straight, the cyclesbecome convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is piecewise-differentiable, does not decrease thedistance between any pair of vertices, and preserves any symmetry present inthe initial configuration.In particular, this result settles the well-studied carpentersrule conjecture. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|