Show simple item record

dc.contributor.authorConnelly, Robert
dc.contributor.authorDemaine, Erik D.
dc.contributor.authorDemaine, Martin L.
dc.contributor.authorFekete, Sandor P.
dc.contributor.authorLangerman, Stefan
dc.contributor.authorMitchell, Joseph S. B.
dc.contributor.authorRibo, Ares
dc.contributor.authorRote, Gunter
dc.date.accessioned2011-04-01T18:34:56Z
dc.date.available2011-04-01T18:34:56Z
dc.date.issued2010-05
dc.date.submitted2007-05
dc.identifier.issn0179-5376
dc.identifier.issn1432-0444
dc.identifier.urihttp://hdl.handle.net/1721.1/62017
dc.description.abstractWe 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 <90° admit locked chains, which is precisely the threshold beyond which the slender property no longer holds.en_US
dc.language.isoen_US
dc.publisherSpring New Yorken_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s00454-010-9262-3en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleLocked and Unlocked Chains of Planar Shapesen_US
dc.typeArticleen_US
dc.identifier.citationConnelly, Robert et al. “Locked and Unlocked Chains of Planar Shapes.” Discrete & Computational Geometry 44.2 (2010): 439-462-462.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverDemaine, Erik D.
dc.contributor.mitauthorDemaine, Erik D.
dc.contributor.mitauthorDemaine, Martin L.
dc.relation.journalDiscrete and Computational Geometryen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsConnelly, Robert; Demaine, Erik D.; Demaine, Martin L.; Fekete, Sándor P.; Langerman, Stefan; Mitchell, Joseph S. B.; Ribó, Ares; Rote, Günteren
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record