The HERO Algorithm for Ray-Tracing Octrees
An algorithm is presented for rapid traversal of octree data structures, in order to enhance the speed of ray tracing for scenes of high complexity. At each level of the octree, the algorithm generates the addresses of child voxels in the order they are penetrated by the ray. This requires only a few arithmetic operations and simple logical operations. A depth-first search of the tree is used to yield the first terminal voxel hit by the ray, thus hidden objects are not processed. The algorithm is designed specifically for implementation as HERO: A Hardware Enhancer for Ray-tracing Octrees.
KeywordsChild Node Hardware Implementation Parent Node IEEE Computer Graphic Memory Contention
Unable to display preview. Download preview PDF.
- Amanatides, John & Andrew Woo, “A Fast Voxel Traversal Algorithm for Ray Tracing”, Eurographics’ 87, August 1987, pp 3–10.Google Scholar
- Glassner, Andrew S., “Space Subdivision for Fast Ray Tracing”, IEEE Computer Graphics & Applications Vol. 4, no. 10, October 1984, pp 15–22.Google Scholar
- Peng, Qunsheng, Yining Zhu & Youdong Liang, “A Fast Ray Tracing Algorithm Using Space Indexing Techniques”, Eurographics’ 87, August 1987, pp 11–23.Google Scholar