Performance of find methods, comparison with linear search

Renaud Detry renaudjdetry at airpost.net
Tue Nov 20 12:38:32 UTC 2007


> Then I moved
>  triplet nearest = random_points[0];
> to above the for loop, and added a
>   std::cout << "PCH: " << nearest << std::endl;
> below the for loop... I got this result
>

I cannot see any difference when I make this change. Can you send the
whole file?

Renaud.




More information about the libkdtree-devel mailing list