An efficient hierarchicaltraversal algorithm for ray tracing
- 39 Downloads
Ray tracing has been shown to be an excellent technique for rendering realistic images. However, it is important to reduce the lengthy computation time resulting from the brute-force nature of the original ray-tracing algorithms. In this paper, two ideas are proposed to speep up the well-known hierarchical subdivision method. First, a new hierarchy traversal scheme is described to reduce the number of raybounding volume intersection tests for secondary rays. Then, a plane-sweep method is proposed to make fewer intersection checks for eye rays. Experiments and discussions are presented to prove the feasibility of our methods.
Key wordsRay tracing Hierarchical subdivision Plane sweep
Unable to display preview. Download preview PDF.
- Appel A (1968) Some techniques for shading machine renderings of solids. Proc AFIPS Spring Joint Comput Conf 32:37–45Google Scholar
- Arvo J, Kirk D (1988) A survey of ray tracing acceleration techniques. SIGGRAPH Tutorial on Introduction to Ray Tracing. pp 1–46Google Scholar
- Fujimoto A, Tanaka T, Iwata K (1986) ARTS: accelerated raytracing system. IEEE Comput Graph Appl 6(4):16–26Google Scholar
- Glassner AS (1988) Space subdivision for fast ray tracing. IEEE Comput Graph Appl 4(10):15–22Google Scholar
- Haines EA (1987) A proposal for standard graphics environments (displays on displays). IEEE Comput Graph Appl 7(11):3–5Google Scholar
- Kay TL, Kajiya JT (1986) Ray tracing complex scenes. Comput Graph 20(4):269–278Google Scholar
- Rubin SM, Whitted T (1980) A three-dimensional representation for fast rendering of complex scenes. Comput Graph 14(3):110–116Google Scholar
- Scherson ID, Caspary E (1987) Data structure and the time complexity of ray tracing. The Visual Computer 3:201–213Google Scholar