bst

Bisector tree implementation in OCaml
Description

A bisector tree allows to do fast but exact nearest neighbor searches in any space provided that you can measure the distance between any two points in that space. A bisector tree also allows fast neighbor searches (range queries/ finding all points within a given tolerance from your query point). 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

Install
Documentation github.com BSD-3-Clause License Edit opam file
Published
23 Aug 2022
Authors
Maintainers
Sources
v7.0.1.tar.gz
md5=ed687bbee9bc7ee2d5b224274c5b14d0
Dependencies
minicli with-test
dolog with-test
base-unix with-test
dune >= "1.11"
batteries
ocaml
Reverse Dependencies
acp4
hts_shrink
linwrap >= "9.0.3"
molenc >= "2.0.0"
rankers