packagebst
Install
Dune Dependency
Authors
Maintainers
Sources
sha256=acc92f22b4b741f664dc5ad8caed11244eeb41960444af1d7e7d32d0e38a0a09md5=4fcd841b20cc9279ce5cad2b7bdaae56Description
A bisector tree allows to do fast but exact nearest neighbor searchesin any space provided that you can measure thedistance 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:17 Apr 2024
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.