CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Stochastic Transparency

Eric Enderton ; Erik Sintorn (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Peter Shirley ; David Luebke
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games p. 157-164. (2010)
[Konferensbidrag, refereegranskat]

Stochastic transparency provides a unified approach to order-independent transparency, anti-aliasing, and deep shadow maps. It augments screen-door transparency using a random sub-pixel stipple pattern, where each fragment of transparent geometry covers a random subset of pixel samples of size proportional to alpha. This results in correct alpha-blended colors on average, in a single render pass with fixed memory size and no sorting, but introduces noise. We reduce this noise by an alpha correction pass, and by an accumulation pass that uses a stochastic shadow map from the camera. At the pixel level, the algorithm does not branch and contains no read-modify-write loops other than traditional z-buffer blend operations. This makes it an excellent match for modern massively parallel GPU hardware. Stochastic transparency is very simple to implement and supports all types of transparent geometry, able without coding for special cases to mix hair, smoke, foliage, windows, and transparent cloth in a single scene.

Nyckelord: rendering, order-independent transparency, deep shadow maps, hair, smoke, foliage

Denna post skapades 2010-04-22. Senast ändrad 2013-12-17.
CPL Pubid: 120228


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Datorteknik (Chalmers)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Efficient rendering of semi-transparent geometry in real-time