rPenttinen(beta, gamma=1, R, W = owin(), expand=TRUE, nsim=1, drop=TRUE)"owin") in which to
generate the random pattern.FALSE, simulation is performed
in the window W, which must be rectangular.
If TRUE (the default), simulation is performed
on a larger window, and the result is clipped to the original
windnsim=1 and drop=TRUE (the default), the
result will be a point pattern, rather than a list
containing a point pattern.W
using a Penttinen (1984, Example 2.1, page 18), citing Cormack (1979), described the pairwise interaction point process with interaction factor $$h(d) = e^{\theta A(d)} = \gamma^{A(d)}$$ between each pair of points separated by a distance $d$. Here $A(d)$ is the area of intersection between two discs of radius $R$ separated by a distance $d$, normalised so that $A(0) = 1$.
The simulation algorithm used to generate the point pattern
is rmh, whose output
is only approximately correct).
There is a tiny chance that the algorithm will
run out of space before it has terminated. If this occurs, an error
message will be generated.
}
nsim = 1, a point pattern (object of class "ppp").
If nsim > 1, a list of point patterns.
Berthelsen, K.K. and
Cormack, R.M. (1979) Spatial aspects of competition between individuals. Pages 151--212 in Spatial and Temporal Analysis in Ecology, eds. R.M. Cormack and J.K. Ord, International Co-operative Publishing House, Fairland, MD, USA.
Penttinen, A. (1984)
Modelling Interaction in Spatial Point Patterns:
Parameter Estimation by the Maximum Likelihood Method.
rmh,
Penttinen.
rStrauss,
rHardcore,
rStraussHard,
rDiggleGratton,
rDGS.