Geometric Folding Algorithms

Geometric Folding Algorithms
-0 %
 Paperback
Print on Demand | Lieferzeit: Print on Demand - Lieferbar innerhalb von 3-5 Werktagen I

Unser bisheriger Preis:ORGPRICE: 102,60 €

Jetzt 102,59 €* Paperback

Alle Preise inkl. MwSt. | Versandkostenfrei
Artikel-Nr:
9780521715225
Veröffentl:
2017
Einband:
Paperback
Erscheinungsdatum:
25.01.2017
Seiten:
488
Autor:
Erik. D Demaine
Gewicht:
909 g
Format:
254x178x27 mm
Sprache:
Englisch
Beschreibung:

Erik D. Demaine is the Esther and Harold E. Edgerton Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, where he joined the faculty in 2001. He is the recipient of several awards, including the MacArthur Fellowship, the Harold E. Edgerton Faculty Achievement Award, the Ruth and Joel Spira Award for Distinguished Teaching, and the NSERC Doctoral Prize. His research interests range throughout algorithms from data structures for improving web searches to the geometry of understanding how proteins relate to the computational difficulty of playing games. He has published more than 150 papers with more than 150 collaborators and coedited the book Tribute to a Mathemagician in honor of the influential recreational mathematician Martin Gardner.
Lavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding.
Introduction; Part I. Linkages: 1. Problem classification and examples; 2. Upper and lower bounds; 3. Planar linkage mechanisms; 4. Rigid frameworks; 5. Reconfiguration of chains; 6. Locked chains; 7. Interlocked chains; 8. Joint-constrained motion; 9. Protein folding; Part II. Paper: 10. Introduction; 11. Foundations; 12. Simple crease patterns; 13. General crease patterns; 14. Map folding; 15. Silhouettes and gift wrapping; 16. The tree method; 17. One complete straight cut; 18. Flattening polyhedra; 19. Geometric constructibility; 20. Rigid origami and curved creases; Part III. Polyhedra: 21. Introduction and overview; 22. Edge unfolding of polyhedra; 23. Reconstruction of polyhedra; 24. Shortest paths and geodesics; 25. Folding polygons to polyhedra; 26. Higher dimensions.

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.