bstversion

Bisector tree implementation in OCaml

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

AuthorFrancois Berenger
LicenseBSD-3-Clause
Published
Homepagehttps://github.com/UnixJunkie/bisec-tree
Issue Trackerhttps://github.com/UnixJunkie/bisec-tree/issues
Maintainerunixjunkie@sdf.org
Dependencies
Source [http] https://github.com/UnixJunkie/bisec-tree/archive/v6.0.0.tar.gz
sha256=7c6b4fd78a463b385c2dfced50c7aa4e0649378654a114415fdc7334a159ead8
md5=e3bafda0a2b705c5cd24e0710dee9c37
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/bst/bst.6.0.0/opam
Required by