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/v7.0.1.tar.gz
sha256=99a4880a0c3c22953b571469832c690ba4b2cea2215f67b1b7f95e27bd84bfe7
md5=ed687bbee9bc7ee2d5b224274c5b14d0
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/bst/bst.7.0.1/opam
Required by