Class SIRtree

Hierarchy: Object , AbstractSTRtree, SIRtree

All Implemented Interfaces: Serializable

public class SIRtree
extends AbstractSTRtree

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.

This class is thread-safe. Building the tree is synchronized, and querying is stateless.

See also:: STRtree

Other

version: 1.7

public SIRtree()

Constructs an SIRtree with the default node capacity.

public SIRtree(int nodeCapacity)

Constructs an SIRtree with the given maximum number of child nodes that a node may have

protected AbstractNode createNode(int level)

public void insert(double x1, double x2, Object item)

Inserts an item having the given bounds into the tree.

public List query(double x)

Returns items whose bounds intersect the given value.

public List query(double x1, double x2)

Returns items whose bounds intersect the given bounds.

Parameters:: x1 - x1 possibly equal to x2

protected IntersectsOp getIntersectsOp()

protected Comparator getComparator()