Majority voting in find_nearest()

[Willi Richert]

Hi,

in some situations the same point is inserted with different labels. In this 
case find_nearest returns an arbitrary point of these euqally nearest points to 
the query point.

However, it would be nice if one could get either all the points that are 
nearest and identical or to have a method that returns the label of the 
majority of the (identical) nearest points.

Would that be feasible with the current libkdtree++ implementation?

Regards,
wr
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.alioth.debian.org/pipermail/libkdtree-devel/attachments/20081015/6cf95394/attachment.htm