Package | Description |
---|---|
org.khelekore.prtree |
The classes for PRTree, a Priority R-Tree.
|
Modifier and Type | Class and Description |
---|---|
class |
SimpleMBR
An implementation of MBRND that keeps a double array with the max
and min values
|
Modifier and Type | Method and Description |
---|---|
MBR |
PRTree.getMBR()
Get an N dimensional minimum bounding box of the data stored
in this tree.
|
MBR |
MBR.union(MBR mbr)
Return a new MBR that is the union of this mbr and the other
|
MBR |
SimpleMBR.union(MBR mbr) |
Modifier and Type | Method and Description |
---|---|
Iterable<T> |
PRTree.find(MBR query)
Find all objects that intersect the given rectangle.
|
void |
PRTree.find(MBR query,
List<T> resultNodes)
Finds all objects that intersect the given rectangle and stores
the found node in the given list.
|
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.
|
static double |
MinDist.get(MBR mbr,
PointND p)
Calculate the MINDIST between the given MBRND and the given point
|
boolean |
MBR.intersects(MBR other)
Check if the other MBR intersects this one
|
boolean |
SimpleMBR.intersects(MBR other) |
MBR |
MBR.union(MBR mbr)
Return a new MBR that is the union of this mbr and the other
|
MBR |
SimpleMBR.union(MBR mbr) |