R-/R*-trees.

R-trees and R*-trees. See the README for a brief overview of the data structures included in this package.

r-tree

A Haskell library for R-trees and R*-trees.

[!NOTE]

R-trees are self-balancing and as such can only be spine-strict.

Featuring:

• Data.R2Tree.*: two-dimensional R-tree with the R*-tree insertion algorithm.

  Double-based implementation is considered the default one; a Float-based variant is provided for cases where reduced precision is preferred, for example rendering.

Higher-dimensional R-trees are not currently provided, but should be trivial to add if needed.