On finding p-th nearest neighbours of scattered points in two dimensions for small p Original Research Article

Given a large set of scattered points in the plane, we describe a new and efficient algorithm to find, for each point, the subset of p closest points, using the Dirichlet tessellation of the set of points, for small values of p. This problem has applications to interpolation and contouring, for example, in the field of Geographic Information Systems.