Multi-level ray tracing algorithm

DMCA

Multi-level ray tracing algorithm

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Alexander Reshetov , Alexei Soupikov , Jim Hurley

Citations:

163 - 2 self

BibTeX

@MISC{Reshetov_multi-levelray,
    author = {Alexander Reshetov and Alexei Soupikov and Jim Hurley},
    title = {Multi-level ray tracing algorithm},
    year = {}
}

OpenURL

Abstract

We propose new approaches to ray tracing that greatly reduce the required number of operations while strictly preserving the geometrical correctness of the solution. A hierarchical “beam” structure serves as a proxy for a collection of rays. It is tested against a kd-tree representing the overall scene in order to discard from consideration the sub-set of the kd-tree (and hence the scene) that is guaranteed not to intersect with any possible ray inside the beam. This allows for all the rays inside the beam to start traversing the tree from some node deep inside thus eliminating unnecessary operations. The original beam can be further sub-divided, and we can either continue looking for new optimal entry points for the sub-beams, or we can decompose the beam into individual rays. This is a hierarchical process that can be adapted to the geometrical complexity of a particular view direction allowing for efficient geometric anti-aliasing. By amortizing the cost of partially traversing the tree for all the rays in a beam, up to an order of magnitude performance improvement can be achieved enabling interactivity for complex scenes on ordinary desktop machines.

Keyphrases

possible ray efficient geometric anti-aliasing enabling interactivity geometrical correctness new optimal entry point overall scene required number particular view direction hierarchical beam structure ordinary desktop machine new approach magnitude performance improvement hierarchical process complex scene geometrical complexity original beam unnecessary operation individual ray

DMCA