package strtree
- Alphabetic
- Public
- Protected
Type Members
- abstract class AbstractNode extends Boundable with Serializable
A node of an {link AbstractSTRtree}.
A node of an {link AbstractSTRtree}. A node is one of:
- empty
- an interior node containing child {link AbstractNode}s
- a leaf node containing data items ({link ItemBoundable}s).
A node stores the bounds of its children, and its level within the index tree.
- Annotations
- @SerialVersionUID()
- Version
1.7
- abstract class AbstractSTRtree extends Serializable
- Annotations
- @SerialVersionUID()
- trait Boundable extends AnyRef
A spatial object in an AbstractSTRtree.
A spatial object in an AbstractSTRtree.
- Version
1.7
- class BoundablePair extends Comparable[BoundablePair]
- class BoundablePairDistanceComparator extends Comparator[BoundablePair] with Serializable
The Class BoundablePairDistanceComparator.
The Class BoundablePairDistanceComparator. It implements Java comparator and is used as a parameter to sort the BoundablePair list.
- class GeometryItemDistance extends ItemDistance
An {link ItemDistance} function for items which are {link Geometry}s, using the {link Geometry#distance(Geometry)} method.
An {link ItemDistance} function for items which are {link Geometry}s, using the {link Geometry#distance(Geometry)} method.
To make this distance function suitable for using to query a single index tree, the distance metric is anti-reflexive. That is, if the two arguments are the same Geometry object, the distance returned is {link Double.MAX_VALUE}.
- class Interval extends AnyRef
A contiguous portion of 1D-space.
A contiguous portion of 1D-space. Used internally by SIRtree.
- Version
1.7
- See also
SIRtree
- class ItemBoundable extends Boundable with Serializable
Boundable wrapper for a non-Boundable spatial object.
Boundable wrapper for a non-Boundable spatial object. Used internally by AbstractSTRtree.
- Version
1.7
- trait ItemDistance extends AnyRef
A function method which computes the distance between two {link ItemBoundable}s in an {link STRtree}.
A function method which computes the distance between two {link ItemBoundable}s in an {link STRtree}. Used for Nearest Neighbour searches.
To make a distance function suitable for querying a single index tree via {link STRtree#nearestNeighbour(ItemDistance)} , the function should have a non-zero reflexive distance. That is, if the two arguments are the same object, the distance returned should be non-zero. If it is required that only pairs of distinct items be returned, the distance function must be anti-reflexive, and must return {link Double#MAX_VALUE} for identical arguments.
- class STRtree extends AbstractSTRtree with SpatialIndex[Any] with Serializable
- Annotations
- @SerialVersionUID()
Value Members
- object AbstractSTRtree extends Serializable
Base class for STRtree and SIRtree.
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.
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.
- Annotations
- @SerialVersionUID()
- Version
1.7
- See also
STRtree
SIRtree
- object BoundablePair
A pair of {link Boundable}s, whose leaf items support a distance metric between them.
A pair of {link Boundable}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.
- object EnvelopeDistance
Functions for computing distances between {link Envelope}s.
- object STRtree extends Serializable
A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm.
A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data. <P> 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. <P> Described in: P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With Application To GIS. Morgan Kaufmann, San Francisco, 2002.
Note that inserting items into a tree is not thread-safe. Inserting performed on more than one thread must be synchronized externally.
Querying a tree is thread-safe. The building phase is done synchronously, and querying is stateless.
- Annotations
- @SerialVersionUID()
- Version
1.7