Journal
ACM TRANSACTIONS ON GRAPHICS
Volume 24, Issue 3, Pages 991-999Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/1073204.1073301
Keywords
deformable collision detection; self-collision; graph coloring; cloth simulation
Categories
Ask authors/readers for more resources
We present a novel algorithm for accurately detecting all contacts, including self-collisions, between deformable models. We precompute a chromatic decomposition of a mesh into non-adjacent primitives using graph coloring algorithms. The chromatic decomposition enables us to check for collisions between non-adjacent primitives using a linear-time culling algorithm. As a result, we achieve higher culling efficiency and significantly reduce the number of false positives. We use our algorithm to check for collisions among complex deformable models consisting of tens of thousands of triangles for cloth modeling and medical simulation. Our algorithm accurately computes all contacts at interactive rates. We observed up to an order of magnitude speedup over prior methods.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available