Acceleration of Monte Carlo Path Tracing in General Environments

Abstract : This paper describes a two pass algorithm capable of computing solutions to the global illumination in general environments (diffuse or glossy surfaces, anisotropically scattering participating media) faster than previous methods, by combining the strengths of finite element and Monte Carlo methods. A quick coarse solution is first computed with a clustered directional hierarchical method. This intermediate solution is used by a Monte Carlo method to accelerate computation of a final accurate solution by importance sampling, by means of Link Probabilities and adaptive probability density functions. Results from a first implementation of the algorithm for diffuse surfaces are presented
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00510053
Contributor : Team Evasion <>
Submitted on : Tuesday, August 17, 2010 - 3:09:28 PM
Last modification on : Wednesday, August 29, 2018 - 1:09:38 AM

Identifiers

  • HAL Id : inria-00510053, version 1

Collections

INRIA | UGA | IMAG

Citation

Frederic Perez-Cazorla, Ignacio Martin, François X. Sillion, Xavier Pueyo. Acceleration of Monte Carlo Path Tracing in General Environments. Proceedings of Pacific Graphics 2000, 2000, Hong Kong, China. ⟨inria-00510053⟩

Share

Metrics

Record views

89