Home > Table of Contents


Proceedings of 2009 International Workshop on Information Security and Application (IWISA 2009)

Qingdao, China, November 21-22, 2009

Editors: Feng Gao and Xijun Zhu

AP Catalog Number: AP-PROC-CS-09CN004

ISBN: 978-952-5726-06-0

Page(s): 228-232

Research on Parallel Collision Detection Algorithm for Polyhedron Models

Yumei Xiong and Yinming Chen

Full text: PDF


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.

Index Terms

collision detection, polyhedron; tetrahedron; parallel, decompose, box-tree

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved