Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays

Abstract

Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths that are very incoherent by construction. We therefore investigate the use of SIMD instructions to accelerate incoherent rays. SIMD is used in the hierarchy construction, the tree traversal and the leaf intersection. This is achieved by increasing the arity of acceleration structures, which also reduces memory requirements. We show that the resulting hierarchies can be built quickly and are smaller than acceleration structures known so far while at the same time outperforming them for incoherent rays. Our new acceleration structure speeds up ray tracing by a factor of 1.6 to 2.0 compared to a highly optimized bounding interval hierarchy implementation, and 1.3 to 1.6 compared to an efficient kd-tree. At the same time, the memory requirements are reduced by 10–50%. Additionally we show how a caching mechanism in conjunction with this memory efficient hierarchy can be used to speed up shadow rays in a global illumination algorithm without increasing the memory footprint. This optimization decreased the number of traversal steps up to 50%.

DOI: 10.1111/j.1467-8659.2008.01261.x

Extracted Key Phrases

11 Figures and Tables

010202008200920102011201220132014201520162017
Citations per Year

93 Citations

Semantic Scholar estimates that this publication has 93 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Dammertz2008ShallowBV, title={Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays}, author={Holger Dammertz and Johannes Hanika and Alexander Keller}, journal={Comput. Graph. Forum}, year={2008}, volume={27}, pages={1225-1233} }