songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Removed: Unnecessary debug logging

This commit is contained in:
Hardik Jain 2020-03-28 16:55:29 +01:00 committed by hrdkjain@cordelia-ubuntu
parent 337365a4f1
commit 9e49252247
2 changed files with 0 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_iterative_parameterizer_3.h
View File

@ -9,7 +9,6 @@
#define CGAL_SURFACE_MESH_PARAMETERIZATION_FIXED_BORDER_ITERATIVE_PARAMETERIZER_3_H #define CGAL_SURFACE_MESH_PARAMETERIZATION_FIXED_BORDER_ITERATIVE_PARAMETERIZER_3_H
#define DEBUG_L0 1 #define DEBUG_L0 1
#define DEBUG_L1 0
#include <CGAL/license/Surface_mesh_parameterization.h> #include <CGAL/license/Surface_mesh_parameterization.h>
@ -239,11 +238,6 @@ public:
// //
initialize_system_from_mesh_border(A, Bu, Bv, mesh, bhd, uvmap1, vimap1); initialize_system_from_mesh_border(A, Bu, Bv, mesh, bhd, uvmap1, vimap1);
if(DEBUG_L1) {
printMatrix(vertices, vimap1, A, "A");
printVector(vertices, vimap1, Bu, "Bu");
printVector(vertices, vimap1, Bv, "Bv");
}
// Fill the matrix for the inner vertices v_i: compute A's coefficient // Fill the matrix for the inner vertices v_i: compute A's coefficient
// w_ij for each neighbor j; then w_ii = - sum of w_ijs // w_ij for each neighbor j; then w_ii = - sum of w_ijs
boost::unordered_set<vertex_descriptor> main_border; boost::unordered_set<vertex_descriptor> main_border;
@ -298,12 +292,6 @@ public:
} }
} }
if(DEBUG_L1) {
print(A, Xu, Bu);
std::cout << std::endl;
print(A, Xv, Bv);
}
// solve linear equations // solve linear equations
// Solve "A*Xu = Bu". On success, solution is (1/Du) * Xu. // Solve "A*Xu = Bu". On success, solution is (1/Du) * Xu.
// Solve "A*Xv = Bv". On success, solution is (1/Dv) * Xv. // Solve "A*Xv = Bv". On success, solution is (1/Dv) * Xv.

14
Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Iterative_authalic_parameterizer_3.h
View File

@ -406,21 +406,12 @@ private:
} }
double getvL2(const TriangleMesh& mesh, vertex_descriptor &vertex) const { double getvL2(const TriangleMesh& mesh, vertex_descriptor &vertex) const {
bool debug = false;
if(vertex == 711111)
debug = true;
if(debug)
std::cout << "\t" << vertex << "\t" << std::flush;
halfedge_descriptor hf = halfedge(vertex, mesh); halfedge_descriptor hf = halfedge(vertex, mesh);
if(debug)
std::cout << hf << "\t" << std::flush;
face_around_target_circulator f_j(hf, mesh), end_f_j = f_j; face_around_target_circulator f_j(hf, mesh), end_f_j = f_j;
double varphi = 0.0; double varphi = 0.0;
double localArea = 0.0; double localArea = 0.0;
int i=0; int i=0;
CGAL_For_all(f_j, end_f_j) { CGAL_For_all(f_j, end_f_j) {
if(debug)
std::cout << *f_j << "\t" << std::flush;
if(*f_j > mesh.number_of_faces()) if(*f_j > mesh.number_of_faces())
continue; continue;
varphi += get(fL2Map,*f_j)*get(areaMap,*f_j); varphi += get(fL2Map,*f_j)*get(areaMap,*f_j);
@ -428,11 +419,6 @@ private:
i++; i++;
} }
if(debug) {
std::cout << varphi << "\t" << std::flush;
std::cout << localArea << "\t" << std::flush;
}
if(mesh.is_border(vertex) && mesh.degree(vertex) != i+1) if(mesh.is_border(vertex) && mesh.degree(vertex) != i+1)
std::cerr << std::endl; std::cerr << std::endl;
else if(!mesh.is_border(vertex) && mesh.degree(vertex) != i) else if(!mesh.is_border(vertex) && mesh.degree(vertex) != i)