Robust Iterative Find-Next-Hit Ray Traversal

Wald, Ingo; Amstutz, Jefferson; Benthin, Carsten

Robust Iterative Find-Next-Hit Ray Traversal

Files

025-032.pdf (3.52 MB)

Date

2018

Authors

Wald, Ingo
Amstutz, Jefferson
Benthin, Carsten

Publisher

The Eurographics Association

Abstract

We present two different methods for improving the performance and robustness of ray tracing algorithms that require iterating through multiple successive intersections along the same ray. Our methods do so without ever missing intersections, even in cases of co-planar or numerically close surfaces, and without having to rely on a dedicated all-hit traversal kernel. Furthermore, our evaluation shows that, in many cases, our methods consistently outperform existing all-hit kernels.

        @inproceedings{10.2312:pgv.20181092
,
booktitle = {Eurographics Symposium on Parallel Graphics and Visualization
},
editor = {Hank Childs and Fernando Cucchietti
},
title = {{Robust Iterative Find-Next-Hit Ray Traversal
}},
author = {Wald, Ingo and 
Amstutz, Jefferson and 
Benthin, Carsten
},
year = {2018
},
publisher = {The Eurographics Association
},
ISSN = {1727-348X
},
ISBN = {978-3-03868-054-3
},
DOI = {10.2312/pgv.20181092
}
}