Difference between revisions of "Thread:User talk:Tmservo/gilgalad's kd-tree/reply (4)"

From Robowiki
Jump to navigation Jump to search
 
m (very minor edit)
 
Line 1: Line 1:
The tree that I have, is approximately as fast as rednaxela's 2nd gen.  (slightly faster in my tests).  Are you trying to write a kd-tree or just looking for one to use?  As far as I know, jk's tree, rednaxela's tree, and my tree are all quite similar.  Bucket kd-tree.  No recursive search methods.  Use a MBR (minimum bounding rectangle).  Use a heap to store the points.  I think rednaxela was the first to introduce most of those ideas to robocode, but in my tests, mine was slightly faster and presumable the same can be said of JK's tests.
+
The tree that I have, is approximately as fast as rednaxela's 2nd gen.  (slightly faster in my tests).  Are you trying to write a kd-tree or just looking for one to use?  As far as I know, jk's tree, rednaxela's tree, and my tree are all quite similar.  Bucket kd-tree.  No recursive search methods.  Use a MBR (minimum bounding rectangle).  Use a heap to store the points.  I think rednaxela was the first to introduce most of those ideas to robocode, but in my tests, mine was slightly faster and presumably the same can be said of JK's tests.

Latest revision as of 21:30, 12 October 2013

The tree that I have, is approximately as fast as rednaxela's 2nd gen. (slightly faster in my tests). Are you trying to write a kd-tree or just looking for one to use? As far as I know, jk's tree, rednaxela's tree, and my tree are all quite similar. Bucket kd-tree. No recursive search methods. Use a MBR (minimum bounding rectangle). Use a heap to store the points. I think rednaxela was the first to introduce most of those ideas to robocode, but in my tests, mine was slightly faster and presumably the same can be said of JK's tests.