Data-Parallel Rasterization of Micropolygons with Defocus and Motion Blur
| dc.contributor.author | Fatahalian, Kayvon | en_US |
| dc.contributor.author | Luong, Edward | en_US |
| dc.contributor.author | Boulos, Solomon | en_US |
| dc.contributor.author | Akeley, Kurt | en_US |
| dc.contributor.author | Mark, William R. | en_US |
| dc.contributor.author | Hanrahan, Pat | en_US |
| dc.contributor.editor | David Luebke and Philipp Slusallek | en_US |
| dc.date.accessioned | 2013-10-29T15:48:16Z | |
| dc.date.available | 2013-10-29T15:48:16Z | |
| dc.date.issued | 2009 | en_US |
| dc.description.abstract | Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. We design and analyze the costs of three alternative data-parallel algorithms for rasterizing micropolygon workloads for the real-time domain. First, we demonstrate that efficient micropolygon rasterization requires parallelism across many polygons, not just within a single polygon. Second, we produce a data-parallel implementation of an existing stochastic rasterization algorithm by Pixar, which is able to produce motion blur and depth-of-field effects. Third, we provide an algorithm that leverages interleaved sampling for motion blur and camera defocus. This algorithm outperforms Pixar s algorithm when rendering objects undergoing moderate defocus or high motion and has the added benefit of predictable performance. | en_US |
| dc.description.seriesinformation | High-Performance Graphics | en_US |
| dc.identifier.isbn | 978-1-60558-603-8 | en_US |
| dc.identifier.issn | 2079-8687 | en_US |
| dc.identifier.uri | https://doi.org/10.1145/1572769.1572780 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Data-Parallel Rasterization of Micropolygons with Defocus and Motion Blur | en_US |