Stochastic transparency

Enderton, Eric; Sintorn, Erik; Shirley, Peter; Luebke, David

doi:10.1145/1730804.1730830

Cited by 51 publications

(18 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the case of order-independent transparency, ignoring order is sometimes acceptable [Meshkin 2007;Bavoil and Myers 2008]. Another method that avoids the need for sorting is stochastic transparency [Enderton et al 2010;Laine and Karras 2011], a refreshing new take on screen-door transparency [Foley et al 1990;Mulder et al 1998]. Our method always produces noisefree renderings and is significantly faster.…”

Section: Related Workmentioning

confidence: 99%

“…We compared the overall performance of our fragment shader algorithm with a selection of state-of-theart real-time depth-sorting algorithms: per-pixel dynamic linked lists (LL) [Yang et al 2010], stochastic transparency (ST) [Enderton et al 2010], and dual depth peeling (DDP) [Bavoil and Myers 2008]. ST is an approximate algorithm, while DDP and LL produce exact results.…”

Section: Overall Performancementioning

confidence: 99%

See 1 more Smart Citation

Depth-presorted triangle lists

Chen¹,

Sander²,

Nehab

et al. 2012

ACM Trans. Graph.

View full text Add to dashboard Cite

run-time selection real-time depth-sorted renderings input triangles off-line preprocess depth-presorted triangle list (triangles & half-spaces) input static model Figure 1: Our off-line preprocessing algorithm produces a depth-presorted triangle list from a static 3D input model. The list contains copies of the model that are depth-sorted relative to any viewpoint outside its bounding volume. Each triangle comes annotated with a half-space test that enables a fast run-time algorithm to select exactly the triangles needed to render a complete depth-sorted model for a given viewpoint.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Overall Performancementioning

confidence: 99%

Depth-presorted triangle lists

Chen¹,

Sander²,

Nehab

et al. 2012

ACM Trans. Graph.

View full text Add to dashboard Cite

show abstract

“…Neither Deferred shading, nor Tiled Deferred Shading, provides a way to handle transparency. We are instead left with techniques that are approximate [KL09,ESSL10], or expensive [Eve01]. In Section 4, we present a way to conveniently support transparency when using tiled shading.…”

Section: Limitationsmentioning

confidence: 99%

Tiled Shading

Olsson

Assarsson

2011

Journal of Graphics, GPU, and Game Tools

View full text Add to dashboard Cite

In this article we describe and investigate Tiled Shading. The tiled techniques, though simple, enable substantial improvements to both deferred and forward shading. Tiled Shading has previously been talked about only in terms of deferred shading (Tiled Deferred Shading). We contribute a more detailed description of the technique, introduce Tiled Forward Shading (a generalization of Tiled Deferred Shading to also apply to forward shading), and a thorough performance evaluation. Tiled Forward Shading has many of the advantages of deferred shading, e.g. scene management and light management is decoupled. At the same time, unlike traditional deferred and tiled deferred shading, Full Screen Anti Aliasing and transparency is trivially supported. We also contribute a thorough comparison of the performance of Tiled Deferred, Tiled Forward and traditional deferred shading. Our evaluation shows that Tiled Deferred Shading has the least variable worst case performance, and scales the best with faster GPUs. Tiled Deferred Shading is especially suitable when there are many light sources. Tiled Forward Shading is shown to be competitive for scenes with fewer lights, while being much simpler than traditional forward shading techniques. Tiled shading also enables simple transitioning between deferred and forward shading. We demonstrate how this can be used to handle transparent geometry, frequently a problem when using deferred shading.

show abstract

“…Kelley et al [KGP*94] use a fixed‐size staging buffer for sorting fragments. Enderton et al [ESSL10] introduce a technique for handling all types of transparent occluders in a fixed amount of storage for both shadow and primary visibility generating a stochastically sampled visibility function.…”

Section: Background and Related Workmentioning

confidence: 99%

Adaptive Volumetric Shadow Maps

Salvi

Vidimče

Lauritzen

et al. 2010

Computer Graphics Forum

View full text Add to dashboard Cite

We introduce adaptive volumetric shadow maps (AVSM), a real-time shadow algorithm that supports high-quality shadowing from dynamic volumetric media such as hair and smoke. The key contribution of AVSM is the introduction of a streaming simplification algorithm that generates an accurate volumetric light attenuation function using a small fixed memory footprint. This compression strategy leads to high performance because the visibility data can remain in on-chip memory during simplification and can be efficiently sampled during rendering. We demonstrate that AVSM compression closely approximates the ground-truth correct solution and performs competitively to existing real-time rendering techniques while providing higher quality volumetric shadows.

show abstract

Stochastic transparency

Cited by 51 publications

References 22 publications

Depth-presorted triangle lists

Depth-presorted triangle lists

Tiled Shading

Adaptive Volumetric Shadow Maps

Contact Info

Product

Resources

About