The mathematical logic behind unfolding complex 3D shapes
In short: Can every convex polyhedron be flattened into a single, non-overlapping piece? This lecture explores the geometric algorithms and theorems that govern how 3D structures transition into 2D forms.
In this session of the MIT course Geometric Folding Algorithms, Erik Demaine explores the computational geometry of unfolding. The lecture covers specialized techniques such as zipper unfolding, band unfolding, and the 'blooming' of convex polyhedra.
The content bridges high-level mathematics and practical algorithms, applying the Gauss-Bonnet Theorem to convex polyhedra. It also addresses complex problems like square-packing and identifies specific 'edge ununfoldable' polyhedra that defy standard flattening methods.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Class 15: General & Edge Unfolding
- Also: Class 15: General & Edge Unfolding | Geometric Folding Algorithms: Linkages, Origami, Polyhedra | Electrical Engineering and Computer Science | MIT OpenCourseWare
- Also: Class 15: General & Edge Unfolding | MIT Learn
To cite this card, link to https://intellectplus.co.uk/app/ideas-class-15-general-edge-unfolding.
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?
Related
More in Mathematics · More in Ideas & Philosophy · Latest · A–Z · All topics
