We can currently support approximate nearest neighbor search trivially by simply allowing neighbors that are at the current search radius + n. This means that we can be off by up to a distance of n. The performance gain should be high and it is easy to control precisely how much off you want to be (exactly by n at most).
We can currently support approximate nearest neighbor search trivially by simply allowing neighbors that are at the current search radius +
n. This means that we can be off by up to a distance ofn. The performance gain should be high and it is easy to control precisely how much off you want to be (exactly bynat most).