The geometry of a single fold: decoding origami's math
In short: How do we determine if a complex piece of paper can actually be folded flat? This MIT course explores the specific algorithms used to test the flat-foldability of single-vertex crease patterns.
In the context of geometric folding algorithms, mathematicians look for specific rules that govern how paper behaves. This lesson focuses on 1D and single-vertex MV (multi-vertex) patterns, providing a framework to determine 'local flat-foldability.'
The material covers the underlying motivations for these tests and explores how these principles can be extended into higher dimensions. It serves as a foundational look at the computational geometry that allows origami to move from art to rigorous mathematics.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Class 3: Single-Vertex Crease Patterns
To cite this card, link to https://intellectplus.co.uk/app/ideas-class-3-single-vertex-crease-patterns.
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?
