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 Dürer 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.

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Demaine, Erik D.

O’Rourke, Joseph

Computers & Technology

Cambridge University Press

<p>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 Dürer 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.</p>

<p>The authors show that there are underlying mathematical reasons for why games and puzzles are challenging (and perhaps why they are so much fun). They also show that games and puzzles can serve as powerful models of computation―quite different from the usual models of automata and circuits―offering a new way of thinking about computation. The appendices provide a substantial survey of all known results in the field of game complexity, serving as a reference guide for readers interested in the computational complexity of particular games, or interested in open problems about such complexities.</p>

Games, Puzzles, and Computation (AK Peters/CRC Recreational Mathematics Series)

Hearn, Robert A.

Computer Science

AK Peters/CRC

See the best price to sell, buy, or rent books by Demaine, Erik D.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Demaine, Erik D.

See the best price to sell, buy, or rent books by Demaine, Erik D.. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Games, Puzzles, and Computation (AK Peters/CRC Recreational Mathematics Series)