<< Click to Display Table of Contents >> Navigation:  Chapter 10 Gridding and Contouring > Contour Maps > Editing a Contour Map > Grids > Gridding Algorithms > Nearest Neighbor

Nearest Neighbor is useful when the data is very regularly spaced with only some missing locations. This method assigns the value of the nearest data point to a grid node. This algorithm is useful when the data is already in a grid and needs to be converted to a different grid spacing or have missing grid node values calculated. In cases where there may be missing data a maximum distance can be specified for the nearest point so that no grid calculation is performed for the node and it is assigned an empty value.