Stencil routed A-Buffer

Myers, Kevin J.; Bavoil, Louis

doi:10.1145/1278780.1278806

Cited by 44 publications

(35 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Recently, Callahan et al (2005) introduced the K-buffer, a per pixel fixed-size buffer of fragments that is maintained in GPU memory. There exist many proposals for implementing the K-Buffer on the GPU, for example by using the stencil routing algorithm (Myers & Bavoil, 2007) or by exploiting generic atomic operations available in OpenGL 4.0 (Yang et al, 2010). It requires only one geometric pass, thus being more efficient than techniques such as depth peeling (Everitt, 2001).…”

Section: Fusing Of Methods Via Global Transparencymentioning

confidence: 99%

Visualization Methods for Numerical Astrophysics

Benger¹,

Haider²,

Höller³

et al. 2012

Astrophysics

View full text Add to dashboard Cite

Section: Fusing Of Methods Via Global Transparencymentioning

confidence: 99%

Visualization Methods for Numerical Astrophysics

Benger¹,

Haider²,

Höller³

et al. 2012

Astrophysics

View full text Add to dashboard Cite

“…4. They use the fact that the stencil test is performed per−sample in most cases of modern hardware anti−aliasing implementations.…”

Section: Previous Workmentioning

confidence: 99%

“…Instead we use a "runtime" storage mechanism inspired by Ref. 4. We start by initializing the stencil buffer of each layer with values going from 2 for the first layer up to the maximum number of fragments (or layers -which− ever is smaller) plus 1 for the last layer used.…”

Section: Multi-layered Frame Buffer Initializationmentioning

confidence: 99%

See 1 more Smart Citation

D-buffer: irregular image data storage made practical

Lipowski

2013

Opto-Electronics Review

View full text Add to dashboard Cite

Modern hardware accelerated graphics pipelines are designed to operate on data in a so called streaming model. To process the data in this model one needs to impose some restrictions on input and output argument’s (most frequently represented by a two-dimensional frame buffer) memory structure. The output data regularity is obvious when we consider rasterizing hardware architecture, which draws 3D polygons using depth buffer to resolve the visible surface problem. But recently the user’s needs surpass those restrictions with increasing frequency. In this work we formulate and present new methods of irregular frame buffer storage and ordering. The so called deque buffer (or D-buffer) allows us to decrease the amount of memory used for storage as well as the memory latency cost by using pixel data ordering. Our findings are confirmed by experimental results that measure the processing time, which is up to four times shorter, when compared with previous work by other authors. We also include a detailed description of algorithms used for D-buffer construction on the last three consumer-grade graphics hardware architectures, as a guide for other researchers and a development aid for practitioners. The only theoretical requirement imposed by our method is the use of memory model with linear address space.

show abstract

“…The process is memory compact and faster than stencil routing [MB07]. Our goal is to store in each pixel of the SM a list length s and a list offset.…”

Section: Constructing and Storing The Shadow Map Listsmentioning

confidence: 99%

Sample Based Visibility for Soft Shadows using Alias‐free Shadow Maps

Sintorn

Eisemann

Assarsson

2008

Computer Graphics Forum

View full text Add to dashboard Cite

This paper introduces an accurate real-time soft shadow algorithm that uses sample based visibility. Initially, we present a GPU-based alias-free hard shadow map algorithm that typically requires only a single render pass from the light, in contrast to using depth peeling and one pass per layer. For closed objects, we also suppress the need for a bias. The method is extended to soft shadow sampling for an arbitrarily shaped area-/volumetric light source using 128-1024 light samples per screen pixel. The alias-free shadow map guarantees that the visibility is accurately sampled per screen-space pixel, even for arbitrarily shaped (e.g. non-planar) surfaces or solid objects. Another contribution is a smooth coherent shading model to avoid common light leakage near shadow borders due to normal interpolation.

show abstract

Stencil routed A-Buffer

Cited by 44 publications

References 1 publication

Visualization Methods for Numerical Astrophysics

Visualization Methods for Numerical Astrophysics

D-buffer: irregular image data storage made practical

Sample Based Visibility for Soft Shadows using Alias‐free Shadow Maps

Contact Info

Product

Resources

About