manolas
/
vcglib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

harmless clang warnings

This commit is contained in:
Paolo Cignoni 2015-11-26 22:02:43 +00:00
parent bc683209eb
commit d628c95688
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
vcg/complex/algorithms/point_outlier.h
View File

@ -58,7 +58,7 @@ class OutlierRemoval
typename MeshType::template PerVertexAttributeHandle<ScalarType> plof = tri::Allocator<MeshType>:: template GetPerVertexAttribute<ScalarType>(mesh, std::string("plof")); typename MeshType::template PerVertexAttributeHandle<ScalarType> plof = tri::Allocator<MeshType>:: template GetPerVertexAttribute<ScalarType>(mesh, std::string("plof"));
#pragma omp parallel for schedule(dynamic, 10) #pragma omp parallel for schedule(dynamic, 10)
for (int i = 0; i < mesh.vert.size(); i++) for (size_t i = 0; i < mesh.vert.size(); i++)
{ {
PriorityQueue queue; PriorityQueue queue;
kdTree.doQueryK(mesh.vert[i].cP(), kNearest, queue); kdTree.doQueryK(mesh.vert[i].cP(), kNearest, queue);
@ -71,7 +71,7 @@ class OutlierRemoval
float mean = 0; float mean = 0;
#pragma omp parallel for reduction(+: mean) schedule(dynamic, 10) #pragma omp parallel for reduction(+: mean) schedule(dynamic, 10)
for (int i = 0; i < mesh.vert.size(); i++) for (size_t i = 0; i < mesh.vert.size(); i++)
{ {
PriorityQueue queue; PriorityQueue queue;
kdTree.doQueryK(mesh.vert[i].cP(), kNearest, queue); kdTree.doQueryK(mesh.vert[i].cP(), kNearest, queue);
@ -87,7 +87,7 @@ class OutlierRemoval
mean = sqrt(mean); mean = sqrt(mean);
#pragma omp parallel for schedule(dynamic, 10) #pragma omp parallel for schedule(dynamic, 10)
for (int i = 0; i < mesh.vert.size(); i++) for (size_t i = 0; i < mesh.vert.size(); i++)
{ {
ScalarType value = plof[i] / (mean * sqrt(2.0f)); ScalarType value = plof[i] / (mean * sqrt(2.0f));
double dem = 1.0 + 0.278393 * value; double dem = 1.0 + 0.278393 * value;