https://github.com/sebastian-philipp/r-tree

Haskell implementatio of R-Trees
https://github.com/sebastian-philipp/r-tree

haskell r-tree

Last synced: 6 months ago
JSON representation

Haskell implementatio of R-Trees

• Host: GitHub
• URL: https://github.com/sebastian-philipp/r-tree
• Owner: sebastian-philipp
• License: mit
• Created: 2014-03-30T01:18:09.000Z (almost 12 years ago)
• Default Branch: master
• Last Pushed: 2024-09-08T15:35:59.000Z (over 1 year ago)
• Last Synced: 2025-06-28T17:10:16.568Z (7 months ago)
• Topics: haskell, r-tree
• Language: Haskell
• Size: 209 KB
• Stars: 12
• Watchers: 2
• Forks: 12
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: changelog.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# r-tree [![Hackage](http://img.shields.io/hackage/v/r-tree.svg)](https://hackage.haskell.org/package/r-tree)

A Haskell library for [R-trees](https://en.wikipedia.org/wiki/R-tree) and [R\*-trees](https://en.wikipedia.org/wiki/R\*-tree).

> [!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.