3 ms·
Typically, a better approach is branch and bound search using a variant of R-tree or Octtree, especially with axis aligned bounding boxes or circles. Ray castin
by AstralStorm 10y ago
Typically, a better approach is branch and bound search using a variant of R-tree or Octtree, especially with axis aligned bounding boxes or circles. Ray casting does not scale to many points while more advanced space partitioning does.
GeoHashing is a kind of binning technique.
Then there are manual volume hierarchies and partitioning based on similarity. Each solves a different problem.