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

Prof. Erik Demaine

Lecture 11 -- Page 5 -- 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 11: Vertex unfolding, unfolding orthogonal polyhedra; Cauchy's rigidity theorem, uniqueness of folding

Page 5: Uniqueness of folding (part of Aleksandrov's theorem), proof using Cauchy rigidity theorem, connection to shortest paths, algorithmic challenge

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