[vtkusers] KDTree timing demo

[Andy Bauer]

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.

On Wed, Sep 29, 2010 at 8:33 AM, David Doria <daviddoria at gmail.com> wrote:

> I am trying to time vtkKdTreePointLocator for several closest point queries
> for varying tree depths. I tried this:
>
> http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/KDTreeTimingDemo
>
> but the results seem not to show the decreasing trend I would expect -
> instead they seem rather random. Any thoughts on this?
> <http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/KDTreeTimingDemo>
> Thanks,
>
> David
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20100929/e2c546c6/attachment.htm>