
#222 overall
6.849 Geometric Folding Algorithms
MIT OpenCourseWare
2 recommenders · 2 threads · recommended in 2 years, 2017–2021 · score 1.9
A graduate-level MIT course on the computational geometry of folding, covering linkages, origami, and polyhedra, taught by Erik Demaine. MIT OpenCourseWare publishes its lecture videos and materials.
Commenters point to the free video lectures of Erik Demaine's folding course and describe it as a good resource for the math behind origami and folding problems.
Recommendations by year
20062026
I recommend this MIT OCW for people interested in the math behind origami and folding problems:
https://ocw.mit.edu/courses/electrical-engineering-and-compu...
Check out [1] for videos of Erik Demaine's lectures on folding. Also, I highly recommend the videos for the algorithms and data structures courses he's taught/co-taught ([2] for example)
[1] https://ocw.mit.edu/courses/electrical-engineering-and-compu...
[2] https://ocw.mit.edu/courses/electrical-engineering-and-compu...
Check out E.Demaine's other classes. Video footage is fresher and of higher res. Subjects are awesome too.
http://erikdemaine.org/classes/ -- http://courses.csail.mit.edu/6.851/spring12/ -- http://courses.csail.mit.edu/6.849/fall10/