A DDA Octree Traversal Algorithm for Ray Tracing

Simple item page
dc.contributor.authorSung, Kelvinen_US
dc.date.accessioned2015-10-05T07:56:47Z
dc.date.available2015-10-05T07:56:47Z
dc.date.issued1991en_US
dc.description.abstractA 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.description.seriesinformationEG 1991-Technical Papersen_US
dc.identifier.doi10.2312/egtp.19911005en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttps://doi.org/10.2312/egtp.19911005en_US
dc.publisherEurographics Associationen_US
dc.titleA DDA Octree Traversal Algorithm for Ray Tracingen_US
Files
Collections
EG1991 Proceedings (Technical Papers)
EG1991 Proceedings (Technical Papers)