Show simple item record

dc.contributor.authorBoxerman, Eddyen_US
dc.contributor.authorAscher, Urien_US
dc.contributor.editorR. Boulic and D. K. Paien_US
dc.date.accessioned2014-01-29T07:08:45Z
dc.date.available2014-01-29T07:08:45Z
dc.date.issued2004en_US
dc.identifier.isbn3-905673-14-2en_US
dc.identifier.issn1727-5288en_US
dc.identifier.urihttp://dx.doi.org/10.2312/SCA/SCA04/153-161en_US
dc.description.abstractImplicit schemes have become the standard for integrating the equations of motion in cloth simulation. These schemes, however, require the solution of a system representing the entire, fully connected cloth mesh at each time step. In this paper we present techniques that dynamically improve the sparsity of the underlying system, ultimately allowing the mesh to be decomposed into multiple components which can then be solved more efficiently and in parallel. Our techniques include a novel adaptive implicit-explicit (IMEX) scheme which takes advantage of simulation parameters, locally in both space and time, to minimize the coupling of the system. This scheme further directly improves the efficiency of the computation at each time step. Other sparsity improvements are obtained by exploiting the physical model of Choi and Ko (2002), as well as static constraints in the system. In addition, we present a modified preconditioner for the modified preconditioned conjugate gradient (MPCG) technique of Baraff and Witkin (1998), improving its performance by taking constraints into account.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleDecomposing Clothen_US
dc.description.seriesinformationSymposium on Computer Animationen_US


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record