Combinatorial and Algorithmic Rigidity: Beyond Two Dimensions

Abstract

Our grant project "Combinatorial and Algorithmic Rigidity: Beyond Two Dimensions" was submitted in 2008, under the DARPA solicitation "Mathematical Challenges, BAA 07-68". It addressed Mathematical Challenge Ten: Algorithmic Origami and Biology and proposed "a line of attack on the central problem in three-dimensional rigidity theory: the combinatorial characterization of minimally rigid bar-and-joint frameworks". Appearing implicitly in James C. Maxwell's work from the 1860's, this problem is currently referred to as Maxwell's problem.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 2012
Accession Number
ADA579251

Entities

People

  • Ciprian S. Borcea
  • Ileana Streinu

Organizations

  • Smith College

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Algebraic Geometry
  • Algorithms
  • Boundaries
  • Computational Biology
  • Computer Science
  • Geometry
  • Materials
  • Mathematics
  • Phase Transformations
  • Resilience
  • Rigidity
  • Robots
  • Tectosilicates
  • Three Dimensional
  • Two Dimensional
  • Universities

Readers

  • Calculus or Mathematical Analysis
  • Distributed Systems and Data Platform Development
  • Graph Algorithms and Convex Optimization.