- All Implemented Interfaces:
public class KdForestBbfNearestNeighbor<P> extends Object implements NearestNeighbor<P>
K-D tree search which searches through multiple trees. The search is performed using a Best-Bin-First approach
Nested Class Summary
setPointsDescription copied from interface:
NearestNeighborSpecifies the set of points which are to be searched.
createSearchDescription copied from interface:
NearestNeighborCreates a new search for this data structure. This is intended to enabled concurrent searches. After
NearestNeighbor.setPoints(java.util.List<P>, boolean)has been called and returned, each searched can be called independently in separate threads. Do not call
NearestNeighbor.setPoints(java.util.List<P>, boolean)which a search is being performed.