Free access
Proceedings
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms

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ß’ 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.

Formats available

You can view the full content in the following formats:

Information & Authors

Information

Published In

cover image Proceedings
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
Pages: 603 - 613
Editor: Dana Randall, Georgia Institute of Technology, Atlanta, Georgia
ISBN (Print): 978-0-898719-93-2
ISBN (Online): 978-1-61197-308-2

History

Published online: 18 December 2013

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options

PDF

View PDF

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media