Skip to main content

Dynamic ray stream traversal

19Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.
Get full text

Abstract

While each new generation of processors gets larger caches and more compute power, external memory bandwidth capabilities increase at a much lower pace. Additionally, processors are equipped with wide vector units that require low instruction level divergence to be efficiently utilized. In order to exploit these trends for ray tracing, we present an alternative to traditional depth-first ray traversal that takes advantage of the available cache hierarchy, and provides high SIMD efficiency, while keeping memory bus traffic low. Our main contribution is an efficient algorithm for traversing large packets of rays against a bounding volume hierarchy in a way that groups coherent rays during traversal. In contrast to previous large packet traversal methods, our algorithm allows for individual traversal order for each ray, which is essential for efficient ray tracing. Ray tracing algorithms is a mature research field in computer graphics, and despite this, our new technique increases traversal performance by 36-53%, and is applicable to most ray tracers. Copyright © ACM.

Author supplied keywords

Cite

CITATION STYLE

APA

Barringer, R., & Akenine-Möller, T. (2014). Dynamic ray stream traversal. In ACM Transactions on Graphics (Vol. 33). Association for Computing Machinery. https://doi.org/10.1145/2601097.2601222

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free