Skip to main content
padlock icon - secure page this page is secure

Bilinear Accelerated Filter Approximation

Buy Article:

$52.00 + tax (Refund Policy)

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.
No References
No Citations
No Supplementary Data
No Article Media
No Metrics

Keywords: Categories and Subject Descriptors (according to ACM CCS); I.3.3 [Computer Graphics]: Picture/Image Generation—Antialiasing

Document Type: Research Article

Publication date: July 1, 2014

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more