Andere Kunden interessierten sich auch für
![Nearest-Neighbor Interpolation]( "Nearest-Neighbor Interpolation")
Nearest-Neighbor Interpolation19,99 €![Nearest Neighbor Search]( "Nearest Neighbor Search")
Nearest Neighbor Search19,99 €![Non-Neighbor Topological Indices]( "Non-Neighbor Topological Indices")
Non-Neighbor Topological Indices26,99 €![Common neighbor polynomial of graphs]( "Common neighbor polynomial of graphs")
Common neighbor polynomial of graphs44,99 €![A Randomized Approximate Nearest Neighbors Algorithm]( "A Randomized Approximate Nearest Neighbors Algorithm")
A Randomized Approximate Nearest Neighbors Algorithm38,99 €![Nasik Magic Hypercube]( "Nasik Magic Hypercube")
Nasik Magic Hypercube22,99 €![Sphere packing]( "Sphere packing")
Sphere packing25,99 €
High Quality Content by WIKIPEDIA articles! Nearest-neighbor interpolation (also known as proximal interpolation or point sampling in some contexts) is a simple method of multivariate interpolation in 1 or more dimensions. 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, yielding a piecewise-constant interpolant. The algorithm is very simple to implement, and is commonly used (usually along with mipmapping) in real-time 3D rendering to select color values for a textured surface.