Nearest neighbour structure for a data set

This function can be used to generate nearest neighbour information for a set of 2D data points.

Keywords
utilities
Usage
nearest.neighbours(x, y)
Arguments
x

vector containing \(x\) ccordinates of points.

y

vector containing \(x\) ccordinates of points.

Details

The C++ implementation of this function is used inside the locpoly and interp functions.

Value

A list with two components

index

A matrix with one row per data point. Each row contains the indices of the nearest neigbours to the point associated with this row, currently the point itself is also listed in the first row, so this matrix is of dimension \(n\) times \(n\) (will change to \(n\) times \(n-1\) later).

dist

A matrix containing the distances according to the neigbours listed in component index.

See Also

convex.hull

Aliases
  • nearest.neighbours
Examples
# NOT RUN {
data(franke)
## use only a small subset
fd <- franke$ds1[1:5,]
nearest.neighbours(fd$x,fd$y)
# }
Documentation reproduced from package interp, version 1.0-33, License: GPL (>= 2)

Community examples

Looks like there are no examples yet.