Video details loaded
HomeMIT 6.849 Geometric Folding Algorithms, Fall 2012Lecture 8: Fold & One Cut
Lecture 8: Fold & One Cut
1:20:57
Description: 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.
Speaker: Erik Demaine