Abstract

Continuous collision detection (CCD) is a process to interpolate the trajectory of polygons and detect collisions between successive time steps. However, this process is time-consuming, especially for a large number of moving polygons. In this paper, we present a parallel CCD algorithm, which aims to accelerate N-body rigid CCD culling by distributing the load across a distributed-memory system. This algorithm is particularly suitable for large-scale distributed simulations. Experimental results, based on a message passing interface implementation, demonstrate that our approach is more computationally efficient than existing sequential CCD approaches.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call