On Mon, Jul 14, 2008 at 5:43 PM, <[EMAIL PROTECTED]> wrote: > Wow, that sounds pretty fantastic. How do you integrate Adrian Egli's K-D > tree implementation into an application that uses OSG?
The new osg::KdTree tree and associated support classes now make it easy to provide custom KdTree implementations - one just subclasses from osg::KdTree and implements two methods. > I appreciate all the hard work everyone does. I appreciate it to the tune > of $25. (actually, I appreciate it much much more than that, but it is > about all I can affor right now. I know its not very much, but its a > start. I also will go ahead and donate $25 to the OSG in general. Heaven > knows Robert has done so much for every project I have worked on that uses > OSG.) Maybe someone else can add to the pot? The sentiment of donations is appreciated, but the time put into such a scheme may well cost more than the time it pays for. I may a living form professional contracts, most of which deliver open source - like osg::KdTree etc, these pay a good enough wage for me support the rest of the open source activity too. For my own personal needs I don't need a general fund, and if I'd did it'd have to a pot of many ten's of thousands per year. If you want to donate to the OSG, then your time and assistance is what is needed the most ;-) Robert. > > Are you manning this competition Adrian? What are the other rules? I just > want to make sure that I (as an OSG noviciate), and everyone else in the > community, can use these great optimizations. > > -- Rick > > On Mon, Jul 14, 2008 at 7:57 AM, Adrian Egli OpenSceneGraph (3D) > <[EMAIL PROTECTED]> 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 >> implementation. >> >> Prize: >> Is out there someone can offering a prize? >> >> Help: >> 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: >> http://homepages.paradise.net.nz/nickamy/benchmark.html >> >> Source: >> http://webaddon3d.assoftware.ch/AE/RayTracer.zip >> >> Scene to test: >> http://webaddon3d.assoftware.ch/AE/bunny.zip >> >> Results: >> *** Adrian Egli's KD-Tree *** >> fraction_hit:10493:0.10493 >> time:108.256ms >> 923.74K rays/sec: >> >> *** OpenSceneGraph's KD-Tree (SVN) **** >> fraction_hit:10495:0.10495 >> time:258.756ms >> 386.464K rays/sec: >> >> *** OpenSceneGraph without any KD-Tree **** >> fraction_hit:10495:0.10495 >> time:77564.2ms >> 1.28925K rays/sec: >> >> -- >> ******************************************** >> Adrian Egli >> _______________________________________________ >> osg-users mailing list >> [email protected] >> http://lists.openscenegraph.org/listinfo.cgi/osg-users-openscenegraph.org >> > > > > -- >>> Rick > Check us out at http://fringe-online.com/ > _______________________________________________ > 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
