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

Prof. Erik Demaine

Lecture 5 -- Page 1 -- 50 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 1: Three algorithms for unfolding 2D chains: ordinary differential equation given by expansive infinitesimal motion, pseudotriangulations, and energy

You can view the papers on each of the three algorithms: original ordinary differential equation, pseudotriangulations, and energy.

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