Ranger: a tool for nearest neighbor search in high dimensions

Nearest neighbor search is one of the fundamental problems in computational geometry. Traditional Voronoi diagram-based methods lose appeal in higher dimensions, in favor of multidimensional search trees. Ranger is a tool for visualizing and experimenting with nearest neighbor and orthogonal range queries in highdimensional data sets, using multidimensional search trees. Four different search data structures are supported by Ranger