Figure 1.

Schematic 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 ith sample point to the CI; H(1)i = the distance from the ith CI to its NN; H(2)i = the distance from the NN at the ith random point.

White et al. BMC Ecology 2008 8:6   doi:10.1186/1472-6785-8-6
Download authors' original image