|
Accession Number
|
ADA567850
|
|
Title
|
Geometric Folding Algorithms: Bridging Theory to Practice.
|
|
Publication Date
|
Nov 2009
|
|
Media Count
|
4p
|
|
Personal Author
|
E. D. Demaine
|
|
Abstract
|
I. RECONFIGURABLE ROBOTS: (a) Solved the hinged dissection problem, which was over a 100 years old, proving that any finite collection of shapes have a hinged dissection; (b) Proved that crystalline robots can reconfigure extremely efficiently: O(log n) time and O(n) moves; (c) Proved that any orthogonal polyhedron can be folded from a single, universal crease pattern (box pleating). II. ORIGAMI DESIGN: (a) Developed mathematical theory for what happens in paper between creases, in particular for the case of circular creases; (b) Circular crease origami on permanent exhibition at MoMA in New York; (c) Developing mathematical theory of Tomohiro Tachi's Origamizer framework for efficiently folding any polyhedron from a sheet of paper; (d) Developing mathematical theory of Robert Lang's TreeMaker framework for efficiently folding tree-shaped origami 'bases'.
|
|
Keywords
|
Algorithms
Box pleating. polyhedrons
Folding
Geometry
Hinged dissection
Mathematics
|
|
|
Source Agency
|
Non Paid ADAS
|
|
NTIS Subject Category
|
72B - Algebra, Analysis, Geometry, & Mathematical Logic
|
|
Corporate Author
|
Massachusetts Inst. of Tech., Cambridge. Computer Science and Artificial Intelligence Lab.
|
|
Document Type
|
Technical report
|
|
Title Note
|
Final rept. 15 Jul 2007-14 Jul 2008.
|
|
NTIS Issue Number
|
1310
|
|
Contract Number
|
FA9550-07-1-0538
|
