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

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 Durer 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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	July 2007
First published:	2007
Authors:	Erik D. Demaine • Joseph O'Rourke (Olin Professor of Computer Science)
Dimensions:	259 x 183 x 28mm (L x W x T)
Format:	Hardcover
Pages:	488
ISBN-13:	978-0-521-85757-4
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Geometry > General
LSN:	0-521-85757-0
Barcode:	9780521857574

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!