Skip to content
Haskell implementatio of R-Trees
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
Data
test
.gitignore
LICENSE
Makefile
README.md
Setup.hs
changelog.md
data-r-tree.cabal

README.md

R-Trees (and in the future also R*-Trees)

R-Tree is a spatial data structure similar to Quadtrees or B-Trees.

An R-Tree is a balanced tree and optimized for lookups. This implemetation useses an R-Tree to privide a map to arbitrary values.

Some function names clash with "Prelude" names, therefore this module is usually imported qualified, e.g.:

> import           Data.RTree (RTree)
> import qualified Data.RTree as RT

this implemetation is incomplete at the moment. Feel free to send comments, patches or merge requests.

You can’t perform that action at this time.