Biased Nearest Neighbour Search
Daniel Minor · 2015
The nearest neighbour search problem is to preprocess a set of points so that for any query point, the closest point in the set to that query point can be determined quickly.In the biased version of this problem a probability distribution over the search points is available that can be used to answer searches more efficiently on average.This thesis contains empirical results showing that practical implementations of data structures for the biased nearest neighbour search problem are possible.iii