package vpt
Vantage point tree implementation in OCaml.
Install
Dune Dependency
Authors
Maintainers
Sources
v3.0.1.tar.gz
sha256=ea83d6a16090835b047e5254dc406e415eaf9b672f0e9b517234f118a0399795
md5=ff4362283a59f3f84d560d1a1975e7fd
Description
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.
Published: 22 Jan 2018
README
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)"
>
On This Page