Parallel Collision Detection Algorithms in Complex Scenes

In current research, collision detection technology has become more and more important, and conflict information is also a problem worth exploring. In order to obtain the information in time and make effective judgment, it is necessary to design corresponding algorithms to deal with the conflicts generated in these complex environments. From the perspective of utilizing the parallel computing power of multiprocessors, a parallel fast collision detection algorithm is proposed. Based on the mixed bounding box hierarchy tree, the algorithm traverses the mixed bounding box hierarchy in parallel by adopting the OpenMP parallel model. The experimental results show that the parallelization of OpenMP significantly improves the speed of the collision detection algorithm.