Base class for STRtree and SIRtree. STR-packed R-trees are described in: P. Rigaux, Michel Scholl and Agnes Voisard. <i>Spatial Databases With Application To GIS.</i> Morgan Kaufmann, San Francisco, 2002.
This implementation is based on {link Boundable}s rather than {link AbstractNode}s, because the STR algorithm operates on both nodes and data, both of which are treated as Boundables.
This class is thread-safe. Building the tree is synchronized, and querying is stateless.
- See also
STRtree
SIRtree
- Version
1.7
- Companion
- class
Type members
Classlikes
A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds.
A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds.