return;
}
- cout << "[ 20%] allocating memory \r";
+ // cout << "[ 20%] allocating memory \r";
point = new double*[numPoints];
tmppoint = new double*[numPoints+3];
f[i] = _f[i];
}
- cout << "[ 30%] creating delaunay diagram \r";
+ // cout << "[ 30%] creating delaunay diagram \r";
Delaunay2D();
}
nts = 1; // number of triangles
i4 = 1;
- cout << "[ 40%] create triangulation \r";
+ // cout << "[ 40%] create triangulation \r";
// compute triangulation
for (i0 = 0; i0 < numPoints; i0++)
}
// count the number of triangles
- cout << "[ 50%] count the number of triangles \r";
+ // cout << "[ 50%] count the number of triangles \r";
numTriangles = 0;
i0 = -1;
}
// create the triangles
- cout << "[ 60%] create the triangles \r";
+ // cout << "[ 60%] create the triangles \r";
triangle = new Triangle[numTriangles];
}
// build edge table
- cout << "[ 70%] build the edge table \r";
+ // cout << "[ 70%] build the edge table \r";
numEdges = 0;
edge = new Edge[3*numTriangles];
int j, j0, j1;
for (i = 0; i < numTriangles; i++)
{
- if ( (i%500) == 0)
- cout << "[ 7" << 10*i/numTriangles << "%] build the edge table \r";
+ // if ( (i%500) == 0)
+ // cout << "[ 7" << 10*i/numTriangles << "%] build the edge table \r";
Triangle& t = triangle[i];
}
// establish links between adjacent triangles
- cout << "[ 80%] establishing links between adjacent triangles \r";
+ // cout << "[ 80%] establishing links between adjacent triangles \r";
for (i = 0; i < numEdges; i++)
{
delete[] ccr[0];
delete[] ccr;
- cout << "[ 90%] finsishes delauney triangulation \r";
+ // cout << "[ 90%] finsishes delauney triangulation \r";
return result;
}