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

Prof. Erik Demaine

Lecture 9 -- 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 9: Fold-and-cut problem: straight-skeleton method, disk-packing method. Flattening polyhedra.

Page 1: Fold-and-cut problem, history, universality result, straight skeleton

The fold-and-cut page details some of the history, including scans from the Kan Chu Sen book.

You can view the original paper introducing straight skeletons by Aichholzer, Aurenhammer, Alberts, and Gärtner.

You can view the paper by Demaine, Demaine, and Lubiw describing the straight-skeleton method (sans dense spirality).

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