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

~ (Author), Joseph O'Rourke (Author)
Key Phrases: polyhedral lifting, flat foldability, flat folded state, Open Problem, One Complete Straight Cut, Edge Unfolding of Polyhedra (more...)

Editorial Reviews

Review

"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

Product Description

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.

See all Editorial Reviews

Product Details

• Hardcover: 496 pages
• Publisher: Cambridge University Press; 1 edition (July 16, 2007)
• Language: English
• ISBN-10: 0521857570
• ISBN-13: 978-0521857574
• Product Dimensions: 10.2 x 7.2 x 1.3 inches
• Shipping Weight: 3.1 pounds (View shipping rates and policies)
• Average Customer Review: No customer reviews yet. Be the first.
• Amazon.com Sales Rank: #1,164,224 in Books (See Bestsellers in Books)