Real-time Kd-tree Based Importance Sampling of Environment Maps
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}
}
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.
September 15, 2012 by hgpu
