Compressed shadow maps

  • Authors:
  • Jukka Arvo;Mika Hirvikorpi

  • Affiliations:
  • University of Turku, Turku Centre for Computer Science, and Department of Information Technology, Lemminkäisenkatu 14 A, 20520, Turku, Finland;University of Turku, Turku Centre for Computer Science, and Department of Information Technology, Lemminkäisenkatu 14 A, 20520, Turku, Finland

  • Venue:
  • The Visual Computer: International Journal of Computer Graphics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.