nanoflann
nanoflann copied to clipboard
jlblancoc
nanoflann: a C++11 header-only library for Nearest Neighbor (NN) search with KD-trees
In many applications we need to map N-dimensional points to a single dimension while preserving space locality. One approach is to build a kd-tree and do an in-order traversal (see...
This is definitely a low-priority edge case. I caught while doing some unit-tests of my own. The repro rate is about 20%. i.e. the code fails about once every five...
Hi, When I put code like this (declare ret_matches and params inside the for loop): ``` for (size_t i = 0; i < num_pts; ++i) { const double query_pt[3] =...
Through some slightly thoughtless code on my part (including utils.h when not needed), I got into linking issues with multiple definitions of dump_mem_usage(), which was solved through inlining the function....
Hello, thank you very much for the invention of the Nanoflann library, which solved many of our problems. I'm having some problems. When the number of point clouds is less...
Hi as some [speed improvement is expected since version 1.53](https://github.com/jlblancoc/nanoflann/releases/tag/v1.5.3), could you please update the port to 1.53 or 1.54 ? Best, Pierre
I'm trying to use k-d tree in order to query fastest point, What i tried was 1) Implement custom metric, returning negative distance. ```cpp struct InverseDistanceMetric { using ElementType =...
I am build a KD tree with some constraint. For object it has timestamp `t` and a 3D position `p`, only the delta time less than some threshold, the distance...
Hello, I've been using the nanoflann library, and the KDTree algorithm developed by your team is incredibly efficient, greatly benefiting my current project. However, I recently encountered an issue where...
Hello, is there any reason for there not to be a radius search for the dynamic adaptor? Any plans to implement this?
