Ordered Front-to-back Any-Hit Traversal in RTX
For computer graphics and ray tracing practitioners, this work addresses a specific traversal ordering problem, but the solutions are incremental adaptations of existing pipeline features.
The paper tackles the problem of ordered front-to-back any-hit traversal in ray tracing, ensuring hits are processed in sorted order without skipping intersections. It proposes and evaluates multiple methods within existing ray tracing constraints.
We look at the problem of Ordered Front-To-Back Any-Hit Traversal (FTB); i.e., a traversal that iterates through successive hits along a ray in a guaranteed front to back-sorted order, and without skip- ping any intersections even if they occur at the same distance. We describe multiple different ways of solving this problem within the constraints of the existing ray tracing pipeline, and evaluate the different realizations.