This Is Now 66x Faster

Quick Overview

The presented high-performance CPU cloth simulation technique achieves significant speedups over previous methods, such as running 66x faster than C-IPC (CPU) and 2.6x faster than PD-BFGS (GPU) in one complex scenario, by employing domain decomposition and solving only the interactions between adjacent, smaller domains rather than the entire global system simultaneously.

Key Points: The proposed high-performance CPU cloth simulation achieves a 66x speedup versus C-IPC (CPU) and a 2.6x speedup versus PD-BFGS (GPU) for a complex 'Hip-hop' simulation with 444K Degrees of Freedom (DOFs). The method uses domain decomposition, illustrated by the 'Dressed Armadillo' example (150K DOFs, 204ms/frame), to solve local interactions rather than the entire global system. In a 'Folding' test, the technique maintains realism and handles complex self-collisions and stacking behavior, taking 557ms per frame. A comparison against PD-Coulomb (CPU) showed an 11x speedup for a complex cloth-on-figure interaction, where the new method only solves interactions for the few critical pieces touching, unlike the previous method which solves all pieces. The technique also successfully handles complex phenomena like the 'Precision Bridge Shuffle' and 'Twisting Test' which caused previous methods to require excessive iterations or fail. The performance advantage is demonstrated by solving a 6 million DOF curtain simulation in 6.6 seconds, which would take previous methods an 'eternity' or require 10,000 ants to solve in a comparable time.

Context: This presentation showcases a novel CPU-based cloth simulation framework that leverages domain-decomposed projective dynamics to achieve high performance comparable to or exceeding GPU-based methods. The key innovation involves partitioning complex simulations (like cloth draped on dynamic characters or folding objects) into smaller, interacting domains, allowing for parallelized, localized constraint solving, which drastically reduces computational overhead compared to traditional global solvers.

Raw markdown version of this recap