Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Erik D. Demaine, Joseph O’Rourke9780521857574, 0521857570

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.

---

Table of contents :
0521857570pre_pi-xiv.pdf……Page 1
0521857570int_p1-6.pdf……Page 15
0521857570c01_p7-16.pdf……Page 21
0521857570c02_p17-28.pdf……Page 31
0521857570c03_p29-42.pdf……Page 43
0521857570c04_p43-58.pdf……Page 57
0521857570c05_p59-85.pdf……Page 73
0521857570c06_p86-122.pdf……Page 100
0521857570c07_p123-130.pdf……Page 137
0521857570c08_p131-147.pdf……Page 145
0521857570c09_p148-164.pdf……Page 162
0521857570c10_p165-171.pdf……Page 179
0521857570c11_p172-192.pdf……Page 186
0521857570c12_p193-213.pdf……Page 207
0521857570c13_p214-223.pdf……Page 228
0521857570c14_p224-231.pdf……Page 238
0521857570c15_p232-239.pdf……Page 246
0521857570c16_p240-253.pdf……Page 254
0521857570c17_p254-278.pdf……Page 268
0521857570c18_p279-284.pdf……Page 293
0521857570c19_p285-291.pdf……Page 299
0521857570c20_p292-296.pdf……Page 306
0521857570c21_p297-305.pdf……Page 311
0521857570c22_p306-338.pdf……Page 320
0521857570c23_p339-357.pdf……Page 353
0521857570c24_p358-380.pdf……Page 372
0521857570c25_p381-436.pdf……Page 395
0521857570c26_p437-442.pdf……Page 451
0521857570bib_p443-460.pdf……Page 457
0521857570ind_p463-472.pdf……Page 477