TY - GEN
T1 - Locked and unlocked chains of planar shapes
AU - Connelly, Robert
AU - Demaine, Erik D.
AU - Demaine, Martin L.
AU - Fekete, Sándor P.
AU - Langerman, Stefan
AU - Mitchell, Joseph S.B.
AU - Ribó, Ares
AU - Rote, Günter
PY - 2006
Y1 - 2006
N2 - 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 familes 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 inward normal from any point on the shape's boundary should intersect the line segment connecting the two incident hinges. In constrast, we show that isosceles triangles with any desired apex angle < 90° admit locked chains, which is precisely the threshold beyond which the inward-normal property no longer holds.
AB - 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 familes 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 inward normal from any point on the shape's boundary should intersect the line segment connecting the two incident hinges. In constrast, we show that isosceles triangles with any desired apex angle < 90° admit locked chains, which is precisely the threshold beyond which the inward-normal property no longer holds.
KW - Folding
KW - Hinged dissections
KW - Linkages
KW - Locked chains
UR - https://www.scopus.com/pages/publications/33748042634
U2 - 10.1145/1137856.1137868
DO - 10.1145/1137856.1137868
M3 - Conference contribution
AN - SCOPUS:33748042634
SN - 1595933409
SN - 9781595933409
T3 - Proceedings of the Annual Symposium on Computational Geometry
SP - 61
EP - 70
BT - Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06
PB - Association for Computing Machinery (ACM)
T2 - 22nd Annual Symposium on Computational Geometry 2006, SCG'06
Y2 - 5 June 2006 through 7 June 2006
ER -