5087

Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs

Oskar Akerlund, Mattias Unger, Rui Wang
UMass Amherst
15th Pacific Conference on Computer Graphics and Applications, 2007. PG ’07

@article{akerlund2007precomputed,

   title={Precomputed visibility cuts for interactive relighting with dynamic BRDFs},

   author={Akerlund, O. and Unger, M. and Wang, R.},

   year={2007},

   publisher={IEEE Computer Society}

}

Download Download (PDF)   View View   Source Source   

555

views

This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our method is inspired by the recent Lightcuts approach [24] and we parameterize distant environment lighting onto uniformly distributed sample points over the sphere. Using a binary tree structure of the points, we precompute and approximate each vertex’s visibility function into clusters that we call the precomputed visibility cuts. These cuts are iteratively selected with bounded approximation error and confined cluster size. At run-time, a GPU-based relighting algorithm quickly computes the view-dependent shading color by accessing a dynamically built light tree, the precomputed visibility cuts, and a direct sampling of an arbitrary BRDF using each visibility cluster’s average direction and the dynamic view direction. Compared to existing PRT techniques, our method guarantees uniform sampling of the lighting, requires no precomputed BRDF data, and can be easily extended to handle one-bounce glossy indirect transfer effects in real-time.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: