Performance of find methods, comparison with linear search

[Sylvain Bougerel]

Hi Renaud,

Some more details than the previous mail. Oh, I can't access the link.
"you don't have the permission"...

On 11/5/07, Renaud Detry <renaudjdetry at airpost.net> wrote:
> My personal interest in libkdtree is an optimized within-range search
> through sets of 100 to 500 points. From the previous comparisons, it
> seems that in this case libkdtree, and probably kdtrees in general,
> are not a better solution than linear search. Does this sound fair to
> you guys?

Honestly, I don't know for 100 to 500 points. But it really seems to
me that linear search should be the slowest, especially if your range
is small.

Sylvain