@inproceedings{0ae15ca89e8246c684cd33ada3940837,
title = "Collapse",
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{\ss}' 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.",
author = "G{\"u}nter Rote and Uri Zwickt",
year = "2011",
doi = "10.1137/1.9781611973082.47",
language = "الإنجليزيّة",
isbn = "9780898719932",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "Association for Computing Machinery",
pages = "603--613",
booktitle = "Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011",
address = "الولايات المتّحدة",
}