2D-Tree: Search within rectangular region

[Paul Harris]

Off top of head, I think you can define a Range and then call find() with
that.
Sorry I can't be more precise.

2009/5/8 Willi Mann <foss-ml at wm1.at>

> Hi!
>
> How do I get all points within a axis-aligned rectangular region? I've
> only found the method that seems tp return points within a square, given
> by the middle of the square and the half of the side.
>
> thanks
> Willi Mann
>
>
> _______________________________________________
> 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/20090508/c6254955/attachment.htm>