| Interface | Description |
|---|---|
| DistanceCalculator<T> |
A class that can calculate the distance to a given object
stored in the PRTree
|
| MBR |
A minimum bounding box for n dimensions.
|
| MBR2D |
A minimum bounding rectangle
|
| MBRConverter<T> |
A class that given a T can tell the minimum and maximum
ordinates for that object.
|
| NodeFilter<T> |
A node object filterer.
|
| PointND |
A description of an N-dimensional point
|
| Class | Description |
|---|---|
| AcceptAll<T> |
A filter that accepts all elements
|
| DistanceResult<T> |
Class to hold object and distance to it
|
| MinDist |
Class that can calculate the MINDIST between a point and a rectangle
|
| MinDist2D |
Class that can calculate the MINDIST between a point and a rectangle
|
| PRTree<T> |
A Priority R-Tree, a spatial index, for N dimensions.
|
| SimpleMBR |
An implementation of MBRND that keeps a double array with the max
and min values
|
| SimpleMBR2D |
An implementation of MBR that keeps 4 double values for the actual min and
max values needed.
|
| SimplePointND |
One implementatoin of a point
|
This r-tree uses interfaces to let the user control how bounding boxes are stored and how distances are calculated.