UnixJunkie/bisec-tree
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
Bisector tree implementation in OCaml
157 commits 4 branches 12 tags 676 KiB
  • OCaml 97.4%
  • Shell 1.3%
  • Makefile 1.2%
Find a file
Exact
Francois Berenger 2be4de601e Test: added BST.any_neighbor to the test suite
2024-04-17 13:54:48 +09:00
data added data/bunny.txt 2019-05-28 12:16:45 +09:00
doc new file: doc/Brin_1995_NNsearchLargeMetricSpace.pdf 2024-04-17 10:51:46 +09:00
src Test: added BST.any_neighbor to the test suite 2024-04-17 13:54:48 +09:00
bst.opam opam: synchronized with opam-repos. 2022-08-24 09:57:07 +09:00
bunny.sh added bunny.sh, to guillotine the Stanford bunny 2018-05-21 17:51:48 +09:00
dune-project new file: dune-project 2022-08-23 15:37:28 +09:00
LICENSE added BSD-3 license file 2018-02-08 09:50:09 +09:00
Makefile typo 2019-06-03 12:15:21 +09:00
README.md better figure legend 2018-04-03 14:33:30 +09:00

README.md

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

Bunny

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