Figure 1From: A comparison of plotless density estimators using Monte Carlo simulation on totally enumerated field data setsSchematic representation of how KM2P and BDAV3 are implemented in the field. Shading shows the search area less intersection used in the calculation of KM2P. R – the random sample point CI – closest individual; NN – nearest neighbor; 2NN – second nearest neighbor, R(1)i= the distance from the ithsample point to the CI; H(1)i= the distance from the ithCI to its NN; H(2)i= the distance from the NN at the ithrandom point.Back to article page