smile.neighbor

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

public interface RNNSearch<K,V>

A range nearest neighbor search retrieves the nearest neighbors to a query in a range. It is a natural generalization of point and continuous nearest neighbor queries and has many applications.

Author:

Haifeng Li

Method Summary

Methods

Modifier and Type	Method and Description
void	range(K q, double radius, List<Neighbor<K,V>> neighbors) Search the neighbors in the given radius of query object, i.e.

Method Detail

range

void range(K q,
         double radius,
         List<Neighbor<K,V>> neighbors)

Search the neighbors in the given 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 in the given range on output.