Geometric Folding Algorithms
Geometric Folding Algorithms
Joseph O'Rourke, Smith College, Massachusetts
Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.
- Fascinating, tangible, accessible cutting-edge research with applications throughout science and engineering
- Full color throughout
- Top notch authors: Erik Demaine won a MacArthur fellowship in 2003 for his work on the mathematics of origami
Reviews & endorsements
"Demaine and O'Rourke are among the best-qualified authors for a book on this subject; and the book that they have written is a delight... It is exceptionally clear and readable. It could be read for pleasure by any mathematics undergraduate, and much of it (though not all) by amateurs with a high school mathematics background... Indeed, the novice will find this book an excellent introduction to complexity.) Most topics are covered in great detail; it is safe to say that even the `insider' will find something new... This book should be in all university libraries, and many professional and amateur mathematicians will want to add it to their personal collections. Origami enthusiasts may also find it of interest."
Robert Dawson, Halifax, Zentralblatt MATH
"Together, they [the authors]have assembled probably the most comprehensive book ever written about the mathematics of paper-folding. It contains theory, along with
illustrations."
Nick Robinson, British Origami Society
"This book does an excellent job of surveying the state of the art. There are copious examples and illustrations, and the authors manage to convey the excitement of working in an are where many basic questions are still unanswered."
Gregory V. Wilson, Dobbs Code Talk
"This book is one of those rare mathematics books that I had a hard time putting down. I wanted to keep reading to find the next insight... it will remain a valuable resource far into the future. There [is] a lot of material in this book and it is really a lot of fun. I highly recommend this book to anyone with even a passing interest in folding mathematics."
Collin Carbno, MAA Reviews
"Rarely can a single work serve as both a guide to a serious innovative course and as an attractive coffee-table book. This book has that distinction, and is either way irresistible to a wide range of scientists."
Harvey Cohn, Computing Reviews
"... the writing is excellent and flows well. It is a very rewarding read, appropriate for someone interested in geometry and geometric algorithms or as a resource for a university course in geometry."
Jeffrey Putnam, Computing Reviews
"Erik Demaine’s Hedrick Lectures at August’s MathFest gave a delightful and masterful summary overview of how mathematics has been applied to novel areas of geometry, such as origami, linkages, hinged dissections, and transformer figures. His beautiful book, with its full color illustrations, gives some of the details, including proofs and open problems."
Paul J. Campbell, Mathematics Magazine
Product details
September 2008Paperback
9780521715225
496 pages
251 × 175 × 25 mm
1.18kg
82 b/w illus. 330 colour illus. 16 tables
Available
Table of Contents
- Introduction
- Part I. Linkages:
- 1. Problem classification and examples
- 2. Upper and lower bounds
- 3. Planar linkage mechanisms
- 4. Rigid frameworks
- 5. Reconfiguration of chains
- 6. Locked chains
- 7. Interlocked chains
- 8. Joint-constrained motion
- 9. Protein folding
- Part II. Paper:
- 10. Introduction
- 11. Foundations
- 12. Simple crease patterns
- 13. General crease patterns
- 14. Map folding
- 15. Silhouettes and gift wrapping
- 16. The tree method
- 17. One complete straight cut
- 18. Flattening polyhedra
- 19. Geometric constructibility
- 20. Rigid origami and curved creases
- Part III. Polyhedra:
- 21. Introduction and overview
- 22. Edge unfolding of polyhedra
- 23. Reconstruction of polyhedra
- 24. Shortest paths and geodesics
- 25. Folding polygons to polyhedra
- 26. Higher dimensions.
