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.

翻译：我们研究有序从前向后任意命中遍历（FTB）问题，即一种沿射线按保证的前后排序顺序遍历连续命中点，且即使交点出现在相同距离处也不跳过任何交点的遍历方法。我们描述了在现有光线追踪管线约束下解决该问题的多种不同方案，并对这些不同实现方式进行了评估。