package bst

  1. Overview
  2. Docs
Bisector tree implementation in OCaml.

Install 

dune-project
 Dependency

github.com Readme Edit opam file Versions (8)

Authors

  1. F
    Francois BERENGER

Maintainers

  1. U
    unixjunkie@sdf.org

Sources

v1.0.1.tar.gz
sha256=b71c6b8ad9a6704b09569ccad962781139f9d06f3acd07f2ba4efe48844d571d
md5=baaacd991615279629aa7bd6464933d6

doc/README.html

bisec-tree

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

Bunny

Figure: the Stanford bunny guillotined by a bisector tree.