{"product_id":"geometric-folding-algorithms-linkages-origami-polyhedra-1","title":"GEOMETRIC FOLDING ALGORITHMS : LINKAGES, ORIGAMI, POLYHEDRA","description":"\u003cp\u003e\u003cb\u003eAuthor:\u003c\/b\u003e DEMAINE\u003c\/p\u003e\u003cp\u003e\u003cb\u003eBrand:\u003c\/b\u003e Cambridge University Press\u003c\/p\u003e\u003cp\u003e\u003cb\u003eEdition:\u003c\/b\u003e 1\u003c\/p\u003e\u003cp\u003e\u003cb\u003eBinding:\u003c\/b\u003e hardcover\u003c\/p\u003e\u003cp\u003e\u003cb\u003eFormat:\u003c\/b\u003e Illustrated\u003c\/p\u003e\u003cp\u003e\u003cb\u003eNumber Of Pages:\u003c\/b\u003e 488\u003c\/p\u003e\u003cp\u003e\u003cb\u003eRelease Date:\u003c\/b\u003e 16-07-2007\u003c\/p\u003e\u003cp\u003e\u003cb\u003emodel number:\u003c\/b\u003e YES2229208\u003c\/p\u003e\u003cp\u003e\u003cb\u003ePart Number:\u003c\/b\u003e YES2229208\u003c\/p\u003e\u003cp\u003e\u003cb\u003eDetails:\u003c\/b\u003e Product Description      \u003cbr\u003e\nDid 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.\u003cbr\u003e\n      Review      \u003cbr\u003e\n'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\u003cbr\u003e\n\u003cbr\u003e\n'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\u003cbr\u003e\n\u003cbr\u003e\n'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\u003cbr\u003e\n      Book Description      \u003cbr\u003e\nLavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding.\u003cbr\u003e\n      About the Author      \u003cbr\u003e\nErik 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.\u003cbr\u003e\n\u003cbr\u003e\nJoseph 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 geo\u003c\/p\u003e\u003cp\u003e\u003cb\u003eEAN:\u003c\/b\u003e 9780521857574\u003c\/p\u003e\u003cp\u003e\u003cb\u003ePackage Dimensions:\u003c\/b\u003e 10.2 x 7.2 x 1.3 inches\u003c\/p\u003e\u003cp\u003e\u003cb\u003eLanguages:\u003c\/b\u003e English\u003c\/p\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":50228853670192,"sku":"Trans_9780521857574","price":10350.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0690\/9968\/4144\/files\/61OzVtSpWEL.jpg?v=1760777669","url":"https:\/\/www.retailmaharaj.com\/products\/geometric-folding-algorithms-linkages-origami-polyhedra-1","provider":"Retail Maharaj","version":"1.0","type":"link"}