Combinatorial and Algorithmic Rigidity: Beyond Two Dimensions
Final technical rept. December 2008 - December 2012
SMITH COLL NORTHAMPTON MA
Pagination or Media Count:
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. Maxwells work from the 1860s, this problem is currently referred to as Maxwells problem.
- Numerical Mathematics
- Statistics and Probability
- Electricity and Magnetism