The Research of Collision Detection Algorithm Based on Spatial Subdivision

Interactive environments for dynamically deforming objects play an important role in virtual environment. These environments require fast and efficient collision detection handling techniques. In this paper, we propose a new collision detection algorithm based on spatial subdivision, which can solve the collision detection problems between deformable objects. The object space is uniformly subdivided into a series of voxels, and then determines whether collision detection will happen by constructing binary sort tree. Based on distribution density of objects, an optimal method is proposed to compute the size of voxels in uniform division, compared to other collision detection algorithm through a serial of tests, the results show that the algorithm this paper proposes is superior in performance when massive objects are uniformly distributed; Besides, the performance of algorithm is more stable than other algorithms in consideration of variable correlation among objects.