Folding Equilateral Plane graphs

We consider two types of folding applied to equilateral plane graph linkages. First, under continuous folding motions, we show how to reconfigure any linear equilateral tree (lying on a line) into a canonical configuration. By contrast, such reconfiguration is known to be impossible for linear (nonequilateral) trees and for (nonlinear) equilateral trees. Second, under instantaneous folding motions, we show that an equilateral plane graph has a noncrossing linear folded state if and only if it is bipartite. Not only is the equilateral constraint necessary for this result, but we show that it is strongly NP-complete to decide whether a (nonequilateral) plane graph has a linear folded state. Equivalently, we show strong NP-completeness of deciding whether an abstract metric polyhedral complex with one central vertex has a noncrossing flat folded state with a specified "outside region". By contrast, the analogous problem for a polyhedral manifold with one central vertex (single-vertex origami) is only weakly NP-complete.

[1]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[2]  Joseph S. B. Mitchell,et al.  Continuous foldability of polygonal paper , 2004, CCCG.

[3]  Erik D. Demaine,et al.  Minimal Locked Trees , 2009, WADS.

[4]  Sheung-Hung Poon,et al.  On Straightening Low-Diameter Unit Trees , 2005, GD.

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

[6]  Mark de Berg,et al.  Optimal Binary Space Partitions for Segments in the Plane , 2012, Int. J. Comput. Geom. Appl..

[7]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[8]  Erik D. Demaine,et al.  Flat-State Connectivity of Linkages under Dihedral Motions , 2002, ISAAC.

[9]  Marshall W. Bern,et al.  The complexity of flat origami , 1996, SODA '96.

[10]  Toshiki Saitoh,et al.  Complexity of the Stamp Folding Problem , 2011, COCOA.

[11]  Erik D. Demaine,et al.  On flat-state connectivity of chains with fixed acute angles , 2002, CCCG.

[12]  Erik D. Demaine,et al.  Geometric folding algorithms - linkages, origami, polyhedra , 2007 .

[13]  Erik D. Demaine,et al.  A note on reconfiguring tree linkages: trees can lock , 2002, Discrete Applied Mathematics.

[14]  Mark de Berg,et al.  Optimal Binary Space Partitions in the Plane , 2010, COCOON.

[15]  J. Pach.  Towards a Theory of Geometric Graphs , 2004 .

[16]  Ileana Streinu,et al.  Single-Vertex Origami and Spherical Expansive Motions , 2004, JCDCG.

[17]  Toshikazu Kawasaki.  On relation between mountain-creases and valley -creases of a flat origami , 1990 .