Affiliation:
1. Adobe & Stanford University
2. Adobe
3. Adobe & University of Toronto, Canada
4. Stanford University
Abstract
The trade-off between speed and fidelity in cloth simulation is a fundamental computational problem in computer graphics and computational design. Coarse cloth models provide the interactive performance required by designers, but they can not be simulated at higher resolutions ("up-resed") without introducing simulation artifacts and/or unpredicted outcomes, such as different folds, wrinkles and drapes. But how can a coarse simulation predict the result of an unconstrained, high-resolution simulation that has not yet been run?
We propose Progressive Cloth Simulation (PCS), a new forward simulation method for efficient
preview
of cloth quasistatics on exceedingly coarse triangle meshes with consistent and progressive improvement over a hierarchy of increasingly higher-resolution models. PCS provides an efficient coarse previewing simulation method that predicts the coarse-scale folds and wrinkles that will be generated by a corresponding converged, high-fidelity C-IPC simulation of the cloth drape's equilibrium. For each preview PCS can generate an increasing-resolution sequence of
consistent
models that progress towards this converged solution. This successive improvement can then be interrupted at any point, for example, whenever design parameters are updated. PCS then ensures feasibility at all resolutions, so that predicted solutions remain intersection-free and capture the complex folding and buckling behaviors of frictionally contacting cloth.
Funder
Sloan Fellowship
Canada Research Chairs Program
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference75 articles.
1. Artist-directed dynamics for 2D animation
2. Large steps in cloth simulation
3. Fast and stable cloth simulation based on multi-resolution shape matching
4. TRACKS
5. Matthias Bollhöfer , Olaf Schenk , Radim Janalik , Steve Hamm , and Kiran Gullapalli . 2020. State-of-the-art sparse direct solvers . In Parallel Algorithms in Computational Science and Engineering . Springer , 3--33. Matthias Bollhöfer, Olaf Schenk, Radim Janalik, Steve Hamm, and Kiran Gullapalli. 2020. State-of-the-art sparse direct solvers. In Parallel Algorithms in Computational Science and Engineering. Springer, 3--33.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献