A disk-packing algorithm for an origami magic trick

Marshall Wayne Bern, Erik D. Demaine, David Eppstein, and Barry Hayes
Proc. Int. Conf. Fun with Algorithms, Elba, 1998, Proceedings in Informatics 4, Elena Lodi, Linda Pagli, and Nicola Santoro, ed., Carleton Scientific, 1999, pp. 32–42
Origami$^3$: Proc. 3rd Int. Mtg. Origami Science, Math, and Education (3OSME), Asilomar, Calif., 2001, Thomas Hull, ed., A K Peters, 2002, pp. 17–28
Mathematical Reviews 2004b:52030
http://www.ics.uci.edu/~eppstein/pubs/BerDemEpp-Fun-98.ps.gz

Cited by:

• Folding and one straight cut suffice
• Computational geometry column 36
• Folding and cutting paper
• The CCCG 2001 logo
• Reaching folded states of a rectangular piece of paper
• Folding and unfolding linkages, paper, and polyhedra
• Recent results in computational origami
• Fold-and-cut magic
• Fold-and-cut magic{}
• A survey of folding and unfolding in computational geometry