Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Main
Mathematics - Geometry and Topology
Geometric Folding Algorithms: Linkages,...

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Name: Geometric Folding Algorithms: Linkages, Origami, Polyhedra
ISBN: 9780521857574

Erik D. Demaine, Joseph O'Rourke

4.5 / 4.0

0 comments

Πόσο σας άρεσε αυτό το βιβλίο;

Ποια είναι η ποιότητα του ληφθέντος αρχείου;

Κατεβάστε το βιβλίο για να αξιολογήσετε την ποιότητά του

Ποια είναι η ποιότητα των ληφθέντων αρχείων;

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.

Κατηγορίες:

Mathematics - Geometry and Topology

Έτος:

2007

Έκδοση:

Εκδότης:

Cambridge University Press

Γλώσσα:

english

Σελίδες:

486

ISBN 10: