Abstract
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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
