[osg-users] KD-Tree Performance Challenge....
robert.osfield at gmail.com
Mon Jul 14 13:16:47 PDT 2008
Neat benchmark, I won't have a chance to look at your benchmark today
as it's late. Perhaps you could morph it into something we could put
into the osgkdtree example. If you can provide your own code under
the OSGPL then we'd be able to merge the best bits of the various
W.r.t benchmarking, there are the other elements that we need to
address, such as the cost of IntersectionVisitor traversal. cost of
recording hits, these I have found are more expensive than doing
The other element that needs benchmarking is build performance.
On Mon, Jul 14, 2008 at 12:57 PM, Adrian Egli OpenSceneGraph (3D)
<3dhelp at gmail.com> wrote:
> Hi all,
> .................... KD-Tree Performance Challenge ....................
> The latest version of OpenSceneGraph (SVN) supports a KD-Tree data
> structure. So we can start a challenge:
> Who can bit my kd-Tree implementation?
> Rule: Everyone who has a faster implementation can send a email with
> containing source code. It has to be based one the OSG KDTree
> Is out there someone can offering a prize?
> I can not offer any price for the winning code, but i will offer my source
> code as starting point.
> My source code should only help to understand who fast we can trace a ray
> through a scene. it's not yet the fastet know implementation have a look at:
> Scene to test:
> *** Adrian Egli's KD-Tree ***
> 923.74K rays/sec:
> *** OpenSceneGraph's KD-Tree (SVN) ****
> 386.464K rays/sec:
> *** OpenSceneGraph without any KD-Tree ****
> 1.28925K rays/sec:
> Adrian Egli
> osg-users mailing list
> osg-users at lists.openscenegraph.org
More information about the osg-users