Lecture 2: Simple Folds
MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture begins with definitions of origami terminology and a demonstration of mountain-valley folding. Turn, hide, color reversal gadgets, proofs for folding any shape, Hamiltonian refinement, and foldability with 1D flat folding are presented. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

▶︎
Class 2: Universality & Simple Folds

▶︎
Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra

▶︎
"The Art and Science of Folding" - Origami Artist Paul Jackson 25.2.2019

▶︎
The High School Student Who Overturned a 40-Year-Old Conjecture

▶︎
A world from a sheet of paper - Tadashi Tokieda

▶︎
There’s a Problem with Quantum Mechanics – with Jim Al-Khalili

▶︎
MIT 6.S184: Flow Matching and Diffusion Models - Lecture 02: Flow Matching (2026)

▶︎
Lecture 13: Breadth-First Search (BFS)

▶︎
Class 1: Overview for MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra

▶︎
The math and magic of origami | Robert Lang

▶︎
The Scariest Chart In Electrical Engineering

▶︎
The French Do Not Care About Work

▶︎
How to Speak

▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup

▶︎
Erik Demaine: Algorithms Meet Art, Puzzles, and Magic

▶︎
The Hardest Questions in Physics | World Science Festival

▶︎
Lecture 4: Efficient Origami Design

▶︎
Origami Art and Science

▶︎
