Folding a Paper Strip to Minimize Thickness
Author(s)Demaine, Erik D; Eppstein, David; Hesterberg, Adam; Ito, Hiro; Lubiw, Anna; Uehara, Ryuhei; Uno, Yushi; ... Show more Show less
MetadataShow full item record
In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative fold orientations), but in general this specification is consistent with exponentially many possible folded states. We analyze the complexity of finding the best consistent folded state according to twometrics:minimizing the total number of layers in the folded state (so that a “flat folding” is indeed close toflat), andminimizing the total amount of paper required to execute the folding (where “thicker” creases consume more paper). We prove both problems strongly NP-complete even for 1D folding. On the other hand, we prove the first problem fixed-parameter tractable in 1D with respect to the number of layers.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Journal of Discrete Algorithms
Springer Nature America, Inc
Demaine, Erik D., David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara and Yushi Uno. "Folding a Paper Strip to Minimize Thickness." Journal of Discrete Algorithms 36: 18-26, 2016.