A framework for the analysis of error in global illumination algorithms

  • Authors:

  • James Arvo;Kenneth Torrance;Brian Smits

  • Affiliations:

  • Program of Computer Graphics, Cornell University, 580 Engineering and Theory Center Building, Ithaca, New York;Program of Computer Graphics, Cornell University, 580 Engineering and Theory Center Building, Ithaca, New York;Program of Computer Graphics, Cornell University, 580 Engineering and Theory Center Building, Ithaca, New York

  • Venue:
  • SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the boundary data, discretization, and computation. Boundary data consists of surface geometry, reflectance functions, and emission functions, all of which may be perturbed by errors in measurement or simulation, or by simplifications made for computational efficiency. Discretization error is introduced by replacing the continuous radiative transfer equation with a finite-dimensional linear system, usually by means of boundary elements and a corresponding projection method. Finally, computational errors perturb the finite-dimensional linear system through imprecise form factors, inner products, visibility, etc., as well as by halting iterative solvers after a finite number of steps. Using the error taxonomy introduced in the paper we examine existing global illumination algorithms and suggest new avenues of research.