| nndist.lpp {spatstat} | R Documentation |
Given a pattern of points on a linear network, compute the nearest-neighbour distances, measured by the shortest path in the network.
## S3 method for class 'lpp' nndist(X, ..., method="C")
X |
Point pattern on linear network (object of class |
method |
Optional string determining the method of calculation.
Either |
... |
Ignored. |
Given a pattern of points on a linear network, this function computes the nearest neighbour distance for each point (i.e. the distance from each point to the nearest other point), measuring distance by the shortest path in the network.
If method="C" the distances are computed using
code in the C language. If method="interpreted" then the
computation is performed using interpreted R code. The R code is
much slower, but is provided for checking purposes.
A numeric vector, of length equal to the number of points in X.
Adrian Baddeley Adrian.Baddeley@uwa.edu.au http://www.maths.uwa.edu.au/~adrian/
example(lpp) nndist(X)