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, this lavishly illustrated book will entertain a broad audience, from school students to researchers.
"Sinopsis" puede pertenecer a otra edición de este libro.
'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
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Descripción Estado de conservación: New. This item is Print on Demand - Depending on your location, this item may ship from the US or UK. Nº de ref. de la librería POD_9780521857574
Descripción Cambridge Univ Pr, 2007. Hardcover. Estado de conservación: Brand New. 1st edition. 472 pages. 10.25x7.50x1.00 inches. In Stock. Nº de ref. de la librería __0521857570
Descripción Cambridge University Press. Hardback. Estado de conservación: new. BRAND NEW PRINT ON DEMAND., Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Erik D. Demaine, Joseph O'Rourke, 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. Nº de ref. de la librería B9780521857574
Descripción Cambridge University Press, 2007. HRD. Estado de conservación: New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. de la librería IP-9780521857574
Descripción Cambridge University Press, 2007. HRD. Estado de conservación: New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. Nº de ref. de la librería IP-9780521857574
Descripción Cambridge University Press, 2016. Paperback. Estado de conservación: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Nº de ref. de la librería ria9780521857574_lsuk
Descripción Cambridge University Press. Hardcover. Estado de conservación: New. Hardcover. 488 pages. Dimensions: 10.2in. x 7.2in. x 1.3in.How can linkages, pieces of paper, and polyhedra be folded The authors present hundreds of results and over 60 unsolved open problems in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Drer 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. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. 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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Hardcover. Nº de ref. de la librería 9780521857574
Descripción 2007. Hardback. Estado de conservación: NEW. 9780521857574 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Nº de ref. de la librería HTANDREE0480647
Descripción Cambridge University Press, 2007. Hardcover. Estado de conservación: New. Nº de ref. de la librería INGM9780521857574
Descripción Cambridge University Press 2007-07-16, 2007. Estado de conservación: New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Nº de ref. de la librería NU-ING-00963945