Geometric Folding Algorithms: Linkages, Origami, Polyhedra

2007/07/16 by Erik D. Demaine, Joseph O’Rourke · 7 citations
Computer Science · Engineering · #Advanced Materials and Mechanics #Computational Geometry and Mesh Generation

paper · doi:10.1017/cbo9780511735172

openalex publication_date 2007/07/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/15

Abstract

Lavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding.

Cited by

• Angle trisection with Origami and related topics
• Nonlinear conduction via solitons in a topological mechanical insulator
• Realizability of Graphs and Linkages
• An Algorithm for Folding a Conway Tile into an Isotetrahedron or a Rectangle Dihedron
• Antiparallelogram [wikipedia]
• Flexible polyhedron [wikipedia]
• Polyhedron [wikipedia]

Related

• On Folding a Polygon to a Polyhedron
• Fold-and-cut theorem: a vertical maths project around origami
• Computational Geometry Column 36
• The Folding Mathematics
• Unfolding Actor-Network Theory: What Bruno Latour’s Notion of Folded Space Could Learn From Origami