Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Hierarchical stochastic motion blur rasterization

In English

Författare

Summary, in English

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.

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

Association for Computing Machinery (ACM)

Ämne

  • Computer Science

Conference name

High Performance Graphics, 2011

Conference date

2011-08-05 - 2011-08-07

Conference place

Vancouver, Canada

Status

Published

Forskningsgrupp

  • Computer Graphics

ISBN/ISSN/Övrigt

  • ISBN: 978-1-4503-0896-0