ACM Home Page
Please provide us with feedback. Feedback
An efficient GPU-based approach for interactive global illumination
Full text PdfPdf (6.81 MB)
Source
ACM Transactions on Graphics (TOG) archive
Volume 28 ,  Issue 3  (August 2009) table of contents
Proceedings of ACM SIGGRAPH 2009
SESSION: Rendering and visibility table of contents
Article No. 91  
Year of Publication: 2009
ISSN:0730-0301
Also published in ...
Authors
Rui Wang  Zhejiang University
Rui Wang  University of Massachusetts Amherst
Kun Zhou  Zhejiang University
Minghao Pan  Zhejiang University
Hujun Bao  Zhejiang University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 162,   Downloads (12 Months): 407,   Citation Count: 0
Additional Information:

appendices and supplements   abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1531326.1531397
What is a DOI?

APPENDICES and SUPPLEMENTS
This document contains additional implementation details and pseudo-code for several major algorithms.


ABSTRACT

This paper presents a GPU-based method for interactive global illumination that integrates complex effects such as multi-bounce indirect lighting, glossy reflections, caustics, and arbitrary specular paths. Our method builds upon scattered data sampling and interpolation on the GPU. We start with raytraced shading points and partition them into coherent shading clusters using adaptive seeding followed by k-means. At each cluster center we apply final gather to evaluate its incident irradiance using GPU-based photon mapping. We approximate the entire photon tree as a compact illumination cut, thus reducing the final gather cost for each ray. The sampled irradiance values are then interpolated at all shading points to produce rendering. Our method exploits the spatial coherence of illumination to reduce sampling cost. We sample sparsely and the distribution of sample points conforms with the underlying illumination changes. Therefore our method is both fast and preserves high rendering quality. Although the same property has been exploited by previous caching and adaptive sampling methods, these methods typically require sequential computation of sample points, making them ill-suited for the GPU. In contrast, we select sample points adaptively in a single pass, enabling parallel computation. As a result, our algorithm runs entirely on the GPU, achieving interactive rates for scenes with complex illumination effects.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
Gautron, P., Křivánek, J., Bouatouch, K., and Pattanaik, S. N. 2005. Radiance cache splatting: A GPU-friendly global illumination algorithm. In Proc. EGSR '05, 55--64.
 
5
Hachisuka, T. 2005. GPU Gems 2 --- High-Quality Global Illumination Rendering Using Rasterization. 615--634.
 
6
Harris, M., Sengupta, S., and Owens, J. 2007. GPU Gems 3 --- Parallel Prefix Sum (Scan) with CUDA. 851--876.
7
8
9
 
10
11
 
12
 
13
 
14
Nijasure, M., Pattanaik, S. N., and Goel, V. 2005. Real-time global illumination on GPUs. Journal of Graphics Tools 10, 2, 55--71.
 
15
16
17
18
19
20
21
 
22
 
23
Walter, B., Drettakis, G., and Parker, S. 1999. Interactive rendering using the render cache. In Proc. Eurographics Workshop on Rendering, 235--246.
24
25
26
27

Collaborative Colleagues:
Rui Wang: colleagues
Rui Wang: colleagues
Kun Zhou: colleagues
Minghao Pan: colleagues
Hujun Bao: colleagues