Pipeline rendering: interaction and realism through hardware-based multi-pass rendering
Pipeline rendering: interaction and realism through hardware-based multi-pass rendering
Shadow algorithms for computer graphics
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Real-Time Shadow Generation Using BSP Trees and Stencil Buffers
SIBGRAPI '99 Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing
Casting curved shadows on curved surfaces
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Robust, geometry-independent shadow volumes
Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
A hierarchical shadow volume algorithm
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Light space perspective shadow maps
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
Anti-aliasing and continuity with trapezoidal shadow maps
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
An efficient hybrid shadow rendering algorithm
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
ACM SIGGRAPH ASIA 2009 Courses
Proceedings of the 2011 SIGGRAPH Asia Conference
Precomputed atmospheric scattering
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
| Hi-index | 0.00 |
We present a novel algorithm for the rendering of hard shadows cast by a point light source. The well-known Z-pass method for rasterizing shadow volumes is not always correct. Our algorithm, which we call ZP+, elegantly corrects Z-pass defects. ZP+ takes advantage of triangle strips and the fast culling capabilities of graphics hardware not available to conventional robust methods like Z-fail. While Z-fail can be up to 80% slower than Z-pass, our new method ZP+ is typically less than 10% slower than Z-pass. Finally, we compare the three methods. When a scene is geometry-bound, ZP+ is always faster than Z-fail. We also explain why, in some situations, Z-pass (hence ZP+) is surprisingly slower than Z-fail on more recent graphics hardware.