diff --git a/vcg/complex/algorithms/curve_on_manifold.h b/vcg/complex/algorithms/curve_on_manifold.h index 1bc35938..2c8e4abe 100644 --- a/vcg/complex/algorithms/curve_on_manifold.h +++ b/vcg/complex/algorithms/curve_on_manifold.h @@ -176,7 +176,7 @@ public: /** - * @brief MarkFauxEdgeWithPolyLine marks the edges of basemesh as non-faux when they coincide with the polyline ones * + * @brief TagFaceEdgeSelWithPolyLine selects edges of basemesh when they coincide with the polyline ones * * @param poly * @return true if all the edges of the polyline are snapped onto the mesh. * @@ -642,7 +642,7 @@ bool TagFaceEdgeSelWithPolyLine(MeshType &poly,bool markFlag=true) tri::UpdateTopology::TestVertexEdge(poly); tri::Allocator::CompactEveryVector(poly); tri::UpdateTopology::TestVertexEdge(poly); - printf("Simplify %5i -> %5i (total len %5.2f)\n",startEn,poly.en,hist.Sum()); +// printf("Simplify %5i -> %5i (total len %5.2f)\n",startEn,poly.en,hist.Sum()); } void EvaluateHausdorffDistance(MeshType &poly, Distribution &dist) @@ -1007,7 +1007,7 @@ bool TagFaceEdgeSelWithPolyLine(MeshType &poly,bool markFlag=true) } } // tri::Allocator::CompactEveryVector(poly); - printf("Refine %i -> %i\n",startEdgeSize,poly.en);fflush(stdout); +// printf("Refine %i -> %i\n",startEdgeSize,poly.en);fflush(stdout); } /** @@ -1068,7 +1068,7 @@ bool TagFaceEdgeSelWithPolyLine(MeshType &poly,bool markFlag=true) { tri::RequireCompactness(poly); tri::UpdateTopology::VertexEdge(poly); - printf("SmoothProject: Selected vert num %i\n",tri::UpdateSelection::VertexCount(poly)); +// printf("SmoothProject: Selected vert num %i\n",tri::UpdateSelection::VertexCount(poly)); assert(poly.en>0 && base.fn>0); for(int k=0;k::TestVertexEdge(poly); int dupVertNum = Clean::RemoveDuplicateVertex(poly); if(dupVertNum) { - printf("****REMOVED %i Duplicated\n",dupVertNum); +// printf("****REMOVED %i Duplicated\n",dupVertNum); tri::Allocator::CompactEveryVector(poly); tri::UpdateTopology::VertexEdge(poly); }