Index: /issm/trunk/src/c/Bamgx/objects/CrackedEdge.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/CrackedEdge.cpp	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/CrackedEdge.cpp	(revision 3325)
@@ -14,21 +14,4 @@
 
 	/*Methods*/
-	/*FUNCTION CrackedEdge::Crack {{{1*/
-	void CrackedEdge::Crack() {
-		a.Crack();
-		b.Crack();
-	}
-	/*}}}*/
-	/*FUNCTION CrackedEdge::UnCrack {{{1*/
-	void CrackedEdge::UnCrack() {
-		a.UnCrack();
-		b.UnCrack();
-	}
-	/*}}}*/
-	/*FUNCTION {{{1*/
-	void CrackedEdge::Set(){
-		a.Set();
-		b.Set();}
-	/*}}}*/
 
 } 
Index: /issm/trunk/src/c/Bamgx/objects/CrackedEdge.h
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/CrackedEdge.h	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/CrackedEdge.h	(revision 3325)
@@ -21,98 +21,11 @@
 	class CrackedEdge {
 
-		friend class Triangles;
-
-		class CrackedTriangle {
-			friend class Triangles;
-			friend class CrackedEdge;
-			Triangle* t; // edge of triangle t
-			int i;       //  edge number of in triangle
-			Edge *edge;  // the  2 edge 
-			Vertex *New[2]; // new vertex number 
-
-			//Constructors
-			CrackedTriangle() : t(0),i(0),edge(0) { New[0]=New[1]=0;} 
-			CrackedTriangle(Edge * a) : t(0),i(0),edge(a) { New[0]=New[1]=0;} 
-
-			//Methods
-			void Crack();
-			void UnCrack();
-			void Set();
-		};
-
-		public:  
-			CrackedTriangle a,b; 
+			Triangle a,b; 
 
 			//Constructors
 			CrackedEdge() :a(),b() {}
-			CrackedEdge(Edge * start, long  i,long j) : a(start+i),b(start+j) {};
-			CrackedEdge(Edge * e0, Edge * e1 ) : a(e0),b(e1) {};
 
 			//Methods
-			void Crack();
-			void UnCrack();
-			void Set();
 	};
-
-	/*Intermediary*/
-	inline TriangleAdjacent FindTriangleAdjacent(Edge &E){
-		/*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp)*/
-
-		Vertex * a = E.v[0];
-		Vertex * b = E.v[1];
-
-		Triangle * t = a->t;
-		int i = a->vint;
-		TriangleAdjacent ta(t,EdgesVertexTriangle[i][0]); // Previous edge
-		if (!t || i<0 || i>=3){
-			throw ErrorException(__FUNCT__,exprintf("!t || i<0 !! i>=3"));
-		}
-		if ( a!=(*t)(i)){
-			throw ErrorException(__FUNCT__,exprintf("a!=(*t)(i)"));
-		}
-		int k=0;
-		do { // turn around vertex in direct sens (trigo)
-			k++;
-			if (k>=20000){
-				throw ErrorException(__FUNCT__,exprintf("k>=20000"));
-			}
-			//  in no crack => ta.EdgeVertex(1) == a otherwise ??? 
-			if (ta.EdgeVertex(1) ==  a && ta.EdgeVertex(0) ==  b) return ta; // find 
-			ta = ta.Adj();
-			if (ta.EdgeVertex(0) ==  a && ta.EdgeVertex(1) ==  b) return ta; // find 
-			--ta;
-		} while (t != (Triangle *)ta);
-		throw ErrorException(__FUNCT__,exprintf("FindTriangleAdjacent: triangle not found"));
-		return TriangleAdjacent(0,0);//for compiler
-	}
-	inline Vertex* TheVertex(Vertex * a){// for remove crak in mesh 
-		/*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp)*/
-
-		// give a unique vertex with smallest number
-		// in case on crack in mesh 
-		Vertex * r(a), *rr;
-		Triangle * t = a->t;
-		int i = a->vint;
-		TriangleAdjacent ta(t,EdgesVertexTriangle[i][0]); // Previous edge
-		if (!t || i<0 || i>=3){
-			throw ErrorException(__FUNCT__,exprintf("!t || i<0 !! i>=3"));
-		}
-		if ( a!=(*t)(i)){
-			throw ErrorException(__FUNCT__,exprintf("a!=(*t)(i)"));
-		}
-		int k=0;
-		do { // turn around vertex in direct sens (trigo)
-			k++;
-			if (k>=20000){
-				throw ErrorException(__FUNCT__,exprintf("k>=20000"));
-			}
-			//  in no crack => ta.EdgeVertex(1) == a
-			if ((rr=ta.EdgeVertex(0)) < r) r = rr;
-			ta = ta.Adj();
-			if ((rr=ta.EdgeVertex(1)) < r) r =rr;
-			--ta;
-		} while (t != (Triangle*) ta);  
-		return r;
-	}
 
 }
Index: /issm/trunk/src/c/Bamgx/objects/CrackedTriangle.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/CrackedTriangle.cpp	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/CrackedTriangle.cpp	(revision 3325)
@@ -14,39 +14,4 @@
 
 	/*Methods*/
-	/*FUNCTION CrackedEdge::CrackedTriangle::Crack{{{1*/
-	void CrackedEdge::CrackedTriangle::Crack(){ 
-		Triangle & T(*t); 
-		int i0=VerticesOfTriangularEdge[i][0];
-		int i1=VerticesOfTriangularEdge[i][0];
-		if (!New[0] && !New[1]){
-			throw ErrorException(__FUNCT__,exprintf("!New[0] && !New[1]"));
-		}
-		T(i0) = New[0];
-		T(i1) = New[1];
-	} 
-	/*}}}*/
-	/*FUNCTION CrackedEdge::CrackedTriangle::UnCrack {{{1*/
-	void CrackedEdge::CrackedTriangle::UnCrack(){ 
-		Triangle & T(*t); 
-		int i0=VerticesOfTriangularEdge[i][0];
-		int i1=VerticesOfTriangularEdge[i][0];
-		if (!New[0] && !New[1]){
-			throw ErrorException(__FUNCT__,exprintf("!New[0] && !New[1]"));
-		}
-		T(i0) = TheVertex(T(i0));
-		T(i1) = TheVertex(T(i1));
-	} 
-	/*}}}*/
-	/*FUNCTION CrackedEdge::CrackedTriangle::Set {{{1*/
-	void CrackedEdge::CrackedTriangle::Set(){
-		TriangleAdjacent ta( FindTriangleAdjacent(*edge));
-		t = ta;
-		i = ta;
-
-		New[0] = ta.EdgeVertex(0);
-		New[1] = ta.EdgeVertex(1);
-		// warning the ref 
-	} 
-	/*}}}*/
 
 } 
Index: /issm/trunk/src/c/Bamgx/objects/Geometry.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/Geometry.cpp	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/Geometry.cpp	(revision 3325)
@@ -182,15 +182,4 @@
 		}
 
-		//CrackedEdges
-		if (bamggeom->CrackedEdges){
-			if(verbose>5) printf("      processing CrackedEdges\n");
-			for (i=0;i<bamggeom->CrackedEdgesSize[0];i++){
-				throw ErrorException(__FUNCT__,exprintf("Not implemented yet"));
-			}
-		}
-		else{
-			if(verbose>5) printf("      no CrackedEdges found\n");
-		}
-
 		//hVertices
 		if(bamggeom->hVertices){
@@ -202,7 +191,4 @@
 			}
 		}
-		else{
-			if(verbose>5) printf("      no hVertices found\n");
-		}
 
 		//MetricVertices
@@ -212,7 +198,4 @@
 				vertices[i].m = Metric((double)bamggeom->MetricVertices[i*3+0],(double)bamggeom->MetricVertices[i*3+1],(double)bamggeom->MetricVertices[i*3+2]);
 			}
-		}
-		else{
-			if(verbose>5) printf("      no MetricVertices found\n");
 		}
 
@@ -229,7 +212,4 @@
 			}
 		}
-		else{
-			if(verbose>5) printf("      no h1h2VpVertices found\n");
-		}
 
 		//MaximalAngleOfCorner
@@ -237,7 +217,4 @@
 			if(verbose>5) printf("      processing MaximalAngleOfCorner\n");
 			MaximalAngleOfCorner=bamgopts->MaximalAngleOfCorner*Pi/180;
-		}
-		else{
-			if(verbose>5) printf("      no MaximalAngleOfCorner found\n");
 		}
 
@@ -260,7 +237,4 @@
 				edges[i].tg[j] = tg;
 			}
-		}
-		else{
-			if(verbose>5) printf("      no TangentAtEdges found\n");
 		}
 
@@ -278,7 +252,4 @@
 				vertices[j].SetRequired();  }
 		}
-		else{
-			if(verbose>5) printf("      no Corners found\n");
-		}
 
 		//RequiredVertices
@@ -294,7 +265,4 @@
 				vertices[j].SetRequired();  }
 		}
-		else{
-			if(verbose>5) printf("      no RequiredVertices found\n");
-		}
 
 		//RequiredEdges
@@ -310,7 +278,4 @@
 				edges[j].SetRequired();  
 			}
-		}
-		else{
-			if(verbose>5) printf("      no RequiredEdges found\n");
 		}
 
@@ -334,7 +299,4 @@
 			}
 		}
-		else{
-			if(verbose>5) printf("      no SubDomains found\n");
-		}
 	}
 	/*}}}1*/
@@ -384,27 +346,6 @@
 				//update counters
 				if (edges[i].Required()) nbreq++;
-				if (edges[i].Cracked()){
-					if (i<=Number(edges[i].link)) nbcracked++;
-				}
 				if (edges[i].TgA() && edges[i][0].Corner()) nbtan++;
 				if (edges[i].TgB() && edges[i][1].Corner()) nbtan++;
-			}
-		}
-
-		/*CrackedEdges*/
-		if(verbose>5) printf("      writing CrackedEdges\n");
-		bamggeom->CrackedEdgesSize[0]=nbcracked;
-		bamggeom->CrackedEdgesSize[1]=2;
-		if (nbcracked){
-			bamggeom->CrackedEdges=(double*)xmalloc(2*nbcracked*sizeof(double));
-			count=0;
-			for (i=0;i<nbe;i++){
-				if (edges[i].Cracked()){
-					if (i<=Number(edges[i].link)){
-						bamggeom->CrackedEdges[count*2+0]=i+1;                     //back to Matlab indexing
-						bamggeom->CrackedEdges[count*2+1]=Number(edges[i].link)+1; //back to Matlab indexing
-						count=count+1;
-					}
-				}
 			}
 		}
@@ -543,25 +484,4 @@
 			}
 			throw ErrorException(__FUNCT__,exprintf("See above"));
-		}
-
-		//  verification of cracked edge (to be completed)
-		for (i=0;i<nbe;i++){
-			if (edges[i].Cracked() ) {
-				//    verification of crack
-				GeometricalEdge & e1=edges[i];
-				GeometricalEdge & e2=*e1.link;
-				if ( e1[0].The() == e2[0].The() && e1[1].The() == e2[1].The() )
-				  {
-					//nothing
-				  }
-				else 
-				 if ( e1[0].The() == e2[1].The() && e1[1].The() == e2[0].The() )
-					{
-					 //nothing
-					}
-				 else {
-					 throw ErrorException(__FUNCT__,exprintf("Cracked edges with no same vertex")); 
-				 }
-			}
 		}
 
Index: /issm/trunk/src/c/Bamgx/objects/TriangleAdjacent.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/TriangleAdjacent.cpp	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/TriangleAdjacent.cpp	(revision 3325)
@@ -27,9 +27,4 @@
 	}
 	/*}}}*/
-	/*FUNCTION TriangleAdjacent::Cracked {{{1*/
-	int  TriangleAdjacent::Cracked() const {
-		return t->TriaAdjSharedEdge[a] & 32;
-	}
-	/*}}}*/
 	/*FUNCTION TriangleAdjacent::GetAllFlag_UnSwap {{{1*/
 	int  TriangleAdjacent::GetAllFlag_UnSwap() const {
@@ -41,9 +36,4 @@
 	void TriangleAdjacent::SetLock(){
 		t->SetLocked(a);
-	}
-	/*}}}*/
-	/*FUNCTION TriangleAdjacent::SetCracked {{{1*/
-	void TriangleAdjacent::SetCracked() {
-		t->SetCracked(a);
 	}
 	/*}}}*/
Index: /issm/trunk/src/c/Bamgx/objects/TriangleAdjacent.h
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/TriangleAdjacent.h	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/TriangleAdjacent.h	(revision 3325)
@@ -38,8 +38,6 @@
 			int  Locked() const;
 			int  MarkUnSwap() const;
-			int  Cracked() const;
 			int  GetAllFlag_UnSwap() const;
 			void SetLock();
-			void SetCracked();
 			void SetAdj2(const TriangleAdjacent &ta, int l=0);
 			int  swap();
Index: /issm/trunk/src/c/Bamgx/objects/Triangles.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/Triangles.cpp	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/Triangles.cpp	(revision 3325)
@@ -481,19 +481,4 @@
 		else{
 			if(verbose>5) printf("      no Edges found\n");
-		}
-
-		//CrackedEdges
-		if(bamgmesh->CrackedEdges){
-			if(verbose>5) printf("      processing CrackedEdges\n");
-			NbCrackedEdges=bamgmesh->CrackedEdgesSize[0];
-			CrackedEdges=new CrackedEdge[NbCrackedEdges];
-			for (i=0;i<NbCrackedEdges;i++){
-				//CrackedEdges[i].a.edge=bamgmesh->CrackedEdges[i*2+0]-1; //C indexing
-				//CrackedEdges[i].b.edge=bamgmesh->CrackedEdges[i*1+0]-1; //C indexing
-				throw ErrorException(__FUNCT__,exprintf("not implemented yet"));
-			}
-		}
-		else{
-			if(verbose>5) printf("      no CrackedEdges found\n");
 		}
 
@@ -718,16 +703,4 @@
 		}
 
-		/*CrackedEdges*/
-		if(verbose>5) printf("      writing CrackedEdges\n");
-		bamgmesh->CrackedEdgesSize[0]=NbCrackedEdges;
-		bamgmesh->CrackedEdgesSize[1]=2;
-		if (NbCrackedEdges){
-			bamgmesh->CrackedEdges=(double*)xmalloc(2*NbCrackedEdges*sizeof(double));
-			for (i=0;i<NbCrackedEdges;i++){
-				bamgmesh->CrackedEdges[i*2+0]=Number(CrackedEdges[i].a.edge)+1; //back to M indexing
-				bamgmesh->CrackedEdges[i*2+1]=Number(CrackedEdges[i].b.edge)+1; //back to M indexing
-			}
-		}
-
 		/*Triangles*/
 		if(verbose>5) printf("      writing Triangles\n");
@@ -2193,157 +2166,4 @@
 	}
 	/*}}}1*/
-		/*FUNCTION Triangles::Crack{{{1*/
-		int  Triangles::Crack() { 
-			/*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp/Crack)*/
-			if (NbCrackedEdges!=0 && NbCrackedVertices<=0);{
-				throw ErrorException(__FUNCT__,exprintf("NbCrackedEdges!=0 && NbCrackedVertices<=0"));
-			}
-			for (int i=0;i<NbCrackedEdges;i++) CrackedEdges[i].Crack();
-			return NbCrackedEdges;
-		}
-		/*}}}1*/
-		/*FUNCTION Triangles::CrackMesh{{{1*/
-		int Triangles::CrackMesh() {
-			/*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp/CrackMesh)*/
-
-			int verbosity=0;
-			int i,k;
-			//  computed the number of cracked edge
-			for (k=i=0;i<nbe;i++)
-			 if(edges[i].onGeometry->Cracked()) k++;
-			if( k==0) return 0;
-			printf("      number of Cracked Edges = %i\n",k);
-			NbCrackedEdges =k;
-			CrackedEdges = new  CrackedEdge[k];
-			//  new edge
-			Edge * e = new Edge[ nbe + k];
-
-			// copy
-			for (i=0;i<nbe;i++) 
-			 e[i] = edges[i];
-			delete edges;
-			edges = e;
-
-			const int  nbe0  = nbe;
-			for (k=i=0;i<nbe0;i++) // on double les arete cracked 
-			 if(edges[i].onGeometry->Cracked())
-				{
-				 e[nbe] = e[i];
-				 //  return the edge 
-				 e[nbe].v[0] =  e[i].v[1];
-				 e[nbe].v[1] =  e[i].v[0];
-				 e[nbe].onGeometry = e[i].onGeometry->link ; // faux 
-				 CrackedEdges[k++]=CrackedEdge(edges,i,nbe);
-				 nbe++;
-				}
-			ReMakeTriangleContainingTheVertex() ; 
-			//  
-			int nbcrakev  =0;
-			Vertex *vlast = vertices + nbv;
-			Vertex *vend = vertices + nbvx; // end of array
-			for (int iv=0;iv<nbv;iv++) // vertex 
-			  {
-				Vertex & v= vertices[iv];
-				Vertex * vv = & v;  
-				int kk=0; // nb cracked
-				int kc=0; 
-				int kkk =0; // nb triangle  with same number 
-				Triangle * tbegin = v.t;
-				int i  = v.vint;       
-				if (!tbegin || (i<0) || (i>=3)){
-					throw ErrorException(__FUNCT__,exprintf("!tbegin || (i<0) || (i>=3)"));
-				}
-				// turn around the vertex v
-				TriangleAdjacent ta(tbegin,EdgesVertexTriangle[i][0]);// previous edge
-				int k=0;
-				do {
-					int kv = VerticesOfTriangularEdge[ta][1];
-					k++; 
-					Triangle * tt (ta);
-					if ( ta.Cracked() ) 
-					  {   
-						TriangleAdjacent tta=(ta.Adj());
-						if (!tta.Cracked()){
-							throw ErrorException(__FUNCT__,exprintf("!tta.Cracked()"));
-						}
-						if ( kk == 0) tbegin=ta,kkk=0;  //  begin by a cracked edge  => restart                
-						if (  kkk ) { kc =1;vv = vlast++;  kkk = 0; } // new vertex if use 
-						kk++;// number of cracked edge view                 
-					  }
-					if ( tt->link ) { // if good triangles store the value 
-						int it = Number(tt);
-						if (it>=nt){
-							throw ErrorException(__FUNCT__,exprintf("(it>=nt)"));
-						}
-						(*tt)(kv)= vv; //   Change the vertex of triangle 
-						if(vv<vend) {*vv= v;vv->ReferenceNumber=iv;} // copy the vertex value + store the old vertex number in ref 
-						//	  tt->SetTriangleContainingTheVertex();
-						kkk++;
-					} else if (kk) { // crack + boundary 
-						if (  kkk ) { kc =1;vv = vlast++;  kkk = 0; } // new vertex if use 
-					}
-
-					ta = Next(ta).Adj(); 
-				} while ( (tbegin != ta)); 
-				if (!k){
-					throw ErrorException(__FUNCT__,exprintf("!k"));
-				}
-				if (kc)  nbcrakev++;
-			  }
-
-			if ( nbcrakev ) 
-			 for (int iec =0;iec < NbCrackedEdges; iec ++)
-			  CrackedEdges[iec].Set();
-
-			//  set the ref 
-			NbCrackedVertices =   nbcrakev;
-			// int nbvo = nbv;
-			nbv = vlast - vertices;
-			int nbnewv =  nbv - nbv; // nb of new vrtices 
-			if (nbcrakev && verbosity > 1 ) printf("      number of Cracked vertices = %i, number of created vertices = %i\n",nbcrakev,nbnewv);
-			// all the new vertices are on geometry 
-			if (nbnewv)
-			  { // 
-				long n = nbnewv+NbVerticesOnGeomVertex;
-				long i,j,k;
-				VertexOnGeom * vog = new VertexOnGeom[n];
-				for ( i =0; i<NbVerticesOnGeomVertex;i++) 
-				 vog[i]=VerticesOnGeomVertex[i];
-				delete [] VerticesOnGeomVertex;
-				VerticesOnGeomVertex = vog;
-				// loop on cracked edge 
-				Vertex * LastOld = vertices + nbv - nbnewv;
-				for (int iec =0;iec < NbCrackedEdges; iec ++)
-				 for (k=0;k<2;k++)
-					{
-					 Edge & e = *( k ? CrackedEdges[iec].a.edge : CrackedEdges[iec].b.edge);
-					 for (j=0;j<2;j++) 
-						{
-						 Vertex * v = e(j);
-						 if ( v >=  LastOld)
-							{ // a new vertex 
-							 long old = v->ReferenceNumber ; // the old same vertex 
-							 long i  = ( v - LastOld);
-							 //  if the old is on vertex => warning
-							 // else the old is on edge => ok 
-							 vog[i] = vog[old];
-							 //  		    vog[i].mv = v;
-							 //g[i].ge = ;
-							 //og[i].abcisse = ;
-							}
-
-						}
-					}
-
-				NbVerticesOnGeomVertex = n;
-			  }
-			SetVertexFieldOn();
-
-			if (vlast >= vend) {  
-				throw ErrorException(__FUNCT__,exprintf("Not enougth vertices: to crack the mesh we need %i vertices",nbv));
-			}
-			return  NbCrackedVertices;
-		}
-		/*}}}1*/
 	/*FUNCTION Triangles::ForceBoundary{{{1*/
 		void Triangles::ForceBoundary() {
@@ -2381,6 +2201,4 @@
 					throw ErrorException(__FUNCT__,exprintf("Missing Edge %i, v0=%i,v1=%i",i,Number(edges[i][0]),Number(edges[i][1])));
 				}
-				if ( nbswp >=0 && edges[i].onGeometry->Cracked())
-				 ta.SetCracked();
 			}
 
@@ -3928,10 +3746,10 @@
 	NbVertexOnBThVertex=0;
 	NbVertexOnBThEdge=0;
-	VertexOnBThVertex=0;
-	VertexOnBThEdge=0;
+	VertexOnBThVertex=NULL;
+	VertexOnBThEdge=NULL;
 
 	NbCrackedVertices=0;
-	NbCrackedEdges =0;
-	CrackedEdges  =0;  
+	NbCrackedEdges   =0;
+	CrackedEdges     =NULL;  
 	nbe = 0; 
 
@@ -3951,17 +3769,17 @@
 	}
 	else {
-		vertices=0;
-		ordre=0;
-		triangles=0;
+		vertices=NULL;
+		ordre=NULL;
+		triangles=NULL;
 		nbtx=0;
 	} 
 
-	quadtree=0;
-	edges=0;
-	VerticesOnGeomVertex=0;
-	VerticesOnGeomEdge=0;
+	quadtree=NULL;
+	edges=NULL;
+	VerticesOnGeomVertex=NULL;
+	VerticesOnGeomEdge=NULL;
 	NbVerticesOnGeomVertex=0;
 	NbVerticesOnGeomEdge=0;
-	subdomains=0;
+	subdomains=NULL;
 	NbSubDomains=0;
 }
@@ -5467,16 +5285,4 @@
 }
 /*}}}1*/
-/*FUNCTION Triangles::UnCrack{{{1*/
-int Triangles::UnCrack() { 
-	/*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp/UnCrack)*/
-
-	if (NbCrackedEdges!=0 && NbCrackedVertices<=0);{
-		throw ErrorException(__FUNCT__,exprintf("NbCrackedEdges ==0 || NbCrackedVertices >0"));
-	}
-	for (int i=0;i<NbCrackedEdges;i++)
-	 CrackedEdges[i].UnCrack();
-	return NbCrackedEdges;
-}
-/*}}}1*/
 
 	/*Intermediary*/
Index: /issm/trunk/src/c/Bamgx/objects/Triangles.h
===================================================================
--- /issm/trunk/src/c/Bamgx/objects/Triangles.h	(revision 3324)
+++ /issm/trunk/src/c/Bamgx/objects/Triangles.h	(revision 3325)
@@ -59,5 +59,5 @@
 			long NbCrackedVertices;
 			long NbCrackedEdges;
-			CrackedEdge *CrackedEdges;
+			CrackedEdge* CrackedEdges;
 			R2 pmin,pmax;    // extrema
 			double coefIcoor; // coef to integer Icoor1;
@@ -143,9 +143,6 @@
 			void AddGeometryMetric(BamgOpts* bamgopts);
 			int  isCracked() const {return NbCrackedVertices != 0;}
-			int  Crack();
-			int  UnCrack();
 			void BuildGeometryFromMesh(BamgOpts* bamgopts=NULL);
 			void ReconstructExistingMesh();
-			int  CrackMesh();
 
 			//Inline methods