rThomas(kappa, sigma, mu, win = owin(c(0,1),c(0,1)))"owin"
    or something acceptable to as.owin."ppp").  Additionally,  some intermediate results of the simulation are
  returned as attributes of this point pattern.
  See rNeymanScott.
kappa. Then each parent point is
  replaced by a random cluster of points, the number of points
  per cluster being Poisson (mu) distributed, and their
  positions being isotropic Gaussian displacements from the
  cluster parent location.  This classical model can be fitted to data by the method of minimum contrast,
  using thomas.estK or kppm.
  
  The algorithm can also generate spatially inhomogeneous versions of
  the Thomas process:
  
kappais afunction(x,y)or a pixel image (object of class"im"), then it is taken
    as specifying the intensity function of an inhomogeneous Poisson
    process that generates the parent points.muis afunction(x,y)or a pixel image (object of class"im"), then it is
    interpreted as the reference density for offspring points,
    in the sense of Waagepetersen (2006).
    For a given parent point, the offspring constitute a Poisson process
    with intensity function equal tomu(x,y) * f(x,y)wherefis the Gaussian density centred at the parent point.kappa is a single number)
  and the offspring are inhomogeneous (mu is a
  function or pixel image), the model can be fitted to data
  using kppm, or 
  using thomas.estK applied to the inhomogeneous
  $K$ function.rpoispp,
rMatClust,
rGaussPoisson,
rNeymanScott,
thomas.estK,
kppm#homogeneous
  X <- rThomas(10, 0.2, 5)
  #inhomogeneous
  Z <- as.im(function(x,y){ 5 * exp(2 * x - 1) }, owin())
  Y <- rThomas(10, 0.2, Z)Run the code above in your browser using DataLab