Jcross(X, i, j, eps=NULL, r=NULL, breaks=NULL, ..., correction=NULL)X from which distances are measured.
A character string (or something that will be converted to a
character string).
Defaults to the first level of marks(X).X to which distances are measured.
A character string (or something that will be
converted to a character string).
Defaults to the second level of marks(X).r.
Not normally invoked by the user. See the Details section."none", "rs", "km",
"Hanisch" and "best"."fv" (see fv.object).Essentially a data frame containing six numeric columns
Gdot and Fest."G" and "F"
which are respectively the outputs of Gcross
and Fest for the point pattern.i and j are always interpreted as
levels of the factor X$marks. They are converted to character
strings if they are not already character strings.
The value i=1 does not
refer to the first level of the factor.Jcross and its companions
Jdot and Jmulti
are generalisations of the function Jest
to multitype point patterns. A multitype point pattern is a spatial pattern of
points classified into a finite number of possible
``colours'' or ``types''. In the X must be a point pattern (object of class
"ppp") or any data that are acceptable to as.ppp.
It must be a marked point pattern, and the mark vector
X$marks must be a factor.
The argument i will be interpreted as a
level of the factor X$marks. (Warning: this means that
an integer value i=3 will be interpreted as the number 3,
not the 3rd smallest level).
The ``type $i$ to type $j$'' multitype $J$ function
of a stationary multitype point process $X$
was introduced by Van lieshout and Baddeley (1999). It is defined by
$$J_{ij}(r) = \frac{1 - G_{ij}(r)}{1 -
F_{j}(r)}$$
where $G_{ij}(r)$ is the distribution function of
the distance from a type $i$ point to the nearest point of type $j$,
and $F_{j}(r)$ is the distribution
function of the distance from a fixed point in space to the nearest
point of type $j$ in the pattern.
An estimate of $J_{ij}(r)$ is a useful summary statistic in exploratory data analysis of a multitype point pattern. If the subprocess of type $i$ points is independent of the subprocess of points of type $j$, then $J_{ij}(r) \equiv 1$. Hence deviations of the empirical estimate of $J_{ij}$ from the value 1 may suggest dependence between types.
This algorithm estimates $J_{ij}(r)$
from the point pattern X. It assumes that X can be treated
as a realisation of a stationary (spatially homogeneous)
random spatial point process in the plane, observed through
a bounded window.
The window (which is specified in X as X$window)
may have arbitrary shape.
Biases due to edge effects are
treated in the same manner as in Jest,
using the Kaplan-Meier and border corrections.
The main work is done by Gmulti and Fest.
The argument r is the vector of values for the
distance $r$ at which $J_{ij}(r)$ should be evaluated.
The values of $r$ must be increasing nonnegative numbers
and the maximum $r$ value must exceed the radius of the
largest disc contained in the window.
Van Lieshout, M.N.M. and Baddeley, A.J. (1999) Indices of dependence between types in multivariate point patterns. Scandinavian Journal of Statistics 26, 511--532.
Jdot,
Jest,
Jmulti# Lansing woods data: 6 types of trees
data(lansing)
<testonly>lansing <- lansing[seq(1,lansing$n, by=30), ]</testonly>
Jhm <- Jcross(lansing, "hickory", "maple")
# diagnostic plot for independence between hickories and maples
plot(Jhm)
# synthetic example with two types "a" and "b"
pp <- runifpoint(30) %mark% factor(sample(c("a","b"), 30, replace=TRUE))
J <- Jcross(pp)Run the code above in your browser using DataLab