, Volume 5, Issue 3-4, pp 181-187
Date: 07 Nov 2012

Grid interpolation algorithm based on nearest neighbor fast search

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


The nearest neighbor search algorithm is one of the major factors that influence the efficiency of grid interpolation. This paper introduces a KD-tree that is a two-dimensional index structure for use in grid interpolation. It also proposes an improved J-nearest neighbor search strategy based on “priority queue” and “neighbor lag” concepts. In the strategy, two types of J-nearest neighbor search algorithms can be used; these algorithms correspond to the consideration of a fixed number of points and a fixed radius. By using the KD-tree and proposed strategy, interpolation can be performed with methods such as Inverse Distance Weighting and Kriging. Experimental results show that the proposed algorithms has high operating efficiency, especially when the data amount is enormous, and high practical value for increasing the efficiency of grid interpolation.

Communicated by: H. A. Babaie