Skip to content

ilcasinistareloaded/r-tree

 
 

Repository files navigation

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.

About

Haskell implementatio of R-Trees

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • Haskell 99.5%
  • Makefile 0.5%