| com.vividsolutions.jts.index.bintree |
|
Contains classes that implement a Binary Interval Tree index
|
| Java Source File Name | Type | Comment |
| Bintree.java | Class | An BinTree (or "Binary Interval Tree")
is a 1-dimensional version of a quadtree.
It indexes 1-dimensional intervals (which of course may
be the projection of 2-D objects on an axis).
It supports range searching
(where the range may be a single point).
This implementation does not require specifying the extent of the inserted
items beforehand. |
| Interval.java | Class | Represents an (1-dimensional) closed interval on the Real number line. |
| Key.java | Class | A Key is a unique identifier for a node in a tree.
It contains a lower-left point and a level number. |
| Node.java | Class | A node of a
Bintree . |
| NodeBase.java | Class | The base class for nodes in a
Bintree . |
| Root.java | Class | The root node of a single
Bintree . |