期刊
COMPUTER GRAPHICS FORUM
卷 32, 期 7, 页码 31-39出版社
WILEY
DOI: 10.1111/cgf.12209
关键词
-
资金
- Ministry of Culture, Sports and Tourism (MCST)
- Korea Culture Content Agency (KOCCA) in the Culture Technology (CT) Research and Development Programs
- Basic Science Research Program through the National Research Foundation of Korea (NRF)
- Ministry of Education, Science and Technology (MEST) [2012R1A2A1A01004891]
- Brain Korea 21 Project
- ASRI (Automation and Systems Research Institute at Seoul National University)
- Korea Creative Content Agency (KOCCA) [R2011100015-0002, R2012030119-0003] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
- National Research Foundation of Korea [2012R1A2A1A01004891] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据