Hi Robert,
It's interesting how different bottlenecks pop up, in this case
creating objects on the heap is clearly showing itself as a bottleneck
whereas the old brute force intersection code was so slow that this
wasn't a significant factor.
Bear in mind that what I mentioned was with Adrian's implementation of a
kd-tree. I haven't yet had time to test the one that's in OSG now.
J-S
--
______________________________________________________
Jean-Sebastien Guay [EMAIL PROTECTED]
http://www.cm-labs.com/
http://whitestar02.webhop.org/
_______________________________________________
osg-users mailing list
[email protected]
http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org
