k Nearest Neighbors Search (Nearest Neighbor Search)

From Algorithm Wiki
Revision as of 07:52, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


Within a dataset of $n$ points, find the $k$ closest points to a specified point.

Related Problems

Subproblem: k Approximate Nearest Neighbors Search

Related: k-ANNS for a dense 3D map of geometric points


$n$: number of points in dataset

$k$: number of neighbors to find

Table of Algorithms

Currently no algorithms in our database for the given problem.