Ranger: A Tool for Nearest Neighbor Search in High Dimensions

Abstract

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

DOI: 10.1145/160985.161178

Extracted Key Phrases

Cite this paper

@inproceedings{Murphy1993RangerAT, title={Ranger: A Tool for Nearest Neighbor Search in High Dimensions}, author={Michael Murphy and Steven Skiena}, booktitle={Symposium on Computational Geometry}, year={1993} }