1
6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra (Fall 2012, MIT OCW). Instructor: Professor Erik Demaine.
FREE
This course includes
Hours of videos
1111 years
Units & Quizzes
40
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course. (from ocw.mit.edu)
Course Currilcum
- Lecture 01 – Overview Unlimited
- Class 01 – Overview Unlimited
- Lecture 02 – Simple Folds Unlimited
- Class 02 – Universality & Simple Folds Unlimited
- Lecture 03 – Single-Vertex Crease Patterns Unlimited
- Class 03 – Single-Vertex Crease Patterns Unlimited
- Lecture 04 – Efficient Origami Design Unlimited
- Class 04 – Efficient Origami Design Unlimited
- Lecture 05 – Artistic Origami Design Unlimited
- Class 05 – Tessellations & Modulars Unlimited
- Lecture 06 – Architectural Origami Unlimited
- Class 06 – Architectural Origami Unlimited
- Lecture 07 – Origami is Hard Unlimited
- Class 07 – Origami is Hard Unlimited
- Lecture 08 – Fold & One Cut Unlimited
- Class 08 – Fold & One Cut Unlimited
- Lecture 09 – Pleat Folding Unlimited
- Class 09 – Pleat Folding Unlimited
- Lecture 10 – Kempe’s Universality Theorem Unlimited
- Class 10 – Kempe’s Universality Theorem Unlimited
- Lecture 11 – Rigidity Theory Unlimited
- Class 11 – Generic Rigidity Unlimited
- Lecture 12 – Tensegrities & Carpenter’s Rules Unlimited
- Class 12 – Tensegrities Unlimited
- Lecture 13 – Locked Linkages Unlimited
- Class 13 – Locked Linkages Unlimited
- Lecture 14 – Hinged Dissections Unlimited
- Class 14 – Hinged Dissections Unlimited
- Lecture 15 – General & Edge Unfolding Unlimited
- Class 15 – General & Edge Unfolding Unlimited
- Lecture 16 – Vertex & Orthogonal Unfolding Unlimited
- Class 16 – Vertex & Orthogonal Unfolding Unlimited
- Lecture 17 – Alexandrov’s Theorem Unlimited
- Class 17 – D-Forms Unlimited
- Lecture 18 – Gluing Algorithms Unlimited
- Lecture 19 – Refolding & Smooth Folding Unlimited
- Class 19 – Refolding & Kinetic Sculpture Unlimited
- Lecture 20 – Protein Chains Unlimited
- Class 20 – 3D Linkage Folding Unlimited
- Lecture 21 – HP Model & Interlocked Chains Unlimited
