A Family of Inexpensive Sampling Schemes

dc.contributor.authorHasselgren, Jonen_US
dc.contributor.authorAkenine-Moeller, Tomasen_US
dc.contributor.authorLaine, Samulien_US
dc.date.accessioned2015-02-19T14:24:38Z
dc.date.available2015-02-19T14:24:38Z
dc.date.issued2005en_US
dc.description.abstractTo 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.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume24en_US
dc.identifier.doi10.1111/j.1467-8659.2005.00905.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages843-848en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2005.00905.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleA Family of Inexpensive Sampling Schemesen_US
Files
Collections