An n-dimensional r*-tree implementation.
This crate implements a flexible, n-dimensional r-tree implementation with the r* (r star) insertion strategy.
An r-tree is a data structure containing spatial data and is optimized for nearest neighbor search. Spatial data refers to an object that has the notion of a position and extent, for example points, lines and rectangles in any dimension.
The crate’s main data structure and documentation is struct RTree.
Also, the pre-defined primitives like lines and rectangles contained in the primitives module may be of interest for a quick start.
serde feature for Serde support.
Contains primitives ready for insertion into an r-tree.
An n-dimensional axis aligned bounding box (AABB).
The default parameters used when creating an r-tree without specific parameters.
Represents an internal parent node.
An n-dimensional r-tree data structure.
Inserts points according to the r-star heuristic.
An internal tree node.
An envelope type that encompasses some child nodes.
Defines how points are inserted into an r-tree.
Defines a point type that is compatible with rstar.
Defines objects which can calculate their minimal distance to a point.
Defines a number type that is compatible with rstar.
An object that can be inserted into an r-tree.
Defines static parameters for an r-tree.
Advanced trait to iterate through an r-tree. Usually it should no be required to be implemented.