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

v3.0.0.tar.gz
md5=5b0caca38e7fd24170efcfda50362b7d

Description

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 (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

Published: 30 May 2018

README

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.

Dependencies (2)

  1. jbuilder >= "1.0+beta19"
  2. ocaml

Dev Dependencies

None

Used by (4)

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

Conflicts

None