Wide BVH Traversal with a Short Stack

Vaidyanathan, Karthik; Woop, Sven; Benthin, Carsten

Wide BVH Traversal with a Short Stack

Files

015-019.pdf (1.45 MB)

Date

2019

Authors

Vaidyanathan, Karthik
Woop, Sven
Benthin, Carsten

Publisher

The Eurographics Association

Abstract

Compressed wide bounding volume hierarchies can significantly improve the performance of incoherent ray traversal, through a smaller working set of inner nodes and therefore a higher cache hit rate. While inner nodes in the hierarchy can be compressed, the size of the working set for a full traversal stack remains a significant overhead. In this paper we introduce an algorithm for wide bounding volume hierarchy (BVH) traversal that uses a short stack of just a few entries. This stack can be fully stored in scarce on-chip memory, which is especially important for GPUs and dedicated ray tracing hardware implementations. Our approach in particular generalizes the restart trail algorithm for binary BVHs to BVHs of arbitrary widths. Applying our algorithm to wide BVHs, we demonstrate that the number of traversal steps with just five stack entries is close to that of a full traversal stack. We also propose an extension to efficiently cull leaf nodes when a closer intersection has been found, which reduces ray primitive intersections by up to 14%.

        @inproceedings{10.2312:hpg.20191190
,
booktitle = {High-Performance Graphics - Short Papers
},
editor = {Steinberger, Markus and Foley, Tim
},
title = {{Wide BVH Traversal with a Short Stack
}},
author = {Vaidyanathan, Karthik and 
Woop, Sven and 
Benthin, Carsten
},
year = {2019
},
publisher = {The Eurographics Association
},
ISSN = {2079-8687
},
ISBN = {978-3-03868-092-5
},
DOI = {10.2312/hpg.20191190
}
}