Items related to Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Synopsis
Lavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding.
"synopsis" may belong to another edition of this title.
About the Authors
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.
"About this title" may belong to another edition of this title.
Search results for Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Seller Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
Used
Hardcover
Seller: WeBuyBooks, Rossendale, LANCS, United Kingdom
Seller rating 5 out of 5 stars
hardcover. Condition: Very Good. Most items will be dispatched the same or the next working day. A copy that has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Seller Inventory # rev3081484599
Buy Used
£ 68.63
£ 12.27 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
Used
Hardcover
Seller: Fireside Bookshop, Stroud, GLOS, United Kingdom
Seller rating 5 out of 5 stars
Cloth/Laminated Boards. Condition: Very Good. Type: Book N.B. Small plain label to inside front cover. Seller Inventory # 055576
Stock Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
Used
Hardcover
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardback. Condition: Very Good. 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. Seller Inventory # 00106514676
Seller Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, Cambridge, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
Used
Hardcover
First Edition
Seller: Zed Books, New York, NY, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Near Fine. First Edition. First printing. 8vo. 472 pp. Near Fine. Slightest shelfwear to head of spine. Seller Inventory # x08823
Stock Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
Used
Hardcover
Seller: World of Books Inc, Montgomery, IL, U.S.A.
Seller rating 4 out of 5 stars
Hardback. Condition: Very Good. 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. Seller Inventory # CIN0521857570VG
Stock Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
Used
Hardcover
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_481046571
Stock Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
New
Hardcover
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0521857570
Stock Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
New
Hardcover
Seller: GoldBooks, Denver, CO, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. New Copy. Customer Service Guaranteed. Seller Inventory # 74R25_66_0521857570
Seller Image
Geometric Folding Algorithms : Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
New
Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 4403796-n
Stock Image
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Published by
Cambridge University Press, 2007
ISBN 10: 0521857570
ISBN 13: 9780521857574
New
Hardcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521857574