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

Erik D. Demaine

ISBN 10: 0521857570 / ISBN 13: 9780521857574

Published by Cambridge University Press, Cambridge, 2007

About this Item

Hardcover. 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. How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results in this comprehensive look at the mathematics of 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521857574

Bibliographic Details

Title: Geometric Folding Algorithms: Linkages, ...

Publisher: Cambridge University Press, Cambridge

Publication Date: 2007

Binding: Hardcover

Condition: new

Edition: 1st Edition

About this title

Synopsis:

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.

Book Description:

Emphasizing algorithmic and computational aspects, this comprehensive treatment of the geometry of folding and unfolding presents hundreds of results and more than 60 open problems. Aimed primarily at advanced undergraduates and graduates in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers.