2008 · 72 citations · 27 references
ComputingComputer ScienceHigh-performance ComputingComputational GeometryData StructuresParallel ComputingData ParallelismRay TracingBinary StructureBranching AlgorithmsPrimary RaysRay Traversal Algorithms
While contemporary approaches to SIMD ray tracing typically rely on traversing packets of coherent rays through a binary data structure, we instead evaluate the alternative of traversing individual rays through a bounding volume hierarchy with a branching factor of 16. Though obviously less efficient than high-performance packet techniques for primary rays, we demonstrate that for less coherent secondary ray distributions this approach is at least competitive with (and often faster than) typical packet traversal techniques.
27
Larry Seiler, Doug Carmean, Eric Sprangle et al. · ACM Transactions on Graphics · 2008 · 783 citations
Timothy L. Kay, James T. Kajiya · ACM SIGGRAPH Computer Graphics · 1986 · 463 citations · Full text
Interactive Rendering with Coherent Ray Tracing
Ingo Wald, Philipp Slusallek, Carsten Benthin et al. · Computer Graphics Forum · 2001 · 425 citations