Nearest neighbor interpolation
From Wikipedia, the free encyclopedia
Nearest neighbor interpolation is a simple method of interpolation. Interpolation is the problem of approximating the value for a non-given point in some space, when given some values of points around that point. The nearest neighbor algorithm simply selects the value of the nearest point, and does not consider the values of other neighboring points at all. The algorithm is very inexpensive to implement, and is commonly used (usually along with mipmapping) in real-time 3D rendering to select color values for a textured surface.
[edit] See also
- linear interpolation
- bilinear interpolation
- trilinear interpolation
- bicubic interpolation
- spline interpolation