Jianguo Wang
Abstract
A range nearest neighbor(RNN) query retrieves the nearest neighbor(NN) for every point in a range.It is a extension of point and continuous nearest neighbor queries.In this paper,we consider the ranges as rectangles,analyze RNN queries quality and describe the process of algorithm in 2D spaces.Last we evaluate the performance of the proposed algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A range nearest neighbor(RNN) query retrieves the nearest neighbor(NN) for every point in a range.It is a extension of point and continuous nearest neighbor queries.In this paper,we consider the ranges as rectangles,analyze RNN queries quality and describe the process of algorithm in 2D spaces.Last we evaluate the performance of the proposed algorithm.
Key concepts: k-nearest neighbors algorithm, Best bin first, Nearest neighbor search, Large margin nearest neighbor, Nearest neighbor graph, Fixed-radius near neighbors, Nearest-neighbor chain algorithm, Cover tree