Bilinear Accelerated Filter Approximation
Article first published online: 15 JUL 2014
© 2014 The Author(s) Computer Graphics Forum © 2014 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.
Computer Graphics Forum
Volume 33, Issue 4, pages 33–40, July 2014
How to Cite
Manson, J. and Schaefer, S. (2014), Bilinear Accelerated Filter Approximation. Computer Graphics Forum, 33: 33–40. doi: 10.1111/cgf.12410
- Issue published online: 15 JUL 2014
- Article first published online: 15 JUL 2014
- Categories and Subject Descriptors (according to ACM CCS);
- I.3.3 [Computer Graphics]: Picture/Image Generation—Antialiasing
Our 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.