Data structures and the time complexity of ray tracing
- 134 Downloads
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.
Key wordsComputer graphics Ray tracing Data structures
Unable to display preview. Download preview PDF.
- Appel A (1968) Some techniques for shading machine rendering of solids. Proc AFIS, Spring Joint Computer Conference 32:37–45Google Scholar
- Cook RI, Porter T, Carpenter L (1984) Distributed ray tracing. Comput Graph 18(3):137–145Google Scholar
- Dippe M, Swensen J (1984) An adaptive subdivision algorithm and parallel architecture for realistic image synthesis. Comput Graph 18(3):149–158Google Scholar
- Fujimoto A, Takayuki T, Iwata K (1986) ARTS: accelerated ray-tracing system. IEEE Comput Graph Appl 6(4):16–26Google Scholar
- Glassner AS (1984) Space subdivision for fast ray tracing. IEEE Comput Graph Appl 4(10):15–22Google Scholar
- Goldstein RA, Nagel R (1971) 3-D visual simulation. Simulation 16(1):25–31Google Scholar
- Kaplan MR (1985) The uses of spatial coherence in ray tracing. ACM SIGGRAPH 85 Course Notes 11:22–26Google Scholar
- Kay TL, Kajiya JT (1986) Ray tracing complex scenes. Computer Graphics 20(4):269–278Google Scholar
- Rubin SM, Whitted T (1980) A 3-dimensional representation for fast rendering of complex Scenes. Comput Graph 14(3):110–116Google Scholar