6.885: Folding and Unfolding in Computational Geometry (Fall 2004)

Prof. Erik Demaine

Lecture 5 -- Page 4 -- 150 DPI

[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]

Switch to 50 DPI or 72 DPI or 100 DPI or 150 DPI or 200 DPI

Lecture 5: Algorithms for unfolding 2D chains, infinitesimally locked linkages, locked 3D chains (knitting needles), pocket flipping, Erdős-Nagy Theorem, deflations, flipturns

Page 4: Pocket flipping, Erdős-Nagy Theorem, proof

You can view Godfried Toussaint's excellent survey on the Erdős-Nagy Theorem, its history, and related results. The proof presented here is based on the proof described in Godfried's paper, which in turn is based on Nagy's original proof.

These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students of the class. Accessibility

Printable PostScript (requires Level-2 PostScript)

[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]

Switch to 50 DPI or 72 DPI or 100 DPI or 150 DPI or 200 DPI