Performance Demonstration

Library of generic, k-d tree multi-dimensional containers

Brought to you by: bouhdevel

#4 Performance Demonstration

Milestone: 2.1.7

Status: closed

Owner: Sylvain Bougerel

Labels: None

Priority: 5

Updated: 2015-11-29

Created: 2011-11-03

Creator: Anonymous

Private: 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 - 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
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
- Anonymous
  
  Add attachments
  Cancel
  You seem to have CSS turned off. Please don't fill out this field.
  
  You seem to have CSS turned off. Please don't fill out this field.

Sylvain Bougerel - 2015-11-29

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

If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
- Anonymous
  
  Add attachments
  Cancel
  You seem to have CSS turned off. Please don't fill out this field.
  
  You seem to have CSS turned off. Please don't fill out this field.

Sylvain Bougerel - 2015-11-29

status: accepted --> closed
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
- Anonymous
  
  Add attachments
  Cancel
  You seem to have CSS turned off. Please don't fill out this field.
  
  You seem to have CSS turned off. Please don't fill out this field.

Anonymous