bst
Bisector tree implementation in OCaml
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
Install
copied = false, 2000)"
:class="{ 'border-gray-700': !copied, 'text-gray-100': !copied, 'focus:ring-orange-500': !copied, 'focus:border-orange-500': !copied, 'border-green-600': copied, 'text-green-600': copied, 'focus:ring-green-500': copied, 'focus:border-green-500': copied }">
- Published
- 23 Aug 2022
- Authors
- Maintainers
Sources
Dependencies
Reverse Dependencies