The mathematical complexity of folding paper and linkages
In short: This lecture introduces the geometric principles behind folding algorithms. It examines how strip folding efficiency relates to computational complexity and explores the fundamental constraints of flat-foldability.
This MIT OpenCourseWare course explores the intersection of geometry and computation through the study of linkages, origami, and polyhedra. The material investigates the mechanics of strip folding and how seam placement affects the process.
The curriculum addresses the formal definitions of pseudo-polynomial complexity and clarifies the essential distinctions between simple folds and the requirements for flat-foldability.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Class 1: Overview for MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra
To cite this card, link to https://intellectplus.co.uk/app/ideas-class-1-overview-for-mit-6-849-geometric-folding-algorithms-.
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?
