Package NetTopologySuite.Index.Strtree

Classes
class	AbstractNode< T, TItem >
	A node of an AbstractSTRtree{T, TItem}. A node is one of: empty an interior node containing child AbstractNode{T, TItem}s a leaf node containing data items (ItemBoundable{T, TItem}s). A node stores the bounds of its children, and its level within the index tree. More...
class	AbstractSTRtree< T, TItem >
	Base class for STRtree and SIRtree. 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. More...
class	BoundablePair< TItem >
	A pair of IBoundable{Envelope, TItem}s, whose leaf items support a distance metric between them. Used to compute the distance between the members, and to expand a member relative to the other in order to produce new branches of the Branch-and-Bound evaluation tree. Provides an ordering based on the distance between the members, which allows building a priority queue by minimum distance.
class	GeometryItemDistance
	An IItemDistance{Envelope, IGeometry} function for items which are IGeometry using the IGeometry.Distance(IGeometry) method. More...
interface	IBoundable
	A spatial object in an AbstractSTRtree. More...
interface	IItemDistance< T, TItem >
	A function method which computes the distance between two IBoundable{T, TItem}s in an STRtree{TItem}. Used for Nearest Neighbour searches. More...
class	Interval
	A contiguous portion of 1D-space. Used internally by SIRtree. More...
class	ItemBoundable< T, TItem >
	Boundable wrapper for a non-Boundable spatial object. Used internally by AbstractSTRtree. More...
class	SIRtree< TItem >
	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. More...
class	STRtree< TItem >
	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. More...