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.
CITATION STYLE
Demaine, E. D., Eppstein, D., Hesterberg, A., Ito, H., Lubiw, A., Uehara, R., & Uno, Y. (2015). Folding a paper strip to minimize thickness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8973, pp. 113–124). Springer Verlag. https://doi.org/10.1007/978-3-319-15612-5_11
Mendeley helps you to discover research relevant for your work.