Cover (draft)

Geometric Folding Algorithms:
Linkages, Origami, Polyhedra

by Erik D. Demaine and Joseph O'Rourke

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.


One-Cut Theorem: click for PDF
One vertex of negative curvature.

Monograph: Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Erik D. Demaine and Joseph O'Rourke.
Cambridge University Press, July 2007. xii+472 pages. ISBN 978-0-521-85757-4.


Updates to selected Chapters/Sections

(Last Updated: )

  • Chapter 16, Section 16.8. The Tree Method, Universal Molecule; Origamizer
  • Chapter 20, Sections 20.2 & 20.3: Curved Creases
  • Chapter 22, Section 22.1: Edge Unfolding of Polyhedra: Introduction
  • Chapter 22, Section 22.4: Ununfoldable Polyhedra
  • Chapter 22, Section 22.5: Special Classes of Edge-Unfoldable Polyhedra

  • Supplementary Material:  Applets, Links, etc.

    Survey Paper (2005)

    PowerPoint Presentations (2003-2007)

     


    Last Update:

    All material in these pages is Copyright 2006–2026 by Erik D. Demaine and Joseph O'Rourke.