You may want to break up the timing into the cost of building the tree and the time to do the searches. I'm not sure a 1000 searches is enough to see that much of a difference, especially for a smaller grid. Also, at some point there will only be 1 point per kdtree bin in which case refining the kdtree more is useless.<br>
<br><div class="gmail_quote">On Wed, Sep 29, 2010 at 8:33 AM, David Doria <span dir="ltr"><<a href="mailto:daviddoria@gmail.com">daviddoria@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
<div>I am trying to time vtkKdTreePointLocator for several closest point queries for varying tree depths. I tried this:</div><div><br></div><a href="http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/KDTreeTimingDemo" target="_blank">http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/KDTreeTimingDemo</a><div>
<br></div><div>but the results seem not to show the decreasing trend I would expect - instead they seem rather random. Any thoughts on this?</div><div><a href="http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/KDTreeTimingDemo" target="_blank"></a><br clear="all">
Thanks,<br><br>David<br>
</div>
</blockquote></div><br>