Lecture

Right Arrow

SEARCH COURSES / LECTURES

Left Arrow

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

(40 Lectures Available)

S# Lecture Course Institute Instructor Discipline
26
  • Lecture 16: Vertex & Orthogonal Unfolding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
27
  • Lecture 17: Alexandrov's Theorem (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
28
  • Lecture 18: Gluing Algorithms (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
29
  • Lecture 19: Refolding & Smooth Folding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
30
  • Lecture 1: Overview (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
31
  • Lecture 20: Protein Chains (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
32
  • Lecture 21: HP Model & Interlocked Chains (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
33
  • Lecture 2: Simple Folds (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
34
  • Lecture 3: Single-Vertex Crease Patterns (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
35
  • Lecture 4: Efficient Origami Design (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
36
  • Lecture 5: Artistic Origami Design (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
37
  • Lecture 6: Architectural Origami (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
38
  • Lecture 7: Origami is Hard (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
39
  • Lecture 8: Fold & One Cut (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences
40
  • Lecture 9: Pleat Folding (M-I-T)
Geometric Folding Algorithms: Linkages, Origami, Polyhedra (M-I-T) MIT Prof. Erik Demaine Applied Sciences