Paper by Erik D. Demaine

Reference:

Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, and Yushi Uno, “Folding a Paper Strip to Minimize Thickness”, in Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM 2015), Lecture Notes in Computer Science, volume 8973, Dhaka, Bangladesh, February 26–28, 2015, pages 113–124.

BibTeX

@InProceedings{Thickness_WALCOM2015,
  AUTHOR        = {Erik D. Demaine and David Eppstein and Adam Hesterberg and Hiro Ito and Anna Lubiw and Ryuhei Uehara and Yushi Uno},
  TITLE         = {Folding a Paper Strip to Minimize Thickness},
  BOOKTITLE     = {Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM 2015)},
  VOLUME        = 8973,
  SERIES        = {Lecture Notes in Computer Science},
  seriesurl     = {http://www.springer.de/comp/lncs/},
  ADDRESS       = {Dhaka, Bangladesh},
  MONTH         = {February 26--28},
  YEAR          = 2015,
  PAGES         = {113--124},

  papers        = {Thickness_JDA},
  withstudent   = 1,
  doi           = {https://dx.doi.org/10.1007/978-3-319-15612-5_11},
  dblp          = {https://dblp.org/rec/conf/walcom/DemaineEHILUU15},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1007/978-3-319-15612-5_11">SpringerLink</A> and as <A HREF="https://arXiv.org/abs/1411.6371">arXiv:1411.6371</A>.},
}

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 the first problem fixed-parameter tractable in 1D with respect to the number of layers.

Comments:

This paper is also available from SpringerLink and as arXiv:1411.6371.

Availability:

The paper is available in PDF (322k).

See information on file formats.

[Google Scholar search]

Related papers:

Thickness_JDA (Folding a Paper Strip to Minimize Thickness)