论文信息 - Data structures and the time complexity of ray tracing

Data structures and the time complexity of ray tracing

The time complexity of ray tracing is a function of the data structures used for space division. Octree and hierarchical extents have been suggested as effective choices. In this paper, complexity parameters are suggested to characterize images and show that both octrees and hierarchies are appropriate choices if given most favorable images. Also, a unified technique is proposed and shown to be better than previous methods for all images. Octrees and hierarchies are particular cases of the new proposed algorithm.

Isaac D. Scherson | Elisha Caspary

[1] James T. Kajiya,et al. Ray tracing complex scenes , 1986, SIGGRAPH.

[2] Turner Whitted,et al. A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[3] Andrew S. Glassner,et al. Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[4] Michael R. Kaplan,et al. The Use of Spatial Coherence in Ray Tracing , 1987 .

[5] R. Nagel,et al. 3-D Visual simulation , 1971 .

[6] Takayuki Tanaka,et al. ARTS: Accelerated Ray-Tracing System , 1986, IEEE Computer Graphics and Applications.

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

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

[9] Mark A. Z. Dippé,et al. An adaptive subdivision algorithm and parallel architecture for realistic image synthesis , 1984, SIGGRAPH.

[10] Donald P. Greenberg,et al. Improved Computational Methods for Ray Tracing , 1984, TOGS.

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