Computes local second-order neighbour density estimates for an univariate spatial point pattern, i.e. the number of neighbours per unit area within sample circles of regularly increasing radii \(r\), centred at each point of the pattern (see Details).
kval(p, upto, by)A list of class c("vads","kval") with essentially the following components:
a vector of regularly spaced out distances (seq(by,upto,by)).
a data frame with 2 components giving \((x,y)\) coordinates of points of the pattern.
a matrix of size \((length(xy),length(r))\) giving individual values of the pair density function \(g(r)\).
a matrix of size \((length(xy),length(r))\) giving individual values of the neighbour density function \(n(r)\).
a matrix of size \((length(xy),length(r))\) giving individual values of Ripley's function \(K(r)\).
a matrix of size \((length(xy),length(r))\) giving individual values the modified Ripley's function \(L(r)\).
a "spp" object defining a spatial point pattern in a given sampling window (see spp).
maximum radius of the sample circles (see Details).
interval length between successive sample circles radii (see Details).
Function kval ignores the marks of multivariate and marked point patterns (they are all considered to be univariate patterns).
Function kval returns individual values of K(r) and associated functions (see kfun)
estimated for each point of the pattern. For a given distance r, these values can be mapped within the sampling window
(Getis & Franklin 1987, P?Pelissier & Goreaud 2001).
Getis, A. and Franklin, J. 1987. Second-order neighborhood analysis of mapped point patterns. Ecology, 68:473-477.
P?Pelissier, R. and Goreaud, F. 2001. A practical approach to the study of spatial structure in simple cases of heterogeneous vegetation. Journal of Vegetation Science, 12:99-108.
plot.vads,
kfun,
dval,
k12val.