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

Prof. Erik Demaine

Lecture 5 -- Page 5 -- 100 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 5: Small polygon requiring many flips; deflations; flipturns

The large-flip example appears in this paper about locked 3D chains.
A paper by Fevens, Hernandez, Mesa, Morin, Soss, and Toussaint covers deflations and the infinite deflation example.
An applet by Christopher Gray demonstrates the infinite deflation example.
Recent papers by Ahn, Bose, Czyzowicz, Hanusse, Kranakis, and Morin and by Aichholzer, Cortés, Demaine, Dujmović, Erickson, Meijer, Overmars, Palop, Ramaswami, and Toussaint cover flipturns.

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