Hi Peter, On Fri, Apr 24, 2009 at 6:21 PM, Peter Amstutz <[email protected]> wrote: > A couple of other questions related to intersection performance: > > 1) The current KdTree implementation is just for sorting triangle geometry > at node leaves. Perhaps it would be useful to to have a KdTree organize the > scene graph nodes themselves, based on bounding volumes? Or are bounding > volume tests generally good enough (and it's up to the user to be clever > about organizing the scene graph?)
A good scene graph will be built up in the same structure as a KdTree, it's just coarse grained .i.e. at whole node/geometry level rather than individual triangles like the KdTree does. Given this there really isn't too much to be gained by trying to graft a KdTree into the scene nodes themselves. > 2) I need to do line-of-sight tests where I am only interested in whether > any intersection exists, and not what those intersections are. This allows > for a "trap door" optimization where the search process terminates on the > first positive intersection. Is there a way to do that with the current > osgUtil::IntersectionVisitor, or do I need to modify it to serve this > purpose? Not at present. I see that JS expands on this topic so I won't comment further. Robert. _______________________________________________ osg-users mailing list [email protected] http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org
