Geometric Folding Algorithms
Linkages, Origami, Polyhedra
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
210.00 €
Produktdetails
Produktinformationen zu „Geometric Folding Algorithms “
Klappentext zu „Geometric Folding Algorithms “
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. With an emphasis on algorithmic or computational aspects, this comprehensive treatment of the geometry of folding and unfolding presents hundreds of results and over 60 unsolved 'open problems' to spur further research. The authors cover one-dimensional objects (linkages), 2D objects (paper), and 3D objects (polyhedra). 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.
Inhaltsverzeichnis zu „Geometric Folding Algorithms “
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. One-dimensional paper; 12. Two-dimensional paper and continuous foldability; 13. Single-vertex foldability; 14. Multi-vertex flat foldability; 15. 2D Map folding; 16. Silhouettes and gift wrapping; 17. Tree method; 18. One complete straight cut; 19. Flattening polyhedra; 20. Geometric constructibility; 21. Curved and curved-fold origami; Part III. Polyhedra: 22. Introduction and overview; 23. Edge unfolding of polyhedra; 24. Reconstruction of polyhedra; 25. Shortest paths and geodesics; 26. Folding polygons to polyhedra; 27. Higher dimensions.
Autoren-Porträt von Erik D. Demaine, Joseph O'Rourke
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. Joseph O'Rourke is the Olin Professor of Computer Science at Smith College and the Chair of the Computer Science Department. He recently completed a one-year appointment as Interim Director of Engineering. He has received several grants and awards, including a Presidential Young Investigator Award, a Guggenheim Fellowship, and the NSF Director's Award for Distinguished Teaching Scholars. His research is in the field of computational geometry, where he has published a monograph and a textbook, and he coedited the 1500-page Handbook of Discrete and Computational Geometry. Thirty-one of his more than one hundred papers published in journals and conference proceedings are coauthored with undergraduates.
Bibliographische Angaben
- Autoren: Erik D. Demaine , Joseph O'Rourke
- 488 Seiten, Maße: 18,3 x 26 cm, Gebunden, Englisch
- Verlag: Cambridge University Press
- ISBN-10: 0521857570
- ISBN-13: 9780521857574
- Erscheinungsdatum: 19.02.2014
Sprache:
Englisch
Rezension zu „Geometric Folding Algorithms “
'Demaine and O'Rourke are among the best-qualified authors for a book on this subject; and the book that they have written is a delight ... it is exceptionally clear and readable. It could be read for pleasure by any mathematics undergraduate, and much of it (though not all) by amateurs with a high school mathematics background ... although there are sections that some amateurs will skip, the level is always kept as elementary as locally possible. This book should be in all university libraries, and many professional and amateur mathematicians will want to add it to their personal collections.' Robert Dawson (Halifax), Zentralblatt Math 'This book is one of those rare mathematics books that I had a hard time putting down. I wanted to keep reading to find the next insight. ... This is a serious mathematics book whose explorations have significant applications and real mathematical profundity, wonderfully mixed with some fun recreational mathematics. ... The book has a useful index and an extensive bibliography, so when you finish reading, it will remain a valuable resource far into the future. There is a lot of material in this book and it is really a lot of fun. I highly, highly recommend this book to anyone with even a passing interest in folding mathematics.' MAA Reviews 'The authors explain step-by-step interesting solutions of some folding problems. This splendidly illustrated book can be interesting for advanced undergraduate students in mathematics and computer science as well as for geometers and computer specialists who can find many new ideas and impulses ...' EMS Newsletter
Kommentar zu "Geometric Folding Algorithms"
0 Gebrauchte Artikel zu „Geometric Folding Algorithms“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Geometric Folding Algorithms".
Kommentar verfassen