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

Within a dataset of nn points in a dense 3D geometric map, find approximately the kk closest points to a specified point.

Parameters

  • nn: number of points in dataset
  • kk: number of neighbors to find

Related Problems

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 1 of 1 algorithms

See more
Projected radial search2013O(nlog⁡n)O(n \log n)O(n)O(n)

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table