Stochastic Iteration for Non-diffuse Global Illumination

László Szirmay-Kalos
Stochastic Iteration for Non-diffuse Global Illumination
TR-186-2-98-21, August 1998 [paper]

Information

Abstract

This paper presents a single-pass, view-dependent method to solve t he rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly in each iteration. The requirements of convergence are given for the general case. To demonstrate the basic idea, a very simple, continuous random transport operator is examined, which gives back the light tracing algorithm incorporating Russian roulette. Then, a new mixed continuous and finite-element based iteration method is proposed, which uses ray-bundles to transfer the radiance in single random direction. The resulting algorithm is fast, it provides initial results in seconds and accurate solutions in minutes and does not suffer from the error accumulation problem and the high memory demand of other finite-element and hierarchical approaches.

Additional Files and Images

Weblinks

No further information available.

BibTeX

@techreport{Szir-1998-Stoch,
  title =      "Stochastic Iteration for Non-diffuse Global Illumination",
  author =     "L\'{a}szl\'{o} Szirmay-Kalos",
  year =       "1998",
  abstract =   "This paper presents a single-pass, view-dependent method to
               solve t he rendering equation, using a stochastic
               iterational scheme where the transport operator is selected
               randomly in each iteration. The requirements of convergence
               are given for the general case. To demonstrate the basic
               idea, a very simple, continuous random transport operator is
               examined, which gives back the light tracing algorithm
               incorporating Russian roulette. Then, a new mixed continuous
               and finite-element based iteration method is proposed, which
               uses ray-bundles to transfer the radiance in single random
               direction. The resulting algorithm is fast, it provides
               initial results in seconds and accurate solutions in minutes
               and does not suffer from the error accumulation problem and
               the high memory demand of other finite-element and
               hierarchical approaches.",
  month =      aug,
  number =     "TR-186-2-98-21",
  address =    "Favoritenstrasse 9-11/E193-02, A-1040 Vienna, Austria",
  institution = "Institute of Computer Graphics and Algorithms, Vienna
               University of Technology ",
  note =       "human contact: technical-report@cg.tuwien.ac.at",
  keywords =   "global ray-bundle tracing, light-tracing, Monte-Carlo Carlo
               integration, global radiance, Rendering equation",
  URL =        "https://www.cg.tuwien.ac.at/research/publications/1998/Szir-1998-Stoch/",
}