Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Revising Apetrei’s bounding volume hierarchy construction algorithm to allow stackless traversal

Technical Report ·
DOI:https://doi.org/10.2172/2301619· OSTI ID:2301619
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 to 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 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.
Research Organization:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
Sponsoring Organization:
USDOE Office of Science (SC)
DOE Contract Number:
AC05-00OR22725
OSTI ID:
2301619
Report Number(s):
ORNL/TM--2024/3259
Country of Publication:
United States
Language:
English

Similar Records

Restructuring Large Data Hierarchies for Scientific Query Tools
Conference · Mon Feb 07 23:00:00 EST 2005 · OSTI ID:15016779

Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs
Conference · Tue Aug 01 00:00:00 EDT 2023 · OSTI ID:2000431

Out-of-core Interactive Display of Large Meshes Using an Oriented Bounding Box-based Hardware Depth Query
Conference · Thu Jun 24 00:00:00 EDT 2004 · OSTI ID:15014349

Related Subjects