maspack.geometry

Class BVFeatureQuery.NearestKCollector<T>

java.lang.Object

maspack.geometry.BVFeatureQuery.NearestKCollector<T>

Type Parameters:

T - boundable class

All Implemented Interfaces:

BVFeatureQuery.ObjectDistanceCollector

Enclosing class:

BVFeatureQuery

public static class BVFeatureQuery.NearestKCollector<T>
extends java.lang.Object
implements BVFeatureQuery.ObjectDistanceCollector

Collects the nearest K boundables, as in a k-nearest-neighbor search

Constructor Summary

Constructors

Constructor and Description
NearestKCollector(int k)

Method Summary

Modifier and Type	Method and Description
boolean	add(Boundable object, double distance)
boolean	check(maspack.geometry.BVFeatureQuery.BVCheckRequest bvcr) Checks if a request has the potential to satisfy the condition, otherwise we can stop the search.
java.util.TreeSet<BVFeatureQuery.ObjectDistanceEntry<T>>	nearest() Retrieves the current set of nearest entries Note: could be < k if there are fewer than k bounded elements, and > k if the last several elements have the exact same distance

Methods inherited from class java.lang.Object

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

Constructor Detail

NearestKCollector

public NearestKCollector(int k)

Method Detail

check

public boolean check(maspack.geometry.BVFeatureQuery.BVCheckRequest bvcr)

Description copied from interface: BVFeatureQuery.ObjectDistanceCollector

Checks if a request has the potential to satisfy the condition, otherwise we can stop the search.

Specified by:

check in interface BVFeatureQuery.ObjectDistanceCollector

Parameters:

bvcr - request, containg BVNode and distance

Returns:

true if we should continue checking, false to signal quitting

add

public boolean add(Boundable object,
                   double distance)

Specified by:

add in interface BVFeatureQuery.ObjectDistanceCollector

nearest

public java.util.TreeSet<BVFeatureQuery.ObjectDistanceEntry<T>> nearest()

Retrieves the current set of nearest entries Note: could be < k if there are fewer than k bounded elements, and > k if the last several elements have the exact same distance

Returns:

(approximately) k nearest elements