diff --git a/vcg/complex/algorithms/point_sampling.h b/vcg/complex/algorithms/point_sampling.h
index d31b0d27..e9664470 100644
--- a/vcg/complex/algorithms/point_sampling.h
+++ b/vcg/complex/algorithms/point_sampling.h
@@ -1260,7 +1260,7 @@ static void PoissonDiskPruning(MetroMesh &origMesh, VertexSampler &ps, MetroMesh
  */
 static void PoissonDisk(MetroMesh &origMesh, VertexSampler &ps, MetroMesh &montecarloMesh, ScalarType diskRadius, const struct PoissonDiskParam pp=PoissonDiskParam())
 {
-  int t0=clock();
+//  int t0=clock();
 	// spatial index of montecarlo samples - used to choose a new sample to insert
     MontecarloSHT montecarloSHTVec[5];
 
diff --git a/vcg/space/planar_polygon_tessellation.h b/vcg/space/planar_polygon_tessellation.h
index 085ea4a0..e73ffe84 100644
--- a/vcg/space/planar_polygon_tessellation.h
+++ b/vcg/space/planar_polygon_tessellation.h
@@ -116,11 +116,11 @@ namespace vcg {
 		Point3x n;
 
 		math::SubtractiveRingRNG rg;
-		int i12[2];
+		size_t i12[2];
 		S bestsn = -1.0;
 		Point3x bestn,u,v;
 		for(size_t i  =0; i < points.size();++i){
-			for(int j = 0; j < 2; ++j){ i12[j] = i; while(i12[j]==i) i12[j] = rg.generate(points.size()-1);}
+			for(size_t j = 0; j < 2; ++j){ i12[j] = i; while(i12[j]==i) i12[j] = rg.generate(points.size()-1);}
 			n = (points[i12[0]]-points[i])^(points[i12[1]]-points[i]);
 			S sn = n.SquaredNorm();
 			if(sn > bestsn){ bestsn = sn; bestn = n;}