Optimizing Monte Carlo radiosity on graphics hardware

Authors:
J. R. Sanjurjo;M. Amor;M. Bóo;R. Doallo;J. Casares
Affiliations:
Dept. of Electronics and Systems, Univ. of A Coruña, A Coruña, Spain;Dept. of Electronics and Systems, Univ. of A Coruña, A Coruña, Spain;Dept. of Electronics and Computer Engineering, Univ. of Santiago de Compostela, Santiago de Compostela, Spain;Dept. of Electronics and Systems, Univ. of A Coruña, A Coruña, Spain;Dept. of Electronics and Systems, Univ. of A Coruña, A Coruña, Spain
Venue:
The Journal of Supercomputing
Year:
2011

Citing 6
Cited 2

Advanced Global Illumination

Advanced Global Illumination
Implicit visibility and antiradiance for interactive global illumination

ACM SIGGRAPH 2007 papers
Progressive radiosity method on clusters using a new clipping algorithm

International Journal of High Performance Computing and Networking
Fast, realistic lighting and material design using nonlinear cut approximation

ACM SIGGRAPH Asia 2008 papers
Imperfect shadow maps for efficient computation of indirect illumination

ACM SIGGRAPH Asia 2008 papers
Incremental instant radiosity for real-time indirect illumination

EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques

Accelerating incompressible flow computations with a Pthreads-CUDA implementation on small-footprint multi-GPU platforms

The Journal of Supercomputing
High-performance Monte Carlo radiosity on GPU based on scene partitioning

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The radiosity method is usually employed for the rendering of highly realistic synthetic images. In this paper we present an implementation of the Monte Carlo radiosity algorithm on the GPU using CUDA. Our proposal is based on the partition of the scene into sub-scenes to be processed in parallel to exploit the graphics card structure. The convex partition method employed permits the exploitation of data locality and the optimization of the ray shooting procedure due to the minimization of the number of objects to be tested in the intersection calculation. The results are good in terms of execution times, increasing the flexibility of previous solutions and demonstrating that the GPU can outperform the CPU results even for non-regular algorithms.