Package | Description |
---|---|
org.khelekore.prtree |
The classes for PRTree, a Priority R-Tree.
|
Modifier and Type | Class and Description |
---|---|
class |
AcceptAll<T>
A filter that accepts all elements
|
Modifier and Type | Method and Description |
---|---|
void |
PRTree.find(double xmin,
double ymin,
double xmax,
double ymax,
List<T> resultNodes,
NodeFilter<T> filter)
Finds all objects that intersect the given rectangle and stores
the found node in the given list.
|
Iterable<T> |
PRTree.find(double xmin,
double ymin,
double xmax,
double ymax,
NodeFilter<T> filter)
Find all objects that intersect the given rectangle.
|
void |
PRTree.find(MBR query,
List<T> resultNodes,
NodeFilter<T> filter)
Finds all objects that intersect the given rectangle and stores
the found node in the given list.
|
Iterable<T> |
PRTree.find(MBR query,
NodeFilter<T> filter)
Find all objects that intersect the given rectangle.
|
List<DistanceResult<T>> |
PRTree.nearestNeighbour(DistanceCalculator<T> dc,
NodeFilter<T> filter,
int maxHits,
PointND p)
Get the nearest neighbour of the given point
|