Talk:Nearest-neighbor interpolation

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computer graphics

	This article is within the scope of WikiProject Computer graphics, a collaborative effort to improve the coverage of computer graphics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer graphicsWikipedia:WikiProject Computer graphicsTemplate:WikiProject Computer graphicscomputer graphics
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

Image

The picture in the article doesn't make any sense to me. Could someone add an explanation for it? --Brandon Dilbeck 07:48, 22 June 2007 (UTC)[reply]

I added some text, please help on what's the most confusing part of it to improve it further. --Berland 18:25, 22 June 2007 (UTC)[reply]

Actually, I think that did the trick; I understand it now. --Brandon Dilbeck 19:15, 22 June 2007 (UTC)[reply]

"Each coloured cell indicates the area in which all the points have the black point in the cell as their nearest black point"

Maybe I'm just tired, but this reads more like a tautology than an explanation. Clayhalliwell (talk) 19:18, 6 February 2008 (UTC)[reply]

Natural neighbor

What's the difference between "Nearest-neighbor" and "Natural neighbor" interpolation? Should these articles be combined, or at least reference one another?67.137.26.114 (talk) 22:43, 25 June 2009 (UTC)[reply]

They are completely different. Nearest neighbor produces a piecewise constant but discontinuous function by copying the function value from a single neighbor. Natural neighbor produces a function that is continuous, and smooth everywhere but at the data points, by combining the values of several nearby points (the points that would be adjacent in the Delaunay triangulation if the point at which the function is being interpolated were added to the set of data points). —David Eppstein (talk) 05:46, 26 June 2009 (UTC)[reply]

Missing Topics

Curse of dimensionality
Comparison to other smoothing functions
Uses
History

These are some topics I think are missing. I'll add some info when I can.--Diaa abdelmoneim (talk) 16:25, 9 February 2014 (UTC)[reply]