Cover-Tree
Cover-Tree copied to clipboard
A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion and removal. Uses templates.
Hi to all, looking at the code frequency, I am wondering if this repo is dead? Did people move on? Is there another good implementation of a cover tree out...
as an example to what I meant by #10
I just replaced all the use of `std::pair` with using `std::tuple` and got a 30% speed improvement on insert calls: ``` -------------------------------------------------------------- Benchmark Time CPU Iterations -------------------------------------------------------------- BM_insert/100 4009190 ns...
I am offering to port the tests to use the header-only [catch(2) framework](https://github.com/catchorg/Catch2). I am suggesting to move to c++11 at least. Any objections/thoughts/feedback? If not, I'll send in a...
it would be useful to add a kNN method that returns not only points, but also their distances, e.g. as `std::vec`.