Video details loaded
HomeMIT 6.849 Geometric Folding Algorithms, Fall 2012Lecture 17: Alexandrov's Theorem
Lecture 17: Alexandrov's Theorem
1:21:24
Description: This lecture addresses the mathematical approaches for solving the decision problem for folding polyhedra. A proof of Alexandrov’s Theorem and later a constructive version of Alexandrov is presented. Gluing trees and rolling belts are introduced.
Speaker: Erik Demaine