E-mail

E-mail a Wiley Online Library Link

Attila T. Áfra and László Szirmay-Kalos Stackless Multi-BVH Traversal for CPU, MIC and GPU Ray Tracing Computer Graphics Forum 33

Version of Record online: 20 NOV 2013 | DOI: 10.1111/cgf.12259

Thumbnail image of graphical abstract

Stackless traversal algorithms for ray tracing acceleration structures require significantly less storage per ray than ordinary stack-based ones. This advantage is important for massively parallel rendering methods, where there are many rays in flight. On SIMD architectures, a commonly used acceleration structure is the multi bounding volume hierarchy (MBVH), which has multiple bounding boxes per node for improved parallelism. It scales to branching factors higher than two, for which, however, only stack-based traversal methods have been proposed so far. In this paper, we introduce a novel stackless traversal algorithm for MBVHs with up to 4-way branching.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field

SEARCH