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

From Algorithm Wiki

Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Projected_radial_search_(k_Approximate_Nearest_Neighbors_Search_(k-ANNS)_for_a_dense_3D_map_of_geometric_points_Nearest_Neighbor_Search)&oldid=44356"