Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Compressed Shadow Maps

Compressed Shadow Maps

Jukka Arvo, Mika Hirvikorpi, Compressed Shadow Maps. The Visual Computer 21(3), 125-138, 2005.

Abstract:

Shadow mapping has been subject to extensive investigation, but previous shadow map algorithms cannot usually generate high-quality shadows with a small memory footprint. In this paper, we present compressed shadow maps as a solution to this problem. A compressed shadow map reduces memory consumption by representing lit surfaces with endpoints of intermediate line segments as opposed to the conventional array-based pixel structures. Compressed shadow maps are only discretized in the vertical direction while the horizontal direction is represented by floating-point accuracy. The compression also helps with the shadow map self-shadowing problems. We compare our algorithm against all of the most popular shadow map algorithms and show, on average, order of magnitude improvements in storage requirements in our test scenes. The algorithm is simple to implement, can be added easily to existing software renderers, and lets us use graphics hardware for shadow visualization.

BibTeX entry:

@ARTICLE{jArHi05a,
  title = {Compressed Shadow Maps},
  author = {Arvo, Jukka and Hirvikorpi, Mika},
  journal = {The Visual Computer},
  volume = {21},
  number = {3},
  publisher = {Springer Berlin / Heidelberg},
  pages = {125-138},
  year = {2005},
  keywords = {computer graphics, shadow algorithms, rendering, shadow maps},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Edit publication