MIT 6.849 Geometric Folding Algorithms, Fall 2012 - Lecture 19: Refolding & Smooth Folding

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 alexandrov common unfolding cone wrapping contractive folding cubigami d-forms genus isometry mozartkugel orthgonal polyhedra petal wrapping

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 a problem involving unfolding and refolding. Examples of smooth foldings and unfoldings are given, followed by a problem involving the wrapping of a sphere and a proof that the wrappings are contractive. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu