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.
Want to master your topic faster? Let AI build your personalized course
📚 Smarter courses, 🔍 adaptive quizzes, 🎓 real certificates.
Coursesity is supported by learner community. We may earn affiliate commission when you make purchase via links on Coursesity.
Similar Courses
