(1+ε)-approximate nearest neighbor search is a special case of the nearest neighbor search problem. The solution to the (1+ε)-approximate nearest neighbor search is a point or multiple points within distance (1+ε) R from a query point, where R is the distance between the query point and its true nearest neighbor.
There are no implementations available for this algorithm yet.
About the speed performance (complexity)?
How much readable is this code?
This code compiles?
AlgPedia - 2014
A project made by Computer Science students of UFRJ.