2005 · 17 citations · 26 references
ComputingComputer Science3D ModelingComputational GeometryGeometric ModelingCollision DetectionContact AnalysisGeometry ProcessingIntersection DetectionMesh ModelingMesh ProcessingCollision ModelingContact Detection AlgorithmsCulling RateDeformable ModelsMedical SimulationMesh Collision DetectionSelf-collision AnalysisSelf-collision Detection
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.
26
Large steps in cloth simulation
David Baraff, Andrew Witkin · 1998 · 1.7K citations · Full text
New methods to color the vertices of a graph
Daniel Brélaz · Communications of the ACM · 1979 · 1.6K citations · Full text
Jonathan D. Cohen, Ming C. Lin, Dinesh Manocha et al. · 1995 · 622 citations · Full text
Subdivision surfaces in character animation
Tony DeRose, Michael Kass, Tien Van Truong · 1998 · 563 citations · Full text
Arts, Design, 3D Modeling +8