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

Vantage point tree implementation in OCaml
https://github.com/unixjunkie/vp-tree

distance metric nearest-neighbor-search ocaml-library point-query spatial-indexing vantage-point-tree

Last synced: about 1 month ago
JSON representation

Vantage point tree implementation in OCaml

• Host: GitHub
• URL: https://github.com/unixjunkie/vp-tree
• Owner: UnixJunkie
• License: bsd-3-clause
• Created: 2017-03-22T13:56:01.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2021-11-05T03:14:30.000Z (about 3 years ago)
• Last Synced: 2023-10-20T23:36:35.524Z (about 1 year ago)
• Topics: distance, metric, nearest-neighbor-search, ocaml-library, point-query, spatial-indexing, vantage-point-tree
• Language: OCaml
• Homepage:
• Size: 224 KB
• Stars: 19
• Watchers: 3
• Forks: 4
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# vp-tree

A vantage point tree implementation in OCaml.

Cf. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.41.4193&rep=rep1&type=pdf

for details.

A vantage point tree allows to do fast but exact nearest neighbor searches

in any space provided that you have a distance function

to measure the distance between any two points in that space.

This implementation might need some tweaks in case it is used to index a very

large number of points (especially the select_vp function in the code).