new tri code more robust ; a new quad mesher available based on initial coarsening of the 1D mesh

Mesh/meshGFace.cpp

@@ -47,7 +47,7 @@
 #include "filterElements.h"
 
 // define this to use the old initial delaunay
-//#define OLD_CODE_DELAUNAY 1
+#define OLD_CODE_DELAUNAY 1
 
 static void computeElementShapes(GFace *gf, double &worst, double &avg,
                                  double &best, int &nT, int &greaterThan)

Mesh/meshGFaceDelaunayInsertion.cpp

@@ -1876,11 +1876,11 @@ void delaunayMeshIn2D(std::vector<MVertex*> &v,
 
   double t1 = Cpu();
 
-  Msg::Info("Delaunay 2D SORTING");
+  //  Msg::Info("Delaunay 2D SORTING");
   if(hilbertSort) SortHilbert(v);
 
   double ta=0,tb=0,tc=0,td=0,T;
-  Msg::Info("Delaunay 2D INSERTING");
+  //  Msg::Info("Delaunay 2D INSERTING");
   for (size_t i=0;i<v.size();i++){
     MVertex *pv = v[i];
 
@@ -1946,7 +1946,7 @@ void delaunayMeshIn2D(std::vector<MVertex*> &v,
   }
 
   double t2 = Cpu();
-  Msg::Info("Delaunay 2D done for %d points : CPU = %g, %d global searches, AVG walk size %g , AVG cavity size %g",
+  Msg::Debug("Delaunay 2D done for %d points : CPU = %g, %d global searches, AVG walk size %g , AVG cavity size %g",
 	    v.size(), t2-t1,NB_GLOBAL_SEARCH,1.+AVG_ITER/v.size(),AVG_CAVSIZE/v.size());
   //  printf("%g %g %g %g --> %g(%g)\n",ta,tb,tc,td,t2-t1,ta+tb+tc+td);