Bilinear Accelerated Filter Approximation

Simple item page
dc.contributor.authorManson, Josiahen_US
dc.contributor.authorSchaefer, Scotten_US
dc.contributor.editorWojciech Jarosz and Pieter Peersen_US
dc.date.accessioned2015-03-03T12:38:27Z
dc.date.available2015-03-03T12:38:27Z
dc.date.issued2014en_US
dc.description.abstractOur method approximates exact texture filtering for arbitrary scales and translations of an image while taking into account the performance characteristics of modern GPUs. Our algorithm is fast because it accesses textures with a high degree of spatial locality. Using bilinear samples guarantees that the texels we read are in a regular pattern and that we use a hardware accelerated path. We control the texel weights by manipulating the u; v parameters of each sample and the blend factor between the samples. Our method is similar in quality to Cardinality-Constrained Texture Filtering [MS13] but runs two times faster.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/cgf.12410en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12410en_US
dc.publisherThe Eurographics Association and John Wiley and Sons Ltd.en_US
dc.titleBilinear Accelerated Filter Approximationen_US
Files
Collections
33-Issue 4
EGSR14: 25th Eurographics Symposium on Rendering