Robust Iterative Find-Next-Hit Ray Traversal

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.