Meny

Du är här

Hierarchical stochastic motion blur rasterization

Författare:
Publiceringsår: 2011
Språk: Engelska
Sidor: 107-118
Publikation/Tidskrift/Serie: HPG '11 Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Dokumenttyp: Konferensbidrag
Förlag: ACM

Sammanfattning

We present a hierarchical traversal algorithm for stochastic rasterization of motion blur, which efficiently reduces the number of inside tests needed to resolve spatio-temporal visibility. Our method is based on novel tile against moving primitive tests that also provide temporal bounds for the overlap. The algorithm works entirely in homogeneous coordinates, supports MSAA, facilitates efficient hierarchical spatio-temporal occlusion culling, and handles typical game workloads with widely varying triangle sizes. Furthermore, we use high-quality sampling patterns based on digital nets, and present a novel reordering that allows efficient procedural generation with good anti-aliasing properties. Finally, we evaluate a set of hierarchical motion blur rasterization algorithms in terms of both depth buffer bandwidth, shading efficiency, and arithmetic complexity.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

High Performance Graphics
2011-08-05/2011-08-07
Vancouver, Canada
Published
Yes
  • Computer Graphics
  • ISBN: 978-1-4503-0896-0

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen