|
||||||||||
| 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)
|
int |
depth()
Returns the number of items in the tree. |
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. |
void |
query(Envelope searchEnv,
ItemVisitor visitor)
Returns items whose bounds intersect the given envelope. |
boolean |
remove(Envelope itemEnv,
java.lang.Object item)
Removes a single item from the tree. |
int |
size()
Returns the number of items in the tree. |
protected java.util.List[] |
verticalSlices(java.util.List childBoundables,
int sliceCount)
|
| Methods inherited from class com.vividsolutions.jts.index.strtree.AbstractSTRtree |
boundablesAtLevel, build, compareDoubles, depth, getNodeCapacity, getRoot, insert, lastNode, query, query, remove, size |
| 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 AbstractSTRtreeprotected AbstractSTRtree.IntersectsOp getIntersectsOp()
getIntersectsOp in class AbstractSTRtreeAbstractSTRtree.IntersectsOp
public void insert(Envelope itemEnv,
java.lang.Object item)
insert in interface SpatialIndexpublic java.util.List query(Envelope searchEnv)
query in interface SpatialIndexsearchEnv - the envelope to query for
public void query(Envelope searchEnv,
ItemVisitor visitor)
query in interface SpatialIndexsearchEnv - the envelope to query forvisitor - a visitor object to apply to the items found
public boolean remove(Envelope itemEnv,
java.lang.Object item)
remove in interface SpatialIndexitemEnv - the Envelope of the item to removeitem - the item to remove
true if the item was foundpublic int size()
size in class AbstractSTRtreepublic int depth()
depth in class AbstractSTRtreeprotected java.util.Comparator getComparator()
getComparator in class AbstractSTRtree
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||