A DDA Octree Traversal Algorithm for Ray Tracing

dc.contributor.author	Sung, Kelvin	en_US
dc.date.accessioned	2015-10-05T07:56:47Z
dc.date.available	2015-10-05T07:56:47Z
dc.date.issued	1991	en_US
dc.identifier.issn	1017-4656	en_US
dc.identifier.uri	http://dx.doi.org/10.2312/egtp.19911005	en_US
dc.description.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.	en_US
dc.publisher	Eurographics Association	en_US
dc.title	A DDA Octree Traversal Algorithm for Ray Tracing	en_US
dc.description.seriesinformation	EG 1991-Technical Papers	en_US
dc.identifier.doi	10.2312/egtp.19911005	en_US