34:40Lecture 17: Alexandrov's Theorem
From the creator
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine 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. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
Published 2014-08-26 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.
