K-ANNS for a dense 3D map of geometric points: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    28 April 2023

    • curprev 10:0810:08, 28 April 2023‎ Admin talk contribs‎ 887 bytes +887‎ Created page with "{{DISPLAYTITLE:k-ANNS for a dense 3D map of geometric points (Nearest Neighbor Search)}} == Description == Within a dataset of $n$ points in a dense 3D geometric map, find approximately the $k$ closest points to a specified point. == Related Problems == Generalizations: k Approximate Nearest Neighbors Search Related: k Nearest Neighbors Search == Parameters == $n$: number of points in dataset $k$: number of neighbors to find == Table of Algorithms ==..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/K-ANNS_for_a_dense_3D_map_of_geometric_points"