修改 Apetrei 的包围体层次结构构建算法以实现无栈遍历
Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
AI总结：
本文提出一种修改 Apetrei 算法的方法，通过恢复 Karras 的内部节点顺序，在单次自底向上遍历中构建适合无栈遍历的层次结构，从而以更低成本加速范围查询。
摘要：
无栈遍历是一种通过在树遍历过程中避免使用栈来加速范围查询的技术。实现该技术的一种方法是将给定的二叉树转换为存储左子节点和跳跃连接（也称为逃逸索引）的形式。通常，此操作在树构建过程中需要额外的树遍历。然而，对于某些树结构，可以以更低的成本实现相同的结果。我们针对 Karras 在 [Karras, 2012] 中提出的 GPU 层次结构构建算法提出了一种此类算法。此外，我们展示了我们的算法同样适用于 Apetrei 在 [Apetrei, 2014] 中提出的改进算法，尽管其内部节点的顺序不同。我们通过修改 Apetrei 的算法以恢复 Karras 原始的内部节点顺序来实现这一点。使用修改后的算法，我们展示了如何在单次自底向上的遍历中构建适合无栈遍历的层次结构。
英文摘要：
Stackless traversal is a technique to speed up range queries by avoiding usage of a stack during the tree traversal. One way to achieve that is to transform a given binary tree to store a left child and a skip-connection (also called an escape index). In general, this operation requires an additional tree traversal during the tree construction. For some tree structures, however, it is possible achieve the same result at a reduced cost. We propose one such algorithm for a GPU hierarchy construction algorithm proposed by Karras in [Karras, 2012]. Furthermore, we show that our algorithm also works with the improved algorithm proposed by Apetrei in [Apetrei, 2014], despite a different ordering of the internal nodes. We achieve that by modifying the Apetrei's algorithm to restore the original Karras' ordering of the internal nodes. Using the modified algorithm, we show how to construct a hierarchy suitable for a stackless traversal in a single bottom-up pass.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
