Lecture 12: Flexible polyhedra, Bellows Theorem; folding polygons into polyhedra, gluings, convex polyhedral metrics, Aleksandrov's Theorem, Sabitov's algorithm, ungluable polygons
Page 2: Folding polygons into convex polyhedra: decision problem, enumeration problem, combinatorial problem. Nonconvex polyhedra. It's all about the gluing: metric induced by shortest paths, polyhedral metrics, convex polyhedral metrics.
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
[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]