<div class="gmail_quote">On Wed, Sep 29, 2010 at 11:36 AM, Andy Bauer <span dir="ltr"><<a href="mailto:andy.bauer@kitware.com">andy.bauer@kitware.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
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</blockquote><div><br></div><div>The octree demo: <a href="http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/OctreeTimingDemo">http://www.vtk.org/Wiki/VTK/Examples/Cxx/DataStructures/OctreeTimingDemo</a> shows a nice trend with only 1k trials. I also tried with 10k and the result is no better.</div>
<div> </div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Also, at some point there will only be 1 point per kdtree bin in which case refining the kdtree more is useless.</blockquote>
<div><br></div><div>Yes, this is exactly what I am trying to see :) In the octree demo, there is a decay in runtime and then it is very flat after a point (this is where you should set the tree/hopefully the automatic parameters end up here). With the KDTree the runtime doesn't seem to vary in a sane way with the depth of the tree.</div>
</div><div><br clear="all">David</div>