package bst
Install
Dune Dependency
Authors
Maintainers
Sources
sha256=b1a2bd2c72a8b42e11dcf58850d3b398be3e3cf1d514a628a88c88e42089dcfd
md5=38b8967699a79d0df30e8acac23093fc
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 (range queries/ 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: 28 May 2019
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.