nanoflann

nanoflann copied to clipboard

Point update safety

2

Just from reading over the code, it seems like updating the values within the data-source may potentially break searches. Am I missing something? The obvious solution to doing "updates", would...

dmadisetti

The benchmarks target fails: libfastann.so, needed by 'bin/benchmark_fastann_real', missing

1

I run ```cmake -DBUILD_BENCHMARKS=ON```, then ```ninja all```, then ```ninja benchmarks```. ``` -- Build files have been written to: /usr/ports/math/nanoflann/work/.build ninja: error: '/usr/ports/math/nanoflann/work/nanoflann-1.3.0/build/fastann-prefix/src/fastann-build/libfastann.so', needed by 'bin/benchmark_fastann_real', missing and no known rule...

yurivict

KDTreeSingleIndexDynamicAdaptor_ vs KDTreeSingleIndexDynamicAdaptor

1

First, thanks for sharing your great code. 👍 I'm a bit confused between `KDTreeSingleIndexDynamicAdaptor`and `KDTreeSingleIndexDynamicAdaptor_`. What are the differences ? For instance , `KDTreeSingleIndexDynamicAdaptor_` supports `radiusSearch` but your dynamic point...

dcoeurjo

Possible to add points to kd tree without rebuilding index from scratch?

3

Hello, Say i have a set of ten 2D points in a list of some sort (i also have an adapter for that list written). I build a kd tree...

JadBatmobile

Re-use previous node for faster lookup?

2

I'm doing a lot of `findNeighbors` (for `k = 1`) close to each other. The results (and tree traversal) should be pretty coherent. Is there a way to re-use the...

Philip-Trettner

``` // Dimensionality set at run-time (default: L2) typedef KDTreeEigenMatrixAdaptor my_kd_tree_t; // Dimensionality set at compile-time // typedef KDTreeEigenMatrixAdaptor< Eigen::Matrix > // my_kd_tree_t; ``` For the one set at compile-time,...

tawe141

Add support for ray search

5

Hi, Would it be possible to add a method to get all indices of points that are traversed by a ray? Something like: `size_t raySearch(const ElementType *ray_origin, const ElementType *ray_direction,...

herpec-j

I try to figure out what is the normal behaviour when I build index on a matrix (x,y) with a query based on another matrix (x,y) How many results nannoflann...

ptvn

Tree building time in the example pointcloud_kdd_radius.cpp is far slow then expected

1

Hi I try to estimate the time consumed in building the KDtree for NN search. In the example pointcloud_kdd_radius.cpp I add the following clock() to tick the time for 100k...

dalishi

nanoflann orders of magnitude slower when using large samples

3

Hi I'm using the [Vector_of_Vectors](https://github.com/jlblancoc/nanoflann/blob/master/examples/vector_of_vectors_example.cpp) example to find nearest neighbors to 128 dimensional float vectors. When using `1e6` samples everything seems fast enough: Building the tree and building the index....

Nelthirion