Geometric Folding Algorithms: Linkages, Origami, Polyhedra

This computational geometry text focuses on the mathematics and algorithms behind folding problems in three key domains: linkages (connected line segments), origami (paper folding), and polyhedra (3D geometric shapes). The book presents both theoretical foundations and practical applications of geometric folding. The content progresses from basic definitions through increasingly complex folding challenges, with mathematical proofs and pseudocode implementations provided throughout. Each chapter contains exercises and open problems to engage readers in hands-on exploration of the concepts. The authors cover applications ranging from robotic arm movement to protein folding to deployable space structures. Key topics include rigid origami, straight-line linkages, fixed-angle chains, and unfolding polyhedra. At its core, this work demonstrates the deep connections between abstract mathematics and real-world mechanical systems. The text serves as both a comprehensive reference for researchers and an accessible introduction to the field for students with backgrounds in geometry or computer science.

Readers describe this as a comprehensive but challenging graduate-level text on computational geometry. The book contains detailed proofs and thorough mathematical foundations. Liked: - Clear illustrations and diagrams support the concepts - Covers recent research developments - Includes open problems for further study - Code examples help with implementation - Extensive bibliography and references Disliked: - Requires strong math background in geometry and algorithms - Some sections are too dense for self-study - A few readers wanted more practical applications - Limited coverage of certain origami techniques Ratings: Goodreads: 4.0/5 (12 ratings) Amazon: 4.7/5 (6 ratings) Notable review: "The mathematical rigor is impressive but can be overwhelming for newcomers to the field. Best suited for those already familiar with computational geometry." - Goodreads reviewer The book has limited reviews online due to its specialized academic nature.

Geometric Methods and Applications by Jean Gallier Covers fundamental concepts of geometry, differential geometry, and mathematical methods used in computational design and robotics.

How to Fold It: The Mathematics of Linkages, Origami and Polyhedra by Joseph O'Rourke Presents mathematical proofs and algorithms behind paper folding, mechanical linkages, and geometric structures.

Making Mathematics with Needlework by sarah-marie belcastro and Carolyn Yackel Explores the connection between mathematical concepts and fiber arts through patterns and topological structures.

The Symmetries of Things by John H. Conway Examines patterns, symmetry groups, and mathematical structures in both two and three dimensions.

Architectonic Space by Hans van der Laan Analyzes the mathematical relationships in architectural forms and spatial structures through geometric principles.

🔷 Erik Demaine became MIT's youngest professor at age 20 and his work in computational origami has been featured in the permanent collection at the Museum of Modern Art in New York. 🔷 The algorithms described in this book have practical applications beyond paper folding, including designing deployable solar panels for satellites and developing microscopic origami robots for medical procedures. 🔷 The mathematics of paper folding was used to solve one of geometry's ancient problems: trisecting an angle, which is impossible with just a compass and straightedge but can be done with paper folding. 🔷 The book explores linkages that can trace any algebraic curve, building on the work of 19th-century mathematician Alfred Kempe who proved that mechanical linkages could write your signature. 🔷 Co-author Joseph O'Rourke pioneered the field of computational geometry and helped establish it as a distinct discipline in computer science, with his textbooks becoming standard references in the field.