Geometric Folding Algorithms:
This is a collection of web pages supporting the monograph
Geometric Folding Algorithms: Linkages, Origami, Polyhedra .
In particular, the pages consist of the book's
table of contents and
errata ;
an electronic copy for owners of the physical book;
applets and other supplementary material ;
related PowerPoint presentations ; and
a survey paper
that in some sense a short form of the book.
Monograph:
Geometric Folding Algorithms:
Linkages, Origami, Polyhedra
Erik D. Demaine and Joseph O'Rourke.
Updates to selected Chapters/Sections (Last Updated :
)
Part I updates: Linkages
Chapter 3, Section 3.2 .
Kempe's Universality Theorem, Open Problem 3.2
Part II updates: Paper
Chapter 16, Section 16.8 .
The Tree Method, Universal Molecule; Origamizer
Chapter 20, Sections 20.2 & 20.3:
Curved CreasesPart III updates: Polyhedra
Chapter 22, Section 22.1:
Edge Unfolding of Polyhedra: IntroductionChapter 22, Section 22.4:
Ununfoldable PolyhedraChapter 22, Section 22.5:
Special Classes of Edge-Unfoldable PolyhedraChapter 23, Section 23.2:
Flexible PolyhedraChapter 24, Section 24.3.2:
Star Unfolding: Cut Locus is a Voronoi DiagramChapter 25, Section 25.1.2:
Folding Polygons to Polyhedra: Open Problem 25.1 ResolvedChapter 25, Section 25.2:
Edge-to-Edge Gluings
Erik D. Demaine and Joseph O'Rourke,A Survey of Folding and Unfolding in Computational Geometry "
Combinatorial and Computational Geometry ,
20-23Aug03, Mathematical Sciences Research Institute: MSRI link
11Sep03, University of Southern Alabama: 25MB .ppt file
St. Mary's Reconnect Lectures , July 2004
D&CG: Twenty Years After ,
Snowbird, Utah,
18 June 2006 (7.6MB .ppt file)
"Unfolding Polyhedral Surfaces" ,
Workshop on Polyhedral Sufaces and Industrial Applications , Strobl, Austria, 15-18 Sep 2007
(8.1MB .ppt file)
Last Update:
All material in these pages is Copyright 2006–2026 by Erik D. Demaine and Joseph O'Rourke.
