Share Description
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.
Craft Your Perfect Resume 10x Faster with AI
Get ResumeCoursesity is supported by learner community. We may earn affiliate commission when you make purchase via links on Coursesity.
Similar Courses
