Skip to content
This repository


Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP

Implementation of PKtrees in Haskell

branch: master
Octocat-spinner-32 Data cubeSearch (aka box search / rectangle search)
Octocat-spinner-32 debian Debianize
Octocat-spinner-32 .gitignore Debianize
Octocat-spinner-32 COPYING cabalize
Octocat-spinner-32 Makefile Debianize
Octocat-spinner-32 README cabalize
Octocat-spinner-32 Setup.hs cabalize
Octocat-spinner-32 Tests.hs test for radiusSearch
Octocat-spinner-32 pktree.cabal 0.2
This project aims to implement the great spatial index data structure, the PK tree, in Haskell.  The data structure is covered in the following papers, but the code is much easier to read than they are:

Something went wrong with that request. Please try again.