Computational Origami Mit
The topics include the algorithm for origamizing arbitrary polyhedral surfaces freeform variation method of different types of origami patterns and rigid origami theory design and physical implementation.
Computational origami mit. It completes what i would characterize as a quest that began some 20 plus years ago. In a 1999 paper erik demaine now an mit professor of electrical engineering and computer science but then an 18 year old phd student at the university of waterloo in canada described an algorithm that could determine how to fold a piece of paper into any conceivable 3 d shape. In this wonderful presentation from moma s now legendary 2008 design and the elastic mind exhibition erik reveals the extraordinary computational origami he has developed with his father mit s first artist in residence.
A computational method for efficiently folding any specified shape from a sheet of paper. What forms of origami can be designed automatically by algorithms. It was a milestone paper in the field of computational origami but the algorithm didn t yield very practical folding patterns.
The technology could help scientists determine why a protein falls into a. This lecture will present my recent studies on computational origami algorithms and interactive systems to enable architectural designs. This is an advanced class on computational geometry focusing on folding and unfolding of geometric structures including linkages proteins paper and polyhedra.
Jun mitani s oripa oripa is a pattern editor for origami that provides a visual rendering of the folded form. It s very impressive stuff says robert lang one of the pioneers of computational origami and a fellow of the american mathematical society who in 2001 abandoned a successful career in optical engineering to become a full time origamist. Performs simulation and analysis of potentially rigidly foldable origami mechanisms and allows 3d manipulation of the pattern on screen.
So we love the work of mit father and son duo erik and martin demaine.
