com.vividsolutions.jts.index.strtree
Class SIRtree
One-dimensional version of an STR-packed R-tree. SIR stands for
"Sort-Interval-Recursive". STR-packed R-trees are described in:
P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With
Application To GIS. Morgan Kaufmann, San Francisco, 2002.
SIRtree() - Constructs an SIRtree with the default node capacity.
|
SIRtree(int nodeCapacity) - Constructs an SIRtree with the given maximum number of child nodes that
a node may have
|
boundablesAtLevel , build , compareDoubles , createNode , createParentBoundables , depth , depth , getComparator , getIntersectsOp , getNodeCapacity , getRoot , insert , lastNode , query , remove , size , size |
SIRtree
public SIRtree()
Constructs an SIRtree with the default node capacity.
SIRtree
public SIRtree(int nodeCapacity)
Constructs an SIRtree with the given maximum number of child nodes that
a node may have
insert
public void insert(double x1,
double x2,
Object item)
Inserts an item having the given bounds into the tree.
query
public List query(double x)
Returns items whose bounds intersect the given value.
query
public List query(double x1,
double x2)
Returns items whose bounds intersect the given bounds.
x1
- possibly equal to x2