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

Prof. Erik Demaine

Lecture 7 -- Page 1 -- 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 7: Fix for proof of Erdős-Nagy Theorem; characterizations of flat-foldable single-vertex crease patterns and mountain-valley patterns; continuous foldability of single-vertex patterns; linear-time algorithm for local foldability; NP-hardness of global foldability

Page 1: Fix for proof of Erdős-Nagy Theorem by Blaise Gassend

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