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

Prof. Erik Demaine

Lecture 12 -- Page 4 -- 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 12: Flexible polyhedra, Bellows Theorem; folding polygons into polyhedra, gluings, convex polyhedral metrics, Aleksandrov's Theorem, Sabitov's algorithm, ungluable polygons

Page 4: Algorithms for Aleksandrov's Theorem: Sabitov's (highly exponential) algorithm

You can view the Fedorchuk and Pak paper on volume polynomials and algorithms for Aleksandrov's Theorem, which also summarizes Sabitov's work.

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.

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