An efficient large deformation method using domain decomposition

被引:24
|
作者
Huang, Jin
Liu, Xinguo [1 ]
Bao, Hujun
Guo, Baining
Shum, Heung-Yeung
机构
[1] Zhejiang Univ, State Key Lab CAD&CG, Hangzhou 310027, Peoples R China
[2] Microsoft Res Asia, Sigma Ctr, Beijing 100080, Peoples R China
来源
COMPUTERS & GRAPHICS-UK | 2006年 / 30卷 / 06期
基金
中国国家自然科学基金;
关键词
deformation; domain decomposition; cluster PCA; Cholesky factorization;
D O I
10.1016/j.cag.2006.08.014
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Efficiently simulating large deformations of flexible objects is a challenging problem in computer graphics. In this paper, we present a physically based approach to this problem, using the linear elasticity model and a finite elements method. To handle large deformations in the linear elasticity model, we exploit the domain decomposition method, based on the observation that each sub-domain undergoes a relatively small local deformation, involving a global rigid transformation. In order to efficiently solve the deformation at each simulation time step, we pre-compute the object responses in terms of displacement accelerations to the forces acting on each node, yielding a force-displacement matrix. However, the force-displacement matrix could be too large to handle for densely tessellated objects. To address this problem, we present two methods. The first method exploits spatial coherence to compress the force-displacement matrix using the clustered principal component analysis method; and the second method pre-computes only the force-displacement vectors for the boundary vertices of the sub-domains and resorts to the Cholesky factorization to solve the acceleration for the internal vertices of the sub-domains. Finally, we present some experimental results to show the large deformation effects and fast performance on complex large scale objects under interactive user manipulations. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:927 / 935
页数:9
相关论文
共 50 条
  • [31] A New Efficient Domain Decomposition Method for Highly Irregular Via Patterns
    Li, Ping
    Jiang, Lijun
    Xiong, Xiaoyan
    Bagci, Hakan
    2018 IEEE 27TH CONFERENCE ON ELECTRICAL PERFORMANCE OF ELECTRONIC PACKAGING AND SYSTEMS (EPEPS), 2018, : 189 - 191
  • [32] Efficient consideration of periodic boundary condition in hierarchical domain decomposition method
    Sugimoto S.-I.
    IEEJ Transactions on Power and Energy, 2019, 139 (11) : 637 - 642
  • [33] Hydrogen Diffusion Computation using the Domain Decomposition Method
    Kanayama, H.
    Ismail, I.
    PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY, 2010, 94
  • [34] An efficient domain decomposition method for three-dimensional parabolic problems
    Jun, Younbae
    APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (08) : 2815 - 2825
  • [35] ANALYSIS OF LUNEBURG LENSES USING DOMAIN DECOMPOSITION METHOD
    Kucharski, Andrzej A.
    2008 MIKON CONFERENCE PROCEEDINGS, VOLS 1 AND 2, 2008, : 730 - 733
  • [36] Parallel DSMC method using dynamic domain decomposition
    Wu, JS
    Tseng, KC
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2005, 63 (01) : 37 - 76
  • [37] Concurrent DSMC method using dynamic domain decomposition
    Wu, JS
    Tseng, KC
    RAREFIED GAS DYNAMICS, 2003, 663 : 406 - 413
  • [38] Nonconforming domain decomposition method as a preconditoner for the solution of large EM problems
    Sun, Din-Kow
    Lee, Seung-Cheol
    Lee, Jin-Fa
    Cendes, Zoltan
    2007 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM, VOLS 1-12, 2007, : 5417 - +
  • [39] A FETI Domain Decomposition Method Applied to Contact Problems with Large Displacements
    Dept. of Appl. Math., Technical University of Ostrava, 17. listopadu 15, Ostrava-Poruba, CZ-70833, Czech Republic
    不详
    Lect. Notes Comput. Sci. Eng., 2007, (771-778):
  • [40] Large scale applications on parallel computers of a mixed domain decomposition method
    Champaney, L
    Cognard, JY
    Dureisseix, D
    Ladeveze, P
    COMPUTATIONAL MECHANICS, 1997, 19 (04) : 253 - 263