MIT
Lecture 17: Alexandrov's Theorem
Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathArt, Design & ArchitectureVisual Arts
Om kurset
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