MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012
View the complete course: [ Ссылка ]
Instructor: Erik Demaine
This lecture introduces universal hinge patterns with the cube and maze gadget. NP-hardness problems involving partition and satisfiability are presented with examples of simple folds, global flat foldability, and disk packing.
License: Creative Commons BY-NC-SA
More information at [ Ссылка ]
More courses at [ Ссылка ]
