Package | Description |
---|---|
ags.utils.dataStructures.trees.thirdGenKD |
Modifier and Type | Class and Description |
---|---|
class |
SquareEuclideanDistanceFunction |
Modifier and Type | Method and Description |
---|---|
MaxHeap<T> |
KdTree.findNearestNeighbors(double[] searchPoint,
int maxPointsReturned,
DistanceFunction distanceFunction) |
NearestNeighborIterator<T> |
KdTree.getNearestNeighborIterator(double[] searchPoint,
int maxPointsReturned,
DistanceFunction distanceFunction) |
protected static <T> void |
KdTree.nearestNeighborSearchStep(MinHeap<ags.utils.dataStructures.trees.thirdGenKD.KdNode<T>> pendingPaths,
MaxHeap<T> evaluatedPoints,
int desiredPoints,
DistanceFunction distanceFunction,
double[] searchPoint) |
Constructor and Description |
---|
NearestNeighborIterator(ags.utils.dataStructures.trees.thirdGenKD.KdNode<T> treeRoot,
double[] searchPoint,
int maxPointsReturned,
DistanceFunction distanceFunction) |
Copyright © 2015. All rights reserved.