https://github.com/unixjunkie/bisec-tree

Bisector tree implementation in OCaml
https://github.com/unixjunkie/bisec-tree

bisector-tree distance metric nearest-neighbor-search nearest-neighbours ocaml-library point-cloud point-query range-query static-spatial-indexing

Last synced: about 2 months ago
JSON representation

Bisector tree implementation in OCaml

• Host: GitHub
• URL: https://github.com/unixjunkie/bisec-tree
• Owner: UnixJunkie
• License: bsd-3-clause
• Created: 2018-01-17T07:26:11.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2024-04-17T05:08:28.000Z (9 months ago)
• Last Synced: 2024-11-01T01:42:22.326Z (2 months ago)
• Topics: bisector-tree, distance, metric, nearest-neighbor-search, nearest-neighbours, ocaml-library, point-cloud, point-query, range-query, static-spatial-indexing
• Language: OCaml
• Homepage:
• Size: 616 KB
• Stars: 25
• Watchers: 1
• Forks: 0
• Open Issues: 4
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

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

![Bunny](data/stanford_bunny.png?raw=true)

Figure: the Stanford bunny, consisting of 35947 3D points, guillotined

by the first layer of a bisector tree.