作者: Kenneth L. Clarkson
DOI:
关键词: Theoretical computer science 、 Mathematics 、 Range searching 、 Metric (mathematics) 、 Fisher information metric 、 Nearest neighbor search 、 Discrete mathematics 、 Equilateral dimension 、 Convex metric space 、 Metric space 、 Intrinsic metric
摘要: Given a set S of points in metric space with distance function D, the nearest-neighbor searching problem is to build data structure for so that an input query point q, s 2 minimizes D(s,q) can be found quickly. We survey approaches this problem, and its relation concepts dimension. Several measures dimension estimated using searching, while others used estimate cost searching. In recent years, several structures have been proposed are provably good low-dimensional spaces, some particular These other surveyed.