Evaluation of continuous collision detection accelerated with tetrahedral structures

Continuous collision detection provides very good information about the interaction between objects. In this paper, we present a new method for computing the continuous collision detection between a static and a moving triangle mesh. We target our method on open triangle meshes, and focus on their small movements. To accelerate the computation, we divide the space inside and around the meshes into tetrahedra. The main idea of our method is to maintain the list of tetrahedra, in which the individual primitives of the meshes are located, to compute collisions only in these tetrahedra, and to update the list as the primitives move. We measure the performance of our algorithm and discuss its advantages and limitations. We also compare our algorithm with other solutions.