Talk:Kd-tree

From Robowiki
Revision as of 12:20, 15 August 2009 by Nat (talk | contribs) (dummy edit, I accidentally make last edit as minor)
Jump to navigation Jump to search

Bucket PR k-d tree

I think you all know about Bucket PR k-d tree (aka Simonton's tree), right? I'll get directly to my point.

The Bucket PR k-d tree (I'll refer as just a tree from now on) is a binary tree split by the median of the bound, right? I wonder if I make it m-ary tree, let say, Ternary or Quaternary tree instead of just binary? Will it better? » Nat | Talk » 09:12, 15 August 2009 (UTC)

Retrieved from "http://robowiki.net/w/index.php?title=Talk:Kd-tree&oldid=10529"