Skip to content
Bisector tree implementation in OCaml
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
data
LICENSE
Makefile
README.md
bisec_tree.ml
bisec_tree.mli
bst.opam
bunny.sh
dump.ml
dune
test.ml

README.md

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

Bunny

Figure: the Stanford bunny, consisting of 35947 3D points, guillotined by the first layer of a bisector tree.

You can’t perform that action at this time.