Research on Parallel Collision Detection Algorithm for polyhedron Models

摘要：

Collision detection among complex polyhedron models is an open question because of its algorithmic complexity. To satisfy the real-time collision detection requirement of polyhedrons, we presented a parallel algorithm to perform collision detection for polyhedrons models. The algorithm decomposes nonconvex polyhedron into tetrahedrons, then detect thetetrahedrons in parallel, and box tree of the polyhedron is built to improve the efficiency of the parallel algorithm. We detailed described the parallel algorithm based on box-tree, and give the experiment data. reseach result shows that the parallel method based on box tree is more efficient and scalable than the classic algorithm.

关键词： collision detection polyhedron tetrahedron parallel decompose box-tree

作者: Xiong Yumei Chen Yinming

作者单位: School of Computer Engineering and Science, Shanghai University, Shanghai, China Electronic & Inform School of Computer Engineering and Science, Shanghai University, Shanghai, China

会议类型: 国际会议

会议名称: 2009 International Workshop on Information Security and Application(2009 信息安全与应用国际研讨会)

会议地点: 青岛

会议语种:英文

页码: 228-232

在线出版日期: 2009-11-21（万方平台首次上网日期，不代表论文的发表时间）