English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Convolution Shadow Maps

MPS-Authors
/persons/resource/persons44022

Annen,  Thomas
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45029

Mertens,  Tom
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44110

Bekaert,  Philippe
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45449

Seidel,  Hans-Peter       
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44747

Kautz,  Jan
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Annen, T., Mertens, T., Bekaert, P., Seidel, H.-P., & Kautz, J. (2007). Convolution Shadow Maps. In D. Fellner, & S. Spencer (Eds.), Rendering Techniques 2007: [18th] Eurographics Symposium on Rendering (pp. 51-60). Aire-la-Ville, Switzerland: Eurographics.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1EBE-8
Abstract
We present \emph{Convolution Shadow Maps}, a novel shadow representation that affords efficient arbitrary linear filtering of shadows. Traditional shadow mapping is inherently non-linear w.r.t.\ the stored depth values due to the binary shadow test. We linearize the problem by approximating shadow maps as a weighted summation of basis terms. We demonstrate the usefulness of this representation and show that hardware-accelerated anti-aliasing techniques, such as tri-linear filtering, can be applied naturally to Convolution Shadow Maps. This approach can be implemented very efficiently in current generation graphics hardware yielding real-time frame rates.