ENGLISH

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

By Joseph O'Rourke , Erik D. Demaine

Book information

Publisher
Cambridge University Press
Year
2007
ISBN
9780521857574, 0521857570
Open Library ID
OL22762514M
Language
english
Format
PDF
Filesize
11 MB (11277037 bytes)
Edition
1
Pages
486\486
Library
mexmat
Orientation
no
Scanned
no
Time added
2009-07-20 03:45:11

Description

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.

Similar books