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
| Author | Francois Berenger |
|---|---|
| License | BSD-3-Clause |
| Published | |
| Homepage | https://github.com/UnixJunkie/bisec-tree |
| Issue Tracker | https://github.com/UnixJunkie/bisec-tree/issues |
| Maintainer | unixjunkie@sdf.org |
| Dependencies | |
| Source [http] | https://github.com/UnixJunkie/bisec-tree/archive/v7.1.0.tar.gz md5=4fcd841b20cc9279ce5cad2b7bdaae56 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/bst/bst.7.1.0/opam |
Required by
- acp4
- hts_shrink
- linwrap>=9.0.3
- molenc>=2.0.0
- rankers
