Difference between revisions of "TrilinearFiltering"
From polycount
(added trilinear filtering) |
EricChadwick (Talk | contribs) (restored and revised) |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 1: | Line 1: | ||
− | + | Trilinear Filtering is a method of [[Texture filtering]] used by [[:Category:GameEngines|game engines]]. | |
− | + | ||
− | + | Since [[Texel]]s are almost always larger or smaller than screen [[Pixel]]s, trilinear filtering finds two [[MipMap]]s whose texels are closest in size to the screen pixels: one with larger texels, and the other with smaller texels. For each of the two MIP-maps, it then [[Interpolation|interpolates]] the four texels that are the nearest to each screen pixel. After this it averages between the two MIP results to render the final screen pixel. | |
− | + | ||
− | + | ||
Trilinear mip-mapping requires more than twice the computational cost of [[BilinearFiltering|bilinear filtering]], but the textures are filtered very nicely, with a clean result. | Trilinear mip-mapping requires more than twice the computational cost of [[BilinearFiltering|bilinear filtering]], but the textures are filtered very nicely, with a clean result. | ||
---- | ---- | ||
− | [[Category:Glossary]] | + | [[Category:Glossary]][[Category:Rendering]] |
Latest revision as of 19:43, 19 March 2015
Trilinear Filtering is a method of Texture filtering used by game engines.
Since Texels are almost always larger or smaller than screen Pixels, trilinear filtering finds two MipMaps whose texels are closest in size to the screen pixels: one with larger texels, and the other with smaller texels. For each of the two MIP-maps, it then interpolates the four texels that are the nearest to each screen pixel. After this it averages between the two MIP results to render the final screen pixel.
Trilinear mip-mapping requires more than twice the computational cost of bilinear filtering, but the textures are filtered very nicely, with a clean result.