Skip to content
Implementation of PKtrees in Haskell
Find file
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.
Data cubeSearch (aka box search / rectangle search)
debian Debianize
COPYING cabalize
README cabalize
Setup.hs cabalize
Tests.hs test for radiusSearch
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.