bstversion
Bisector tree implementation in OCaml.
A bisector tree allows to do fast but exact nearest neighbor searches in any space provided that you have a metric (function) to measure the distance between any two points in that space. 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/v1.0.1.tar.gz sha256=b71c6b8ad9a6704b09569ccad962781139f9d06f3acd07f2ba4efe48844d571d md5=baaacd991615279629aa7bd6464933d6 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/bst/bst.1.0.1/opam |
Required by
- hts_shrink
- linwrap>=9.0.3
- molenc>=2.0.0 & <5.0.0
- rankers
