Abstract
Four procedures used to obtain the distribution of distances to the jth nearest neighbour in point-pattern analysis are evaluated by Monte Carlo simulation for seven pattern sizes and eight order distances. The mapping of point patterns onto a torus is found to be the most powerful technique, whilst the most useful procedure for non-rectangular regions requires the discarding of nearest-neighbour distances greater than the distance to the boundary.

This publication has 0 references indexed in Scilit: