An R-tree created using the Sort-Tile-Recursive (STR) algorithm, described in: P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With Application To GIS. Morgan Kaufmann, San Francisco, 2002.
For a list of all members of this type, see STRtree Members.
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.
This implementation is based on Rectangles rather than Nodes, because the STR algorithm operates on both nodes and items, both of which are treated here as Rectangles (using the Composite design pattern). [Jon Aquino]
Namespace: Geotools.Index.STRTree Namespace