Paper by Erik D. Demaine

Reference:

Marshall Bern, Erik Demaine, David Eppstein, and Barry Hayes, “A Disk-Packing Algorithm for an Origami Magic Trick”, in Origami³: Proceedings of the 3rd International Meeting of Origami Science, Math, and Education (OSME 2001), Monterey, California, March 9–11, 2001, pages 17–28, A K Peters.

BibTeX

@InProceedings{OSME2001b,
  AUTHOR        = {Marshall Bern and Erik Demaine and David Eppstein and
                   Barry Hayes},
  TITLE         = {A Disk-Packing Algorithm for an Origami Magic Trick},
  BOOKTITLE     = {Origami$^3$: Proceedings of the 3rd International Meeting of
                   Origami Science, Math, and Education (OSME 2001)},
  BOOKURL       = {http://mars.wne.edu/~thull/osm/osm.html},
  ADDRESS       = {Monterey, California},
  MONTH         = {March 9--11},
  YEAR          = 2001,
  PAGES         = {17--28},
  PUBLISHER     = {A K Peters},

  award         = {Translated into Japanese in a book of selected papers
                   from OSME 2001, Morikita Publishing Co., 2005, 17--28.},
  length        = {10 pages},
  papers        = {FUN98},
}

Abstract:

We present an algorithm for a magic trick. Given a polygon with holes P, our algorithm determines a folding of a rectangular sheet of paper such that a single straight cut suffices to cut out P. This paper is a simplification and improvement of a paper first published in Fun with Algorithms [10].

Length:

The paper is 10 pages.

Availability:

The paper is available in PostScript (174k), gzipped PostScript (62k), and PDF (164k).

See information on file formats.

[Google Scholar search]

Related papers:

FUN98 (A Disk-Packing Algorithm for an Origami Magic Trick)