Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Condition - Very Good
The item shows wear from consistent use, but it remains in good condition and functions properly. Item may arrive with damaged packaging or be repackaged. It may be marked, have identifying markings on it, or have minor cosmetic damage. It may also be missing some parts/accessories or bundled items.

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

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.
Country USA
Brand Cambridge University Press
Manufacturer Cambridge University Press
Binding Hardcover
ItemPartNumber YES2229208
Model YES2229208
UnitCount 1
EANs 9780521857574
ReleaseDate 0000-00-00

Country	USA
Brand	Cambridge University Press
Manufacturer	Cambridge University Press
Binding	Hardcover
ItemPartNumber	YES2229208
Model	YES2229208
UnitCount	1
EANs	9780521857574
ReleaseDate	0000-00-00

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

You might also like...