vptversion
Vantage point tree implementation in OCaml
A vantage point tree allows to do fast but exact nearest neighbor searches in any space provided that you have a metric (function) to measure the distance between any two points in that space.
Bibliography
Yianilos, P. N. (1993, January). Data structures and algorithms for nearest neighbor search in general metric spaces. In Soda (Vol. 93, No. 194, pp. 311-21). http://dx.doi.org/10.1145/313559.313789
| Author | Francois BERENGER |
|---|---|
| License | BSD-3-Clause |
| Published | |
| Homepage | https://github.com/UnixJunkie/vp-tree |
| Issue Tracker | https://github.com/UnixJunkie/vp-tree/issues |
| Maintainer | unixjunkie@sdf.org |
| Dependencies |
|
| Source [http] | https://github.com/UnixJunkie/vp-tree/archive/v5.0.0.tar.gz sha256=9bdc6bd62397b4237979a00f802fa81346882a72a4e3ab039979414dc00c8d0d md5=898aec0cf703c15443f26ca42cde76d0 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/vpt/vpt.5.0.0/opam |
Required by
- lbvs_consent>=2.1.3
