Name
Abstract | ||
|---|---|---|
Reduced precision bounding volume hierarchies and ray traversal can significantly improve the efficiency of ray tracing through low-cost dedicated hardware. A key approach to enabling reduced precision computations during traversal is to translate the ray origin closer to the bounding volume hierarchy node after each traversal step. However, this approach precludes sharing of intersection computations between a parent node and its two children, which is an important optimization. In this paper, we introduce a novel traversal algorithm that addresses this limitation and achieves a significant reduction in the computational complexity of traversal compared to previous approaches. We also include an analysis that shows how our algorithm guarantees watertight intersections which is a key requirement for robust image quality, especially with reduced precision traversal where numerical errors can be large. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.2312/hpg.20161190 | High Performance Graphics |
Field | DocType | ISBN |
Bounding volume hierarchy,Bounding volume,Tree traversal,Computer science,Ray tracing (graphics),Parallel computing,Image quality,Algorithm,Computational complexity theory,Computation | Conference | 978-3-03868-008-6 |
Citations | PageRank | References |
4 | 0.39 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karthikeyan Vaidyanathan | 1 | 9 | 0.79 |
| Tomas Akenine-Möller | 2 | 972 | 67.60 |
| Marco Salvi | 3 | 98 | 6.80 |