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 boxtree 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 boxtree is more efficient and scalable than the classic algorithm.
منابع مشابه
An Improved Bounding Box Algorithm to Collision Detection for Virtual Environment
The paper proposed a parallel collision detection algorithm based on bounding box-tree. The hierarchical bounding box –tree was built by dividing the polyhedron into tetrahedron. The collision detection can be completed by the method searching the bounding box-tree from top to bottom or from bottom to top. The first top-down search algorithm can give accurate calculation of collision detection,...
متن کاملA Parallel Collision Detection Algorithm Based on Hybrid Bounding Volume Hierarchy
* Supported by National Natural Science Foundation of China and Excellent Young Teacher Foundation of Education Ministry of China. Abstract One of the key problems with current interactive virtual environments is real-time collision detection. In this paper, a parallel algorithm for realtime, exact collision detection is presented. The approach adopts a hierarchical adaptive space subdivision s...
متن کاملImprovements to Ellipsoidal Fit Based Col- lision Detection
In the collision detection literature, use of ellipsoidal fits has been successfully made to accelerate the detection beyond polyhedron based methods [12], [4]. In this paper, we propose some improvements to the state-of-the-art work of this methodology [4]. These improvements are made in the following three respects that are crucial to the overall performance of a collision detector. First, ob...
متن کاملEvaluation of Collision Detection Methods for Virtual Reality Fly-throughs
We consider the problem of preprocessing a scene of polyhedral models in order to perform collision detection very eeciently for an object that moves amongst obstacles. This problem is of central importance in virtual reality applications, where it is necessary to check for collisions at real-time rates. We give an algorithm for collision detection that is based on the use of a mesh (tetrahedra...
متن کاملA Collision Detection Algorithm for Polygonal Models that uses Sequential and Parallel Techniques for Improving Per- formance
This paper presents an efficient collision detection algorithm for polygonal models. It is based on the Overlapping Axis-Aligned Bounding Box (OAABB) and R-tree structures to gain sequential improvements. It also takes advantages of multiple processors platforms.
متن کامل