Improved Computational Methods for Ray Tracing
Hank Weghorst, Gary Hooper, Donald P. Greenberg · ACM Transactions on Graphics · 1984
This paper describes algorithmic procedures that have been implemented to reduce the computational expense of producing ray-traced images.The selection of bounding volumes is examined to reduce the computational cost of the ray-intersection test.The use of object coherence, which relies on a hierarchical description of the environment, is then presented.Finally, since the building of the rayintersection trees is such a large portion of the computation, a method using image coherence is described.This visible-surface preprocessing method, which is dependent upon the creation of an "item buffer," takes advantage of a priori image information.Examples that indicate the efficiency of these techniques for a variety of representative environments are presented.
Cited by 359 works. doi:10.1145/357332.357335 Open-access PDF
Authors
References
- A Characterization of Ten Hidden-Surface Algorithms
- An improved illumination model for shaded display
- The notion of quantitative invisibility and the machine rendering of solids
- Hierarchical geometric models for visible surface algorithms
- 3-D Visual simulation
- A 3-dimensional representation for fast rendering of complex scenes
- A Testbed for Realistic Image Synthesis
- A more flexible image generation environment
- Transparency for computer synthesized images
- New Techniques for Ray Tracing Procedurally Defined Objects