Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Demaine, Erik D.

ISBN 10: 0521715229 / ISBN 13: 9780521715225

Edité par Cambridge University Press, 2008

Special order direct from the distributor. N° de réf. du vendeur ING9780521715225

Synopsis :

Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.

À propos des auteurs: 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.

Détails bibliographiques

Titre : Geometric Folding Algorithms: Linkages, ...
Éditeur : Cambridge University Press
Date d'édition : 2008
Reliure : Paperback
Etat : New
Edition : Reprint.