Geometric Folding Algorithms

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

English | July 16, 2007 | ISBN: 0521857570 | 488 Pages | PDF | 10 MB

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.


[Fast Download] Geometric Folding Algorithms

Related eBooks:
Multivariable Model - Building
Elliptic Curves and Big Galois Representations
Advanced Calculus Problem Solver (Problem Solvers Solution Guides)
Elementary Number Theory
Dynamics Of Complex Systems
An Imaginary Tale
William e Martha Kneale - Storia della logica
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
Hausdorff Gaps and Limits
Expander Families and Cayley Graphs: A Beginner's Guide
Topology and Geometry
What is a Mathematical Concept?
Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.