Fast simulation of mass-spring systems
Links to Fileshttps://dl.acm.org/citation.cfm?id=2508406
MetadataShow full item record
Type of Work7 pages
journal articles preprints
Citation of Original PublicationTiantian Liu, Adam W. Bargteil, et.al, Fast simulation of mass-spring systems, ACM Transactions on Graphics (TOG) TOG Homepage archive Volume 32 Issue 6, November 2013 Article No. 214, DOI: https://doi.org/10.1145/2508363.2508406
RightsThis item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
We describe a scheme for time integration of mass-spring systems that makes use of a solver based on block coordinate descent. This scheme provides a fast solution for classical linear (Hookean) springs. We express the widely used implicit Euler method as an energy minimization problem and introduce spring directions as auxiliary unknown variables. The system is globally linear in the node positions, and the non-linear terms involving the directions are strictly local. Because the global linear system does not depend on run-time state, the matrix can be pre-factored, allowing for very fast iterations. Our method converges to the same final result as would be obtained by solving the standard form of implicit Euler using Newton's method. Although the asymptotic convergence of Newton's method is faster than ours, the initial ratio of work to error reduction with our method is much faster than Newton's. For real-time visual applications, where speed and stability are more important than precision, we obtain visually acceptable results at a total cost per timestep that is only a fraction of that required for a single Newton iteration. When higher accuracy is required, our algorithm can be used to compute a good starting point for subsequent Newton's iteration.