package bst
Bisector tree implementation in OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
v6.0.0.tar.gz
sha256=7c6b4fd78a463b385c2dfced50c7aa4e0649378654a114415fdc7334a159ead8
md5=e3bafda0a2b705c5cd24e0710dee9c37
README.md.html
bisec-tree
Bisector tree implementation in OCaml.
A bisector tree allows to do fast and 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.
Cf. this article for details: "A Data Structure and an Algorithm for the Nearest Point Problem"; Iraj Kalaranti and Gerard McDonald. ieeexplore.ieee.org/iel5/32/35936/01703102.pdf
Figure: the Stanford bunny, consisting of 35947 3D points, guillotined by the first layer of a bisector tree.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>