nanoflann issues

Non consistent Output of Neighbor Search

1

Hi thanks for the great work. I encountered a potential bug within the lib. I want to filter my point cloud based on how many Neighbors a point has. For...

wienans

Feature request about NN search strategy.

3

There are two types of NNS query: the k-NN search and the fixed radius search. The combination of the two types yields the ranged search, i.e. the retrieval of the...

xlicz

Adding a previously removed index results in unexpected behavior.

3

I tried to add the removed index at https://github.com/jlblancoc/nanoflann/blob/4c47ca200209550c5628c89803591f8a753c8181/examples/dynamic_pointcloud_example.cpp#L69-L70 by adding the following code: ```c++ cloud.pts[N-1] = { 0.5, 0.5, 0.5 }; cout

YashBansod

bug

Storage container within RadiusResultSet

4

Would it be possible to replace the `m_indices_dists` container within `RadiusResultSet` of type `std::vector` with something that interoperates better with C? Currently, any attempt to use nanoflann from a language...

ivan-pi

enhancement

findNeighbors is slow for repeated calls, would be faster with caching in leaves

2

I'm using findNeighbors via PDAL filters.icp, and the general algorithm is (pseudocode): ``` # Given two point clouds A and B iterations = 100 # customizable kdtree = KDTree(A) for...

froody

Parallel KD-Tree construction

12

Hey thanks for the great project! I am wondering if there is any easy way (or forked project) to enable parallelism for KD-Tree construction with nanoflann? Or do you have...

B1ueber2y

Incremental creation of KD-TREE

3

Hi, I wanted to know if there is a way to incrementally add points to the kd-tree, like say one at a time. What I basically want to achieve is...

karry3775

SO(3) radius querries

1

I have a set of orientations and need to find all orientations in a radius. In my case, the radius is the smallest delta orientation around any axis (equivalent to...

barcode