Geometric Folding Algorithms: Linkages, Origami, Polyhedra

摘要: How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds results over 60 unsolved 'open problems' in this comprehensive look at the mathematics folding, with an emphasis on algorithmic or computational aspects. Folding unfolding problems have been implicit since Albrecht Drer early 1500s, but only recently studied mathematical literature. Over past decade, there has a surge interest these problems, applications ranging from robotics to protein folding. A proof shows that it is possible design series jointed bars moving flat plane sign name trace any other algebraic curve. One remarkable algorithm you fold straight-line drawing paper so complete cut out one straight scissors cut. Aimed primarily advanced undergraduate graduate students computer science, lavishly illustrated book will fascinate broad audience, high school researchers.