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
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.1.0.tar.gz
md5=b630b52af052d34fdb9ed9de544fcd48
StatisticsInstalled 4 times last month.
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/bst/bst.6.1.0/opam
Required by