Lecture 4: Efficient Origami Design
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 continues to discuss the tree method and characterizing a uniaxial base. Another algorithm, Origamizer, is presented with introductory examples of folding a cube, checkerboard, and arbitrary polyhedra. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
▶︎
Class 4: Efficient Origami Design
▶︎
Lecture 5: Artistic Origami Design
▶︎
Lecture 8: Fold & One Cut
▶︎
Class 5: Tessellations & Modulars
▶︎
The Origami Design Process from Start to Finish
▶︎
Inside Black Holes | Leonard Susskind
▶︎
Erik Demaine: Algorithms Meet Art, Puzzles, and Magic
▶︎
The math and magic of origami | Robert Lang
▶︎
Lecture 3: Single-Vertex Crease Patterns
▶︎
The Scariest Chart In Electrical Engineering
▶︎
Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra
▶︎
MIT 6.S184: Flow Matching and Diffusion Models - Lecture 03B - Classifier-free Guidance (2026)
▶︎
"The Art and Science of Folding" - Origami Artist Paul Jackson 25.2.2019
▶︎
The Most Satisfying Machines That Are At Another Level!
▶︎
Only Video That Will Make You BETTER at MATH - 100%
▶︎
Lecture 6: Architectural Origami
▶︎
MIT 6.S184: Flow Matching and Diffusion Models - Lecture 02: Flow Matching (2026)
▶︎
Class 6: Architectural Origami
▶︎
Folding the Future: How Origami is Transforming Engineering | Dr Mark Schenk
▶︎