MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Class 15: General & Edge Unfolding

4.0 (0)

5 learners

What you'll learn

This course includes

42.5 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

6-849-geometric-folding-algorithms-linkages-origami-polyhedra-fall-2012 band blooming continuous curvature gauss-bonnet genus hamiltonian path handle hole locus polyhedra

Full Transcript

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