Книга Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Книги Математика

Автор:

Erik D. Demaine, Joseph O'Rourke

Год издания: 2007

Формат: pdf

Издат.:

Cambridge University Press

Страниц: 496

Размер: 9,6 Mb

ISBN: 0521857570

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

(голосов: 0)

Оценка:

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

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.

tata167

7 мая 2008

Добавление комментария к книге Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Электронная библиотека книг