6 OutPut(
"Example: Hemker_DEVSS" << 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;
116 for(i=0;i<n_points;i++)
129 void ExactS1(
double x,
double y,
double *values)
137 void ExactS2(
double x,
double y,
double *values)
145 void ExactS3(
double x,
double y,
double *values)
156 void BoundCondition_CST(
int i,
double t, BoundCond &cond)
172 void S1BoundValue(
int BdComp,
double Param,
double &value)
185 case 3: value=(pow(0.375*Wei*(-1+2*Param),2) * 2.0 )+1.0;
193 void S2BoundValue(
int BdComp,
double Param,
double &value)
206 case 3: value=0.375*Wei*(-1+2*Param);
217 void S3BoundValue(
int BdComp,
double Param,
double &value)
238 void LinCoeffs_CST(
int n_points,
double *X,
double *Y,
239 double **parameters,
double **coeffs)
246 for(i=0;i<n_points;i++)
263 void ExactD1(
double x,
double y,
double *values)
271 void ExactD2(
double x,
double y,
double *values)
279 void ExactD3(
double x,
double y,
double *values)
290 void BoundCondition_DFT(
int i,
double t, BoundCond &cond)
306 void D1BoundValue(
int BdComp,
double Param,
double &value)
320 default: cout <<
"wrong boundary part number" << endl;
326 void D2BoundValue(
int BdComp,
double Param,
double &value)
336 case 3: value=(2*Param-1)*3.0/16.0;
340 default: cout <<
"wrong boundary part number" << endl;
348 void D3BoundValue(
int BdComp,
double Param,
double &value)
362 default: cout <<
"wrong boundary part number" << endl;
369 void LinCoeffs_DFT(
int n_points,
double *X,
double *Y,
370 double **parameters,
double **coeffs)
373 double *coeff, x, y, *param;
374 double u1x, u1y, u2x, u2y;
376 for(i=0;i<n_points;i++)
402 double &cd,
double &cl)
405 int N_Points,N_Edges,comp,ed_nr;
406 double *weights, *xi, *eta;
407 double X[MaxN_QuadPoints_2D];
408 double Y[MaxN_QuadPoints_2D];
409 double AbsDetjk[MaxN_QuadPoints_2D];
410 int N_LocalUsedElements;
411 FE2D LocalUsedElements[3], CurrentElement;
413 double **OrigFEValues, *Orig;
414 bool SecondDer[3] = { FALSE, FALSE, FALSE };
415 double *u1, *u2, *p, *tau1, *tau2, *tau3;
417 int *UGlobalNumbers, *UBeginIndex;
418 int *PGlobalNumbers, *PBeginIndex;
419 int *TauGlobalNumbers, *TauBeginIndex;
420 int *N_BaseFunct, N_Cells;
421 BaseFunct2D BaseFunct, *BaseFuncts;
424 double value, value1, value2, value3, value4, value5, value6;
425 double FEFunctValues[MaxN_BaseFunctions2D];
426 double FEFunctValues1[MaxN_BaseFunctions2D];
427 double FEFunctValues2[MaxN_BaseFunctions2D];
428 double FEFunctValues3[MaxN_BaseFunctions2D];
429 double FEFunctValues4[MaxN_BaseFunctions2D];
430 double FEFunctValues5[MaxN_BaseFunctions2D];
431 double FEFunctValues6[MaxN_BaseFunctions2D];
433 int N_DerivativesU = 3;
434 double *Derivatives[MaxN_BaseFunctions2D];
435 MultiIndex2D NeededDerivatives[3] = { D00, D10, D01 };
446 int N_DOF_Circ, *DOF_Circ;
447 char VString[] =
"v";
472 aux =
new double [MaxN_QuadPoints_2D*13];
473 for(j=0;j<MaxN_QuadPoints_2D;j++)
474 Derivatives[j] = aux + j*13;
478 memset(v,0,N_*SizeOfDouble);
487 for(i=0;i<N_Cells;i++)
491 for(j=0;j<N_Edges;j++)
494 if ((joint->
GetType() == BoundaryEdge)||
495 (joint->
GetType() == IsoBoundEdge))
500 comp=BoundComp->
GetID();
503 FEEle = USpace->
GetFE2D(i,cell);
508 DOF = UGlobalNumbers + UBeginIndex[i];
509 for (k=0;k<N_DOF_Circ;k++)
510 v[DOF[DOF_Circ[k]]] = 1;
524 for(i=0;i<N_Cells;i++)
531 N_LocalUsedElements = 3;
532 LocalUsedElements[0] = USpace->
GetFE2D(i, cell);
533 LocalUsedElements[1] = PSpace->
GetFE2D(i, cell);
534 LocalUsedElements[2] = TauSpace->
GetFE2D(i, cell);
539 TFEDatabase2D::GetOrig(N_LocalUsedElements, LocalUsedElements, Coll, cell, SecondDer, N_Points, xi, eta, weights, X, Y, AbsDetjk);
542 CurrentElement = LocalUsedElements[1];
543 BaseFunct = BaseFuncts[CurrentElement];
544 N_ = N_BaseFunct[CurrentElement];
546 DOF = PGlobalNumbers + PBeginIndex[i];
548 FEFunctValues[l] = p[DOF[l]];
552 for(j=0;j<N_Points;j++)
554 Orig = OrigFEValues[j];
557 value += FEFunctValues[l] * Orig[l];
559 Derivatives[j][0] = value;
563 CurrentElement = LocalUsedElements[0];
564 BaseFunct = BaseFuncts[CurrentElement];
565 N_ = N_BaseFunct[CurrentElement];
567 DOF = UGlobalNumbers + UBeginIndex[i];
570 FEFunctValues1[l] = u1[DOF[l]];
571 FEFunctValues2[l] = u2[DOF[l]];
572 FEFunctValues3[l] = v[DOF[l]];
575 for(k=0;k<N_DerivativesU;k++)
578 NeededDerivatives[k]);
579 for(j=0;j<N_Points;j++)
581 Orig = OrigFEValues[j];
587 value1 += FEFunctValues1[l] * Orig[l];
588 value2 += FEFunctValues2[l] * Orig[l];
589 value3 += FEFunctValues3[l] * Orig[l];
591 Derivatives[j][k+1] = value1;
592 Derivatives[j][k+4] = value2;
593 Derivatives[j][k+7] = value3;
599 CurrentElement = LocalUsedElements[2];
600 BaseFunct = BaseFuncts[CurrentElement];
601 N_ = N_BaseFunct[CurrentElement];
603 DOF = TauGlobalNumbers + TauBeginIndex[i];
606 FEFunctValues4[l] = tau1[DOF[l]];
607 FEFunctValues5[l] = tau2[DOF[l]];
608 FEFunctValues6[l] = tau3[DOF[l]];
613 for(j=0;j<N_Points;j++)
615 Orig = OrigFEValues[j];
621 value4 += FEFunctValues4[l] * Orig[l];
622 value5 += FEFunctValues5[l] * Orig[l];
623 value6 += FEFunctValues6[l] * Orig[l];
625 Derivatives[j][10] = value4;
626 Derivatives[j][11] = value5;
627 Derivatives[j][12] = value6;
634 for(j=0;j<N_Points;j++)
636 Der = Derivatives[j];
639 value1 = beta*nu*(Der[2]*Der[8]+Der[3]*Der[9]);
643 value1 -= Der[0]*Der[8];
645 value1 += (1.0-beta)*nu*wei*(Der[10]*Der[8] + Der[11]*Der[9]);
652 cd += AbsDetjk[j]*weights[j] * value1;
653 cl += AbsDetjk[j]*weights[j] * value2;
661 delete Derivatives[0];
670 void TriaReMeshGen(
TDomain *&Domain)
672 int j, ID, k, N_G, *PartMarker, *PointNeighb, maxEpV=0;
673 int a, b, len1, len2, Neighb_tmp, BDpart;
674 int i, temp, N_Cells, N_RootCells, CurrVertex, N_Joints, N_Vertices;
675 int N_Interface_Vert, N_Verti, N_Hori, N_SlipBound_Vert, N_BDVertices;
676 int CurrComp, In_Index, *Triangles, Neib[2], CurrNeib;
678 double deviation, hi, x0, y0, x, y, phi1, phi2;
679 double T_a, T_b, C_x, C_y, s, theta;
681 double *Coordinates, *Hole_List;
683 double Xi[4] = {-40., 40., 40.,-40.};
684 double Yi[4] = {-8.,-8., 8., 8.};
690 TVertex **VertexDel, **NewVertices;
698 std::ostringstream opts;
701 Out.pointlist = NULL;
702 Out.pointattributelist = NULL;
703 Out.pointmarkerlist = NULL;
704 Out.trianglelist = NULL;
705 Out.triangleattributelist = NULL;
706 Out.trianglearealist = NULL;
707 Out.neighborlist = NULL;
708 Out.segmentlist = NULL;
709 Out.segmentmarkerlist = NULL;
711 Out.regionlist = NULL;
713 Out.edgemarkerlist = NULL;
716 opts.seekp(std::ios::beg);
746 N_SlipBound_Vert = 2*N_Hori + 2*N_Verti;
748 N_BDVertices = N_Interface_Vert+N_SlipBound_Vert;
749 In.numberofpoints = N_BDVertices;
750 In.pointlist =
new double[2*In.numberofpoints];
751 In.pointmarkerlist =
new int[In.numberofpoints];
752 In.numberofpointattributes = 0;
754 In.numberofsegments = In.numberofpoints;
755 In.segmentlist =
new int[2*In.numberofsegments];
756 In.segmentmarkerlist =
new int[In.numberofsegments];
757 In.numberofregions = 0;
758 In.regionlist = NULL;
760 In.numberofholes = 1;
763 Hole_List =
new double[2* In.numberofholes];
766 In.holelist = Hole_List;
771 hi = (Xi[1] - Xi[0])/(
double)N_Hori;
777 for(i=0;i<N_Hori;i++)
779 x = x0 + (double)i*hi;
780 In.pointlist[2*In_Index] = x;
781 In.pointlist[2*In_Index+1] = y0;
783 In.pointmarkerlist[In_Index] = CurrComp;
784 In.segmentlist[2*In_Index] = In_Index;
785 In.segmentlist[2*In_Index+1] = In_Index+1;
786 In.segmentmarkerlist[In_Index] = CurrComp;
792 hi = (Yi[2] - Yi[1])/(
double)N_Verti;
797 for(i=0;i<N_Verti;i++)
799 y = y0 + (double)i*hi;
800 In.pointlist[2*In_Index] = x0;
801 In.pointlist[2*In_Index+1] = y;
803 In.pointmarkerlist[In_Index] = CurrComp;
804 In.segmentlist[2*In_Index] = In_Index;
805 In.segmentlist[2*In_Index+1] = In_Index+1;
806 In.segmentmarkerlist[In_Index] = CurrComp;
814 hi = (Xi[3] - Xi[2])/(
double)N_Hori;
819 for(i=0;i<N_Hori;i++)
821 x = x0 + (double)i*hi;
822 In.pointlist[2*In_Index] = x;
823 In.pointlist[2*In_Index+1] = y0;
825 In.pointmarkerlist[In_Index] = CurrComp;
826 In.segmentlist[2*In_Index] = In_Index;
827 In.segmentlist[2*In_Index+1] = In_Index+1;
828 In.segmentmarkerlist[In_Index] = CurrComp;
836 hi = (Yi[0] - Yi[3])/(
double)N_Verti;
841 for(i=0;i<N_Verti;i++)
843 y = y0 + (double)i*hi;
844 In.pointlist[2*In_Index] = x0;
845 In.pointlist[2*In_Index+1] = y;
847 In.pointmarkerlist[In_Index] = CurrComp;
848 In.segmentlist[2*In_Index] = In_Index;
849 In.segmentlist[2*In_Index+1] = In_Index+1;
850 In.segmentmarkerlist[In_Index] = CurrComp;
856 In.segmentlist[2*(In_Index-1)+1] = 0;
867 phi1 = 0.000000E+0000;
872 s = (phi2- phi1)/(
double)N_Interface_Vert;
878 for(i=0;i<N_Interface_Vert;i++)
880 theta = phi1 + (double)i*s;
884 In.pointlist[2*In_Index] = T_a*cos(theta);;
885 In.pointlist[2*In_Index+1] = T_b*sin(theta);
901 In.pointmarkerlist[In_Index] = CurrComp;
902 In.segmentlist[2*In_Index] = In_Index;
903 In.segmentlist[2*In_Index+1] = In_Index+1;
904 In.segmentmarkerlist[In_Index] = CurrComp;
908 In.segmentlist[2*(In_Index-1)+1] = temp;
912 if(Out.pointlist!=NULL) {
913 free(Out.pointlist); Out.pointlist = NULL;}
914 if(Out.pointattributelist!=NULL) {
915 free(Out.pointattributelist); Out.pointattributelist = NULL;}
916 if(Out.pointmarkerlist!=NULL) {
917 free(Out.pointmarkerlist); Out.pointmarkerlist = NULL;}
918 if(Out.trianglelist!=NULL) {
919 free(Out.trianglelist); Out.trianglelist = NULL;}
920 if(Out.triangleattributelist!=NULL) {
921 free(Out.triangleattributelist); Out.triangleattributelist = NULL;}
922 if(Out.trianglearealist!=NULL) {
923 free(Out.trianglearealist); Out.trianglearealist = NULL;}
924 if(Out.neighborlist!=NULL) {
925 free(Out.neighborlist); Out.neighborlist = NULL;}
926 if(Out.segmentlist!=NULL) {
927 free(Out.segmentlist); Out.segmentlist = NULL;}
928 if(Out.segmentmarkerlist!=NULL) {
929 free(Out.segmentmarkerlist); Out.segmentmarkerlist = NULL;}
930 if(Out.holelist!=NULL) {
931 free(Out.holelist); Out.holelist = NULL;}
932 if(Out.regionlist!=NULL) {
933 free(Out.regionlist); Out.regionlist = NULL;}
934 if(Out.edgelist!=NULL) {
935 free(Out.edgelist); Out.edgelist = NULL;}
936 if(Out.edgemarkerlist!=NULL) {
937 free(Out.edgemarkerlist); Out.edgemarkerlist = NULL;}
938 if(Out.normlist!=NULL) {
939 free(Out.normlist); Out.normlist = NULL;}
942 triangulate((
char*)opts.str().c_str(), &In, &Out, (
struct triangulateio *)NULL);
950 VertexDel =
new TVertex*[3*N_RootCells];
954 for(i=0;i<N_Cells;i++)
959 for(j=0;j<N_Joints;j++)
963 VertexDel[CurrVertex] = cell->
GetVertex(j);
969 for(k=0;k<CurrVertex;k++)
976 VertexDel[CurrVertex] = cell->
GetVertex(j);
982 for(k=0;k<CurrVertex;k++)
983 if(VertexDel[k]==cell->
GetVertex((j+1)%N_Vertices))
989 VertexDel[CurrVertex] = cell->
GetVertex((j+1)%N_Vertices);
994 for(i=0;i<CurrVertex;i++)
998 OutPut(CurrVertex<<
" vertices were deleted"<<endl);
1001 for(i=0;i<N_RootCells;i++)
1003 OutPut(N_RootCells<<
" cells were deleted"<<endl);
1010 UpdateBound[0]->
SetParams(Xi[0], Yi[0], Xi[1]-Xi[0],Yi[1]-Yi[0]);
1011 UpdateBound[1]->
SetParams(Xi[1], Yi[1], Xi[2]-Xi[1],Yi[2]-Yi[1]);
1012 UpdateBound[2]->
SetParams(Xi[2], Yi[2], Xi[3]-Xi[2],Yi[3]-Yi[2]);
1013 UpdateBound[3]->
SetParams(Xi[3], Yi[3], Xi[0]-Xi[3],Yi[0]-Yi[3]);
1017 UpdateIntface->
SetParams(C_x, C_y, T_a, T_b, phi1, phi2);
1020 N_RootCells = Out.numberoftriangles;
1023 Coordinates = Out.pointlist;
1024 Triangles = Out.trianglelist;
1025 PartMarker =
new int[Out.numberofpoints];
1028 N_G = Out.numberofpoints;
1029 NewVertices =
new TVertex*[N_G];
1032 NewVertices[i] =
new TVertex(Coordinates[2*i], Coordinates[2*i+1]);
1058 for (i=0;i<N_RootCells;i++)
1062 CellTree[i]->
SetVertex(0, NewVertices[Out.trianglelist[3*i ]]);
1063 CellTree[i]->
SetVertex(1, NewVertices[Out.trianglelist[3*i + 1]]);
1064 CellTree[i]->
SetVertex(2, NewVertices[Out.trianglelist[3*i + 2]]);
1066 ((
TMacroCell *) CellTree[i])->SetSubGridID(0);
1079 N_G = Out.numberofpoints;
1080 PointNeighb =
new int[N_G];
1082 memset(PointNeighb, 0, N_G *SizeOfInt);
1084 for (i=0;i<3*N_RootCells;i++)
1085 PointNeighb[Triangles[i]]++;
1090 if (PointNeighb[i] > maxEpV) maxEpV = PointNeighb[i];
1091 delete [] PointNeighb;
1093 PointNeighb =
new int[++maxEpV * N_G];
1095 memset(PointNeighb, 0, maxEpV * N_G *SizeOfInt);
1100 for(i=0;i<3*N_RootCells;i++)
1102 j = Triangles[i]*maxEpV;
1104 PointNeighb[j + PointNeighb[j]] = i / 3;
1108 N_G = Out.numberofedges;
1111 a = Out.edgelist[2*i];
1112 b = Out.edgelist[2*i+1];
1117 len1 = PointNeighb[a*maxEpV];
1118 len2 = PointNeighb[b*maxEpV];
1121 for (j=1;j<=len1;j++)
1123 Neighb_tmp = PointNeighb[a*maxEpV + j];
1124 for (k=1;k<=len2;k++)
1125 if (Neighb_tmp == PointNeighb[b*maxEpV + k])
1127 Neib[CurrNeib++] = Neighb_tmp;
1130 if (CurrNeib == 2)
break;
1137 if (Out.edgemarkerlist[i])
1139 CurrComp = Out.edgemarkerlist[i] - 1;
1140 if (CurrComp >= 100000) CurrComp -= 100000;
1148 NewVertices[a]->GetX(), NewVertices[a]->GetY(), T_a) ||
1150 NewVertices[b]->GetX(), NewVertices[b]->GetY(), T_b))
1152 cerr<<
"Error: could not set parameter values"<<endl;
1153 OutPut(NewVertices[a]<<endl);
1154 OutPut(NewVertices[b]<<endl);
1166 if(BDpart==1 && CurrComp==0 && fabs(T_a)==0 ) T_a=1;
1177 T_a, T_b, CellTree[Neib[0]], CellTree[Neib[1]]);
1182 T_a, T_b, CellTree[Neib[0]], CellTree[Neib[1]]);
1201 cerr <<
"Error!!!!!!!! not enough neighbours!" << endl;
1203 Joint =
new TJointEqN(CellTree[Neib[0]], CellTree[Neib[1]]);
1208 if (Triangles[3*Neib[0]+j] == a)
break;
1212 if (Triangles[3*Neib[0]+k] == b)
break;
1232 CellTree[Neib[0]]->
SetJoint(j, Joint);
1238 if (Triangles[3*Neib[1]+j] == a)
break;
1242 if (Triangles[3*Neib[1]+k] == b)
break;
1262 CellTree[Neib[1]]->
SetJoint(j, Joint);
1265 if (Joint->
GetType() == InterfaceJoint ||
1266 Joint->
GetType() == IsoInterfaceJoint)
1271 delete [] NewVertices;
1272 delete [] PointNeighb;
1273 delete [] In.pointlist;
1274 delete [] In.pointmarkerlist;
1275 delete [] In.segmentlist;
1276 delete [] In.segmentmarkerlist;
1278 if(Out.pointlist!=NULL) {
1279 free(Out.pointlist); Out.pointlist = NULL;}
1280 if(Out.pointattributelist!=NULL) {
1281 free(Out.pointattributelist); Out.pointattributelist = NULL;}
1282 if(Out.pointmarkerlist!=NULL) {
1283 free(Out.pointmarkerlist); Out.pointmarkerlist = NULL;}
1284 if(Out.trianglelist!=NULL) {
1285 free(Out.trianglelist); Out.trianglelist = NULL;}
1286 if(Out.triangleattributelist!=NULL) {
1287 free(Out.triangleattributelist); Out.triangleattributelist = NULL;}
1288 if(Out.trianglearealist!=NULL) {
1289 free(Out.trianglearealist); Out.trianglearealist = NULL;}
1290 if(Out.neighborlist!=NULL) {
1291 free(Out.neighborlist); Out.neighborlist = NULL;}
1292 if(Out.segmentlist!=NULL) {
1293 free(Out.segmentlist); Out.segmentlist = NULL;}
1294 if(Out.segmentmarkerlist!=NULL) {
1295 free(Out.segmentmarkerlist); Out.segmentmarkerlist = NULL;}
1296 if(Out.holelist!=NULL) {
1297 free(Out.holelist); Out.holelist = NULL;}
1298 if(Out.regionlist!=NULL) {
1299 free(Out.regionlist); Out.regionlist = NULL;}
1300 if(Out.edgelist!=NULL) {
1301 free(Out.edgelist); Out.edgelist = NULL;}
1302 if(Out.edgemarkerlist!=NULL) {
1303 free(Out.edgemarkerlist); Out.edgemarkerlist = NULL;}
1304 if(Out.normlist!=NULL) {
1305 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