Locked and Unlocked Chains of Planar Shapes
Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sandor, P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribo and, Guenter Rote

TL;DR
This paper generalizes linkage unfolding results from polygons to chains of arbitrary planar shapes, identifying conditions for locked configurations and universal foldability, with broad implications for shape reconfiguration.
Contribution
It introduces the concept of slender adornments that ensure universal foldability and characterizes shapes like isosceles triangles that admit locked chains.
Findings
Slender adornments guarantee universal foldability.
Isosceles triangles with apex angles less than 90° admit locked chains.
Polygonal linkage results extend to general planar shapes.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
