Skip to main content
Log in

An efficient hierarchicaltraversal algorithm for ray tracing

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Appel A (1968) Some techniques for shading machine renderings of solids. Proc AFIPS Spring Joint Comput Conf 32:37–45

    Google Scholar 

  • Arvo J, Kirk D (1988) A survey of ray tracing acceleration techniques. SIGGRAPH Tutorial on Introduction to Ray Tracing. pp 1–46

  • Fujimoto A, Tanaka T, Iwata K (1986) ARTS: accelerated raytracing system. IEEE Comput Graph Appl 6(4):16–26

    Google Scholar 

  • Glassner AS (1988) Space subdivision for fast ray tracing. IEEE Comput Graph Appl 4(10):15–22

    Google Scholar 

  • Glassner AS (1988) Spacetime ray tracing for animation. IEEE Comput Graph Appl 8(2):60–70

    Article  Google Scholar 

  • Haines EA (1987) A proposal for standard graphics environments (displays on displays). IEEE Comput Graph Appl 7(11):3–5

    Google Scholar 

  • Kay TL, Kajiya JT (1986) Ray tracing complex scenes. Comput Graph 20(4):269–278

    Google Scholar 

  • Rubin SM, Whitted T (1980) A three-dimensional representation for fast rendering of complex scenes. Comput Graph 14(3):110–116

    Google Scholar 

  • Scherson ID, Caspary E (1987) Data structure and the time complexity of ray tracing. The Visual Computer 3:201–213

    Google Scholar 

  • Weghorst H, Hooper G, Greenberg DP (1984) Improved computational methods for ray tracing. ACM Trans Graph 3(1):52–69

    Article  Google Scholar 

  • Whitted T (1980) An improved illumination model for shaded display. Commun ACM 23(6):343–349

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ruei-Chuan Chang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ke, HR., Chang, RC. An efficient hierarchicaltraversal algorithm for ray tracing. The Visual Computer 10, 79–87 (1993). https://doi.org/10.1007/BF01901944

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01901944

Key words

Navigation