dc.contributor.author | Demaine, Erik D | |
dc.contributor.author | Eppstein, David | |
dc.contributor.author | Hesterberg, Adam | |
dc.contributor.author | Ito, Hiro | |
dc.contributor.author | Lubiw, Anna | |
dc.contributor.author | Uehara, Ryuhei | |
dc.contributor.author | Uno, Yushi | |
dc.date.accessioned | 2019-06-18T14:27:21Z | |
dc.date.available | 2019-06-18T14:27:21Z | |
dc.date.issued | 2016-01 | |
dc.date.submitted | 2014-11 | |
dc.identifier.issn | 1570-8667 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/121340 | |
dc.description.abstract | 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. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.). Origami Design for Integration of Self-assembling Systems for Engineering Innovation (grant EFRI- 124038) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.). Expedition grant (CCF-1138967) | en_US |
dc.description.sponsorship | United States. Department of Defense. National Defense Science and Engineering Graduate (NDSEG) Fellowship (32 CFR 168a) | en_US |
dc.language.iso | en | |
dc.publisher | Springer Nature America, Inc | en_US |
dc.relation.isversionof | 10.1007/978-3-319-15612-5_11 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | arXiv | en_US |
dc.title | Folding a Paper Strip to Minimize Thickness | en_US |
dc.type | Article | en_US |
dc.identifier.citation | 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. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.relation.journal | Journal of Discrete Algorithms | en_US |
dc.eprint.version | Original manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dc.date.updated | 2019-06-18T12:34:28Z | |
dspace.date.submission | 2019-06-18T12:34:29Z | |
mit.journal.volume | Volume 36 | en_US |