Namespace NetTopologySuite.Index.Bintree

Contains classes that implement a Binary Interval Tree index

Classes

Bintree

Bintree<T>

An BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree. It indexes 1-dimensional intervals (which may be the projection of 2-D objects on an axis). It supports range searching (where the range may be a single point).

Interval

Represents an (1-dimensional) closed interval on the Real number line.

Key

A Key is a unique identifier for a node in a tree. It contains a lower-left point and a level number. The level number is the power of two for the size of the node envelope.

NodeBase<T>

The base class for nodes in a Bintree.

Node<T>

A node of a Bintree.

Root<T>

The root node of a single Bintree. It is centred at the origin, and does not have a defined extent.