A Progressive Algorithm For Three Point Transport - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

A Progressive Algorithm For Three Point Transport

Abstract

When computing global illumination in environments made up of surfaces with general Bidirectionnal Reflection Distribution Function, a three point formulation of the rendering equation can be used. Brute-force algorithms can lead to a linear system of equations whose matrix is cubic, which is expensive in time and space. The hierarchical approach is more efficient. Aupperle et al. proposed a hierchical three point algorithm to compute global illumination in presence of glossy reflection. We present in this paper some improvements we brought to this method: shooting, "lazy" push-pull, photometric subdivision criterion... Then we will show how our new method takes into account non-planar surfaces in the hierarchical resolution process.
Fichier principal
Vignette du fichier
RR-3305.pdf (601.31 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073384 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073384 , version 1

Cite

Reynald Dumont, Kadi Bouatouch, Philippe Gosselin. A Progressive Algorithm For Three Point Transport. [Research Report] RR-3305, INRIA. 1997. ⟨inria-00073384⟩
176 View
268 Download

Share

Gmail Facebook X LinkedIn More