Skip to main content
SpringerLink
Log in

Data structures and the time complexity of ray tracing

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Appel A (1968) Some techniques for shading machine rendering of solids. Proc AFIS, Spring Joint Computer Conference 32:37–45

    Google Scholar 

  • Cook RI, Porter T, Carpenter L (1984) Distributed ray tracing. Comput Graph 18(3):137–145

    Google Scholar 

  • Dippe M, Swensen J (1984) An adaptive subdivision algorithm and parallel architecture for realistic image synthesis. Comput Graph 18(3):149–158

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Goldstein RA, Nagel R (1971) 3-D visual simulation. Simulation 16(1):25–31

    Google Scholar 

  • Kaplan MR (1985) The uses of spatial coherence in ray tracing. ACM SIGGRAPH 85 Course Notes 11:22–26

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Sutherland IE, Sproul RF, Schumacker RA (1974) A characterization of ten hidden surface algorithms. ACM Comput Surv 6(1):1–55

    Article  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

  1. Department of Electrical and Computer Engineering, University of California, 93106, Santa Barbara, CA, USA

    Isaac D. Scherson & Elisha Caspary

Authors
  1. Isaac D. Scherson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elisha Caspary
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scherson, I.D., Caspary, E. Data structures and the time complexity of ray tracing. The Visual Computer 3, 201–213 (1987). https://doi.org/10.1007/BF01952827

Download citation

  • Issue Date:

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

Key words

Search

Navigation