How do fixed-angle chains flatten and polygons flip their pockets?
In short: This lecture explores the geometry of folding, examining how chains with fixed angles can be flattened and addressing the complexities of flipping pockets within a polygon.
Presented by Erik Demaine, this MIT OpenCourseWare session investigates recent research into geometric folding algorithms. The lecture specifically addresses the mechanics of flattening fixed-angle chains and the process of flipping pockets in a polygon.
The session also scrutinizes existing mathematical literature, identifying flaws and omissions in previous proofs regarding the bounding number of flips. To resolve these issues, the lecture provides a corrected version of the proof originally proposed by Bing and Kazarinoff.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Class 20: 3D Linkage Folding
- Also: Class 20: 3D Linkage Folding | MIT Learn
- Also: ocw.mit.edu — Class 20: 3D Linkage Folding | Geometric Folding Algorithms: Linkages, Origami, Polyhedra | Electrical Engineering and Computer Science | MIT OpenCourseWare
To cite this card, link to https://intellectplus.co.uk/app/ideas-class-20-3d-linkage-folding.
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?
