| 1. |
- Akenine-Möller, Tomas, et al.
(författare)
-
Efficient Depth of Field Rasterization Using a Tile Test Based on Half-Space Culling
- 2012
-
Ingår i: Computer Graphics Forum. - : Wiley. - 1467-8659 .- 0167-7055. ; 31:1, s. 3-18
-
Tidskriftsartikel (refereegranskat)abstract
- For depth of field (DOF) rasterization, it is often desired to have an efficient tile versus triangle test, which can conservatively compute which samples on the lens that need to execute the sample-in-triangle test. We present a novel test for this, which is optimal in the sense that the region on the lens cannot be further reduced. Our test is based on removing half-space regions of the (u, v) -space on the lens, from where the triangle definitely cannot be seen through a tile of pixels. We find the intersection of all such regions exactly, and the resulting region can be used to reduce the number of sample-in-triangle tests that need to be performed. Our main contribution is that the theory we develop provides a limit for how efficient a practical tile versus defocused triangle test ever can become. To verify our work, we also develop a conceptual implementation for DOF rasterization based on our new theory. We show that the number of arithmetic operations involved in the rasterization process can be reduced. More importantly, with a tile test, multi-sampling anti-aliasing can be used which may reduce shader executions and the related memory bandwidth usage substantially. In general, this can be translated to a performance increase and/or power savings.
|
|
| 2. |
- Munkberg, Jacob, et al.
(författare)
-
Per-Vertex Defocus Blur for Stochastic Rasterization
- 2012
-
Ingår i: Computer Graphics Forum. - : Wiley. - 1467-8659 .- 0167-7055. ; 31:4, s. 1385-1389
-
Tidskriftsartikel (refereegranskat)abstract
- We present user-controllable and plausible defocus blur for a stochastic rasterizer. We modify circle of confusion coefficients per vertex to express more general defocus blur, and show how the method can be applied to limit the foreground blur, extend the in-focus range, simulate tilt-shift photography, and specify per-object defocus blur. Furthermore, with two simplifying assumptions, we show that existing triangle coverage tests and tile culling tests can be used with very modest modifications. Our solution is temporally stable and handles simultaneous motion blur and depth of field.
|
|
| 3. |
- Munkberg, Jacob, et al.
(författare)
-
Hierarchical stochastic motion blur rasterization
- 2011
-
Ingår i: HPG '11 Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics. - New York, NY, USA : ACM. - 9781450308960 ; , s. 107-118
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
