How to searching for in kdtree when dynamic elements are considered

Sylvain Bougerel sylvain.bougerel.devel at gmail.com
Tue Nov 17 03:10:14 UTC 2009


On Tue, Nov 17, 2009 at 7:37 AM, Paul Harris <paulharris at computer.org> wrote:
> Hi Jsl,
>
> any rotation, translation etc can reversed.  matrix multiplications make
> this simple and quick to do.
>
> that way you can avoid rebuilding the tree with each iteration, which would
> be expensive.
>
> cheers
> Paul
>

Hi Jsl,

You should follow Paul's proposition if it is possible. I was just
stating a factual truth about kd-tree in general in my previous mail.
Paul's implementation obviously performs better.

Cheers,
Sylvain



More information about the libkdtree-devel mailing list