Sign inSign in

Theory & Algos · Book

Geometric Folding Algorithms

Erik D. Demaine, Joseph O'Rourke

Linkages, Origami, Polyhedra

Demaine and O'Rourke treat folding and unfolding problems in three parts: linkages, paper origami, and polyhedra, with emphasis on algorithms and computation.

Erik D. Demaine, Joseph O'RourkeBy the lecturerCambridge University Press2007496 pages

Watch Erik D. DemaineFind a copy

Opens a bookshop outside Lectern.

Good fit if

MacArthur Fellow Erik Demaine's monograph on the algorithmic geometry of linkages, origami crease patterns, and polyhedral unfolding.

About the book

Results include a proof that planar jointed bars can trace any algebraic curve and an algorithm folding any straight-line drawing so one straight cut removes it. The book gathers hundreds of results and over 60 open problems. It is aimed at advanced undergraduate and graduate students in mathematics or computer science.

Authors

Readers

No reader has written about it yet.

Write the first review

Where next

6 connections

Connections

6

Its authors, the courses that use it and the lectures that cite it.