Geometric Folding Algorithms Linkages, Origami, Polyhedra

Name: Geometric Folding Algorithms Linkages, Origami, Polyhedra
Price: 65.87 USD
Availability: InStock
ISBN: 9780521715225

ISBN-10: 0521715229

ISBN-13: 9780521715225

Edition: 2008

Authors: Erik D. Demaine, Joseph O'Rourke

List price: $70.99

This item qualifies for FREE shipping.

30 day, 100% satisfaction guarantee!

Buy new: $65.87

Marketplace

2 new & used from $69.52

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.

Book details

List price: $70.99
Copyright year: 2008
Publisher: Cambridge University Press
Publication date: 8/21/2008
Binding: Paperback
Pages: 496
Size: 6.89" wide x 9.88" long x 0.98" tall
Weight: 2.596
Language: English



Introduction



Linkages



Problem classification and examples



Upper and lower bounds



Planar linkage mechanisms



Rigid frameworks



Reconfiguration of chains



Locked chains



Interlocked chains



Joint-constrained motion



Protein folding



Paper



Introduction



Foundations



Simple crease patterns



General crease patterns



Map folding



Silhouettes and gift wrapping



The tree method



One complete straight cut



Flattening polyhedra



Geometric constructibility



Rigid origami and curved creases



Polyhedra



Introduction and overview



Edge unfolding of polyhedra



Reconstruction of polyhedra



Shortest paths and geodesics



Folding polygons to polyhedra



Higher dimensions