基于aabb包围盒的碰撞检测算法的研究-计算机软件与理论专业论文.docxVIP

③ ③ 硕士擘位论文 MASTER’S THESIS Abstract Collision detection has been researched m many fields，such as computational geometry,computer graphics and robot motion planning．In recent years，collision detection has been a hot topic with the boom ofvirtual reality and distributed simulation technology．Fast and exact collision detection is very important to improve reality and enhance immersion for virtual environment． Bounding volume hierarchy provides all effective method to resolve the time complexity in collision detection．The idea behind it is to approximate the object with a simpler bounding volume that is a little bigger than the object．In building hierarchies on object，one can obtain increasingly more accurate approximations of the objects．So during traversing bounding volume hierarchy,it speeds up collision detection by prune away primitives pairs，which will not intersect clearly though rapid intersection test between bounding volumes andjust deal with those bounding volume is intersected．The choice of bounding volume is the basic and key problem of this approach．This paper analyzes different bounding volumes and correlative algorithms． Because AABB parallels coordinate,we choose it to approximate the object．Analyzing the collision detection algorithm based on AABB，we found that the speed of algorithm can be affected by three factors：intersection test between bounding volumes，traversing of AABB tree and intersection test between primitives．This paper summarizes the methods about three factors and provides improvement methods from temporal—spacial coherence and memory apace． The implementation speed ofcollision detection algorithm is affected by intersection test between AABB bounding volumes directly．Bounding volume sorting is an effective method to estimate the intersection between AABB．We don’t adopt of insertion sort algorithm but the diminishing increment sort algorithm to sort AABBs’orthogonal projections onto the axes of the coordinate system．Collision is a loc