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 presents the fold and cut problem, and both the straight skeleton method and disk-packing method. Simple fold and cut is then generalized for folding surface of polyhedra.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu