Protected Member Functions |
std::auto_ptr< BoundableList > | createParentBoundables (BoundableList *childBoundables, int newLevel) |
| Sorts the childBoundables then divides them into groups of size M, where M is the node capacity.
|
AbstractNode * | createNode (int level) |
IntersectsOp * | getIntersectsOp () |
std::auto_ptr< BoundableList > | sortBoundables (const BoundableList *input) |
virtual AbstractNode * | lastNode (BoundableList *nodes) |
virtual AbstractNode * | getRoot () |
virtual void | insert (const void *bounds, void *item) |
| Also builds the tree, if necessary.
|
void | query (const void *searchBounds, std::vector< void * > &foundItems) |
| Also builds the tree, if necessary.
|
void | query (const void *searchBounds, ItemVisitor &visitor) |
| Also builds the tree, if necessary.
|
void | query (const void *searchBounds, const AbstractNode &node, ItemVisitor &visitor) |
bool | remove (const void *itemEnv, void *item) |
| Also builds the tree, if necessary.
|
std::auto_ptr< BoundableList > | boundablesAtLevel (int level) |
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.
- See Also
- STRtree