A DDA Octree Traversal Algorithm for Ray Tracing
Abstract
A spatial traversal algorithm for ray tracing that combines the memory efficiency of an octree and the traversal speed of a uniform voxel space is described. A new octree representation is proposed and an implementation of the algorithm based on that representation is presented. Performance of the implementation and other spatial structure traversal algorithms are examined.
BibTeX
@inproceedings {10.2312:egtp.19911005,
booktitle = {EG 1991-Technical Papers},
editor = {},
title = {{A DDA Octree Traversal Algorithm for Ray Tracing}},
author = {Sung, Kelvin},
year = {1991},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egtp.19911005}
}
booktitle = {EG 1991-Technical Papers},
editor = {},
title = {{A DDA Octree Traversal Algorithm for Ray Tracing}},
author = {Sung, Kelvin},
year = {1991},
publisher = {Eurographics Association},
ISSN = {1017-4656},
DOI = {10.2312/egtp.19911005}
}