
Lecture 34 of 40 · Geometric Folding Algorithms
Erik Demaine
Geometric Folding Algorithms · 40 lectures
40 lectures
Overview of Geometric Folding Algorithms
Overview for Geometric Folding Algorithms
Simple Folds
Universality & Simple Folds
Single-Vertex Crease Patterns
Single-Vertex Crease Patterns (6)
Efficient Origami Design
Efficient Origami Design (8)
Artistic Origami Design
Tessellations & Modulars
Architectural Origami
Architectural Origami (12)
Origami is Hard
Origami is Hard (14)
Fold & One Cut
Fold & One Cut (16)
Pleat Folding
Pleat Folding (18)
Kempe’s Universality Theorem
Kempe’s Universality Theorem (20)
Rigidity Theory
Generic Rigidity
Tensegrities & Carpenter’s Rules
Tensegrities
Locked Linkages
Locked Linkages (26)
Hinged Dissections
Hinged Dissections (28)
General & Edge Unfolding
General & Edge Unfolding (30)
Vertex & Orthogonal Unfolding
Vertex & Orthogonal Unfolding (32)
Alexandrov’s Theorem
D-Forms
Gluing Algorithms
Refolding & Smooth Folding
Refolding & Kinetic Sculpture
Protein Chains
3D Linkage Folding
HP Model & Interlocked Chains