A Family of Inexpensive Sampling Schemes
dc.contributor.author | Hasselgren, Jon | en_US |
dc.contributor.author | Akenine-Moeller, Tomas | en_US |
dc.contributor.author | Laine, Samuli | en_US |
dc.date.accessioned | 2015-02-19T14:24:38Z | |
dc.date.available | 2015-02-19T14:24:38Z | |
dc.date.issued | 2005 | en_US |
dc.description.abstract | To improve image quality in computer graphics, antialiazing techniques such as supersampling and multisampling are used. We explore a family of inexpensive sampling schemes that cost as little as 1.25 samples per pixel and up to 2.0 samples per pixel. By placing sample points in the corners or on the edges of the pixels, sharing can occur between pixels, and this makes it possible to create inexpensive sampling schemes. Using an evaluation and optimization framework, we present optimized sampling patterns costing 1.25, 1.5, 1.75 and 2.0 samples per pixel. | en_US |
dc.description.number | 4 | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 24 | en_US |
dc.identifier.doi | 10.1111/j.1467-8659.2005.00905.x | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.pages | 843-848 | en_US |
dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2005.00905.x | en_US |
dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
dc.title | A Family of Inexpensive Sampling Schemes | en_US |