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.
50,000+ Free Courses Online to Start Today
View CoursesCoursesity is supported by learner community. We may earn affiliate commission when you make purchase via links on Coursesity.
Similar Courses
