Real-time kd-tree based importance sampling of environment maps
Abstract
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 r
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84876217584&doi=10.1145%2f2448531.2448541&partnerID=40&md5=c33220e72e6ffa4c0e6e990b6adaf69bhttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10545
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..