Menu ▾ ▴

#4 Performance Demonstration

2.1.7
closed
Sylvain Bougerel
None
5
2015-11-29
2011-11-03
Anonymous
No

When is it less efficient or more efficient than libkdtree++? How does it compares to ANN on nearest neighbor searches? Or to boost::rtree?

Discussion

  • Sylvain Bougerel

    Sylvain Bougerel - 2014-01-26
    • Description has changed:

    Diff:

    --- old
+++ new
@@ -1 +1 @@
-Is it as performant as libkdtree++ or more performant? How does it compares to ANN on nearest neighbor searches?
+When is it less efficient or more efficient than libkdtree++? How does it compares to ANN on nearest neighbor searches? Or to boost::rtree?
    • status: open --> accepted
    • assigned_to: Sylvain Bougerel
    • Group: --> 2.1.2
     

  • Sylvain Bougerel

    Sylvain Bougerel - 2015-11-29

    Enough performance works for now. Closed to re-open more targetted tasks.

     

  • Sylvain Bougerel

    Sylvain Bougerel - 2015-11-29
    • status: accepted --> closed
     

Anonymous
Anonymous

Add attachments
Cancel