r-tree: R-/R*-trees.

[ data-structures, library, mit ] [ Propose Tags ]

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


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 1.0.0.0
Change log CHANGELOG.md
Dependencies base (>=4.12 && <5), deepseq (>=1.4.3 && <1.6) [details]
License MIT
Copyright Sebastian Wagner, Birte Wagner, Oleksii Divak
Author Sebastian Wagner, Birte Wagner, Oleksii Divak
Maintainer Oleksii Divak <frozenwitness@gmail.com>
Category Data Structures
Home page https://github.com/sebastian-philipp/r-tree
Bug tracker https://github.com/sebastian-philipp/r-tree/issues
Source repo head: git clone https://github.com/sebastian-philipp/r-tree.git
Uploaded by OleksiiDivak at 2024-09-08T15:04:53Z
Distributions
Downloads 18 total (18 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2024-09-08 [all 1 reports]

Readme for r-tree-1.0.0.0

[back to package description]

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.