Geometric Folding Algorithms

Linkages, Origami, Polyhedra

Nonfiction, Science & Nature, Mathematics, Geometry, Computers, General Computing
Cover of the book Geometric Folding Algorithms by Erik D. Demaine, Joseph O'Rourke, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Erik D. Demaine, Joseph O'Rourke ISBN: 9781107386204
Publisher: Cambridge University Press Publication: July 16, 2007
Imprint: Cambridge University Press Language: English
Author: Erik D. Demaine, Joseph O'Rourke
ISBN: 9781107386204
Publisher: Cambridge University Press
Publication: July 16, 2007
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book Environmental Protection and Human Rights by Erik D. Demaine, Joseph O'Rourke
Cover of the book Automated Planning and Acting by Erik D. Demaine, Joseph O'Rourke
Cover of the book The Cambridge Companion to Hume by Erik D. Demaine, Joseph O'Rourke
Cover of the book Contest Theory by Erik D. Demaine, Joseph O'Rourke
Cover of the book The Poetry of Victorian Scientists by Erik D. Demaine, Joseph O'Rourke
Cover of the book Thyroid Fine Needle Aspiration by Erik D. Demaine, Joseph O'Rourke
Cover of the book Engaging the Disengaged by Erik D. Demaine, Joseph O'Rourke
Cover of the book How Solidarity Works for Welfare by Erik D. Demaine, Joseph O'Rourke
Cover of the book The Peaceful Settlement of International Disputes by Erik D. Demaine, Joseph O'Rourke
Cover of the book Maths: A Student's Survival Guide by Erik D. Demaine, Joseph O'Rourke
Cover of the book Industrial Crystallization by Erik D. Demaine, Joseph O'Rourke
Cover of the book Holy Scripture by Erik D. Demaine, Joseph O'Rourke
Cover of the book The Ideology of Creole Revolution by Erik D. Demaine, Joseph O'Rourke
Cover of the book Reason, Revelation, and Devotion by Erik D. Demaine, Joseph O'Rourke
Cover of the book How Well Do Facts Travel? by Erik D. Demaine, Joseph O'Rourke
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy