Visit our Christmas Gift Finder
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Hardback)
  • Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Hardback)
zoom

Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Hardback)

(author), (author)
£119.00
Hardback 488 Pages / Published: 16/07/2007
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Cambridge University Press
ISBN: 9780521857574
Number of pages: 488
Weight: 1200 g
Dimensions: 259 x 183 x 28 mm


MEDIA REVIEWS
'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 ... although there are sections that some amateurs will skip, the level is always kept as elementary as locally possible. This book should be in all university libraries, and many professional and amateur mathematicians will want to add it to their personal collections.' Robert Dawson (Halifax), Zentralblatt Math
'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. ... This is a serious mathematics book whose explorations have significant applications and real mathematical profundity, wonderfully mixed with some fun recreational mathematics. ... The book has a useful index and an extensive bibliography, so when you finish reading, 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, highly recommend this book to anyone with even a passing interest in folding mathematics.' MAA Reviews
'The authors explain step-by-step interesting solutions of some folding problems. This splendidly illustrated book can be interesting for advanced undergraduate students in mathematics and computer science as well as for geometers and computer specialists who can find many new ideas and impulses ...' EMS Newsletter
"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

You may also be interested in...

Understanding Cryptography
Added to basket
Algorithms
Added to basket
£66.49
Hardback
Machine Learning
Added to basket
£39.99
Paperback
Understanding Cryptography
Added to basket
Algorithms Unlocked
Added to basket
Introduction to Algorithms
Added to basket
Gynaecology: Evidence-Based Algorithms
Added to basket
Purely Functional Data Structures
Added to basket
Generative Art
Added to basket
£25.99
Paperback

Please sign in to write a review

Your review has been submitted successfully.