z-logo
Premium
Constrainable Multigrid for Cloth
Author(s) -
Jeon Inyong,
Choi KwangJin,
Kim TaeYong,
Choi BongOuk,
Ko HyeongSeok
Publication year - 2013
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12209
Subject(s) - multigrid method , computer science , polygon mesh , conjugate gradient method , mathematical optimization , algorithm , computational science , computer graphics (images) , mathematics , partial differential equation , mathematical analysis
We present a new technique which can handle both point and sliding constraints in the multigrid (MG) framework. Although the MG method can theoretically perform as fast as O(N), the development of a clothing simulator based on the MG method calls for solving an important technical challenge: handling the constraints. Resolving constrains has been difficult in MG because there has been no clear way to transfer the constraints existing in the finest level mesh to the coarser level meshes. This paper presents a new formulation based on soft constraints, which can coarsen the constraints defined in the finest level to the coarser levels. Experiments are performed which show that the proposed method can solve the linear system up to 4–9 times faster in comparison with the modified preconditioned conjugate gradient method (MPCG) without quality degradation. The proposed method is easy to implement and can be straightforwardly applied to existing clothing simulators which are based on implicit time integration.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here