Class 15: General & Edge Unfolding

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 class begins with defining handles and holes, and the Gauss-Bonnet Theorem applied to convex polyhedra. Algorithms for zipper unfolding, edge ununfoldable polyhedra, square-packing, band unfolding, and blooming of convex polyhedra are presented. 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.