Demaine E.D., O'Rourke J. Geometric Folding Algorithms: Linkages, Origami, Polyhedra

New York, USA: Cambridge University Press, 2007. — 486 p. — ISBN13: 978-0-521-85757-4.How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects.Linkages
Problem Classification and Examples
Upper and Lower Bounds
Planar LinkageMechanisms
Rigid Frameworks
Reconfiguration of Chains
Locked Chains
Interlocked Chains
Joint-ConstrainedMotion
Protein Folding
PaperFoundations
Simple Crease Patterns
General Crease Patterns
Map Folding
Silhouettes and GiftWrapping
The TreeMethod
One Complete Straight Cut
Flattening Polyhedra
Geometric Constructibility
Rigid Origami and Curved Creases
Polyhedra
Introduction and Overview
Edge Unfolding of Polyhedra
Reconstruction of Polyhedra
Shortest Paths and Geodesics
Folding Polygons to Polyhedra
Higher Dimensions