Arrow Research search
Back to SODA

SODA 2011

Collapse

Conference Paper Session 4C Algorithms and Complexity · Theoretical Computer Science

Abstract

The problem of checking whether a given tower of bricks is stable can be easily answered by checking whether a system of linear inequalities has a feasible solution. A more challenging problem is to determine how an unstable tower of bricks collapses. We use Gauß’ principle of least restraint to show that this, and more general rigid-body simulation problems in which many parts touch each other, can be reduced to solving a sequence of convex quadratic programs, with linear constraints, corresponding to a discretization of time. The first of these quadratic programs gives an exact description of initial infinitesimal collapse. The results of the subsequent programs need to be integrated over time to yield an approximation of the global motion of the system.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM-SIAM Symposium on Discrete Algorithms
Archive span
1990-2025
Indexed papers
4674
Paper id
352211003167169539