Geometric Folding Algorithms: Bridging Theory to Practice

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".

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 03, 2009
Accession Number
ADA567850

Entities

People

  • Erik D. Demaine

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Algebra
  • Algorithms
  • Artificial Intelligence
  • Availability
  • Classification
  • Computations
  • Computer Science
  • Department Of Defense
  • Determinants (Mathematics)
  • Geometry
  • Mathematics
  • Monitoring
  • New York
  • Security
  • Self Assembly
  • Shape

Readers

  • Graph Algorithms and Convex Optimization.
  • Mycotoxin ecology in Amazonian ecosystems.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • Autonomy