Fragment‐Parallel Composite and Filter
- 1 June 2010
- journal article
- research article
- Published by Wiley in Computer Graphics Forum
- Vol. 29 (4) , 1251-1258
Abstract
We present a strategy for parallelizing the composite and filter operations suitable for an order‐independent rendering pipeline implemented on a modern graphics processor. Conventionally, this task is parallelized across pixels/subpixels, but serialized along individual depth layers. However, our technique extends the domain of parallelization to individual fragments (samples), avoiding a serial dependence on the number of depth layers, which can be a constraint for scenes with high depth complexity. As a result, our technique scales with the number of fragments and can sustain a consistent and predictable throughput in scenes with both low and high depth complexity, including those with a high variability of depth complexity within a single frame. We demonstrate composite/filter performance in excess of 50M fragments/sec for scenes with more than 1500 semi‐transparent layers.Keywords
This publication has 15 references indexed in Scilit:
- Stochastic transparency2010
- RenderAntsACM Transactions on Graphics, 2009
- Bucket depth peeling2009
- LarrabeeACM Transactions on Graphics, 2008
- NVIDIA Tesla: A Unified Graphics and Computing ArchitectureIEEE Micro, 2008
- Stencil routed A-Buffer2007
- Multi-fragment effects on the GPU using the k -buffer2007
- GPU-accelerated high-quality hidden surface removal2005
- R-buffer2001
- The A -buffer, an antialiased hidden surface methodACM SIGGRAPH Computer Graphics, 1984