Computational Origami
This category deals with problems in trying to figure out when certain
questions about paper folding can be answered, as well as if they can be
answered in linear time, polynomial time, or what-have-you. There is a lot
of overlap here with mathematical modeling of paper folding, but more and
more papers are being written on this topic, so it seemed to me that it
deserved its own section.
Note that I've included Robert Lang's work on origami design (also listed in the modeling and design bibliography section) in this list. I did this because, as Erik Demaine says, Lang's work is, "...in some sense the beginning of computational origami."
- Arkin, Esther M.; Bender, Michael A.; Demaine, Erik D.; Demaine,
Martin L; Mitchell, Joseph S. B.; Sethia, Saurabh, and Skiena, Steven S.,
When can you fold a map?, Proceedings of the 7th Workshop on
Algorithms and Data Structures, edited by F. Dehne, J.-R. Sack, and
R. Tamassia, Lecture Notes in Computer Science, volume 2125,
Providence, Rhode Island, August 2001, pages 401-413.
Shorter version in Proceedings of the 10th Annual Fall
Workshop on Computational Geometry (2000).
- Bern, Marshall; Demaine, Erik; Eppstein, David; and Hayes, Barry,
A disk-packing algorithm for an origami magic trick, Proceedings of
the International Conference on Fun with Algorithms, Isola d'Elba,
Italy, June 1998, pages 32-42.
- Bern, Marshall and Barry Hayes, The complexity of flat origamis,
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete
Algorithms (1996) 175-183.
- Biedl, Therese C.; Demaine, Erik D.; Demaine, Martin L.; Lubiw, Anna,
and Toussaint, Godfried T., Hiding disks in folded polygons,
Proceedings of the 10th Canadian Conference on Computational
Geometry, Montreal, Quebec, Canada, August 1998.
- Demaine, Erik D. and Demaine, Martin L., Planar drawings of origami polyhedra, Proceedings of the 6th Symposium on Graph
Drawing, Lecture Notes in Computer Science, volume 1547, Montreal, Quebec, Canada, August 1998, pages 438-440.
- Demaine, Erik D.; Demaine, Martin L., and Lubiw, Anna, Folding and cutting paper, Revised Papers from the Japan Conference on
Discrete and Computational Geometry, edited by Jin Akiyama, Mikio Kano, and Masatsugu Urabe, Lecture Notes in
Computer Science, volume 1763, Tokyo, Japan, December 1998, pages 104-117. Shorter version in Proceedings of the Japan
Conference on Computational Geometry, pages 5-9.
- Demaine, Erik D.; Demaine, Martin L., and Lubiw, Anna, Folding and one straight cut suffice, Proceedings of the 10th Annual
ACM-SIAM Symposium on Discrete Algorithms (1999) 891-892.
- Demaine, Erik D.; Demaine, Martin L., and Lubiw, Anna,
The CCCG 2001 Logo, Proceedings of the 13th Canadian Conference on
Computational Geometry, Waterloo, Ontario, Canada, August 2001,
pages iv-v.
- Demaine, Erik D.; Mitchell, Joseph S. B., Reaching folded states of a
rectangular piece of paper, Proceedings of the 13th Canadian
Conference on Computational Geometry, Waterloo, Ontario,
Canada, August 2001, pages 73-75.
- Demaine, Erik D.; Demaine, Martin L., and Mitchell, Joseph S. B.,
Folding flat silhouettes and wrapping polyhedral packages: new results
in computational origami, Computational Geometry: Theory and
Applications, 16(1):3-21, 2000. Preliminary versions in
Proceedings of the 15th Annual ACM Symposium on Computational
Geometry (1999) 105-114 and Proceedings of the 3rd CGC
Workshop on Computational Geometry (1998).
- Demaine, Erik D., Folding and unfolding linkages, paper, and polyhedra,
Revised Papers from the Japan Conference on Discrete and
Computational Geometry (JCDCG 2000), edited by Jin Akiyama,
Mikio Kano, and Masatsugu Urabe, Lecture Notes in Computer
Science, volume 2098, Tokyo, Japan, November 2000, pages 113-124.
- Lang, Robert J., A computational algorithm for origami design,
Proceedings of the 12th Annual Symposium on Computational Geometry
(1996), 98-105.
- Lang, Robert J., Mathematical algorithms for origami design,
Symmetry: Culture and Science, Vol. 5, No. 2 (1994), 115-152.
- Lang, Robert J., The tree method of origami design,
Origami Science and Art, K. Miura ed., Otsu, Japan (1997), 73-82.
- Streinu, Ileana; Whiteley, Walter, The spherical carpenter's rule problem
and conical origami folds, Proceedings of the 11th Annual Fall
Workshop on Computational Geometry, Brooklyn, New York,
November 2001.
Back to bibliography main