Hi Robert,
My plan is to have a kdtree pointer on osg::Drawable. My initial
though would be to have users manually assign created kdtree's to
osg::Drawable, and update these when geometry is updated. One could
possible do this within a dirty mechanism in Drawable a bit like
bounding boxes are currently updated.
Computing a kd-tree for a whole scene graph or whole subgraphs is not
really required, as a well balanced scene graph will provide
reasonable culling as is, the expensive part of intersection traversal
right now is the not the traversal of the internal nodes of the scene
graph but when happens when you hit an osg::Geometry contains
thousands of triangles, it's the later bottleneck that I'm after
tackling.
Sounds good, we're on the same page then. I agree that the focus on the
dynamic case is appropriate in the context of a scene graph.
Looking forward to seeing your progress on this.
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
