diff --git a/vcg/complex/algorithms/polygonal_algorithms.h b/vcg/complex/algorithms/polygonal_algorithms.h
index fbbb9a28..6a6d2b6e 100644
--- a/vcg/complex/algorithms/polygonal_algorithms.h
+++ b/vcg/complex/algorithms/polygonal_algorithms.h
@@ -171,8 +171,6 @@ private:
     static bool CollapseBorderSmallEdgesStep(PolyMeshType &poly_m,
                                              const ScalarType edge_limit)
     {
-        bool collapsed=false;
-
         //update topology
         vcg::tri::UpdateTopology<PolyMeshType>::FaceFace(poly_m);
 
@@ -440,8 +438,6 @@ public:
                                          ScalarType Damp=0.5,
                                          ScalarType angleDeg=100)
     {
-        typedef typename TriMeshType::FaceType FaceType;
-
         //first select corners
         vcg::tri::UpdateFlags<PolyMeshType>::VertexClearS(poly_m);
 
diff --git a/wrap/io_trimesh/import_obj.h b/wrap/io_trimesh/import_obj.h
index 7c35eefc..5cb9258c 100644
--- a/wrap/io_trimesh/import_obj.h
+++ b/wrap/io_trimesh/import_obj.h
@@ -681,7 +681,7 @@ namespace vcg {
                         for(unsigned int j=0;j<indexedFaces[i].v.size();++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]]);
 
                             if (((oi.mask & vcg::tri::io::Mask::IOM_WEDGTEXCOORD) != 0) && (HasPerWedgeTexCoord(m)))
diff --git a/wrap/qt/Outline2ToQImage.cpp b/wrap/qt/Outline2ToQImage.cpp
index a5262c7a..1e6b9cf2 100644
--- a/wrap/qt/Outline2ToQImage.cpp
+++ b/wrap/qt/Outline2ToQImage.cpp
@@ -171,7 +171,7 @@ int Outline2Dumper::getMaxMaskRadius(int x,int y,QImage &img)
 	int Max_radius=std::min(Max_radiusX,Max_radiusY);
 	int val=qGray(img.pixel(x,y));
 	///if is outside
-	assert(val!=255);
+	assert(val!=255); (void)val;
 
 	int curr_radius=1;
 	while (curr_radius<Max_radius)