In this paper, a parallel collision detection algorithm is presented.
提出了一种基于并行的快速碰撞检测算法。
The algorithm builds BoxTreees of arbitrary non convex polyhedra using a hierarchical adaptive space subdivision scheme, and speeds up collision detection by traversing the BoxTrees in parallel.
该算法面向动态复杂场景采用层次的自适应空间剖分方法建构物体的平衡包围盒树，然后通过并行遍历包围盒树来加速碰撞检测。
The algorithm builds BoxTreees of arbitrary non convex polyhedra using a hierarchical adaptive space subdivision scheme, and speeds up collision detection by traversing the BoxTrees in parallel.
该算法面向动态复杂场景采用层次的自适应空间剖分方法建构物体的平衡包围盒树，然后通过并行遍历包围盒树来加速碰撞检测。
应用推荐