Issue No. 01 - Jan. (2014 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2013.98
Loeiz Glondu , IRISA, Inria, Rennes, France
Sara C. Schvartzman , Univ. Rey Juan Carlos, Mostoles, Spain
Maud Marchal , IRISA, Inria, Rennes, France
Georges Dumont , IRISA, Inria, Rennes, France
Miguel A. Otaduy , Univ. Rey Juan Carlos, Mostoles, Spain
In complex scenes with many objects, collision detection plays a key role in the simulation performance. This is particularly true in fracture simulation for two main reasons. One is that fracture fragments tend to exhibit very intensive contact, and the other is that collision detection data structures for new fragments need to be computed on the fly. In this paper, we present novel collision detection algorithms and data structures for real-time simulation of fracturing rigid bodies. We build on a combination of well-known efficient data structures, namely, distance fields and sphere trees, making our algorithm easy to integrate on existing simulation engines. We propose novel methods to construct these data structures, such that they can be efficiently updated upon fracture events and integrated in a simple yet effective self-adapting contact selection algorithm. Altogether, we drastically reduce the cost of both collision detection and collision response. We have evaluated our global solution for collision detection on challenging scenarios, achieving high frame rates suited for hard real-time applications such as video games or haptics. Our solution opens promising perspectives for complex fracture simulations involving many dynamically created rigid objects.
Computational modeling, Data structures, Surface cracks, Approximation methods, Detection algorithms, Data models, Approximation algorithms
L. Glondu, S. C. Schvartzman, M. Marchal, G. Dumont and M. A. Otaduy, "Fast Collision Detection for Fracturing Rigid Bodies," in IEEE Transactions on Visualization & Computer Graphics, vol. 20, no. 1, pp. 30-41, 2013.