Completed
Lecture 1: Overview
Class Central Classrooms beta
YouTube playlists curated by Class Central.
Classroom Contents
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2012)
Automatically move to the next video in the Classroom when playback concludes
- 1 Lecture 1: Overview
- 2 Class 1: Overview
- 3 Lecture 2: Simple Folds
- 4 Class 2: Universality & Simple Folds
- 5 Lecture 3: Single-Vertex Crease Patterns
- 6 Class 3: Single-Vertex Crease Patterns
- 7 Lecture 4: Efficient Origami Design
- 8 Class 4: Efficient Origami Design
- 9 Lecture 5: Artistic Origami Design
- 10 Class 5: Tessellations & Modulars
- 11 Lecture 6: Architectural Origami
- 12 Class 6: Architectural Origami
- 13 Lecture 7: Origami is Hard
- 14 Class 7: Origami is Hard
- 15 Lecture 8: Fold & One Cut
- 16 Class 8: Fold & One Cut
- 17 Lecture 9: Pleat Folding
- 18 Class 9: Pleat Folding
- 19 Lecture 10: Kempe's Universality Theorem
- 20 Class 10: Kempe's Universality Theorem
- 21 Lecture 11: Rigidity Theory
- 22 Class 11: Generic Rigidity
- 23 Lecture 12: Tensegrities & Carpenter's Rules
- 24 Class 12: Tensegrities
- 25 Lecture 13: Locked Linkages
- 26 Class 13: Locked Linkages
- 27 Lecture 14: Hinged Dissections
- 28 Class 14: Hinged Dissections
- 29 Lecture 15: General & Edge Unfolding
- 30 Class 15: General & Edge Unfolding
- 31 Lecture 16: Vertex & Orthogonal Unfolding
- 32 Class 16: Vertex & Orthogonal Unfolding
- 33 Lecture 17: Alexandrov's Theorem
- 34 Class 17: D-Forms
- 35 Lecture 18: Gluing Algorithms
- 36 Lecture 19: Refolding & Smooth Folding
- 37 Class 19: Refolding & Kinetic Sculpture
- 38 Lecture 20: Protein Chains
- 39 Class 20: 3D Linkage Folding
- 40 Lecture 21: HP Model & Interlocked Chains
