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
[1] Jon Louis Bentley,et al. K-d trees for semidynamic point sets , 1990, SCG '90.
[2] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[3] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[4] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.