Scalable Nearest Neighbor Algorithms for High Dimensional Data

The main goal of this project is to implement several Data Structures(Trees) that are efficient for Nearest Neighbour Search in higher dimensional data. A detailed description of these Data Structures is presented in This paper.

The result of this project is documented in the following document.

NOTICE: The purpose of this project is educational. The corresponded library for the above-mentioned paper can be found here.