|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectcom.vividsolutions.jts.index.strtree.AbstractSTRtree
com.vividsolutions.jts.index.strtree.STRtree
A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data.
The STR packed R-tree is simple to implement and maximizes space utilization; that is, as many leaves as possible are filled to capacity. Overlap between nodes is far less than in a basic R-tree. However, once the tree has been built (explicitly or on the first call to #query), items may not be added or removed.
Described in: P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With Application To GIS. Morgan Kaufmann, San Francisco, 2002.
Nested Class Summary |
Nested classes inherited from class com.vividsolutions.jts.index.strtree.AbstractSTRtree |
AbstractSTRtree.IntersectsOp |
Field Summary |
Fields inherited from class com.vividsolutions.jts.index.strtree.AbstractSTRtree |
root |
Constructor Summary | |
STRtree()
Constructs an STRtree with the default node capacity. |
|
STRtree(int nodeCapacity)
Constructs an STRtree with the given maximum number of child nodes that a node may have |
Method Summary | |
protected AbstractNode |
createNode(int level)
|
protected java.util.List |
createParentBoundables(java.util.List childBoundables,
int newLevel)
Creates the parent level for the given child level. |
protected java.util.List |
createParentBoundablesFromVerticalSlice(java.util.List childBoundables,
int newLevel)
|
protected java.util.Comparator |
getComparator()
|
protected AbstractSTRtree.IntersectsOp |
getIntersectsOp()
|
void |
insert(Envelope itemEnv,
java.lang.Object item)
Inserts an item having the given bounds into the tree. |
java.util.List |
query(Envelope searchEnv)
Returns items whose bounds intersect the given envelope. |
protected java.util.List[] |
verticalSlices(java.util.List childBoundables,
int sliceCount)
|
Methods inherited from class com.vividsolutions.jts.index.strtree.AbstractSTRtree |
boundablesAtLevel, build, compareDoubles, getNodeCapacity, getRoot, insert, lastNode, query |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public STRtree()
public STRtree(int nodeCapacity)
Method Detail |
protected java.util.List createParentBoundables(java.util.List childBoundables, int newLevel)
createParentBoundables
in class AbstractSTRtree
protected java.util.List createParentBoundablesFromVerticalSlice(java.util.List childBoundables, int newLevel)
protected java.util.List[] verticalSlices(java.util.List childBoundables, int sliceCount)
childBoundables
- Must be sorted by the x-value of the envelope midpointsprotected AbstractNode createNode(int level)
createNode
in class AbstractSTRtree
protected AbstractSTRtree.IntersectsOp getIntersectsOp()
getIntersectsOp
in class AbstractSTRtree
AbstractSTRtree.IntersectsOp
public void insert(Envelope itemEnv, java.lang.Object item)
insert
in interface SpatialIndex
public java.util.List query(Envelope searchEnv)
query
in interface SpatialIndex
searchEnv
- the envelope to query for
protected java.util.Comparator getComparator()
getComparator
in class AbstractSTRtree
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |