Günter Rote*, Uri Zwickt

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationProceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011
PublisherAssociation for Computing Machinery
Number of pages11
ISBN (Print)9780898719932
StatePublished - 2011

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms


Dive into the research topics of 'Collapse'. Together they form a unique fingerprint.

Cite this