Projected radial search (k-ANNS for a dense 3D map of geometric points Nearest Neighbor Search)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(k)$

Space Complexity

$O({1})$ words

(Derived: There are 5 local variables and no tables or lists aside from input/output)

Description

Approximate?

Approximate

Approximation Factor: ?

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2013

Reference

http://www.araa.asn.au/acra/acra2013/papers/pap148s1-file1.pdf