| #1944350 in Books | 2008-09-15 | 2008-08-21 | Original language:English | PDF # 1 | 9.96 x.98 x6.97l,2.60 | File Name: 0521715229 | 496 pages
||5 of 7 people found the following review helpful.| Hardbound book poorly constructed|By nmheath|Purchased this book in January 2015 for my husband. He hasn't read enough of it to review the contents, so this review is only about the quality of the hardbound book. This book is not sewn. It is only glued. So with only light usage, it has already split apart. Very shoddy for a book published by Cambridge University Press.<
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 ...
Geometric Folding Algorithms: Linkages, Erik D. Demaine, Joseph O'Rourke epub Geometric Folding Algorithms: Linkages, Erik D. Demaine, Joseph O'Rourke pdf Geometric Folding Algorithms: Linkages, Erik D. Demaine, Joseph O'Rourke pdf download Geometric Folding Algorithms: Linkages, Erik D. Demaine, Joseph O'Rourke review Geometric Folding Algorithms: Linkages, Erik D. Demaine, Joseph O'Rourke textbooks Geometric Folding Algorithms: Linkages, Erik D. Demaine, Joseph O'Rourke Free
You can specify the type of files you want, for your gadget.Geometric Folding Algorithms: Linkages, Origami, Polyhedra | Erik D. Demaine, Joseph O'Rourke.Not only was the story interesting, engaging and relatable, it also teaches lessons.
