UnixJunkie/vp-tree
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
Vantage point tree implementation in OCaml
71 commits 1 branch 7 tags 269 KiB
  • OCaml 90.4%
  • Standard ML 8.5%
  • Makefile 1%
  • Dune 0.1%
Find a file
Exact
François Bérenger 65b10e18f0
 Merge pull request #22 from Leonidas-from-XIV/ocaml-dependency 
Add a dependency on `ocaml`
2025-04-22 09:40:43 +01:00
doc added doc/Yianilos_vpt_10.1.1.41.4193.pdf 2017-12-22 15:42:52 +09:00
src correct several unused variables detected by dune 2021-11-05 11:38:44 +09:00
dune-project Switch to dune (and fix two warnings) 2021-11-04 19:54:29 -05:00
LICENSE Initial commit 2017-03-22 08:56:01 -05:00
Makefile repair test target in Makefile 2021-11-05 11:38:31 +09:00
plot.gpl added gnuplot script plot.gpl to plot test results 2018-01-05 10:35:36 +09:00
README.md updated README 2018-01-04 13:49:33 +09:00
vpt.opam Add a dependency on ocaml 2025-04-17 16:23:31 +02:00

README.md

vp-tree

A vantage point tree implementation in OCaml.

Cf. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.4193&rep=rep1&type=pdf for details.

A vantage point tree allows to do fast but exact nearest neighbor searches in any space provided that you have a distance function to measure the distance between any two points in that space.

This implementation might need some tweaks in case it is used to index a very large number of points (especially the select_vp function in the code).