Computer Science – Computational Geometry
Scientific paper
2006-04-06
Computer Science
Computational Geometry
23 pages, 25 figures, Latex; full journal version with all proof details. (Fixed crash-induced bugs in the abstract.)
Scientific paper
10.1145/1137856.1137868
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.
Connelly Robert
Demaine Erik D.
Demaine Martin L.
Fekete Sandor P.
Langerman Stefan
No associations
LandOfFree
Locked and Unlocked Chains of Planar Shapes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Locked and Unlocked Chains of Planar Shapes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locked and Unlocked Chains of Planar Shapes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-721127