Hi Brad, OSG-2.6 comes with a new KdTree support that can be automatically built on loaded models, and used by the IntersectionVisitor. Have a browse through the archives for the last two months on the topic of KdTree, lots has been written on this topic.
KdTree do in principle provide the O(log n) intersection costs. Robert. On Sun, Aug 24, 2008 at 5:10 PM, Brad Eric Hollister <[EMAIL PROTECTED]> wrote: >> What do you mean by a dynamic bounding volume hierarchy? > >> The OSG automatically updates bounding volumes of parents in the scene >> graph when a node or drawable leaf gets modified. It doesn't >> re-arrange the scene graph structure though. > > I've implemented a BVH for a terrain rendering system that runs O(log n) for > isector and frustum culling. It dynamically structures the scene > graph between the root and drawable leaf nodes by grouping them n-levels > deep. The level number depends on the maximum children that are selected for > each bounding volume in the graph. The selection criterion is bsphere volume > sorting. This reduces O(n) searches for culling and intersection tests to > O(log n). > > Would something like this be a useful addition for OSG, possibly as a simple > plugin? > > _______________________________________________ > osg-users mailing list > [email protected] > http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org > > _______________________________________________ osg-users mailing list [email protected] http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org
