AW's kd-tree

Fragment of a discussion from User talk:Tmservo
Jump to navigation Jump to search

How Fast Is Andrew Wells KD-TREE

Tmservo (talk)23:33, 10 October 2013

I suggest you stop worrying about how fast a particular kd-tree is and just use one of them. The top few kd-trees are all very similar in performance and I am sure each have their pro's and cons. I personally still use Rednaxela's Gen 2 tree because of how self contained it is (vs his Gen 3 which has more structure).

Chase06:10, 11 October 2013
Edited by author.
Last edit: 20:43, 11 October 2013

If you were using it for Robocode I don't think you'd be worrying about which one. What are you using the tree for?

Skilgannon (talk)18:27, 11 October 2013
Edited by another user.
Last edit: 22: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.

AW (talk)20:35, 11 October 2013
Edited by author.
Last edit: 21:34, 11 October 2013

there is no kd-tree at but there is kd-tree inside gilgalad

Tmservo (talk)20:45, 11 October 2013

Soooo, I've been staying out of this because I have nothing constructive to offer... But FYI, the fact you ignore pretty much every question someone asks makes you seem suspicious. And asking/demanding things without listening makes you seem rude.

If you'd engage in a conversation and tell us your situation, we could probably offer you a lot more help. If you're doing something shady, like cheating on homework, and that's why you're being so secretive, we probably don't want to help.

Voidious (talk)21:05, 11 October 2013

My Goal Is To Benchmark KD-TREES

Tmservo (talk)21:29, 11 October 2013

did i mention AW's mallorn KD-TREE inside gilgalad

Tmservo (talk)22:34, 11 October 2013

I didn't know AW named his Kd-Tree "mallorn." That's really clever. ;)

Sheldor (talk)22:23, 12 October 2013

AW loves j.r.r tolkien Because he's catholic

Tmservo (talk)01:20, 13 October 2013

If that's your goal, why don't you benchmark them instead of asking us things we don't know?

What will you be using the results of the benchmark for? Once you do know which Kd-Tree is fastest, what will you do with it?

Skilgannon (talk)08:29, 12 October 2013

my goal is just to benchmark kd-trees

Tmservo (talk)18:15, 12 October 2013

What have you done so far? Do you have the kd-tree benchmark running? Did you get JK's tree working with that? Did you get mine working with that? If you want to benchmark them, I think it makes more sense for you to ask for help with that, rather than asking how fast the various trees are (which nobody knows since we never bothered to benchmark all of the latest trees). I'm actually kind of curious about this too, so I'm willing to offer some help if you'll explain what you need done and what you've tried already.

AW (talk)16:13, 14 October 2013

I Need Help on benchmarking all the KD-Trees

Tmservo (talk)00:38, 15 October 2013