I have a collection of query points, std::vector<float> queryPoints(2 * sampleSz);, that I'd like to perform a radiusSearch for each of; I want the nearest neighbor or each query point. What is the fastest way to do this?
I've done a simple iteration over each query_pt[2], however with data egress an ingress other algorithms seem to provide an overall faster - from initialization to searching over the whole vector - times.
I have a collection of query points,
std::vector<float> queryPoints(2 * sampleSz);, that I'd like to perform aradiusSearchfor each of; I want the nearest neighbor or each query point. What is the fastest way to do this?I've done a simple iteration over each
query_pt[2], however with data egress an ingress other algorithms seem to provide an overall faster - from initialization to searching over the whole vector - times.