CGAL users discussion list

[Samaras <>]

>Could you provide a minimal example showing the issue?

Sorry for taking me too long to answer, but I was trying to find a way to
minimize the code completely. I think I can't do nothing better than a .zip
file, which I provide in this  link
<https://www.dropbox.com/s/z3ujtdm19fnt017/minimal.zip>   from dropbox

In this .zip, I read from a file that contains 2^17 points in 17 dimensions,
with coordinates at {-1, 1}, into an std::vector.
Then I insert them into the tree and then I use the first 1000 points of the
vector as queries.
Here are the average time measurements I got: (for epsilon from 0.0 to 0.2)
NN for 0.0  0.000212090 seconds.
NN for 0.1  0.000376698 seconds.
NN for 0.15 0.004152510 seconds.
NN for 0.2  0.009170970 seconds.

I am really eager to hear from you! As you see, as the epsilon increases,
the time increases too! :/





--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Nearest-neighbor-query-time-increases-as-epsilon-increases-tp4658494p4658503.html
Sent from the cgal-discuss mailing list archive at Nabble.com.