Resolution:
## 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 i^{th }sample point to the CI; H_{(1)i }= the distance from the i^{th }CI to its NN; H_{(2)i }= the distance from the NN at the i^{th }random point.
White |