Practical logarithmic rasterization for low-error shadow maps
D. Brandon Lloyd, Naga K. Govindaraju, Steven Molnar et al. · International Conference on Computer Graphics and Interactive Techniques · 2007
Logarithmic shadow maps can deliver the same quality as competing shadow map algorithms with substantially less storage and bandwidth. We show how current GPU architectures can be modified incrementally to support rendering of logarithmic shadow maps at current GPU fill rates. Specifically, we modify the rasterizer to support rendering to a nonuniform grid with the same watertight rasterization properties as current rasterizers. We also describe a depth compression scheme to handle the nonlinear primitives produced by logarithmic rasterization. Our proposed architecture enhancements align with current trends of decreasing cost for on-chip computation relative to off-chip bandwidth and storage. For a modest increase in computation, logarithmic rasterization can greatly reduce shadow map bandwidth and storage costs.
Cited by 13 works. doi:10.5555/1280094.1280097
Authors
References
- Casting curved shadows on curved surfaces
- Shadow algorithms for computer graphics
- The OpenGL Graphics System: A Specification
- A parallel algorithm for polygon rasterization
- RPU
- Perspective shadow maps
- Adaptive shadow maps
- Light Space Perspective Shadow Maps
- Anti-aliasing and Continuity with Trapezoidal Shadow Maps
- The irregular Z-buffer