package bst

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

Install

Dune 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
md5=baaacd991615279629aa7bd6464933d6

Description

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

Published: 07 Feb 2018

README

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

Figure: the Stanford bunny guillotined by a bisector tree.

Dependencies (2)

  1. jbuilder >= "1.0+beta7"
  2. ocaml >= "4.03.0"

Dev Dependencies

None

Used by (4)

  1. hts_shrink
  2. linwrap >= "9.0.3"
  3. molenc >= "2.0.0" & < "5.0.0"
  4. rankers

Conflicts

None