spatgraphs-rclustercounts {spatgraphs}R Documentation

Compute clustercounts

Description

Compute clustercounts (componentcounts) of a point pattern graph. Two graphs are supported: geometric and mutual k-nearest neighbour (mknn). These are both symmetric graphs with suitable parameters 'k' and 'R'.

Arguments

pp Point pattern with at least members x,y,n
R If Geometric graph, the vector of R for which the clustercount is needed. R>0!!!!
k If mknn-graph, the vector of k for which the clustercount is needed.
graph 1 = geometric, 2 = mknn

Details

Date: 2007-02-26
License: GPL v2 or later

Value

Returns a with the counts as 'n' and 'r' or 'k' depending on the graph.

Examples

library(spatstat)
p<-rpoispp(100)
R<-seq(0.0001,0.25,length=50)
result1<-rclustercounts(p,R=R,graph=1)
k<-1:10
result2<-rclustercounts(p,k=k,graph=2)
par(mfrow=c(1,2))
plot(result1$r,result1$n,type="l",main="Geometric graph")
plot(result2$k,result2$n,type="l",main="Mutual k-nearest neighbours graph");

[Package spatgraphs version 0.2 Index]