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
Type de document :
Communication dans un congrès
Proceedings of Pacific Graphics 2000, 2000, Hong Kong, China. 2000
Liste complète des métadonnées

https://hal.inria.fr/inria-00510053
Contributeur : Team Evasion <>
Soumis le : mardi 17 août 2010 - 15:09:28
Dernière modification le : vendredi 2 février 2018 - 19:24:01

Identifiants

  • 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. 2000. 〈inria-00510053〉

Partager

Métriques

Consultations de la notice

59