𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Geometric Folding Algorithms Linkages, Origami, Polyhedra

✍ Scribed by Erik D. Demaine, Joseph O'Rourke

Publisher
Cambridge University Press
Year
2007
Tongue
English
Leaves
486
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results in this comprehensive look at the mathematics of 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.

πŸ“œ SIMILAR VOLUMES

Geometric Folding Algorithms: Linkages,
πŸ“ Geometric Folding Algorithms: Linkages, Origami, Polyhedra
✍ Erik D. Demaine, Joseph O'Rourke πŸ“‚ Library πŸ“… 2007 πŸ› CUP 🌐 English

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 implic

Geometric Folding Algorithms: Linkages,
πŸ“ Geometric Folding Algorithms: Linkages, Origami, Polyhedra
✍ Demaine E., O'Rourke J. πŸ“‚ Library πŸ“… 2007 πŸ› CUP 🌐 English

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 implic

Geometric Folding Algorithms: Linkages,
πŸ“ Geometric Folding Algorithms: Linkages, Origami, Polyhedra
✍ Erik D. Demaine, Joseph O'Rourke πŸ“‚ Library πŸ“… 2007 πŸ› Cambridge University Press 🌐 English

How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results in this comprehensive look at the mathematics of 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 algeb

How to Fold It: The Mathematics of Linka
πŸ“ How to Fold It: The Mathematics of Linkages, Origami and Polyhedra
✍ Joseph O’Rourke πŸ“‚ Library πŸ“… 2011 πŸ› Cambridge University Press 🌐 English

What do proteins and pop-up cards have in common? How is opening a grocery bag different from opening a gift box? How can you cut out the letters for a whole word all at once with one straight scissors cut? How many ways are there to flatten a cube? You can answer these questions and more through t

How to Fold It: The Mathematics of Linka
πŸ“ How to Fold It: The Mathematics of Linkages, Origami and Polyhedra
✍ Joseph O'Rourke πŸ“‚ Library πŸ“… 2011 πŸ› CUP 🌐 English

What do proteins and pop-up cards have in common? How is opening a grocery bag different from opening a gift box? How can you cut out the letters for a whole word all at once with one straight scissors cut? How many ways are there to flatten a cube? You can answer these questions and more through