KD Tree Range Queries

Thierry Moreira thierrypin at gmail.com
Thu Jul 21 22:50:00 UTC 2016


Hello,

I'm new to the library and I'm facing trouble with range queries. What I
want to do is find all the points within a given rectangle. I know this as
"range query". (link below)

http://www.cise.ufl.edu/class/cot5520fa09/CG_RangeKDtrees.pdf (Kd-trees ->
Querying in kd-trees)


Apparently, the only type of searching in range available is having a point
and finding all the nearest points, with a tolerance.

Is it possible to do what I want with this library?

Thank you,

Thierry P. Moreira
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.alioth.debian.org/pipermail/libkdtree-devel/attachments/20160721/ffe4b0db/attachment.html>


More information about the libkdtree-devel mailing list