Answers are grounded in this paper and cite their sources.
An algorithm is described that speeds up ray-tracing techniques by reducing the number of time-consuming object-ray intersection calculations that have to be made. The algorithm is based on subdividing space into an octree, associating a given voxel with only those objects whose surfaces pass through the volume of the voxel. It includes a technique for obtaining fast access to any node and a mechanism for finding the next node intersected by a ray when it has hit nothing in the current node. This new algorithm makes possible the ray tracing of complex scenes by medium-scale and small-scale computers.
No takes yet. Share an insight, caveat, or question.
Andrew Glassner (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: