Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T)

• Lecture 1: Overview (M-I-T)
• Class 1: Overview (M-I-T)
• Lecture 2: Simple Folds (M-I-T)
• Class 2: Universality & Simple Folds (M-I-T)
• Lecture 3: Single-Vertex Crease Patterns (M-I-T)
• Class 3: Single-Vertex Crease Patterns (M-I-T)
• Lecture 4: Efficient Origami Design (M-I-T)
• Class 4: Efficient Origami Design (M-I-T)
• Lecture 5: Artistic Origami Design (M-I-T)
• Class 5: Tessellations & Modulars (M-I-T)
• Lecture 6: Architectural Origami (M-I-T)
• Class 6: Architectural Origami (M-I-T)
• Lecture 7: Origami is Hard (M-I-T)
• Class 7: Origami is Hard (M-I-T)
• Lecture 8: Fold & One Cut (M-I-T)
• Class 8: Fold & One Cut (M-I-T)
• Lecture 9: Pleat Folding (M-I-T)
• Class 9: Pleat Folding (M-I-T)
• Lecture 10: Kempe's Universality Theorem (M-I-T)
• Class 10: Kempe's Universality Theorem (M-I-T)
• Lecture 11: Rigidity Theory (M-I-T)
• Class 11: Generic Rigidity (M-I-T)
• Class 12: Tensegrities (M-I-T)
• Lecture 13: Locked Linkages (M-I-T)
• Class 13: Locked Linkages (M-I-T)