Optimization to the new KDTree (which I'm going to port over to the old KDTree soon). The routine to find a good split location now does a binary search instead of just trying 20 times. This greatly improves the speed as it now only has to try 5 times for the same accuracy.
Optimization to the new KDTree (which I'm going to port over to the old
KDTree soon). The routine to find a good split location now does a binary
search instead of just trying 20 times. This greatly improves the
speed as it now only has to try 5 times for the same accuracy.



git-svn-id: 28d9401aa571d5108e51b194aae6f24ca5964c06@36940 8cc4aa7f-3514-0410-904f-f2cc9021211c

crystalspace/CS,crystalspace/CS,crystalspace/CS,crystalspace/CS,crystalspace/CS,crystalspace/CS,crystalspace/CS,crystalspace/CS