Skip to content

Latest commit

 

History

History
18 lines (12 loc) · 683 Bytes

README.md

File metadata and controls

18 lines (12 loc) · 683 Bytes

r-tree Hackage

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.