Name
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 two metrics: minimizing the total number of layers in the folded state (so that a “flat folding” is indeed close to flat), and minimizing 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 both problems fixed-parameter tractable in 1D with respect to the number of layers. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.jda.2015.09.003 | Journal of Discrete Algorithms |
Keywords | DocType | Volume |
Linkage,NP-complete,Optimization problem,Rigid origami | Journal | 36 |
ISSN | Citations | PageRank |
1570-8667 | 1 | 0.54 |
References | Authors | |
5 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik D. Demaine | 1 | 4624 | 388.59 |
| David Eppstein | 2 | 4897 | 533.94 |
| Adam Hesterberg | 3 | 4 | 7.07 |
| Hiro Ito | 4 | 290 | 39.95 |
| Anna Lubiw | 5 | 753 | 95.36 |
| Ryuhei Uehara | 6 | 528 | 75.38 |
| yushi uno | 7 | 222 | 28.80 |