package bst

  1. Overview
  2. Docs
Bisector tree implementation in OCaml

Install

Dune Dependency

github.com Readme BSD-3-Clause License Edit opam file Versions (8)

Authors

  1. F
    Francois Berenger

Maintainers

  1. U
    unixjunkie@sdf.org

Sources

v7.1.0.tar.gz
md5=4fcd841b20cc9279ce5cad2b7bdaae56

README.md.html

bisec-tree

Bisector tree implementation in OCaml.

A bisector tree allows to do fast and 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

Figure: the Stanford bunny, consisting of 35947 3D points, guillotined by the first layer of a bisector tree.