On Fri, Jun 6, 2008 at 2:59 PM, Jean-Sébastien Guay <[EMAIL PROTECTED]> wrote: > Hi Robert, > >> Then... we'll find out just how fast a >> cache friendly kdtree implementation can be :-) > > Oooo... Dramatic foreshadowing :-)
Oh "how fast" can be taken many ways. It could be dog slow.. :-) Although I'm expecting it do just fine, traversing a data structure should typically be quicker than building it, but that depends a lot on the speed/complexity of the intersection test itself. What we can be sure of is that the speed will be much much faster than the present osgUtil::Optimizer. For models will lots of polygons it could easily be 100+ times faster. Robert. _______________________________________________ osg-users mailing list [email protected] http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org
