Locked and unlocked chains of planar shapes

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.

[1]  Mark H. Overmars,et al.  Immobilizing Hinged Polygons , 2007, Int. J. Comput. Geom. Appl..

[2]  Erik D. Demaine,et al.  Hinged Dissection of Polypolyhedra , 2005, WADS.

[3]  Erik D. Demaine,et al.  An energy-driven approach to linkage unfolding , 2004, SCG '04.

[4]  Erik D. Demaine,et al.  Hinged Dissections Exist , 2007, SCG '08.

[5]  M. D. Kirszbraun Über die zusammenziehende und Lipschitzsche Transformationen , 1934 .

[6]  Helmut Alt,et al.  On the Complexity of the Linkage Recon guration Problem , .

[7]  Ileana Streinu,et al.  Acute Triangulations of Polygons , 2005, Discret. Comput. Geom..

[8]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[9]  David Eppstein,et al.  Hinged dissections of polyominoes and polyforms , 1999, CCCG.

[10]  R. Alexander The Circumdisk and its Relation to a Theorem of Kirszbraun and Valentine , 1984 .

[11]  R. Connelly,et al.  Innitesimally Locked Self-Touching Linkages with Applications to Locked Trees , 2002 .

[12]  I. J. Schoenberg,et al.  On Cauchy's Lemma Concerning Convex Polygons , 1967, Canadian Journal of Mathematics.

[13]  Jin Akiyama,et al.  Dudeney Dissection of Polygons , 1998, JCDCG.

[14]  Sue Whitesides,et al.  Dissections: self-assembled aggregates that spontaneously reconfigure their structures when their environment changes. , 2002, Journal of the American Chemical Society.

[15]  阿部 浩一,et al.  Fundamenta Mathematicae私抄 : 退任の辞に代えて , 1987 .

[16]  Günter Rote,et al.  Straightening polygonal arcs and convexifying polygonal cycles , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[17]  R. Connelly Rigidity and energy , 1982 .

[18]  D. Eppstein Hinged Kite Mirror Dissection , 2001, ArXiv.

[19]  Y. Gordon,et al.  On the Volume of Unions and Intersections of Balls in Euclidean Space , 1995 .

[20]  Robert Connelly,et al.  Pushing disks apart - The Kneser-Poulsen conjecture in the plane , 2001 .

[21]  Greg N. Frederickson,et al.  Hinged dissections : swinging & twisting , 2002 .

[22]  Sue WhitesidesyFebruary,et al.  On the Complexity of the Linkage Reconfiguration Problem , 2003 .

[23]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[24]  Jin Akiyama,et al.  Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry , 2004 .

[25]  Balázs Csikós,et al.  On the Volume of Flowers in Space Forms , 2001 .

[26]  B. M. Fulk MATH , 1992 .

[27]  H. Alt,et al.  On the Complexity of the Linkage Reconguration Problem , 2003 .