Skip to main content
Log in

An Efficient Algorithm for Ray Tracing

  • Published:
Journal of Intelligent and Robotic Systems Aims and scope Submit manuscript

Abstract

This paper presents a new algorithm that performs more efficient ray tracing compared to existing algorithms. This algorithm is based on the “divide-and-conquer” technique well known from the area of lists sorting, and speeds up the intersections and light-visibility tests for the first hit. A new definition of transitive-between-relations (TBR) is introduced. A simple shooting ray guide is embedded into a conventional ray tracer to reduce the number of intersection tests and thus speed-up the first hit calculation and the associated light conditions tests. The algorithm was tested in environments made up of convex polygons (random triangles, linearly positioned pyramids) but it can be used in environments with other primitives.

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

  1. Amantides, J.: Ray tracing with cones, Comput. Graph. 18(3) (1984), 129–135.

    Google Scholar 

  2. Barth, W. and Sturzlinger, W.: Efficient ray tracing for bezier and b-spline surfaces, Comput. Graph. 17(4) (1993), 423–430.

    Google Scholar 

  3. Clark, J. H.: Hierarchical geometric models for visible surface algorithms, Comm. ACM 19(10) (1976), 547–554.

    Google Scholar 

  4. Doctor, L. J. and Toborg, J. G.: Display techniques for octree encoded objects, IEEE Comput. Graph. Appl. 1(3) (1981), 29–38.

    Google Scholar 

  5. Fuchs, H., Kedem, Z. M., and Naylor, B. F.: On visible surface generation by a priori tree structures, in: '80, 1980, pp. 124–133.

  6. Fujimoto, A., Tanaka, T., and Iwata, K.: ARTS: Accelerated ray tracing system, IEEE Comput. Graph. Appl. 6(4) (1986), 16–26.

    Google Scholar 

  7. Glassner, S. A.: Space subdivision for fast ray tracing, IEEE Comput. Graph. Appl. 4(10) (1984), 15–22.

    Google Scholar 

  8. Heckbert, P. S. and Hanrahn, P.: Beam tracing polygonal object, Comput. Graph. 18(3) (1984), 119–127.

    Google Scholar 

  9. Kaplan, M. R.: Space tracing, a constant time ray tracer, in: '85, 1985.

  10. Kay, T. L. and Kajiya, J. T.: Ray tracing complex scenes, Comput. Graph. 20(4) (1986), 269–278.

    Google Scholar 

  11. Knuth, D. E.: Algorithms, SAM editions, 1974.

  12. Rubin, S. M. and Whited, T.: A three-dimensional representation for fast rendering of complex schemes, Comput. Graph. 14 (1980), 110–116.

    Google Scholar 

  13. Tanaka, T. and Iwata, K.: ARTS: Accelerated ray-tracing system, IEEE Comput. Graph. Appl. 6(4) (1986), 16–26.

    Google Scholar 

  14. Weghorst, H., Hooper, G., and Greenberg, D. P.: Improved computational methods for ray tracing, ACM Trans. Graphics 11(2) (1984), 214–222.

    Google Scholar 

  15. Whitted, J. T.: An improved illumination model for shaded display, Comm. ACM 23(6) (1980), 342–349.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pantazopoulos, J.S., Tzafestas, S.G. An Efficient Algorithm for Ray Tracing. Journal of Intelligent and Robotic Systems 28, 171–180 (2000). https://doi.org/10.1023/A:1008105317571

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008105317571

Navigation