The mathematical complexity hidden within a simple fold
In short: Explore the geometric principles of origami and linkages in this lecture by Erik Demaine. This session examines the efficiency of strip folding and the mechanics of flat-foldability.
Presented as part of the MIT 6.849 course on Geometric Folding Algorithms, this lecture moves from a practical exercise of folding numerical digits to complex computational concepts. The discussion delves into the placement of seams and the definition of pseudo-polynomial in the context of folding efficiency.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Class 2: Universality & Simple Folds
- Also: Class 2: Universality & Simple Folds | MIT Learn
- Also: Class 2: Universality & Simple Folds | 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-2-universality-simple-folds.
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?
