.png){kind=icon}
Return
Interactive collision detection between deformable models using chromatic decomposition
.png){kind=icon}
PRE
AI
DOI：10.1145/1073204.1073301.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
deformable collision detection
self-collision
graph coloring
cloth simulation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.5
Papers:
4.7K
Citations:
3.6W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveForeign Aid and Soft Power: Great Power Competition in Africa in the Early Twenty-first Century
PREAI
ShareSaveShareSaveEffects of Unsteady Wakes on Flow Through High Pressure Turbine Passages With and Without Tip Gaps
PREAI
ShareSave
View more