Abstract
An optimized collision detection algorithm based on dynamic bounding volume tree is proposed in this paper. First this algorithm adopts spatial division to exclude objects which cant intersect to define the potential intersection areas. Then use a new dynamic OBB bounding volume tree to test whether the intersection happened between the objects in the same grid. At last, this algorithm improves the traditional overlapping test between the primitives for accurate collision detection to accelerate the detection between objects. Compared to the traditional collision detection algorithm based on OBB bounding volume. This algorithm can effectively improve the real-time of the collision detection without affecting the accuracy of original collision detection.
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.
