Skip to main navigation Skip to search Skip to main content

Locked and unlocked chains of planar shapes

  • Robert Connelly
  • , Erik D. Demaine
  • , Martin L. Demaine
  • , Sándor P. Fekete
  • , Stefan Langerman
  • , Joseph S.B. Mitchell
  • , Ares Ribó
  • , Günter Rote
  • Cornell University
  • Massachusetts Institute of Technology
  • Technical University of Braunschweig
  • Université libre de Bruxelles
  • Free University of Berlin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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 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.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06
PublisherAssociation for Computing Machinery (ACM)
Pages61-70
Number of pages10
ISBN (Print)1595933409, 9781595933409
DOIs
StatePublished - 2006
Event22nd Annual Symposium on Computational Geometry 2006, SCG'06 - Sedona, AZ, United States
Duration: Jun 5 2006Jun 7 2006

Publication series

NameProceedings of the Annual Symposium on Computational Geometry
Volume2006

Conference

Conference22nd Annual Symposium on Computational Geometry 2006, SCG'06
Country/TerritoryUnited States
CitySedona, AZ
Period06/5/0606/7/06

Keywords

  • Folding
  • Hinged dissections
  • Linkages
  • Locked chains

Fingerprint

Dive into the research topics of 'Locked and unlocked chains of planar shapes'. Together they form a unique fingerprint.

Cite this