This example is explained in Section 6.2 Use of fspace in 3d, page 152 of the doc in version 3.20
![]() | ![]() |
nodes oredered | 3D view of the mesh |
download example: periodic-3d.edp or return to 3D examples
load "msh3" load "medit" searchMethod=1; // more safe seach algo .. (FH for PICHON ??) verbosity=1; real a=1, d=0.5, h=0.5; border b1(t=0.5,-0.5) {x=a*t; y=-a/2; label=1;}; border b2(t=0.5,-0.5) {x=a/2; y=a*t; label=2;}; border b3(t=0.5,-0.5) {x=a*t; y=a/2; label=3;}; border b4(t=0.5,-0.5) {x=-a/2; y=a*t; label=4;}; border i1(t=0,2*pi) {x=d/2*cos(t); y=-d/2*sin(t); label=7;}; int nnb=7, nni=10; mesh Th=buildmesh(b1(-nnb)+b3(nnb)+b2(-nnb)+b4(nnb)+i1(nni));//, fixeborder=true); //Th=adaptmesh(Th,0.1,IsMetric=1,periodic=[[1,x],[3,x],[2,y],[4,y]]); int nz=3; { // for cleanning memory.. int[int] old2new(0:Th.nv-1); fespace Vh2(Th,P1); Vh2 sorder=x+y; sort(sorder[],old2new); int[int] new2old=old2new^-1; // inverse the permuation //for(int i=0;i< Th.nv;++i) // so by hand. // new2old[old2new[i]]=i; Th= change(Th,renumv=new2old); sorder[]=0:Th.nv-1; } { fespace Vh2(Th,P1); Vh2 nu; nu[]=0:Th.nv-1; plot(nu,cmm="nu=",wait=1); } int[int] rup=[0,5], rlow=[0,6], rmid=[1,1,2,2,3,3,4,4,7,7], rtet=[0,41]; func zmin=0; func zmax=h; mesh3 Th3=buildlayers(Th, nz, zbound=[zmin,zmax], reftet=rtet,reffacemid=rmid, reffaceup=rup, reffacelow=rlow); for(int i=1;i<=6;++i) cout << " int " << i << " : " << int2d(Th3,i)(1.) << " " << int2d(Th3,i)(1./area) << endl; savemesh(Th3,"Th3.mesh"); plot(Th3,wait=1); medit("Th3",Th3); fespace Vh(Th3,P2, periodic=[[1,x,z],[3,x,z],[2,y,z],[4,y,z],[5,x,y],[6,x,y]]);