From: Marcin Raczkowski <mailing.mr@...>
Date: 2008-01-20T21:01:14+09:00
Subject: Re: kD-Trees implementation

Clifford Heath wrote:
> Marcin Raczkowski wrote:
>> Clifford Heath wrote:
>>> Is this the standard way to build a kdtree?
>> Problem is more complex than you think.
> 
> Yes, ok, I see that now, @dim copies doesn't help much.
> I'm still interested to know what better method there
> might be, if any.
> 
>> for now I'm focusing on writing proper algorithm , then i might think 
>> how to optimize it.
> 
> Fair enough!
> 
> 
There are reaserch papers that descripbe O(nlogn) instead of (nlog^2n) 
algorithms but They are usually full of complex math and 20-50 pages 
long. Also one that i could understand Is based n pointers and 
interlinked lists and it's kinda hard to implement in Ruby