Hi Rob,<div><br></div><div>Interesting, I'll bookmark nanoflann if I need it in future.</div><div><br></div><div>Ironically, I am using FLANN in header-only mode, by simply #including the kdtree_single_index header file directly.</div>
<div><br></div><div>I made a couple of changes to the headers, and posted the info to the FLANN issue list. I dunno if they will ever want to incorporate my (minor) changes, I put them up there just in case.</div><div>
<br>
</div><div>I'll email the nanoflann guy, maybe he likes the changes.</div><div><br></div><div>cheers</div><div>Paul</div><div><br><br><div class="gmail_quote">On 17 April 2012 22:39, Rob McDonald <span dir="ltr"><<a href="mailto:ramcdona@calpoly.edu">ramcdona@calpoly.edu</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Paul,<br>
<br>
Thanks for the information.<br>
<br>
In my own search, I came across nanoflann -- a header-only fork of flann.<br>
<br>
<a href="http://code.google.com/p/nanoflann/" target="_blank">http://code.google.com/p/<u></u>nanoflann/</a><br>
<br>
Although the question of repeated nearby searches remains unanswered, it is working well for my needs.<br>
<br>
Rob<div class="im"><br>
<br>
On 4/15/12 10:11 PM, Paul wrote:<br>
</div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div class="im">
Hi Rob,<br>
<br>
I haven't done anything with libkdtree for a while now.<br>
<br>
Have you checked out flann ?<br>
Its got some heavyweights behind it:<br>
<a href="http://www.pointclouds.org/" target="_blank">http://www.pointclouds.org/</a><br>
<br>
cheers,<br>
Paul<br>
<br>
On 3 April 2012 23:00, Rob McDonald <<a href="mailto:ramcdona@calpoly.edu" target="_blank">ramcdona@calpoly.edu</a><br></div><div><div class="h5">
<mailto:<a href="mailto:ramcdona@calpoly.edu" target="_blank">ramcdona@calpoly.edu</a>>> wrote:<br>
<br>
I am considering using libkdtree++ for an open source project.<br>
Thank you very much for your work and for making this available.<br>
Although the mailing list hasn't had traffic since 2010, I'm<br>
hoping that someone out there is listening.<br>
<br>
1) I need to do many repeated range searches through a static cloud<br>
of points. Each search will be at a location very close to the<br>
previous search.<br>
<br>
Is there a way to return the location in the tree from a completed<br>
search? Then, can that location be passed to the next search as a<br>
starting point? Will this significantly accelerate the search?<br>
<br>
2) What is the preferred way (from the libkdtree developers point of<br>
view) of including libkdtree++ in a project? My project is<br>
cross-platform, and uses CMake to generate build files.<br>
<br>
We include some smaller libraries in the project tree directly. We<br>
require the developer to go out and obtain other larger libraries as<br>
required. This can become a hassle.<br>
<br>
I would rather not include everything in our project - the<br>
tests/examples, the CMake build files, the Python bindings, etc.<br>
<br>
I believe we could just include the contents of the kdtree++<br>
directory in our project. What other files would be required by the<br>
license? What other files would you like to have included?<br>
<br>
3) What is the general status of this library? Do the developers<br>
have any further development plans? Has this reached maturity? Our<br>
project's needs are modest, so I think we will be fine with<br>
libkdtree++ as-is. At the same time, we haven't committed yet and<br>
could switch to another kdtree if that is recommended.<br>
<br>
We will need a range search, but a radius search would be better (if<br>
not too expensive). I saw in the archives some discussion/debate<br>
about how best to move forward to support a radius search. Is there<br>
any plan for that?<br>
<br>
Thanks for any information,<br>
<br>
Rob<br>
<br>
<br>
<br>
<br>
<br>
<br>
______________________________ _________________<br>
libkdtree-devel mailing list<br>
libkdtree-devel@lists.alioth. <a href="http://debian.org" target="_blank">debian.org</a><br></div></div>
<mailto:<a href="mailto:libkdtree-devel@lists.alioth.debian.org" target="_blank">libkdtree-devel@lists.<u></u>alioth.debian.org</a>><br>
<a href="http://lists.alioth.debian" target="_blank">http://lists.alioth.debian</a>. org/cgi-bin/mailman/listinfo/<br>
libkdtree-devel<br>
<<a href="http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/libkdtree-devel" target="_blank">http://lists.alioth.debian.<u></u>org/cgi-bin/mailman/listinfo/<u></u>libkdtree-devel</a>><br>
<br>
<br><span class="HOEnZb"><font color="#888888">
</font></span></blockquote><span class="HOEnZb"><font color="#888888">
<br>
-- <br>
Rob McDonald, Ph.D.<br>
Aerospace Engineering<br>
Cal Poly, San Luis Obispo<br>
805-756-7242<br>
</font></span></blockquote></div><br></div>