Paper by Erik D. Demaine

Reference:

MIT Folding Group, Lily Chung, Erik D. Demaine, Martin L. Demaine, Jenny Diomidova, Jayson Lynch, Klara Mundilova, and Hanyu Alice Zhang, “Folding a Strip of Paper into Shapes with Specified Thickness”, in Origami⁸: Proceedings of the 8th International Meeting on Origami in Science, Mathematics and Education (OSME 2024), Melbourne, Australia, July 16–18, 2024, to appear.

BibTeX

@InProceedings{UniformLayers_OSME2024,
  key           = {MIT},
  AUTHOR        = {{MIT Folding Group} and Lily Chung and Erik D. Demaine and Martin L. Demaine and Jenny Diomidova and Jayson Lynch and Klara Mundilova and Hanyu Alice Zhang},
  TITLE         = {Folding a Strip of Paper into Shapes with Specified Thickness},
  BOOKTITLE     = {Origami$^8$: Proceedings of the 8th International Meeting on Origami in Science, Mathematics and Education (OSME 2024)},
  bookurl       = {http://www.impactengineering.org/8OSME/},
  ADDRESS       = {Melbourne, Australia},
  MONTH         = {July 16--18},
  YEAR          = 2024,
  PAGES         = {to appear},

  withstudent   = 1,
  length        = {16 pages},
}

Abstract:

Computational origami design typically focuses on achieving a desired shape of folding, treating multiple layers of paper like a single layer. In this paper, we study when we can achieve a desired shape with a desired constant number of layers throughout the shape, or a specified pattern of layer thicknesses. Specifically, we study the case of a rectangular strip of paper, which is the setting of the first universal computational origami design algorithm [SoCG'99]. Depending on the generality of the target surface and on the number of layers modulo 4, we give a variety of universal design algorithms, polynomial-time decision algorithms characterizing what is possible to fold, and NP-hardness results.

Length:

The paper is 16 pages.

Availability:

The paper is available in PDF (569k).

See information on file formats.

[Google Scholar search]