- Timestamp:
- 08/10/10 13:39:21 (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
issm/trunk/src/c/objects/Bamg/ListofIntersectionTriangles.cpp
r5095 r5120 44 44 double ba,bb; 45 45 TriangleAdjacent edge=CloseBoundaryEdge(a,t,ba,bb); 46 MeshVertex & v0 = *edge.EdgeVertex(0), & v1 = *edge.EdgeVertex(1);46 BamgVertex & v0 = *edge.EdgeVertex(0), & v1 = *edge.EdgeVertex(1); 47 47 NewItem(A,Metric(ba,v0,bb,v1)); 48 48 t=edge; … … 50 50 if (det(v0.i,v1.i,b)>=0) { 51 51 TriangleAdjacent edge=CloseBoundaryEdge(a,t,ba,bb); 52 MeshVertex & v0 = *edge.EdgeVertex(0), & v1 = *edge.EdgeVertex(1);52 BamgVertex & v0 = *edge.EdgeVertex(0), & v1 = *edge.EdgeVertex(1); 53 53 NewItem(A,Metric(ba,v0,bb,v1)); 54 54 return; … … 80 80 long int verbose=2; 81 81 TriangleAdjacent edge=CloseBoundaryEdge(a,t,ba,bb); 82 MeshVertex & v0 = *edge.EdgeVertex(0), & v1 = *edge.EdgeVertex(1);82 BamgVertex & v0 = *edge.EdgeVertex(0), & v1 = *edge.EdgeVertex(1); 83 83 NewItem(A,Metric(ba,v0,bb,v1)); 84 84 return; … … 232 232 lIntTria[Size].x = x; 233 233 Metric m0,m1,m2; 234 register MeshVertex * v;234 register BamgVertex * v; 235 235 if ((v=(*tt)(0))) m0 = v->m; 236 236 if ((v=(*tt)(1))) m1 = v->m; … … 307 307 /*}}}1*/ 308 308 /*FUNCTION ListofIntersectionTriangles::NewPoints{{{1*/ 309 long ListofIntersectionTriangles::NewPoints( MeshVertex* vertices,long &nbv,long nbvx){309 long ListofIntersectionTriangles::NewPoints(BamgVertex* vertices,long &nbv,long maxnbv){ 310 310 /*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp/NewPoints)*/ 311 311 … … 354 354 355 355 si += sint; 356 if ( nbv< nbvx) {356 if ( nbv<maxnbv) { 357 357 vertices[nbv].r = C; 358 358 vertices[nbv++].m = Metric(cx,lIntTria[ii-1].m,cy,lIntTria[ii].m);
Note:
See TracChangeset
for help on using the changeset viewer.