Commit 25d62f0a authored by Alexander Liao's avatar Alexander Liao
Browse files

fixed windows build error

parent 4614c3d5
...@@ -51,7 +51,7 @@ int nanoflann_neighbors(vector<scalar_t>& queries, vector<scalar_t>& supports, ...@@ -51,7 +51,7 @@ int nanoflann_neighbors(vector<scalar_t>& queries, vector<scalar_t>& supports,
for (auto& p0 : pcd_query.pts){ for (auto& p0 : pcd_query.pts){
// Find neighbors // Find neighbors
scalar_t query_pt[dim]; scalar_t* query_pt = new scalar_t[dim];
std::copy(p0.begin(), p0.end(), query_pt); std::copy(p0.begin(), p0.end(), query_pt);
//for(int i=0; i < p0.size(); i++) //for(int i=0; i < p0.size(); i++)
...@@ -60,7 +60,7 @@ int nanoflann_neighbors(vector<scalar_t>& queries, vector<scalar_t>& supports, ...@@ -60,7 +60,7 @@ int nanoflann_neighbors(vector<scalar_t>& queries, vector<scalar_t>& supports,
list_matches[i0].reserve(max_count); list_matches[i0].reserve(max_count);
std::vector<std::pair<size_t, scalar_t> > ret_matches; std::vector<std::pair<size_t, scalar_t> > ret_matches;
const size_t nMatches = index->radiusSearch(&query_pt[0], search_radius+eps, ret_matches, search_params); const size_t nMatches = index->radiusSearch(query_pt, search_radius+eps, ret_matches, search_params);
list_matches[i0] = ret_matches; list_matches[i0] = ret_matches;
if(max_count < nMatches) max_count = nMatches; if(max_count < nMatches) max_count = nMatches;
i0++; i0++;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment