On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions
In designing an algorithm to find pairs of points that are within Euclidean distance d it is effective to use a screening procedure to reject most pairs of points that are far apart. A procedure based on multiple, overlapping lattices can efficiently identify close points and exclude distant ones.
neighbour detection computational geometry