We present a new acceleration structure for ray tracing called the Split Grid. Combining concepts of hierarchical grids, kd-trees and Bounding Volume Hierarchies (BVHs), our approach is based on the idea of nesting 1D-grids. Our proposed acceleration structure is compact in storage, adaptive to the scene geometry and can be traversed using a fast and efficient traversal scheme. We show that the...

We present an approach for approximate collision handling which uses probabilistic information for improving the calculated collision response between objects in real-time physically based animation. The system uses an interruptible collision detection mechanism, which checks for intersections between successive levels of a bounding volume hierarchy (BVH). Traditionally, when the collision dete...

Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.

In this paper we present a new method for improving the performance of the widely used Bounding Volume Hierarchies for collision detection. The major contribution of our work is a culling algorithm that serves as a generalization of the Separating Axis Theorem for non parallel axes, based on the well-known concept of support planes. We also provide a rigorous definition of support plane mapping...

Raytracing is a method to produce photo-realistic pictures. For each pixel of an image one ray is shot to nd the object, which determines the color of the pixel. Rays are also used to simulate shadows and reeections. Previously bounding volume hierarchies have been used to speed raytracing. A new method to speed the traversal of a bounding volume hierarchy is presented. Optimisation methods to ...

We propose a new method for incremental construction of Bounding Volume Hierarchies (BVH). Despite the wide belief that the incremental construction of BVH is inefficient we show that our method incrementally constructs a BVH with quality comparable to the best SAH builders. We illustrate the versatility of the proposed method using a flexible parallelization scheme that opens new possibilities...

We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-trees and box-trees.

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 ...

Ray tracing is a computationally intensive process, several tree data structures and heuristics have been developed to optimize it. This paper presents a new heuristic in the area, based on collapsing some nodes in order to achieve a smaller expected number of node-tests. Two ways of using this heuristic in Bounding Volume Hierarchies are presented as well as the cost-model used to drive the he...