org.ddogleg.nn.alg

Class KdTreeSearchNBbf

java.lang.Object

org.ddogleg.nn.alg.KdTreeSearchBestBinFirst

org.ddogleg.nn.alg.KdTreeSearchNBbf

All Implemented Interfaces:

KdTreeSearchN

public class KdTreeSearchNBbf
extends KdTreeSearchBestBinFirst
implements KdTreeSearchN

Implementation of KdTreeSearchBestBinFirst which searches for the N nearest-neighbors.

Constructor Summary

Constructors

Constructor and Description
KdTreeSearchNBbf(int maxNodesSearched) Configures the search

Method Summary

Modifier and Type	Method and Description
void	findNeighbor(double[] target, int searchN, FastQueue<KdTreeResult> results) Searches for the N nearest-neighbors to the target.

Methods inherited from class org.ddogleg.nn.alg.KdTreeSearchBestBinFirst

_findClosest, setMaxDistance, setTree, setTrees

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface org.ddogleg.nn.alg.KdTreeSearchN

setMaxDistance, setTree

Constructor Detail

KdTreeSearchNBbf

public KdTreeSearchNBbf(int maxNodesSearched)

Configures the search

Parameters:

maxNodesSearched - Maximum number of nodes it will search. Used to limit CPU time.

Method Detail

findNeighbor

public void findNeighbor(double[] target,
                         int searchN,
                         FastQueue<KdTreeResult> results)

Description copied from interface: KdTreeSearchN

Searches for the N nearest-neighbors to the target. The results are added to the 'results' list.

Specified by:

findNeighbor in interface KdTreeSearchN

Parameters:

target - Point whose nearest neighbor is being searched for

searchN - Number of closest points it will find. Must be >= 1

results - Storage for the found neighbors.