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 Proceedings of the International Conference on Fun with Algorithms (FUN'98), Isola d'Elba, Italy, June 18–20, 1998, pages 32–42.

BibTeX

@InProceedings{FUN98,
  AUTHOR        = {Marshall Bern and Erik Demaine and David Eppstein and
                   Barry Hayes},
  TITLE         = {A Disk-Packing Algorithm for an Origami Magic Trick},
  BOOKTITLE     = {Proceedings of the International Conference on Fun with
                   Algorithms (FUN'98)},
  BOOKURL       = {http://www.di.unipi.it/fun98/},
  ADDRESS       = {Isola d'Elba, Italy},
  MONTH         = {June 18--20},
  YEAR          = 1998,
  PAGES         = {32--42},

  LENGTH        = {11 pages},
  PAPERS        = {OSME2001b},
}

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.

Length:

The paper is 11 pages.

Availability:

The paper is available in PostScript (88k).

See information on file formats.

[Google Scholar search]

Related papers:

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