Difference between revisions of "Talk:Kd-tree"
Jump to navigation
Jump to search
m (wonder about Bucket PR k-d tree) |
(dummy edit, I accidentally make last edit as minor) |
||
| Line 1: | Line 1: | ||
| + | == 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. | 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? » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 09:12, 15 August 2009 (UTC) | 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? » <span style="font-size:0.9em;color:darkgreen;">[[User:Nat|Nat]] | [[User_talk:Nat|Talk]]</span> » 09:12, 15 August 2009 (UTC) | ||
Revision as of 11:20, 15 August 2009
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)
