com.vividsolutions.jts.index.intervalrtree
Class SortedPackedIntervalRTree
java.lang.Object
com.vividsolutions.jts.index.intervalrtree.SortedPackedIntervalRTree
- public class SortedPackedIntervalRTree
- extends java.lang.Object
A static index on a set of 1-dimensional intervals,
using an R-Tree packed based on the order of the interval midpoints.
It supports range searching,
where the range is an interval of the real line (which may be a single point).
A common use is to index 1-dimensional intervals which
are the projection of 2-D objects onto an axis of the coordinate system.
This index structure is static
- items cannot be added or removed once the first query has been made.
The advantage of this characteristic is that the index performance
can be optimized based on a fixed set of items.
- Author:
- Martin Davis
|
Method Summary |
void |
insert(double min,
double max,
java.lang.Object item)
Adds an item to the index which is associated with the given interval |
void |
query(double min,
double max,
ItemVisitor visitor)
Search for intervals in the index which intersect the given closed interval
and apply the visitor to them. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
SortedPackedIntervalRTree
public SortedPackedIntervalRTree()
insert
public void insert(double min,
double max,
java.lang.Object item)
- Adds an item to the index which is associated with the given interval
- Parameters:
min - the lower bound of the item intervalmax - the upper bound of the item intervalitem - the item to insert
query
public void query(double min,
double max,
ItemVisitor visitor)
- Search for intervals in the index which intersect the given closed interval
and apply the visitor to them.
- Parameters:
min - the lower bound of the query intervalmax - the upper bound of the query intervalvisitor - the visitor to pass any matched items to