search give now about ocw help & faqs contact us
6.849 | Fall 2012 | Graduate

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Class and Lecture Videos

Class 16: Vertex & Orthogonal Unfolding

Description: This class reviews covers topologically convex vertex-ununfoldable cases and unfolding for orthogonal polyhedra, including the approach of heavy-light decomposition. The class also reviews Cauchy’s Rigidity Theorem.

Speaker: Erik Demaine

The following videos were played at the end of the class:

http://www.youtube.com/watch?v=9h1Og9KdL08

http://www.youtube.com/watch?v=Y47ZTc3lSvk&list=PLF44ECE2EF13B303D

Course Info

Instructor
Departments
As Taught In
Fall 2012
Level
Graduate
Topics
Learning Resource Types
Lecture Videos
Problem Sets with Solutions
Projects
Instructor Insights
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2023 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2023 Massachusetts Institute of Technology