package vpt
Vantage point tree implementation in OCaml.
Install
Dune Dependency
Authors
Maintainers
Sources
v3.0.0.tar.gz
sha256=92799a8dc0365b616ecd619a01aea470749beca005001ff78dffc9f6d8b4fc4c
md5=172f210c7ac22193f26a96472f8fb1e4
README.md.html
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).
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>