data-r-tree (hackage): 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.
Keywords: data-structures|library|mit|haskell|r-tree