Sparse -Navigable Graphs in Euclidean Space via Steiner PointsResearch Paper
Most practical systems for approximate nearest neighbor search in high dimension store the data set as a directed graph and answer a query by greedy search: starting at some vertex, as long as an out-neighbor of the current vertex is closer to than the current vertex is, move to the out-neighbor closest to ; when no such neighbor…