6 OutPut(
"Example: Hemker_Wide_VMS" << endl) ;
13 #include <BoundEdge.h>
14 #include <BoundComp.h>
18 #include <MainUtilities.h>
21 #include <MacroCell.h>
22 #include <BoundEdge.h>
23 #include <IsoBoundEdge.h>
25 #include <IsoInterfaceJoint.h>
30 #include <QuadAffin.h>
31 #include <QuadBilinear.h>
32 #include <QuadIsoparametric.h>
33 #include <TriaAffin.h>
34 #include <TriaIsoparametric.h>
45 void ExactU1(
double x,
double y,
double *values)
53 void ExactU2(
double x,
double y,
double *values)
61 void ExactP(
double x,
double y,
double *values)
72 void BoundCondition(
int i,
double t, BoundCond &cond)
77 void U1BoundValue(
int BdComp,
double Param,
double &value)
83 case 1: value=1.5*(1.0 - (pow(-8+16*Param,2))/64.0);
87 case 3: value=1.5*(1.0 - (pow(8-16*Param,2))/64.0) ;
91 default: cout <<
"wrong boundary part number: " << BdComp << endl;
95 void U2BoundValue(
int BdComp,
double Param,
double &value)
98 if(BdComp>4) cout <<
"wrong boundary part number: " << BdComp << endl;
104 void LinCoeffs(
int n_points,
double *x,
double *y,
105 double **parameters,
double **coeffs)
109 double *coeff, nondim;
113 for(i=0;i<n_points;i++)
126 void ExactS1(
double x,
double y,
double *values)
134 void ExactS2(
double x,
double y,
double *values)
142 void ExactS3(
double x,
double y,
double *values)
153 void BoundCondition_CST(
int i,
double t, BoundCond &cond)
169 void S1BoundValue(
int BdComp,
double Param,
double &value)
182 case 3: value=(pow(0.375*Wei*(-1+2*Param),2) * 2.0 )+1.0;
190 void S2BoundValue(
int BdComp,
double Param,
double &value)
203 case 3: value=0.375*Wei*(-1+2*Param);
214 void S3BoundValue(
int BdComp,
double Param,
double &value)
235 void LinCoeffs_CST(
int n_points,
double *X,
double *Y,
236 double **parameters,
double **coeffs)
243 for(i=0;i<n_points;i++)
261 double &cd,
double &cl)
264 int N_Points,N_Edges,comp,ed_nr;
265 double *weights, *xi, *eta;
266 double X[MaxN_QuadPoints_2D];
267 double Y[MaxN_QuadPoints_2D];
268 double AbsDetjk[MaxN_QuadPoints_2D];
269 int N_LocalUsedElements;
270 FE2D LocalUsedElements[3], CurrentElement;
272 double **OrigFEValues, *Orig;
273 bool SecondDer[3] = { FALSE, FALSE, FALSE };
274 double *u1, *u2, *p, *tau1, *tau2, *tau3;
276 int *UGlobalNumbers, *UBeginIndex;
277 int *PGlobalNumbers, *PBeginIndex;
278 int *TauGlobalNumbers, *TauBeginIndex;
279 int *N_BaseFunct, N_Cells;
280 BaseFunct2D BaseFunct, *BaseFuncts;
283 double value, value1, value2, value3, value4, value5, value6;
284 double FEFunctValues[MaxN_BaseFunctions2D];
285 double FEFunctValues1[MaxN_BaseFunctions2D];
286 double FEFunctValues2[MaxN_BaseFunctions2D];
287 double FEFunctValues3[MaxN_BaseFunctions2D];
288 double FEFunctValues4[MaxN_BaseFunctions2D];
289 double FEFunctValues5[MaxN_BaseFunctions2D];
290 double FEFunctValues6[MaxN_BaseFunctions2D];
292 int N_DerivativesU = 3;
293 double *Derivatives[MaxN_BaseFunctions2D];
294 MultiIndex2D NeededDerivatives[3] = { D00, D10, D01 };
305 int N_DOF_Circ, *DOF_Circ;
306 char VString[] =
"v";
331 aux =
new double [MaxN_QuadPoints_2D*13];
332 for(j=0;j<MaxN_QuadPoints_2D;j++)
333 Derivatives[j] = aux + j*13;
337 memset(v,0,N_*SizeOfDouble);
346 for(i=0;i<N_Cells;i++)
350 for(j=0;j<N_Edges;j++)
353 if ((joint->
GetType() == BoundaryEdge)||
354 (joint->
GetType() == IsoBoundEdge))
359 comp=BoundComp->
GetID();
362 FEEle = USpace->
GetFE2D(i,cell);
367 DOF = UGlobalNumbers + UBeginIndex[i];
368 for (k=0;k<N_DOF_Circ;k++)
369 v[DOF[DOF_Circ[k]]] = 1;
383 for(i=0;i<N_Cells;i++)
390 N_LocalUsedElements = 3;
391 LocalUsedElements[0] = USpace->
GetFE2D(i, cell);
392 LocalUsedElements[1] = PSpace->
GetFE2D(i, cell);
393 LocalUsedElements[2] = TauSpace->
GetFE2D(i, cell);
398 TFEDatabase2D::GetOrig(N_LocalUsedElements, LocalUsedElements, Coll, cell, SecondDer, N_Points, xi, eta, weights, X, Y, AbsDetjk);
401 CurrentElement = LocalUsedElements[1];
402 BaseFunct = BaseFuncts[CurrentElement];
403 N_ = N_BaseFunct[CurrentElement];
405 DOF = PGlobalNumbers + PBeginIndex[i];
407 FEFunctValues[l] = p[DOF[l]];
411 for(j=0;j<N_Points;j++)
413 Orig = OrigFEValues[j];
416 value += FEFunctValues[l] * Orig[l];
418 Derivatives[j][0] = value;
422 CurrentElement = LocalUsedElements[0];
423 BaseFunct = BaseFuncts[CurrentElement];
424 N_ = N_BaseFunct[CurrentElement];
426 DOF = UGlobalNumbers + UBeginIndex[i];
429 FEFunctValues1[l] = u1[DOF[l]];
430 FEFunctValues2[l] = u2[DOF[l]];
431 FEFunctValues3[l] = v[DOF[l]];
434 for(k=0;k<N_DerivativesU;k++)
437 NeededDerivatives[k]);
438 for(j=0;j<N_Points;j++)
440 Orig = OrigFEValues[j];
446 value1 += FEFunctValues1[l] * Orig[l];
447 value2 += FEFunctValues2[l] * Orig[l];
448 value3 += FEFunctValues3[l] * Orig[l];
450 Derivatives[j][k+1] = value1;
451 Derivatives[j][k+4] = value2;
452 Derivatives[j][k+7] = value3;
458 CurrentElement = LocalUsedElements[2];
459 BaseFunct = BaseFuncts[CurrentElement];
460 N_ = N_BaseFunct[CurrentElement];
462 DOF = TauGlobalNumbers + TauBeginIndex[i];
465 FEFunctValues4[l] = tau1[DOF[l]];
466 FEFunctValues5[l] = tau2[DOF[l]];
467 FEFunctValues6[l] = tau3[DOF[l]];
472 for(j=0;j<N_Points;j++)
474 Orig = OrigFEValues[j];
480 value4 += FEFunctValues4[l] * Orig[l];
481 value5 += FEFunctValues5[l] * Orig[l];
482 value6 += FEFunctValues6[l] * Orig[l];
484 Derivatives[j][10] = value4;
485 Derivatives[j][11] = value5;
486 Derivatives[j][12] = value6;
493 for(j=0;j<N_Points;j++)
495 Der = Derivatives[j];
498 value1 = beta*nu*(Der[2]*Der[8]+Der[3]*Der[9]);
502 value1 -= Der[0]*Der[8];
504 value1 += (1.0-beta)*nu*wei*(Der[10]*Der[8] + Der[11]*Der[9]);
511 cd += AbsDetjk[j]*weights[j] * value1;
512 cl += AbsDetjk[j]*weights[j] * value2;
520 delete Derivatives[0];
529 void TriaReMeshGen(
TDomain *&Domain)
531 int j, ID, k, N_G, *PartMarker, *PointNeighb, maxEpV=0;
532 int a, b, len1, len2, Neighb_tmp, BDpart;
533 int i, temp, N_Cells, N_RootCells, CurrVertex, N_Joints, N_Vertices;
534 int N_Interface_Vert, N_Verti, N_Hori, N_SlipBound_Vert, N_BDVertices;
535 int CurrComp, In_Index, *Triangles, Neib[2], CurrNeib;
537 double deviation, hi, x0, y0, x, y, phi1, phi2;
538 double T_a, T_b, C_x, C_y, s, theta;
540 double *Coordinates, *Hole_List;
542 double Xi[4] = {-40., 40., 40.,-40.};
543 double Yi[4] = {-8.,-8., 8., 8.};
549 TVertex **VertexDel, **NewVertices;
557 std::ostringstream opts;
560 Out.pointlist = NULL;
561 Out.pointattributelist = NULL;
562 Out.pointmarkerlist = NULL;
563 Out.trianglelist = NULL;
564 Out.triangleattributelist = NULL;
565 Out.trianglearealist = NULL;
566 Out.neighborlist = NULL;
567 Out.segmentlist = NULL;
568 Out.segmentmarkerlist = NULL;
570 Out.regionlist = NULL;
572 Out.edgemarkerlist = NULL;
575 opts.seekp(std::ios::beg);
605 N_SlipBound_Vert = 2*N_Hori + 2*N_Verti;
607 N_BDVertices = N_Interface_Vert+N_SlipBound_Vert;
608 In.numberofpoints = N_BDVertices;
609 In.pointlist =
new double[2*In.numberofpoints];
610 In.pointmarkerlist =
new int[In.numberofpoints];
611 In.numberofpointattributes = 0;
613 In.numberofsegments = In.numberofpoints;
614 In.segmentlist =
new int[2*In.numberofsegments];
615 In.segmentmarkerlist =
new int[In.numberofsegments];
616 In.numberofregions = 0;
617 In.regionlist = NULL;
619 In.numberofholes = 1;
622 Hole_List =
new double[2* In.numberofholes];
625 In.holelist = Hole_List;
630 hi = (Xi[1] - Xi[0])/(
double)N_Hori;
636 for(i=0;i<N_Hori;i++)
638 x = x0 + (double)i*hi;
639 In.pointlist[2*In_Index] = x;
640 In.pointlist[2*In_Index+1] = y0;
642 In.pointmarkerlist[In_Index] = CurrComp;
643 In.segmentlist[2*In_Index] = In_Index;
644 In.segmentlist[2*In_Index+1] = In_Index+1;
645 In.segmentmarkerlist[In_Index] = CurrComp;
651 hi = (Yi[2] - Yi[1])/(
double)N_Verti;
656 for(i=0;i<N_Verti;i++)
658 y = y0 + (double)i*hi;
659 In.pointlist[2*In_Index] = x0;
660 In.pointlist[2*In_Index+1] = y;
662 In.pointmarkerlist[In_Index] = CurrComp;
663 In.segmentlist[2*In_Index] = In_Index;
664 In.segmentlist[2*In_Index+1] = In_Index+1;
665 In.segmentmarkerlist[In_Index] = CurrComp;
673 hi = (Xi[3] - Xi[2])/(
double)N_Hori;
678 for(i=0;i<N_Hori;i++)
680 x = x0 + (double)i*hi;
681 In.pointlist[2*In_Index] = x;
682 In.pointlist[2*In_Index+1] = y0;
684 In.pointmarkerlist[In_Index] = CurrComp;
685 In.segmentlist[2*In_Index] = In_Index;
686 In.segmentlist[2*In_Index+1] = In_Index+1;
687 In.segmentmarkerlist[In_Index] = CurrComp;
695 hi = (Yi[0] - Yi[3])/(
double)N_Verti;
700 for(i=0;i<N_Verti;i++)
702 y = y0 + (double)i*hi;
703 In.pointlist[2*In_Index] = x0;
704 In.pointlist[2*In_Index+1] = y;
706 In.pointmarkerlist[In_Index] = CurrComp;
707 In.segmentlist[2*In_Index] = In_Index;
708 In.segmentlist[2*In_Index+1] = In_Index+1;
709 In.segmentmarkerlist[In_Index] = CurrComp;
715 In.segmentlist[2*(In_Index-1)+1] = 0;
726 phi1 = 0.000000E+0000;
731 s = (phi2- phi1)/(
double)N_Interface_Vert;
737 for(i=0;i<N_Interface_Vert;i++)
739 theta = phi1 + (double)i*s;
743 In.pointlist[2*In_Index] = T_a*cos(theta);;
744 In.pointlist[2*In_Index+1] = T_b*sin(theta);
760 In.pointmarkerlist[In_Index] = CurrComp;
761 In.segmentlist[2*In_Index] = In_Index;
762 In.segmentlist[2*In_Index+1] = In_Index+1;
763 In.segmentmarkerlist[In_Index] = CurrComp;
767 In.segmentlist[2*(In_Index-1)+1] = temp;
771 if(Out.pointlist!=NULL) {
772 free(Out.pointlist); Out.pointlist = NULL;}
773 if(Out.pointattributelist!=NULL) {
774 free(Out.pointattributelist); Out.pointattributelist = NULL;}
775 if(Out.pointmarkerlist!=NULL) {
776 free(Out.pointmarkerlist); Out.pointmarkerlist = NULL;}
777 if(Out.trianglelist!=NULL) {
778 free(Out.trianglelist); Out.trianglelist = NULL;}
779 if(Out.triangleattributelist!=NULL) {
780 free(Out.triangleattributelist); Out.triangleattributelist = NULL;}
781 if(Out.trianglearealist!=NULL) {
782 free(Out.trianglearealist); Out.trianglearealist = NULL;}
783 if(Out.neighborlist!=NULL) {
784 free(Out.neighborlist); Out.neighborlist = NULL;}
785 if(Out.segmentlist!=NULL) {
786 free(Out.segmentlist); Out.segmentlist = NULL;}
787 if(Out.segmentmarkerlist!=NULL) {
788 free(Out.segmentmarkerlist); Out.segmentmarkerlist = NULL;}
789 if(Out.holelist!=NULL) {
790 free(Out.holelist); Out.holelist = NULL;}
791 if(Out.regionlist!=NULL) {
792 free(Out.regionlist); Out.regionlist = NULL;}
793 if(Out.edgelist!=NULL) {
794 free(Out.edgelist); Out.edgelist = NULL;}
795 if(Out.edgemarkerlist!=NULL) {
796 free(Out.edgemarkerlist); Out.edgemarkerlist = NULL;}
797 if(Out.normlist!=NULL) {
798 free(Out.normlist); Out.normlist = NULL;}
801 triangulate((
char*)opts.str().c_str(), &In, &Out, (
struct triangulateio *)NULL);
809 VertexDel =
new TVertex*[3*N_RootCells];
813 for(i=0;i<N_Cells;i++)
818 for(j=0;j<N_Joints;j++)
822 VertexDel[CurrVertex] = cell->
GetVertex(j);
828 for(k=0;k<CurrVertex;k++)
835 VertexDel[CurrVertex] = cell->
GetVertex(j);
841 for(k=0;k<CurrVertex;k++)
842 if(VertexDel[k]==cell->
GetVertex((j+1)%N_Vertices))
848 VertexDel[CurrVertex] = cell->
GetVertex((j+1)%N_Vertices);
853 for(i=0;i<CurrVertex;i++)
857 OutPut(CurrVertex<<
" vertices were deleted"<<endl);
860 for(i=0;i<N_RootCells;i++)
862 OutPut(N_RootCells<<
" cells were deleted"<<endl);
869 UpdateBound[0]->
SetParams(Xi[0], Yi[0], Xi[1]-Xi[0],Yi[1]-Yi[0]);
870 UpdateBound[1]->
SetParams(Xi[1], Yi[1], Xi[2]-Xi[1],Yi[2]-Yi[1]);
871 UpdateBound[2]->
SetParams(Xi[2], Yi[2], Xi[3]-Xi[2],Yi[3]-Yi[2]);
872 UpdateBound[3]->
SetParams(Xi[3], Yi[3], Xi[0]-Xi[3],Yi[0]-Yi[3]);
876 UpdateIntface->
SetParams(C_x, C_y, T_a, T_b, phi1, phi2);
879 N_RootCells = Out.numberoftriangles;
882 Coordinates = Out.pointlist;
883 Triangles = Out.trianglelist;
884 PartMarker =
new int[Out.numberofpoints];
887 N_G = Out.numberofpoints;
888 NewVertices =
new TVertex*[N_G];
891 NewVertices[i] =
new TVertex(Coordinates[2*i], Coordinates[2*i+1]);
917 for (i=0;i<N_RootCells;i++)
921 CellTree[i]->
SetVertex(0, NewVertices[Out.trianglelist[3*i ]]);
922 CellTree[i]->
SetVertex(1, NewVertices[Out.trianglelist[3*i + 1]]);
923 CellTree[i]->
SetVertex(2, NewVertices[Out.trianglelist[3*i + 2]]);
925 ((
TMacroCell *) CellTree[i])->SetSubGridID(0);
938 N_G = Out.numberofpoints;
939 PointNeighb =
new int[N_G];
941 memset(PointNeighb, 0, N_G *SizeOfInt);
943 for (i=0;i<3*N_RootCells;i++)
944 PointNeighb[Triangles[i]]++;
949 if (PointNeighb[i] > maxEpV) maxEpV = PointNeighb[i];
950 delete [] PointNeighb;
952 PointNeighb =
new int[++maxEpV * N_G];
954 memset(PointNeighb, 0, maxEpV * N_G *SizeOfInt);
959 for(i=0;i<3*N_RootCells;i++)
961 j = Triangles[i]*maxEpV;
963 PointNeighb[j + PointNeighb[j]] = i / 3;
967 N_G = Out.numberofedges;
970 a = Out.edgelist[2*i];
971 b = Out.edgelist[2*i+1];
976 len1 = PointNeighb[a*maxEpV];
977 len2 = PointNeighb[b*maxEpV];
980 for (j=1;j<=len1;j++)
982 Neighb_tmp = PointNeighb[a*maxEpV + j];
983 for (k=1;k<=len2;k++)
984 if (Neighb_tmp == PointNeighb[b*maxEpV + k])
986 Neib[CurrNeib++] = Neighb_tmp;
989 if (CurrNeib == 2)
break;
996 if (Out.edgemarkerlist[i])
998 CurrComp = Out.edgemarkerlist[i] - 1;
999 if (CurrComp >= 100000) CurrComp -= 100000;
1007 NewVertices[a]->GetX(), NewVertices[a]->GetY(), T_a) ||
1009 NewVertices[b]->GetX(), NewVertices[b]->GetY(), T_b))
1011 cerr<<
"Error: could not set parameter values"<<endl;
1012 OutPut(NewVertices[a]<<endl);
1013 OutPut(NewVertices[b]<<endl);
1025 if(BDpart==1 && CurrComp==0 && fabs(T_a)==0 ) T_a=1;
1036 T_a, T_b, CellTree[Neib[0]], CellTree[Neib[1]]);
1041 T_a, T_b, CellTree[Neib[0]], CellTree[Neib[1]]);
1060 cerr <<
"Error!!!!!!!! not enough neighbours!" << endl;
1062 Joint =
new TJointEqN(CellTree[Neib[0]], CellTree[Neib[1]]);
1067 if (Triangles[3*Neib[0]+j] == a)
break;
1071 if (Triangles[3*Neib[0]+k] == b)
break;
1091 CellTree[Neib[0]]->
SetJoint(j, Joint);
1097 if (Triangles[3*Neib[1]+j] == a)
break;
1101 if (Triangles[3*Neib[1]+k] == b)
break;
1121 CellTree[Neib[1]]->
SetJoint(j, Joint);
1124 if (Joint->
GetType() == InterfaceJoint ||
1125 Joint->
GetType() == IsoInterfaceJoint)
1130 delete [] NewVertices;
1131 delete [] PointNeighb;
1132 delete [] In.pointlist;
1133 delete [] In.pointmarkerlist;
1134 delete [] In.segmentlist;
1135 delete [] In.segmentmarkerlist;
1137 if(Out.pointlist!=NULL) {
1138 free(Out.pointlist); Out.pointlist = NULL;}
1139 if(Out.pointattributelist!=NULL) {
1140 free(Out.pointattributelist); Out.pointattributelist = NULL;}
1141 if(Out.pointmarkerlist!=NULL) {
1142 free(Out.pointmarkerlist); Out.pointmarkerlist = NULL;}
1143 if(Out.trianglelist!=NULL) {
1144 free(Out.trianglelist); Out.trianglelist = NULL;}
1145 if(Out.triangleattributelist!=NULL) {
1146 free(Out.triangleattributelist); Out.triangleattributelist = NULL;}
1147 if(Out.trianglearealist!=NULL) {
1148 free(Out.trianglearealist); Out.trianglearealist = NULL;}
1149 if(Out.neighborlist!=NULL) {
1150 free(Out.neighborlist); Out.neighborlist = NULL;}
1151 if(Out.segmentlist!=NULL) {
1152 free(Out.segmentlist); Out.segmentlist = NULL;}
1153 if(Out.segmentmarkerlist!=NULL) {
1154 free(Out.segmentmarkerlist); Out.segmentmarkerlist = NULL;}
1155 if(Out.holelist!=NULL) {
1156 free(Out.holelist); Out.holelist = NULL;}
1157 if(Out.regionlist!=NULL) {
1158 free(Out.regionlist); Out.regionlist = NULL;}
1159 if(Out.edgelist!=NULL) {
1160 free(Out.edgelist); Out.edgelist = NULL;}
1161 if(Out.edgemarkerlist!=NULL) {
1162 free(Out.edgemarkerlist); Out.edgemarkerlist = NULL;}
1163 if(Out.normlist!=NULL) {
1164 free(Out.normlist); Out.normlist = NULL;}
double * GetValues()
Definition: FEFunction2D.h:67
virtual int GetTofXY(double X, double Y, double &T)=0
static TFE2D * GetFE2D(FE2D FE)
Definition: FEDatabase2D.h:353
int GetLength()
Definition: FEFunction2D.h:63
void GetTreeInfo(TBaseCell **&celltree, int &N_rootcells)
get tree of cells
Definition: Domain.h:176
TCollection * GetCollection() const
Definition: FESpace.h:131
JointType GetType()
Definition: Joint.h:75
TBaseCell * GetCell(int i) const
return Cell with index i in Cells-array
Definition: Collection.h:50
TBoundComp2D * GetBoundComp() const
Definition: BoundEdge.h:77
int GetBdPartID(int BdCompID)
get boundary part of BdCompID
Definition: Domain.C:88
void SetParams(double xmid, double ymid, double radius_a, double radius_b, double phi1, double phi2)
Definition: BdCircle.C:21
Definition: IsoBoundEdge.h:18
TBoundComp2D * GetBdComp(int i)
Definition: BoundPart.h:49
int SetJoint(int J_i, TJoint *J)
set the pointer to face J_i to J
Definition: BaseCell.h:168
contains the boundary description, the virtual cell tree and macro grid
Definition: Domain.h:36
void SetParams(double xstart, double ystart, double delx, double dely)
Definition: BdLine.C:21
Definition: FESpace2D.h:28
double RE_NR
Definition: Database.h:313
int SetParam(TDomain *domain)
Definition: Iterator.C:17
static double ** GetOrigElementValues(BaseFunct1D BaseFunct, MultiIndex1D MultiIndex)
Definition: FEDatabase2D.h:300
static TIterator ** IteratorDB
Definition: Database.h:1131
store cells in an array, used by cell iterators
Definition: Collection.h:18
int GetN_Joints()
return the number of joints
Definition: BaseCell.h:185
virtual TVertex * GetVertex(int Vert_i)=0
return the pointer to vertex with number i
represent a unit of the macro grid
Definition: MacroCell.h:15
Definition: JointEqN.h:20
int GetN_Cells() const
return number of cells
Definition: Collection.h:46
TJoint * GetJoint(int J_i)
return the pointer to face with number i
Definition: BaseCell.h:175
TFESpace2D * GetFESpace2D()
Definition: FEFunction2D.h:59
TBoundPart * GetBdPart(int i)
get i-th boundary part
Definition: Domain.h:172
FE2D GetFE2D(int i, TBaseCell *cell)
Definition: FESpace2D.C:1184
TFEDesc2D * GetFEDesc2D() const
Definition: FE2D.h:97
int GetN_Vertices()
return the number of vertices of the cell
Definition: BaseCell.h:179
int ** GetJointDOF() const
Definition: FEDesc2D.h:86
static BaseFunct2D * GetBaseFunct2D_IDFromFE2D()
Definition: FEDatabase2D.h:417
Definition: BoundPart.h:21
void SetTreeInfo(TBaseCell **celltree, int N_rootcells)
set tree of cells
Definition: Domain.h:183
static int * GetN_BaseFunctFromFE2D()
Definition: FEDatabase2D.h:421
bool IsFreeBoundary() const
Definition: BoundComp.h:57
TCollection * GetCollection(Iterators it, int level)
produce a collection with all cells returned by iterator it
Definition: Domain.C:1982
int GetID() const
Definition: BoundComp.h:49
Definition: BdCircle.h:18
information for finite element data structure
Definition: BaseCell.h:25
int * GetGlobalNumbers() const
Definition: FESpace.h:135
int GetN_Edges()
return the number of edges of the cell
Definition: BaseCell.h:182
static TRefDesc ** RefDescDB
Definition: Database.h:1125
Definition: BoundEdge.h:19
Definition: IsoInterfaceJoint.h:18
Definition: BoundComp.h:27
static RefTrans2D GetOrig(int N_LocalUsedElements, FE2D *LocalUsedElements, TCollection *Coll, TBaseCell *cell, bool *Needs2ndDer, int &N_Points, double *&xi, double *&eta, double *&weights, double *X, double *Y, double *absdetjk)
Definition: FEDatabase2D.C:1765
virtual int SetVertex(int Vert_i, TVertex *Vert)=0
set the pointer of vertex Vert_i to Vert
Definition: FEDesc2D.h:15
represent geometric information of the cell
Definition: GridCell.h:15
int * GetBeginIndex() const
Definition: FESpace.h:142
int GetN_JointDOF() const
Definition: FEDesc2D.h:61
Definition: InterfaceJoint.h:18
static TParamDB * ParamDB
Definition: Database.h:1134
int GetLocalBdCompID(int BdCompID)
get local number of boundary component
Definition: Domain.C:98
Definition: FEFunction2D.h:24