Z3: an economical hardware technique for high-quality antialiasing and transparency
HWWS '99 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
The F-buffer: a rasterization-order FIFO buffer for multi-pass rendering
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Proceedings of the 12th Eurographics Workshop on Rendering Techniques
The A -buffer, an antialiased hidden surface method
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Hair self shadowing and transparency depth ordering using occupancy maps
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Efficient depth peeling via bucket sort
Proceedings of the Conference on High Performance Graphics 2009
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Fragment-parallel composite and filter
EGSR'10 Proceedings of the 21st Eurographics conference on Rendering
Adaptive volumetric shadow maps
EGSR'10 Proceedings of the 21st Eurographics conference on Rendering
Real-time concurrent linked list construction on the GPU
EGSR'10 Proceedings of the 21st Eurographics conference on Rendering
I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Depth-presorted triangle lists
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
High-quality parallel depth-of-field using line samples
EGGH-HPG'12 Proceedings of the Fourth ACM SIGGRAPH / Eurographics conference on High-Performance Graphics
Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Proceedings of the 18th meeting of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
| Hi-index | 0.00 |
Adaptive transparency is a new solution to order-independent transparency that closely approximates the ground-truth results obtained with A-buffer compositing but, like a Z-buffer, operates in bounded memory and exhibits consistent performance. The key contribution of our method is an adaptively compressed visibility representation that can be efficiently constructed and queried while rendering. The algorithm supports a wide range and combination of transparent geometry (e.g., foliage, windows, hair, and smoke). We demonstrate that adaptive transparency is five to forty times faster than realtime A-buffer implementations, closely matches the image quality, and is both higher quality and faster than other approximate order-independent transparency techniques: stochastic transparency, uniform opacity shadow maps, and Fourier opacity mapping.