Articoli correlati a Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Sinossi
Lavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sugli autori
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 72,76
EUR 10,39 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costi
Risultati della ricerca per Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Foto dell'editore
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521715225_new
Quantità: Più di 20 disponibili
Foto dell'editore
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9780521715225
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 5622204-n
Quantità: Più di 20 disponibili
Foto dell'editore
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 1st edition. 496 pages. 10.00x7.00x1.00 inches. In Stock. This item is printed on demand. Codice articolo __0521715229
Quantità: 1 disponibili
Immagini fornite dal venditore
Geometric Folding Algorithms
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Emphasizing algorithmic and computational aspects, this fascinating treatment of the geometry of folding and unfolding presents hundreds of results and over 60 open problems. Aimed at advanced undergraduates and graduates in mathematics or computer science,. Codice articolo 446945495
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 5622204-n
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Editore:
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antico o usato
Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 5622204
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Editore:
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antico o usato
Brossura
Da: Goodbooks Company, Springdale, AR, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: acceptable. This copy may contain significant wear, including bending, heavy writing, tears, and or water damage. This book is a functional copy, not necessarily a beautiful copy. Copy may have loose pages. May not include access codes or CDs. May be an Ex library book with stickers and stamps. Dustjacket may be missing. Codice articolo GBV.0521715229.A
Quantità: 1 disponibili
Immagini fornite dal venditore
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Editore:
Cambridge University Press, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Antico o usato
Brossura
Da: Goodbooks Company, Springdale, AR, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: good. Has a sturdy binding with some shelf wear. May have some markings or highlighting. Used copies may not include access codes or Cd's. Slight bending may be present. Codice articolo GBV.0521715229.G
Quantità: 1 disponibili
Immagini fornite dal venditore
Geometric Folding Algorithms
Editore:
Cambridge University Press, GB, 2008
ISBN 10: 0521715229
ISBN 13: 9780521715225
Nuovo
Paperback
Da: Rarewaves.com UK, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: New. 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. Codice articolo LU-9780521715225
Quantità: Più di 20 disponibili