MIT · Computer Science
6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Erik Demaine · 2012 · 39 free video lectures
This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra.…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Class 1 overview
- Class 2 univeresality simple folds
- Class 3 single vertex crease patterns
- Class 4 efficient origami design
- Class 5 tessellations modulars
- Class 6 architectural origami
- Class 7 origami is hard
- Class 8 fold one cut
- Class 9 pleat folding
- Class 10 kempes universality theorem
- Class 11 generic rigidity
- Class 12 tensegrities
- Class 13 locked linkages
- Class 14 hinged dissections
- Class 15 general edge unfolding
- Class 16 vertex orthogonal unfolding
- Class 17 d forms
- Class 19 refolding kinetic sculpture
- Class 20 3d linkage folding
- Lecture 1: overview
- Lecture 2: simple folds
- Lecture 3: single vertex crease patterns
- Lecture 4: efficient origami design
- Lecture 5: artistic origami design
- Lecture 6: architectural origami
- Lecture 7: origami is hard
- Lecture 8: fold one cut
- Lecture 9: pleat folding
- Lecture 10: kempes universality theorem
- Lecture 11: rigidity theory
- Lecture 12: tensegrities carpenters rules
- Lecture 13: locked linkages
- Lecture 15: general edge unfolding
- Lecture 16: vertex orthogonal unfolding
- Lecture 17: alexandrovs theorem
- Lecture 18: gluing algorithms
- Lecture 19: refolding smooth folding
- Lecture 20: protein chains
- Lecture 21: hp model interlocked chains
From MIT OpenCourseWare · CC BY-NC-SA 4.0. More from MIT.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights