Why the mathematics of paper folding is computationally complex
In short: Explore the intricate intersection of geometry and computer science in this lecture from MIT's Geometric Folding Algorithms course. Discover why certain folding patterns present significant mathematical challenges.
In this lecture, Erik Demaine examines the complexities of origami through the lens of computational theory. The session explores specific techniques such as box-pleating and maze-folding, while providing a detailed walkthrough of a proof regarding NP-hardness. The presentation also introduces various folding gadgets and addresses the mechanics of non-simple folds.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Class 7: Origami is Hard
- Also: Class 7: Origami is Hard | Geometric Folding Algorithms: Linkages, Origami, Polyhedra | Electrical Engineering and Computer Science | MIT OpenCourseWare
- Also: Class 7: Origami is Hard | MIT Learn
To cite this card, link to https://intellectplus.co.uk/app/ideas-class-7-origami-is-hard.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
