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

removed harmless warnings

This commit is contained in:
Luigi Malomo 2017-04-16 16:24:00 +02:00
parent d7e9209a4f
commit 066762521a
3 changed files with 2 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
vcg/complex/algorithms/polygonal_algorithms.h
View File

@ -171,8 +171,6 @@ private:
static bool CollapseBorderSmallEdgesStep(PolyMeshType &poly_m, static bool CollapseBorderSmallEdgesStep(PolyMeshType &poly_m,
const ScalarType edge_limit) const ScalarType edge_limit)
{ {
bool collapsed=false;
//update topology //update topology
vcg::tri::UpdateTopology<PolyMeshType>::FaceFace(poly_m); vcg::tri::UpdateTopology<PolyMeshType>::FaceFace(poly_m);
@ -440,8 +438,6 @@ public:
ScalarType Damp=0.5, ScalarType Damp=0.5,
ScalarType angleDeg=100) ScalarType angleDeg=100)
{ {
typedef typename TriMeshType::FaceType FaceType;
//first select corners //first select corners
vcg::tri::UpdateFlags<PolyMeshType>::VertexClearS(poly_m); vcg::tri::UpdateFlags<PolyMeshType>::VertexClearS(poly_m);

2
wrap/io_trimesh/import_obj.h
View File

@ -681,7 +681,7 @@ namespace vcg {
for(unsigned int j=0;j<indexedFaces[i].v.size();++j) for(unsigned int j=0;j<indexedFaces[i].v.size();++j)
{ {
int vertInd = indexedFaces[i].v[j]; int vertInd = indexedFaces[i].v[j];
assert(vertInd >=0 && vertInd < m.vn); assert(vertInd >=0 && vertInd < m.vn); (void)vertInd;
m.face[i].V(j) = &(m.vert[indexedFaces[i].v[j]]); m.face[i].V(j) = &(m.vert[indexedFaces[i].v[j]]);
if (((oi.mask & vcg::tri::io::Mask::IOM_WEDGTEXCOORD) != 0) && (HasPerWedgeTexCoord(m))) if (((oi.mask & vcg::tri::io::Mask::IOM_WEDGTEXCOORD) != 0) && (HasPerWedgeTexCoord(m)))

2
wrap/qt/Outline2ToQImage.cpp
View File

@ -171,7 +171,7 @@ int Outline2Dumper::getMaxMaskRadius(int x,int y,QImage &img)
int Max_radius=std::min(Max_radiusX,Max_radiusY); int Max_radius=std::min(Max_radiusX,Max_radiusY);
int val=qGray(img.pixel(x,y)); int val=qGray(img.pixel(x,y));
///if is outside ///if is outside
assert(val!=255); assert(val!=255); (void)val;
int curr_radius=1; int curr_radius=1;
while (curr_radius<Max_radius) while (curr_radius<Max_radius)