8210

Real-time Kd-tree Based Importance Sampling of Environment Maps

Serkan Ergun, Murat Kurt, Aydin Ozturk
International Computer Institute, Ege University
Spring conference on computer graphics, 2012
@inproceedings{EKO12,

   title={Real-time Kd-tree Based Importance Sampling of Environment Maps},

   author={Ergun, Serkan and Kurt, Murat and {"O}zt{"u}rk, Ayd{i}n},

   booktitle={Proceedings of the 28th Spring Conference on Computer Graphics},

   pages={84–91},

   year={2012},

   organization={Comenius University Press}

}

Download Download (PDF)   View View   Source Source   

889

views

We present a new real-time importance sampling algorithm for environment maps. Our method is based on representing environment maps using kd-tree structures, and generating samples with a single data lookup. An efficient algorithm has been developed for realtime image-based lighting applications. In this paper, we compared our algorithm with Inversion method [Fishman 1996]. We show that our proposed algorithm provides compactness and speedup as compared to Inversion method. Based on a number of rendered images, we have demonstrated that in a fixed time frame the proposed algorithm produces images with a lower noise than that of the Inversion method. We also demonstrate that our algorithm can successfully represent a wide range of material types.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Follow us on Twitter

HGPU group

1941 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

441 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: