This algorithm generates a realisation of the
general Neyman-Scott process, with the cluster mechanism
given by the function rcluster
.
The clusters must have a finite maximum possible radius rmax
. First, the algorithm
generates a Poisson point process of ``parent'' points
with intensity lambda
. Here lambda
may be a single
positive number, a function lambda(x, y)
, or a pixel image
object of class "im"
(see im.object
).
See rpoispp
for details.
Second, each parent point is
replaced by a random cluster of points, created by calling the
function rcluster
.
The function rcluster
should expect to be called as
rcluster(xp[i],yp[i],...)
for each parent point at a location
(xp[i],yp[i])
. The return value of rcluster
should be a list with elements
x,y
which are vectors of equal length giving the absolute
$x$ and y
coordinates of the points in the cluster.