Locked and Unlocked Chains of Planar Shapes
<|reference_start|>Locked and Unlocked Chains of Planar Shapes: We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together sequentially at rotatable joints. Our goal is to characterize the families of planar shapes that admit locked chains, where some configurations cannot be reached by continuous reconfiguration without self-intersection, and which families of planar shapes guarantee universal foldability, where every chain is guaranteed to have a connected configuration space. Previously, only obtuse triangles were known to admit locked shapes, and only line segments were known to guarantee universal foldability. We show that a surprisingly general family of planar shapes, called slender adornments, guarantees universal foldability: roughly, the distance from each edge along the path along the boundary of the slender adornment to each hinge should be monotone. In contrast, we show that isosceles triangles with any desired apex angle less than 90 degrees admit locked chains, which is precisely the threshold beyond which the inward-normal property no longer holds.<|reference_end|>
@article{connelly2006locked,
    title={Locked and Unlocked Chains of Planar Shapes},
    author={Robert Connelly and Erik D. Demaine and Martin L. Demaine and Sandor
  P. Fekete and Stefan Langerman and Joseph S. B. Mitchell and Ares Ribo and
  Guenter Rote},
    journal={Discrete and Computational Geometry 44 (2010), 439-462},
    year={2006},
    doi={10.1007/s00454-010-9262-3},
    archivePrefix={arXiv},
    eprint={cs/0604022},
    primaryClass={cs.CG}
}