论文信息 - Space subdivision for fast ray tracing

Space subdivision for fast ray tracing

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.

Andrew S. Glassner | A. Glassner

[1] Robert L. Cook,et al. Distributed ray tracing , 1984, SIGGRAPH.

[2] Arthur Appel,et al. Some techniques for shading machine renderings of solids , 1968, AFIPS Spring Joint Computing Conference.

[3] James T. Kajiya,et al. New Techniques for Ray Tracing Procedurally Defined Objects , 1983, TOGS.

[4] R. Fuller,et al. Synergetics: Explorations in the Geometry of Thinking , 1975 .

[5] James T. Kajiya,et al. Ray tracing parametric patches , 1982, SIGGRAPH.

[6] Scott D. Roth,et al. Ray casting for modeling solids , 1982, Comput. Graph. Image Process..

[7] Irene Gargantini,et al. Linear octtrees for fast processing of three-dimensional objects , 1982, Comput. Graph. Image Process..

[8] Pat Hanrahan,et al. Ray tracing algebraic surfaces , 1983, SIGGRAPH.

[9] Michael Karl Ullner. Parallel machines for computer graphics , 1983 .

[10] Turner Whitted,et al. An improved illumination model for shaded display , 1979, CACM.

[11] W. Jack Bouknight,et al. An algorithm for producing half-tone computer graphics presentations with shadows and movable light sources , 1899, AFIPS '70 (Spring).