Fast Collision Detection Algorithm based on parallel ant
In order to improve the real-time,precision and interactivity of collision detection,based on detailed study of intelligent optimization algorithm technology,we propose a parallel ant colony optimization algorithm,which is introduced into improved random collision detection algorithm,in preliminary testing phase we use balancing bounding box tree first to rule out disjoint objects quickly,use parallel thoughtl to accelerate the speed of collision detection,regard the basic unit and leaves of object as ants,and then traverse the search.Compare to traditional serial and parallel collision detection algorithm and partial parallel collision detection algorithm,especially for large-scale optimization problems,in the premise does not affect the accuracy and interactivity,the algorithm accelerate the collision detection efficiency further and reduce the time complexity.
Collision detection ant colony optimization algorithm parallel balanced bounding box tree
Qu Huiyan Zhao Wei
School of Information Technology Jilin Agricultural University,JLAU Changchun,China
国际会议
西安
英文
261-264
2013-09-14（万方平台首次上网日期，不代表论文的发表时间）