Learn · MIT OpenCourseWare

Green paper folded along multiple curved creases to form curved fins of a sculpture.

Course6.84940 lectures42 h 47 min

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Prof. Erik Demaine · Massachusetts Institute of Technology

Start with lecture 1 At MIT OpenCourseWare

About

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.

Acknowledgments

Thanks to videographers Martin Demaine and Jayson Lynch.

Lectures

Lecture Videos

  1. Lecture 1: Overview, 6.849 Fall 2012 1 h 20 min · Video
  2. Lecture 2: Simple Folds 1 h 24 min · Video
  3. Lecture 3: Single-Vertex Crease Patterns 1 h 24 min · Video
  4. Lecture 4: Efficient Origami Design 1 h 27 min · Video
  5. Lecture 5: Artistic Origami Design 1 h 27 min · Video
  6. Lecture 6: Architectural Origami 1 h 19 min · Video
  7. Lecture 7: Origami is Hard 1 h 23 min · Video
  8. Lecture 8: Fold & One Cut 1 h 21 min · Video
  9. Lecture 9: Pleat Folding 1 h 23 min · Video
  10. Lecture 10: Kempe's Universality Theorem 1 h 19 min · Video
  11. Lecture 11: Rigidity Theory 1 h 25 min · Video
  12. Lecture 12: Tensegrities & Carpenter's Rules 1 h 25 min · Video
  13. Lecture 13: Locked Linkages 1 h 22 min · Video
  14. Lecture 14: Hinged Dissections 1 h 22 min · Video
  15. Lecture 15: General & Edge Unfolding 1 h 21 min · Video
  16. Lecture 16: Vertex & Orthogonal Unfolding 1 h 23 min · Video
  17. Lecture 17: Alexandrov's Theorem 1 h 22 min · Video
  18. Lecture 18: Gluing Algorithms 1 h 22 min · Video
  19. Lecture 19: Refolding & Smooth Folding 1 h 26 min · Video
  20. Lecture 20: Protein Chains 1 h 20 min · Video
  21. Lecture 21: HP Model & Interlocked Chains 1 h 10 min · Video

Class Videos

  1. Class 1: Overview 51 min · Video
  2. Class 2: Universality & Simple Folds 54 min · Video
  3. Class 3: Single-Vertex Crease Patterns 47 min · Video
  4. Class 4: Efficient Origami Design 50 min · Video
  5. Class 5: Tessellations & Modulars 39 min · Video
  6. Class 6: Architectural Origami 46 min · Video
  7. Class 7: Origami is Hard 50 min · Video
  8. Class 8: Fold & One Cut 50 min · Video
  9. Class 9: Pleat Folding 47 min · Video
  10. Class 10: Kempe's Universality Theorem 45 min · Video
  11. Class 11: Generic Rigidity 51 min · Video
  12. Class 12: Tensegrities 19 min · Video
  13. Class 13: Locked Linkages 52 min · Video
  14. Class 14: Hinged Dissections 53 min · Video
  15. Class 15: General & Edge Unfolding 51 min · Video
  16. Class 16: Vertex & Orthogonal Unfolding 42 min · Video
  17. Class 17: D-Forms 44 min · Video
  18. Class 19: Refolding & Kinetic Sculpture 32 min · Video
  19. Class 20: 3D Linkage Folding 39 min · Video

Syllabus and materials

At MIT OpenCourseWare, as the course publishes them.

Credits and licence

Institution
Massachusetts Institute of Technology
Department
Electrical Engineering and Computer Science
Teacher
Prof. Erik Demaine
Term
Fall 2012
Level
Graduate
Language
English
Subjects
Mathematics, Computer science, Engineering, Art, architecture and design
Source
MIT OpenCourseWare
Licence
CC BY-NC-SA 4.0, as MIT OpenCourseWare states it. Non-commercial use only. MIT OpenCourseWare's terms
Attribution
Prof. Erik Demaine. Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Fall 2012. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu/. License: Creative Commons BY-NC-SA.
Who can watch
MIT OpenCourseWare gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed