Shadow algorithms for computer graphics
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Casting curved shadows on curved surfaces
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
A hierarchical shadow volume algorithm
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
The irregular Z-buffer: Hardware acceleration for irregular data structures
ACM Transactions on Graphics (TOG)
Parallel-split shadow maps for large-scale virtual environments
Proceedings of the 2006 ACM international conference on Virtual reality continuum and its applications
Resolution-matched shadow maps
ACM Transactions on Graphics (TOG)
Proceedings of the 2011 SIGGRAPH Asia Conference
Real-Time Shadows
Sample based visibility for soft shadows using alias-free shadow maps
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
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
Clustered deferred and forward shading
EGGH-HPG'12 Proceedings of the Fourth ACM SIGGRAPH / Eurographics conference on High-Performance Graphics
SIGGRAPH Asia 2012 Technical Briefs
| Hi-index | 0.00 |
Rendering pixel-accurate shadows in scenes lit by a point light-source in real time is still a challenging problem. For scenes of moderate complexity, algorithms based on Shadow Volumes are by far the most efficient in most cases, but traditionally, these algorithms struggle with views where the volumes generate a very high depth complexity. Recently, a method was suggested that alleviates this problem by testing each individual triangle shadow volume against a hierarchical depth map, allowing volumes that are in front of, or behind, the rendered view samples to be efficiently culled. In this paper, we show that this algorithm can be greatly improved by building a full 3D acceleration structure over the view samples and testing per-triangle shadow volumes against that. We show that our algorithm can elegantly maintain high frame-rates even for views with very high-frequency depth-buffers where previous algorithms perform poorly. Our algorithm also performs better than previous work in general, making it, to the best of our knowledge, the fastest pixel-accurate shadow algorithm to date. It can be used with any arbitrary polygon soup as input, with no restrictions on geometry or required pre-processing, and trivially supports transparent and textured shadow-casters.