A data-driven approach for real-time clothes simulation

被引:20
作者
Cordier, F [1 ]
Magnenat-Thalmann, N
机构
[1] Korea Adv Inst Sci & Technol, Dept Comp Sci, Taejon 305701, South Korea
[2] Univ Geneva, MIRALab, CH-1211 Geneva, Switzerland
关键词
cloth simulation; collision detection; cloth wrinkles; data-driven approach; geometric deformation; linear interpolation;
D O I
10.1111/j.1467-8659.2005.00841.x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A data-driven approach for the real-time processing of clothes, particularly suitable for simulating dresses worn by virtual characters, is proposed. It starts, prior to real-time simulation, by analyzing cloth behavior in relation to the underlying skeleton movement from a presimulated sequence of the cloth obtained using any high-quality off-line simulators. The idea is to use this analysis to find an optimal combination of physics-based simulation and geometric approximation of the simulator; potentially colliding regions are defined on the cloth such that they will hold true for the skeleton movement that closely matches that of presimulated sequence. At runtime, using these analyses, our simulation process provides both visually pleasing results and performance, as long as the motion of the character remains sufficiently close to the original sequence used for the precomputation. The key contributions of this paper are (1) efficient collision handling that prunes out potentially colliding objects by using the off-line simulation sequence as examples; (2) data-driven fix-up process for the coarse mesh simulation that deduces the gross behavior of the cloth; and (3) geometric approximation of the fine mesh deformation, responsible for details in the shape of the cloth such as wrinkles.
引用
收藏
页码:173 / 183
页数:11
相关论文
共 22 条
  • [1] Alexa M, 2002, ACM T GRAPHIC, V21, P380, DOI 10.1145/566570.566592
  • [2] Untangling cloth
    Baraff, D
    Witkin, A
    Kass, M
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03): : 862 - 870
  • [3] Baraff D., 1998, Computer Graphics. Proceedings. SIGGRAPH 98 Conference Proceedings, P43, DOI 10.1145/280814.280821
  • [4] The Quickhull algorithm for convex hulls
    Barber, CB
    Dobkin, DP
    Huhdanpaa, H
    [J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04): : 469 - 483
  • [5] Bridson R, 2002, ACM T GRAPHIC, V21, P594, DOI 10.1145/566570.566623
  • [6] Choi KJ, 2002, ACM T GRAPHIC, V21, P604, DOI 10.1145/566570.566624
  • [7] Cordier F, 2002, COMPUT GRAPH FORUM, V21, P327, DOI 10.1111/1467-8659.t01-1-00592
  • [8] Desbrun M, 1999, PROC GRAPH INTERF, P1
  • [9] A FAST PROCEDURE FOR COMPUTING THE DISTANCE BETWEEN COMPLEX OBJECTS IN 3-DIMENSIONAL SPACE
    GILBERT, EG
    JOHNSON, DW
    KEERTHI, SS
    [J]. IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1988, 4 (02): : 193 - 203
  • [10] HADAP S, 1999, IEEE VISUALIZATION 9, P175