Skip to content
Register Sign in Wishlist

Geometric Folding Algorithms
Linkages, Origami, Polyhedra

CAD$75.95 (C)

  • Date Published: September 2008
  • availability: Available
  • format: Paperback
  • isbn: 9780521715225
Average user rating
(1 review)

CAD$ 75.95 (C)

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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. Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high 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
    Read more

    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

    See more reviews

    Customer reviews

    23rd Jan 2019 by LauraJason1

    I was attracted by the title Geometric Folding Algorithms: Linkages, Origami, Polyhedra and than more specific on the nameOrigami:! On the moment I'm busy to prepare some Origami related post for my website and last week I have read the bio form the authors Erik D. Demaine and Joseph O'Rourke. All very interesting!

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: September 2008
    • format: Paperback
    • isbn: 9780521715225
    • length: 496 pages
    • dimensions: 251 x 175 x 25 mm
    • weight: 1.18kg
    • contains: 330 colour illus. 16 tables
    • availability: Available
  • Table of Contents

    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.

  • Authors

    Erik D. Demaine, Massachusetts Institute of Technology
    Erik D. Demaine is the Esther and Harold E. Edgerton Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, where he joined the faculty in 2001. He is the recipient of several awards, including the MacArthur Fellowship, the Harold E. Edgerton Faculty Achievement Award, the Ruth and Joel Spira Award for Distinguished Teaching, and the NSERC Doctoral Prize. His research interests range throughout algorithms from data structures for improving web searches to the geometry of understanding how proteins relate to the computational difficulty of playing games. He has published more than 150 papers with more than 150 collaborators and coedited the book Tribute to a Mathemagician in honor of the influential recreational mathematician Martin Gardner.

    Joseph O'Rourke, Smith College, Massachusetts
    Joseph O'Rourke is the Olin Professor of Computer Science at Smith College and the Chair of the Computer Science Department. He recently completed a one-year appointment as Interim Director of Engineering. He has received several grants and awards, including a Presidential Young Investigator Award, a Guggenheim Fellowship, and the NSF Director's Award for Distinguished Teaching Scholars. His research is in the field of computational geometry, where he has published a monograph and a textbook, and he coedited the 1500-page Handbook of Discrete and Computational Geometry. Thirty-one of his more than one hundred papers published in journals and conference proceedings are coauthored with undergraduates.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.