Opam Package bst.7.0.0

Package info

opam-namebst
opam-version7.0.0
synopsisBisector 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
authors
  • Francois Berenger
homepagehttps://github.com/UnixJunkie/bisec-tree
licenseBSD-3-Clause
readme-fileREADME.md
deps (6)
revdeps (3)
metas (1)
libraries (1)

Package modules

Package sources

bst

Package files

lib/bst/opam
lib/bst/dune-package
lib/bst/bst__Bisec_tree.cmx
lib/bst/bst__Bisec_tree.cmti
lib/bst/bst__Bisec_tree.cmt
lib/bst/bst__Bisec_tree.cmi
lib/bst/bst.ml
lib/bst/bst.cmxs
lib/bst/bst.cmxa
lib/bst/bst.cmx
lib/bst/bst.cmt
lib/bst/bst.cmi
lib/bst/bst.cma
lib/bst/bst.a
lib/bst/bisec_tree.mli
lib/bst/bisec_tree.ml
lib/bst/META
lib/bst
doc/bst/README.md
doc/bst/LICENSE
doc/bst