Cost Prediction in Ray Tracing

  • Erik Reinhard
  • Arjan J. F. Kok
  • Prederik W. Jansen
Part of the Eurographics book series (EUROGRAPH)


Although it is generally known that ray tracing is ‘time consuming’, yet rewarding with respect to image quality, there are few attempts to predict the rendering time for a given model in advance. This paper focusses on the development of such a technique.

The cost of ray tracing using adaptive spatial subdivisions has been studied by analysing the probability that a ray intersects an object. Per spatial subdivision cell the surface area relative to the cell size provides a measure for this probability. This cost function is refined by taking into account possible overlap when multiple objects inhabit the same cell. A further refinement is applied by computing the average tree depth of the spatial subdivision and by assuming that each ray will on average traverse the spatial subdivision at this depth. To evaluate and validate our method we applied it to some complex models and compared the results with the actual rendering cost.


Intersection Test Leaf Cell Blocking Factor Spatial Subdivision Octree Cell 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ward, G. J.: ‘The radiance lighting simulation and rendering system’, ACM Computer Graphics pp. 459–472. (1994) SIGGRAPH ’94 Proceedings.Google Scholar
  2. 2.
    Haines, E. A.: Standard procedural database, v3.1. 3D/Eye. (1992)Google Scholar
  3. 3.
    Reinhard, E., Jansen, F. W.: ‘Pyramid clipping’, Ray Tracing News, volume 8, number 2. (1995)Google Scholar
  4. 4.
    Cleary, J. G., Wyvill, G.: ‘Analysis of an algorithm for fast ray tracing using uniform space subdivision’, The Visual Computer (4), 65–83. (1988)CrossRefGoogle Scholar
  5. 5.
    MacDonald, J. D., Booth, K. S.: ‘Heuristics for ray tracing using space subdivision’, The Visual Computer (6), 153–166. (1990)CrossRefGoogle Scholar
  6. 6.
    Whang, K.-Y., Song, J.-W., Chang, J.-W., Kim, J.-Y., Cho, W.-S., Park, C.-M., Song, I.-Y.: ‘Octree-r: An adaptive octree for efficient ray tracing’, IEEE Transactions on Visualization and Computer Graphics 1(4), 343–349.Google Scholar
  7. 7.
    Subramanian, K. R., Fussell, D. S.: ‘Automatic termination criteria for ray tracing hierarchies’, Graphics Interface ’91 pp. 93–100. (1991)Google Scholar

Copyright information

© Springer-Verlag/Wien1996 1996

Authors and Affiliations

  • Erik Reinhard
    • 1
  • Arjan J. F. Kok
    • 2
  • Prederik W. Jansen
    • 1
  1. 1.Faculty of Technical Mathematics and InformaticsDelft University of TechnologyThe Netherlands
  2. 2.TNO/FELThe HagueThe Netherlands

Personalised recommendations