A Rapid Clustering Algorithm for Efficient Rendering

We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to bounding volume hierarchies the memory of the acceleration data structure is linear

The Distance Hierarchy (DH) algorithm adopts a Bounding Volume Hierarchical approach and a feature-based method to obtain a simple and fast technique for collision detection..

We compared our algorithm with other recent hardware- based volume rendering algorithms, based on the ray casting paradigm, and on a hybrid version mixing ray casting and

This paper examines the second benefit, large numbers of tightly connected processor nodes, within the context of a parallel ray casting volume rendering algorithm implemented on

Standard AABBs used in BVHs usually encode the following information in 32 byte structures: minimal and maximal bounds, reference to the child nodes, is it a leaf or inner node,

To solve this, we have developed a three step algorithm to opti- mize the texture that (see Figure 2): i) packs the 2D patches yielded by our unwrapping method so that the bounding

Based on the sphere packing, we create an inner bounding volume hierarchy where the inner spheres are the leaves.. In order to construct our hierarchy we use a top-down

Memory efficient: With our index-based hash function and a novel group traversal algorithm, a small size buffer shows a high utilization efficiency (Fig.. As a result, we can achieve