maxnndist

From spatstat v1.52-1 by Adrian Baddeley

Compute Minimum or Maximum Nearest-Neighbour Distance

A faster way to compute the minimum or maximum nearest-neighbour distance in a point pattern.

Keywords: spatial, math

Usage

minnndist(X, positive=FALSE)
maxnndist(X, positive=FALSE)

Arguments

X: A point pattern (object of class "ppp").
positive: Logical. If FALSE (the default), compute the usual nearest-neighbour distance. If TRUE, ignore coincident points, so that the nearest neighbour distance for each point is greater than zero.

Details

These functions find the minimum and maximum values of nearest-neighbour distances in the point pattern X. minnndist(X) and maxnndist(X) are equivalent to, but faster than, min(nndist(X)) and max(nndist(X)) respectively.

The value is NA if npoints(X) < 2.

Value

A single numeric value (possibly NA).

Examples

# NOT RUN {
  min(nndist(swedishpines))
  minnndist(swedishpines)

  max(nndist(swedishpines))
  maxnndist(swedishpines)

  minnndist(lansing, positive=TRUE)

  if(interactive()) {
     X <- rpoispp(1e6)
     system.time(min(nndist(X)))
     system.time(minnndist(X))
  }
# }

Documentation reproduced from package spatstat, version 1.52-1, License: GPL (>= 2)

Community examples

Looks like there are no examples yet.