Folding equilateral plane graphs
Name
Demaine-Folding Equilateral.pdf
Size
304.22 KB
Format
Adobe PDF
Checksum (MD5)
f7c5ea75065b32aecf45343d62f93ec0
Author(s)
Abel, Zachary Ryan
Demaine, Erik D.
Demaine, Martin L.
Eisenstat, Sarah Charmian
Lynch, Jayson R.
Schardl, Tao Benjamin
Shapiro-Ellowitz, Isaac
Date Issued
December 2011
Journal
Algorithms and Computation
Publisher
Springer Berlin / Heidelberg
Citation
Abel, Zachary et al. “Folding Equilateral Plane Graphs.” Algorithms and Computation. Ed. Takao Asano et al. LNCS Vol. 7074. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 574–583.
Version
Author's final manuscript
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, 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.
Description
22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-25591-5_59
