Paper by Erik D. Demaine

Reference:

Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Jayson Lynch, Tao B. Schardl, and Isaac Shapiro-Ellowitz, “Folding Equilateral Plane Graphs”, International Journal of Computational Geometry and Applications, volume 23, number 2, April 2013, pages 75–92.

BibTeX

@Article{LinearEquilateral_IJCGA,
  AUTHOR        = {Zachary Abel and Erik D. Demaine and Martin L. Demaine and
                   Sarah Eisenstat and Jayson Lynch and Tao B. Schardl and
                   Isaac Shapiro-Ellowitz},
  TITLE         = {Folding Equilateral Plane Graphs},
  JOURNAL       = {International Journal of Computational Geometry and
                   Applications},
  journalurl    = {http://www.worldscinet.com/ijcga/ijcga.shtml},
  VOLUME        = 23,
  NUMBER        = 2,
  MONTH         = {April},
  YEAR          = 2013,
  PAGES         = {75--92},

  withstudent   = 1,
  doi           = {https://dx.doi.org/10.1142/S0218195913600017},
  dblp          = {https://dblp.org/rec/journals/ijcga/AbelDDELSS13},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1142/S0218195913600017">World Scientific</A>.},
  replaces      = {LinearEquilateral_ISAAC2011},
  papers        = {LinearEquilateral_ISAAC2011},
}

Abstract:

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, it is known that such reconfiguration is not always possible 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. Furthermore, we show that the equilateral constraint is necessary for this result, by proving 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. By contrast, the analogous problem for a polyhedral manifold with one central vertex (single-vertex origami) is only weakly NP-complete.

Comments:

This paper is also available from World Scientific.

Availability:

The paper is available in PDF (437k).

See information on file formats.

[Google Scholar search]

Related papers:

LinearEquilateral_ISAAC2011 (Folding Equilateral Plane Graphs)