3 ms·
If you have heuristics fast enough to make kd-trees competitive, it would be interesting to have them added to http://ann-benchmarks.com/ http://ann-benchmarks.
by thomasahle 6y ago
If you have heuristics fast enough to make kd-trees competitive, it would be interesting to have them added to http://ann-benchmarks.com/ http://ann-benchmarks.com/
- CyberDildonics 6y agoWhat do you mean by "heuristics"? What I described was how flann works. It is not only on those benchmarks but is one of the reasons they exist in the first place, since it instigated a lot of the research into approximate nearest neighbors.