MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Lecture 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 unfolding crease curvature cut dome edge unfolding general unfolding geodesic path locus prismatoid prismoid

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 lecture begins with describing polyhedron unfolding for convex and nonconvex polygons. Algorithms for shortest path solutions and unfoldings are presented along with how to determine whether an edge unfolding exists. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu