I would like to boost the line intersection visitor by implementing a really fast kd-Tree data representation. The traversal process for intersection testing has to be implemented as fastest as possible. It's hard optimisation work, which needs depth know-how in computer architecture. If you like to join the "project", please contact me in the osg-user group.
4.23s , 67K Triangles , 600x600 , 3 Lights
4.32s , 67K Triangles , 600x600 , 3 Lights