|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use KdTree.Entry | |
|---|---|
| ags.utils.dataStructures.trees.secondGenKD | Adapted Version of Rednaxela's Kd-tree implementation. |
| Uses of KdTree.Entry in ags.utils.dataStructures.trees.secondGenKD |
|---|
| Methods in ags.utils.dataStructures.trees.secondGenKD that return types with arguments of type KdTree.Entry | |
|---|---|
List<KdTree.Entry<T>> |
KdTree.nearestNeighbor(double[] location,
int count,
boolean sequentialSorting)
Calculates the nearest 'count' points to 'location' |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||