Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Купить бумажную книгу и читать

Название: Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Автор: Erik D. Demaine, Joseph O'Rourke

Издательство: Cambridge University Press

Год: 2007

ISBN: 0521857570

Страниц: 496

Формат: PDF

Размер: 11.1 Mb

Язык: Английский

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.