Interface RNNSearch<K,V>

Type Parameters:
K - the type of keys.
V - the type of associated objects.
All Known Implementing Classes:
BKTree, CoverTree, KDTree, LinearSearch, LSH, MPLSH, MutableLSH, SNLSH
public interface RNNSearch<K,V>
Retrieves the nearest neighbors to a query in a radius. It is a natural generalization of point and continuous nearest neighbor queries and has many applications.

  • Method Summary

    Modifier and Type
    Method
    Description
    void
    search(K q, double radius, List<Neighbor<K,V>> neighbors)
    Retrieves the neighbors in a fixed radius of query object, i.e.

  • Method Details

    • search

      void search(K q, double radius, List<Neighbor<K,V>> neighbors)
      Retrieves the neighbors in a fixed radius of query object, i.e. d(q, v) <= radius.
      Parameters:
      q - the query key.
      radius - the radius of search range from target.
      neighbors - the list to store found neighbors on output.