Parallel Construction of Bounding Volumes
نویسندگان
چکیده
This paper presents techniques for speeding up commonly used algorithms for bounding volume construction using Intel’s SIMD SSE instructions. A case study is presented, which shows that speed-ups between 7–9 can be reached in the computation of k-DOPs. For the computation of tight fitting spheres, a speed-up factor of approximately 4 is obtained. In addition, it is shown how multi-core CPUs can be used to speed up the algorithms further.
منابع مشابه
gProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کاملBounding Volume Construction using Point Clouds
Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray tracing and collision detection. This paper presents a new method to calculate tight bounding volumes for ...
متن کاملIntersecting general parametric surfaces using bounding volumes
This paper describes a robust algorithm for computing all parts of the intersection curve of two general parametric surfaces. The algorithm follows a divide-and-conquer approach. Surfaces (and parts of them) are enclosed by tight parallel epipeds and axis aligned bounding boxes. If two bounding volumes intersect, one surface is split into two patches. This step is repeated recur-sively for both...
متن کاملMassively Parallel Batch Neural Gas for Bounding Volume Hierarchy Construction
Ordinary bounding volume hierarchy (BVH) construction algorithms create BVHs that approximate the boundary of the objects. In this paper, we present a BVH construction that instead approximates the volume of the objects with successively finer levels. It is based on Batch Neural Gas (BNG), a clustering algorithm that is known from machine learning. Additionally, we present a novel massively par...
متن کاملEasy Realignment of k-DOP Bounding Volumes
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is equally efficient for rigid motions as for arbitrary point motions (deformations). We propose a new efficient realignment algorithm, which produces tighter results compared to all known algorithms. It can be implemented ...
متن کامل