ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Data-parallel rasterization of micropolygons with defocus and motion blur
Full text PdfPdf (8.60 MB)
Source
SIGGRAPH/EUROGRAPHICS Conference On Graphics Hardware archive
Proceedings of the Conference on High Performance Graphics 2009 table of contents
New Orleans, Louisiana
SESSION: Visibility table of contents
Pages: 59-68  
Year of Publication: 2009
ISBN:978-1-60558-603-8
Authors
Kayvon Fatahalian  Stanford University
Edward Luong  Stanford University
Solomon Boulos  Stanford University
Kurt Akeley  Microsoft Research
William R. Mark  Intel Corporation
Pat Hanrahan  Stanford University
Sponsors
Eurographics: Eurographics
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 130,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1572769.1572780
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
 
4
Cook, R. L., Porter, T. K., and Carpenter, L. C., 1990. Pseudo-random point sampling techniques in computer graphics. United States Patent 4,897,806, Jan.
5
 
6
Demers, J. 2004. Depth of field: A survey of techniques. GPU Gems, 375--390.
7
8
9
10
 
11
Houston, M., 2008. Anatomy of AMD's terascale graphics engine. SIGGRAPH 2008 Class Notes: Beyond Programmable Shading: Fundamentals. http://s08.idav.ucdavis.edu/houston-amd-terascale.pdf.
 
12
13
14
15
16
17
 
18

Collaborative Colleagues:
Kayvon Fatahalian: colleagues
Edward Luong: colleagues
Solomon Boulos: colleagues
Kurt Akeley: colleagues
William R. Mark: colleagues
Pat Hanrahan: colleagues