[Back]

T. Weber, M. Wimmer et al.:
"Parallel Reyes-style Adaptive Subdivision with Bounded Memory Usage";
Talk: i3D 2015 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, San Francisco, CA; 2015-02-27 - 2015-03-01; in: "i3D 2015 ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games", Proceedings of the 19th Symposium on Interactive 3D Graphics and Games, (2015), ISBN: 978-1-4503-3392-4; 39 - 45.

Recent advances in graphics hardware have made it a desirable goal to implement the Reyes algorithm on current graphics cards. One key component in this algorithm is the bound-and-split phase, where surface patches are recursively split until they are smaller than a given screen-space bound. While this operation has been successfully parallelized for execution on the GPU using a breadth-first traversal, the resulting implementations are limited by their unpredictable worst-case memory consumption and high global memory bandwidth utilization. In this paper, we propose an alternate strategy that allows limiting the amount of necessary memory by controlling the number of assigned worker threads. The result is an implementation that scales to the performance of the breadth-first approach while offering three advantages: significantly decreased memory usage, a smooth and predictable tradeoff between memory usage and performance, and increased locality for surface processing. This allows us to render scenes that would require too much memory to be processed by the breadth-first method.

micro-rasterization

http://dx.doi.org/10.1145/2699276.2699289

http://publik.tuwien.ac.at/files/PubDat_242882.pdf