Split-plane shadow volumes

Authors:
Samuli Laine
Affiliations:
Helsinki University of Technology
Venue:
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Year:
2005

Citing 10
Cited 5

Shadow volume reconstruction from depth maps

ACM Transactions on Graphics (TOG)
Shadow algorithms for computer graphics

SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
A Survey of Shadow Algorithms

IEEE Computer Graphics and Applications
Casting curved shadows on curved surfaces

SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
A geometry-based soft shadow volume algorithm using graphics hardware

ACM SIGGRAPH 2003 Papers
Graphics for the masses: a hardware rasterization architecture for mobile phones

ACM SIGGRAPH 2003 Papers
ZP+: correct Z-pass stencil shadows

Proceedings of the 2005 symposium on Interactive 3D graphics and games
A hierarchical shadow volume algorithm

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
An efficient hybrid shadow rendering algorithm

EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
CC shadow volumes

EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques

Realistic soft shadows by penumbra-wedges blending

GH '06 Proceedings of the 21st ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Casting Shadows in Real Time

ACM SIGGRAPH ASIA 2009 Courses
An efficient alias-free shadow algorithm for opaque and transparent objects using per-triangle shadow volumes

Proceedings of the 2011 SIGGRAPH Asia Conference
Simulated real-time soft shadow in mixed reality using fuzzy logic

3D Research
Per-triangle shadow volumes using a view-sample cluster hierarchy

Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel method for rendering shadow volumes. The core idea of the method is to locally choose between Z-pass and Z-fail algorithms on a per-tile basis. The choice is made by comparing the contents of the low-resolution depth buffer against an automatically constructed split plane. We show that this reduces the number of stencil updates substantially without affecting the resulting shadows. We outline a simple and efficient hardware implementation that enables the early tile culling stages to reject considerably more pixels than with shadow volume optimizations currently available in the hardware.