|Version 1 (modified by osg, 9 years ago)|
I would like to boost the line intersection visitor by implementing a really fast kd-Tree data representation. At the moment still in testing and learning who the traversal time for intersection testing can be become as fastest as possible. It's hard optimisation work, which needs depth know-how in computer architecture. If you like to join me, please contact me in the osg-user group.