pktree: Implementation of the PKTree spatial index data structure
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:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.411 http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.883 http://www.cs.umd.edu/~hjs/pubs/TR-4523.pdf
[Skip to Readme]
Downloads
- pktree-0.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1, 0.2 |
---|---|
Dependencies | base (>=4 && <5), containers [details] |
Tested with | ghc ==7.0.3 |
License | LicenseRef-OtherLicense |
Copyright | © 2011 Stephen Paul Weber |
Author | Stephen Paul Weber <singpolyma@singpolyma.net> |
Maintainer | Stephen Paul Weber <singpolyma@singpolyma.net> |
Category | Data |
Home page | https://github.com/singpolyma/pktree-haskell |
Bug tracker | https://github.com/singpolyma/pktree-haskell/issues |
Source repo | head: git clone git://github.com/singpolyma/pktree-haskell.git |
Uploaded | by StephenWeber at 2012-04-10T00:45:17Z |
Distributions | NixOS:0.2 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 1900 total (4 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |