bst

Bisector tree implementation in OCaml.
README

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.

Install
Published
30 Jul 2018
Sources
v5.0.0.tar.gz
md5=2cff1148329e7c3b10cce7ae7728c97b
Dependencies
Reverse Dependencies