Support for directional data

[Paul Harris]

If you can phrase your data so that the direction is just another dimension,
then sure.

Maybe instead of storing the angle, store the 3 components of the unit
direction vector.  Then you could search for points that have a direction
within dist range of a target direction...  and with the addition of the 3
components of the location, that can allow you to search on both nearby
points with similar directions.

However i think the distance calc may need to be tweaked, as i think its
just Euler distance... which means the distance will be inclusive of the
"distance" between 2 directions.

Do you follow?  I may be babbling, i'm pretty tired at the moment.

2008/10/20 Willi Richert <w.richert at gmx.net>

>  Hi,
>
> is there a possibility to store directional data (e.g. angle of object) in
> libkdtree++? There are some side-issues with dir. data like 2*pi=0, etc.
> This should be handled somehow at the node level. I'm not sure whether this
> is generally feasible with KD-trees.
>
> Regards,
>
> wr
>
>
> _______________________________________________
> libkdtree-devel mailing list
> libkdtree-devel at lists.alioth.debian.org
> http://lists.alioth.debian.org/mailman/listinfo/libkdtree-devel
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.alioth.debian.org/pipermail/libkdtree-devel/attachments/20081020/2412d1e0/attachment.htm