Geometric Folding Algorithms (Paperback) (ISBN-13: 9780521715225)

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.

Author: Erik D. Demaine, Joseph O'Rourke
ISBN-10: 0521715229
ISBN-13: 9780521715225
Publisher: Cambridge University Press
Language: English
Published: 08/21/2008
Pages: 496
Format: Paperback
Weight: 1.85lbs
Size: 9.90h x 6.90w x 1.10d