KDTreeF

Jump to navigation Jump to search

Nice stuff! With that graph, it looks like the place you have the most room to squeeze out more performance if you wish to, is by refactoring the code so that the JIT gets it optimized sooner. Having the lowest time in those first few searches is certainly neat, and perhaps is the most important thing in the robocode context as that's the most likely time for a kd-tree to lead to a skipped turn. I wonder what it took to get that down and how much that is dataset specific.

Rednaxela‎21:02, 9 June 2012

You do not have permission to edit this page, for the following reasons:

  • The action you have requested is limited to users in the group: Users.
  • You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

Return to Thread:User talk:Chase-san/Kd-Tree/KDTreeF/reply (2).

 
Retrieved from "http://robowiki.net/wiki/Thread:User_talk:Chase-san/Kd-Tree/KDTreeF/reply#KDTreeF_953"