Introduction Smallish history Axioms of Origami Computational Model Definition Links Demo Applet Files Bibliography Author & Credits

Mathematical Origami

  • Hull, Thomas C.: The Combinatorics of Flat Folds: a Survey, Proceedings of te Third International Meeting of Origami Science, Mathematics, and Education, 2002.
  • Hull, Thomas C.: On the Mathematics of Flat Origamis, Congressus Numerantium, Vol. 100 (1994), pp215-224.
  • Hull, Thomas C.; Belcastro, Sarah-Marie: Modelling the folding of paper into three dimensions using affine transformations, Linear Algebra and it's Applications 348 (2002) 273-282.
  • Cipra, Barry A.: In the Fold: Origami meets Mathematics, SIAM News, Volume 32, Number 8.

Computational Origami

  • Bern, Marshall and Barry Hayes, The complexity of flat origamis, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (1996) 175-183.
  • 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.: Recent Results in Computational Origami. [PDF]
  • Fisher, David: Origami on Computer. Thesis. [PS]
  • Gout, Jerome: DOODLE: Origami-Oriented Diagramming LanguagE. Doodle documentation.


  • Toussaint, Godfried: A new look at Euclid's Second Proposition. The Mathematical Intelligencer, vol. 15, No. 3, 1993, pp. 12-23. [PS]
  • Erickson, Jeff; Seidel, Raimund: Better Lower Bounds on Detecting Affine and Spherical Degeneracies, Proceedings 34th Annual IEEE Symposium on Foundation of Computer Science (1993) pp528-536