Collision Detection of High Density Point Set Based on Convex Hull

This paper presents a collision detection algorithm of high density point set based on convex hull. According to the characteristics of the point set tightness, a fast speed convex full algorithm is designed. If extremums can´t define un-collision, convex hull of the await collision detection point set and intersection of the convex hulls are calculated. If they disjoint, the two point sets donpsilat collide; if they intersect, we search for the collision point set in the intersection set region of the two convex hulls. The algorithm is simple, high-efficiency and reliable. It has the certain application value for education, defense and art.