Changeset 16233 for issm/trunk-jpl/src/c/bamg/Triangle.cpp

Timestamp:

09/23/13 11:01:34 (11 years ago)

Author:

Mathieu Morlighem

Message:

DEL: removed legacy code

File:

• issm/trunk-jpl/src/c/bamg/Triangle.cpp (modified) (2 diffs)

issm/trunk-jpl/src/c/bamg/Triangle.cpp

@@ -53 +53 @@
                 return AdjacentTriangle(adj[i],AdjEdgeIndex[i]&3);
         };/*}}}*/
-        /*FUNCTION Triangle::Anisotropy{{{*/
-        double Triangle::Anisotropy() const{
-
-                double lmin,lmax;
-
-                /*Get three vertices A,B and C*/
-                R2 A=*this->vertices[0];
-                R2 B=*this->vertices[1];
-                R2 C=*this->vertices[2];
-
-                /*Compute edges*/
-                R2 e1=B-A;
-                R2 e2=C-A;
-                R2 e3=B-C;
-
-                /*Compute edge length*/
-                double l1=Norme2(e1);
-                double l2=Norme2(e2);
-                double l3=Norme2(e3);
-
-                lmin=l1;
-                lmin=min(lmin,l2);
-                lmin=min(lmin,l3);
-                lmax=l1;
-                lmax=max(lmax,l2);
-                lmax=max(lmax,l3);
-
-                return lmax/lmin;
-        };/*}}}*/
         /*FUNCTION Triangle::Length{{{*/
         double Triangle::Length() const{
@@ -133 +104 @@
 
                 return;
-        }
-        /*}}}*/
-        /*FUNCTION Triangle::FindBoundaryEdge{{{*/
-        AdjacentTriangle Triangle::FindBoundaryEdge(int i) const{
-                /*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp/FindBoundaryEdge)*/
-
-                /*Intermediary*/
-                Triangle* ttc=NULL;
-                int k,j,jc;
-
-                // call current triangle t
-                Triangle* t = (Triangle*)this;
-
-                //is the current triangle inside or outside?
-                int outside=!link  ;
-
-                // EdgesVertexTriangle[3][2] = {{1,2},{2,0},{0,1}};
-                // initialize j as the first vertex of the ith edge
-                j=EdgesVertexTriangle[i][0];
-
-                //Loop over the adjacent triangle of t
-                k=0;
-                do{
-                        //keep track of outside
-                        int outsidep = outside;
-                        //increment k
-                        k++;
-                        //Get ttc, adjacent triangle of t with respect to vertex j
-                        ttc =  t->adj[j];
-                        //is the current triangle inside or outside?
-                        outside = !ttc->link;
-                        //if both previous triangle are outside, return
-                        if (outside+outsidep == 1) return AdjacentTriangle(t,j);
-
-                        //update t and j
-                        t = ttc;
-                        //NextEdge[3] = {1,2,0};
-                        jc = NextEdge[t->AdjEdgeIndex[j]&3];
-                        j = NextEdge[jc];
-
-                        //check number of iterations
-                        if (k>=2000){
-                                _error_("too many iteration in Triangle::FindBoundaryEdge (k>=2000)");
-                        }
-                } while (this!= t);
-                //not found, return empty triangle
-                return AdjacentTriangle(NULL,0);
         }
         /*}}}*/