Suggested preparation: Discrete mathematics, geometry and algorithms.
Optional preparation: Free MIT Course: Algorithms and Data Structures.
About this course
Explore algorithms and geometry through linkages, origami, rigidity and unfolding. The lectures connect physical folding questions with mathematical proofs and computational problems.
Topics and lesson examples
- Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra
- Lecture 8: Fold & One Cut
- Lecture 12: Tensegrities & Carpenter's Rules
- Class 16: Vertex & Orthogonal Unfolding
- Lecture 21: HP Model & Interlocked Chains
Course at a glance
| Provider | MIT |
|---|---|
| Platform | YouTube · MIT OpenCourseWare |
| Access | Free Video |
| Level | Professional — WikiFree study-level assessment |
| Language | English |
| Available lessons | 40 |
| Video duration | 42h 46m · self-paced |
| Details checked | 10 October 2026 |
Preparation and study approach
Suggested preparation: Discrete mathematics, geometry and algorithms.
Follow the available videos in sequence, pausing to summarize the main argument or reconstruct a worked example. Keep a short list of assumptions, unfamiliar terms and questions to revisit. Additional reading, problem solving and practice will take time beyond the listed video duration.
Using this video classroom
Select a lesson from the list, or search for a topic. Previous and Next move through the sequence. You can mark lessons complete; progress is stored in this browser without a WikiFree account.
Free access and course scope
The public MIT OpenCourseWare videos in this classroom are free to watch. This listing provides the available playlist recordings, which may include selected lectures, recitations, demonstrations or supporting discussions rather than every component of the original campus course. Textbooks, equipment, software licenses, supervised labs, graded assignments and instructor feedback are not supplied by WikiFree. No purchase is required to watch the videos or use the note-based study approach above.
WikiFree independently organizes these resources for self-paced study. Watching does not award an MIT certificate, academic credit or admission to MIT.
Video provider and credit: MIT OpenCourseWare on YouTube. WikiFree titles, descriptions and cover artwork are independently prepared.
Related courses for your next step
- Review a lower-level optionFree MIT Course: Algorithms and Data Structures
Focus: 1. Algorithms and Computation · Problem Session 3
Intermediate - Compare another approachFree MIT Course: Algorithm Design and Complexity Analysis
Focus: 1. Course Overview, Interval Scheduling · R4. Randomized Select and Randomized Quicksort
Professional - Review a lower-level optionFree Simplilearn Course: Data Structures and Algorithms
Focus: Arrays & Lists · Trees & Graphs
Intermediate
Compare course focus, level and study time
| Course | Level | Focus | Study time |
|---|---|---|---|
| This course — Free MIT Course: Geometric Folding Algorithms and Origami Mathematics | Professional | Lecture 1: Overview of Geometric Folding Algorithms: Linkages, Origami, Polyhedra · Lecture 8: Fold & One Cut · Lecture 12: Tensegrities & Carpenter's Rules | 42h 46m of video; practice time is additional |
| Free MIT Course: Algorithms and Data Structures | Intermediate | 1. Algorithms and Computation · Problem Session 3 · 11. Weighted Shortest Paths | 35h 19m of video; practice time is additional |
| Free MIT Course: Algorithm Design and Complexity Analysis | Professional | 1. Course Overview, Interval Scheduling · R4. Randomized Select and Randomized Quicksort · R6. Greedy Algorithms | 39h 28m of video; practice time is additional |
| Free Simplilearn Course: Data Structures and Algorithms | Intermediate | Arrays & Lists · Trees & Graphs · Search & Sort | 56h 43m of video; practice time is additional |
Provider: MIT. Videos play from the MIT OpenCourseWare channel on YouTube.
Report a correction
Questions & discussion
Share a useful question or correction. Comments appear after moderation. Please avoid personal or sensitive information.