Fast Soft Self-Shadowing on Dynamic Height Fields

John Snyder, Derek Nowrouzezahrai
Microsoft Research
Computer Graphics Forum, Vol. 27, No. 4. (June 2008), pp. 1275-1283


   title={Fast Soft Self-Shadowing on Dynamic Height Fields},

   author={Snydre, J. and Nowrouzezahrai, D.},

   booktitle={Computer Graphics Forum},






   organization={Wiley Online Library}


Download Download (PDF)   View View   Source Source   



We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map for a set of azimuthal directions. To reduce sampling, we compute a multi-resolution pyramid on the height field. Coarser pyramid levels are indexed as the distance from caster to receiver increases. For every receiver point and every azimuthal direction, a smooth function of blocking angle in terms of log distance is reconstructed from a height difference sample at each pyramid level. This function’s maximum approximates the horizon angle. We then sum visibility at each receiver point over wedges determined by successive pairs of horizon angles. Each wedge represents a linear transition in blocking angle over its azimuthal extent. It is precomputed in the order-4 spherical harmonic (SH) basis, for a canonical azimuthal origin and fixed extent, resulting in a 2D table. The SH triple product of 16D vectors representing lighting, total visibility, and diffuse reflectance then yields the soft-shadowed result. Two types of light sources are considered; both are distant and low-frequency. Environmental lights require visibility sampling around the complete 360 azimuth, while key lights sample visibility within a partial swath. Restricting the swath concentrates samples where the light comes from (e.g. 3 azimuthal directions vs. 16-32 for a full swath) and obtains sharper shadows. Our GPU implementation handles height fields up to 1024 ? 1024 in real-time. The computation is simple, local, and parallel, with performance independent of geometric content.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: