forked from FreeFem/FreeFem-sources
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lgmesh.cpp
2027 lines (1749 loc) · 60.8 KB
/
lgmesh.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// -*- Mode : c++ -*-
//
// SUMMARY :
// USAGE :
// ORG :
// AUTHOR : Frederic Hecht
// E-MAIL : [email protected]
//
/*
This file is part of Freefem++
Freefem++ is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
Freefem++ is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with Freefem++; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
#include <iostream>
#include <cfloat>
using namespace std;
#include "error.hpp"
#include "AFunction.hpp"
#include "rgraph.hpp"
#include "RNM.hpp"
#include "fem.hpp"
#include "FESpacen.hpp"
#include "FESpace.hpp"
//#include "fem3.hpp"
#include "MeshPoint.hpp"
#include <complex>
#include "Operator.hpp"
#include <set>
#include <vector>
#include <fstream>
#include "lex.hpp"
#include "Mesh2.h"
#include "BamgFreeFem.hpp"
#include "lgfem.hpp"
*/
#include "ff++.hpp"
#include "AFunction_ext.hpp"
#include "lgmesh.hpp"
using Fem2D::Mesh;
using Fem2D::MeshPoint;
extern bool NoWait;
typedef Mesh const * pmesh;
class classBuildMesh : public E_F0mps { public:
typedef pmesh Result;
static basicAC_F0::name_and_type name_param[] ;
static const int n_name_param =5;
Expression nargs[n_name_param];
Expression getborders;
long arg(int i,Stack stack,long a) const{ return nargs[i] ? GetAny<long>( (*nargs[i])(stack) ): a;}
bool arg(int i,Stack stack,bool a) const{ return nargs[i] ? GetAny<bool>( (*nargs[i])(stack) ): a;}
double arg(int i,Stack stack,double a) const{ return nargs[i] ? GetAny<double>( (*nargs[i])(stack) ): a;}
KNM<double>* arg(int i,Stack stack,KNM<double>* p) const{ return nargs[i] ? GetAny<KNM<double>*>( (*nargs[i])(stack) ): p;}
classBuildMesh(const basicAC_F0 & args)
{
args.SetNameParam(n_name_param,name_param,nargs);
getborders=to<const E_BorderN *>(args[0]);
}
static ArrayOfaType typeargs() { return ArrayOfaType(atype<const E_BorderN *>());}
static E_F0 * f(const basicAC_F0 & args){ return new classBuildMesh(args);}
AnyType operator()(Stack s) const ;
operator aType () const { return atype<Result>();}
};
class classBuildMeshArray : public E_F0mps { public:
typedef pmesh Result;
//static basicAC_F0::name_and_type name_param[] ;
static const int n_name_param =0;
//Expression nargs[n_name_param];
Expression env,ent,enbe;
Expression ev,et,ebe;
classBuildMeshArray(const basicAC_F0 & args)
{
args.SetNameParam(0,0,0);
env=to<long>(args[0]);
ent=to<long>(args[1]);
enbe=to<long>(args[2]);
ev=to<KNM_<double> >(args[3]);
et=to<KNM_<long> >(args[4]);
ebe=to<KNM_<long> >(args[5]);
}
static ArrayOfaType typeargs() {
aType ffint =atype< long >();
aType ffMi =atype< KNM_<long> >();
aType ffMr =atype< KNM_<double> >();
return ArrayOfaType(ffint,ffint,ffint,ffMr,ffMi,ffMi);}
static E_F0 * f(const basicAC_F0 & args){ return new classBuildMeshArray(args);}
AnyType operator()(Stack s) const {
long nv = GetAny<long >((*env)(s));
long nt = GetAny<long >((*ent)(s));
long nbe = GetAny<long >((*enbe)(s));
KNM_<double> xyl( GetAny<KNM_<double> >((*ev)(s)));
KNM_<long> nut( GetAny<KNM_<long> >((*et)(s)));
KNM_<long> nube( GetAny<KNM_<long> >((*ebe)(s)));
using Fem2D::Vertex;
using Fem2D::R2;
using Fem2D::BoundaryEdge;
using Fem2D::Mesh;
using Fem2D::MeshPointStack;
// Mesh(int nbv,int nbt,int nbeb,Vertex *v,Triangle *t,BoundaryEdge *b);
cout << nv << " " << nt << " " << nbe << endl;
cout << xyl.N() << " "<< xyl.M() << endl;
cout << nut.N() << " "<< nut.M() << endl;
cout << nube.N() << " "<< nube.M() << endl;
ffassert(xyl.N() >=nv && xyl.M() >= 3);
ffassert(nut.N() >=nt && nut.M() >= 4);
ffassert(nube.N() >=nbe && nube.M() >= 3);
Vertex *v= new Vertex [nv];
Triangle *t= new Triangle[nt];
BoundaryEdge *b = new BoundaryEdge[nbe];
for(int i=0;i<nv;++i)
{
v[i].x = xyl(i,0);
v[i].y = xyl(i,1);
v[i].lab = xyl(i,2);
}
for(int i=0;i<nt;++i)
t[i].set(v,nut(i,0),nut(i,1),nut(i,2),nut(i,3));
for(int i=0;i<nbe;++i)
b[i].set(v,nube(i,0),nube(i,1),nube(i,2));
Mesh * pth= new Mesh(nv,nt,nbe,v,t,b);
if(verbosity) cout << " -- BuildMesh " << pth << " " << nv << " " << nt << " " << nbe << endl;
R2 Pn,Px;
pth->BoundingBox(Pn,Px);
if(!pth->quadtree)
pth->quadtree=new Fem2D::FQuadTree(pth,Pn,Px,pth->nv);
return Add2StackOfPtr2FreeRC(s,pth);// 07/2008 FH
}
operator aType () const { return atype<Result>();}
};
basicAC_F0::name_and_type classBuildMesh::name_param[]= {
{ "nbvx", &typeid(long)} ,
{"fixeborder", &typeid(bool)},// obsolete
{"points", &typeid(KNM<double>*)},
{"fixedborder", &typeid(bool)},
{"alea", &typeid(double)}
};
// modif aout 2007
class BuildMeshFile : public E_F0mps { public:
typedef pmesh Result;
static basicAC_F0::name_and_type name_param[] ;
static const int n_name_param =1;
Expression nargs[n_name_param];
Expression getfilename;
long arg(int i,Stack stack,long a) const{ return nargs[i] ? GetAny<long>( (*nargs[i])(stack) ): a;}
BuildMeshFile(const basicAC_F0 & args)
{
args.SetNameParam(n_name_param,name_param,nargs);
getfilename=to<string* >(args[0]);
}
static ArrayOfaType typeargs() { return ArrayOfaType(atype<string *>());}
static E_F0 * f(const basicAC_F0 & args){ return new BuildMeshFile(args);}
AnyType operator()(Stack s) const ;
operator aType () const { return atype<Result>();}
};
basicAC_F0::name_and_type BuildMeshFile::name_param[]= {
{ "nbvx", &typeid(long) }
};
// fin modif 2007
class MoveMesh : public E_F0mps { public:
typedef pmesh Result;
Expression getmesh;
Expression U,V;
int nbsol;
vector<Expression> sol;
MoveMesh(const basicAC_F0 & args) :nbsol(args.size()-2),sol(args.size()-2)
{
using Fem2D::Triangle;
using Fem2D::Vertex;
using Fem2D::R2;
using Fem2D::BoundaryEdge;
using Fem2D::Mesh;
// using Fem2D::R;
using Fem2D::MeshPointStack;
args.SetNameParam();
getmesh=to<pmesh>(args[0]);
const E_Array * a = dynamic_cast<const E_Array *>(args[1].LeftValue());
ffassert(a);
if (a->size() !=2) CompileError("movemesh(Th,[u,v],...) need 2 componate in array ",atype<pmesh>());
U=to<double>( (*a)[0]);
V=to<double>( (*a)[1]);
for (int i=2;i<args.size();i++)
sol[i-2]=to<double>(args[i]);
}
static ArrayOfaType typeargs() { return ArrayOfaType(atype<pmesh>(),atype<E_Array>(),true);}
static E_F0 * f(const basicAC_F0 & args){ return new MoveMesh(args);}
AnyType operator()(Stack s) const ;
operator aType () const { return atype<Result>();}
};
class SplitMesh : public E_F0mps { public:
typedef pmesh Result;
Expression getmesh;
Expression U;
SplitMesh(const basicAC_F0 & args)
{
args.SetNameParam();
getmesh=to<pmesh>(args[0]);
U = to<long>(args[1]);
}
static ArrayOfaType typeargs() { return ArrayOfaType(atype<pmesh>(),atype<long>());}
static E_F0 * f(const basicAC_F0 & args){ return new SplitMesh(args);}
AnyType operator()(Stack s) const ;
operator aType () const { return atype<Result>();}
};
class SaveMesh : public E_F0 { public:
typedef pmesh Result;
Expression getmesh;
Expression filename;
Expression xx,yy,zz;
SaveMesh(const basicAC_F0 & args)
{
xx=0;
yy=0;
zz=0;
args.SetNameParam();
getmesh=to<pmesh>(args[0]);
filename=to<string*>(args[1]);
if (args.size() >2)
{
const E_Array * a = dynamic_cast<const E_Array *>(args[2].LeftValue());
if (!a) CompileError("savemesh(Th,\"filename\",[u,v,w],...");
int k=a->size() ;
// cout << k << endl;
if ( k!=2 && k !=3) CompileError("savemesh(Th,\"filename\",[u,v,w]) need 2 or 3 componate in array ",atype<pmesh>());
xx=to<double>( (*a)[0]);
yy=to<double>( (*a)[1]);
if(k==3)
zz=to<double>( (*a)[2]);
}
}
static ArrayOfaType typeargs() { return ArrayOfaType(atype<pmesh>(),atype<string*>(),true);}
static E_F0 * f(const basicAC_F0 & args){ return new SaveMesh(args);}
AnyType operator()(Stack s) const ;
};
class Adaptation : public E_F0mps { public:
typedef pmesh Result;
static basicAC_F0::name_and_type name_param[] ;
static const int n_name_param =28;
int nbsol;
Expression nargs[n_name_param];
Expression getmesh;
Expression em11,em22,em12;
int typesol[100];
vector<Expression> sol;
int nbcperiodic;
Expression *periodic;
double arg(int i,Stack stack,double a) const { return nargs[i] ? GetAny<double>( (*nargs[i])(stack) ): a;}
long arg(int i,Stack stack,long a) const{ return nargs[i] ? GetAny<long>( (*nargs[i])(stack) ): a;}
long* arg(int i,Stack stack,long* a) const{ return nargs[i] ? GetAny<long*>( (*nargs[i])(stack) ): a;}
bool arg(int i,Stack stack,bool a) const{ return nargs[i] ? GetAny<bool>( (*nargs[i])(stack) ): a;}
int arg(int i,Stack stack,int a) const{ return nargs[i] ? GetAny<int>( (*nargs[i])(stack) ): a;}
Adaptation(const basicAC_F0 & args) :nbsol(args.size()-1),sol(args.size()-1)
{
em11=0;
em22=0;
em12=0;
args.SetNameParam(n_name_param,name_param,nargs);
getmesh=to<pmesh>(args[0]);
int ksol=0;
ffassert(nbsol<100);
for (int i=1;i<nbsol+1;i++)
if (args[i].left()==atype<E_Array>())
{
const E_Array * a = dynamic_cast<const E_Array *>(args[i].LeftValue());
ffassert(a);
ksol+=a->size();
}
else
ksol++;
sol.resize(ksol);
ksol=0;
for (int i=1;i<nbsol+1;i++)
if (args[i].left()==atype<E_Array>())
{
const E_Array * a = dynamic_cast<const E_Array *>(args[i].LeftValue());
ffassert(a);
int N=a->size();
typesol[i-1]=N-1; // ok en 2D
if (N<=4) {
for (int j=0;j<N;j++)
sol[ksol++]=to<double>((*a)[j]); }
else {
lgerror(" Adaptation vecteur a plus de 4 compossantes inconnue");
}
}
else {
typesol[i-1]=0;
sol[ksol++]=to<double>(args[i]);
}
const E_Array * expmetrix = dynamic_cast<const E_Array *>(nargs[24]);
if(expmetrix)
{
if(expmetrix->nbitem()!=3)
ExecError("\nSorry we wait an array with 3 componants in: metrix=[m11,m12,m22]");
em11=(*expmetrix)[0];
em12=(*expmetrix)[1];
em22=(*expmetrix)[2];
if( (*expmetrix)[0].left()!= atype<KN<double> *>() )
CompileError("Sorry the fist array componant in metrix=[m11,m12,m22] must be vector");
if( (*expmetrix)[1].left()!= atype<KN<double> *>() )
CompileError("Sorry the second array componant in metrix=[m11,m12,m22] must be vector");
if( (*expmetrix)[2].left()!= atype<KN<double> *>() )
CompileError("Sorry the third array componant in metrix=[m11,m12,m22] must be vector");
}
nbcperiodic=0;
periodic=0;
GetPeriodic(2,nargs[25],nbcperiodic,periodic);
}
static ArrayOfaType typeargs() { return ArrayOfaType(atype<pmesh>(),true);}
static E_F0 * f(const basicAC_F0 & args){ return new Adaptation(args);}
AnyType operator()(Stack s) const ;
operator aType () const { return atype<pmesh>();}
};
basicAC_F0::name_and_type Adaptation::name_param[Adaptation::n_name_param] = {
{ "hmin", &typeid(double)}, // à
{ "hmax", &typeid(double)},
{ "err", &typeid(double)},
{ "errg", &typeid(double)},
{ "nbvx", &typeid(long)}, // 4
{ "nbsmooth", &typeid(long)},
{ "nbjacoby", &typeid(long)},
{ "ratio", &typeid(double)},
{ "omega", &typeid(double)},
{ "iso", &typeid(bool)}, // 9
{ "abserror", &typeid(bool)},
{ "cutoff", &typeid(double)},
{ "verbosity", &typeid(long)},
{ "inquire", &typeid(bool)},
{ "splitpbedge", &typeid(bool)}, // 14
{ "maxsubdiv", &typeid(double)},
{ "anisomax", &typeid(double)},
{ "rescaling", &typeid(bool)},
{ "keepbackvertices", &typeid(bool)},
{ "IsMetric", &typeid(bool)}, // 19
{ "power", &typeid(double)}, // 20
{ "thetamax", &typeid(double)},
{ "splitin2", &typeid(bool) },
{ "nomeshgeneration", &typeid(bool) },
{ "metric" , &typeid(E_Array)}, // 24
{ "periodic" , &typeid(E_Array) },// 25
{ "requirededges", &typeid(KN_<long> ) }, // 26
{ "warning", &typeid(long *) } // 27
};
struct Op_trunc_mesh : public OneOperator {
class Op: public E_F0mps { public:
static basicAC_F0::name_and_type name_param[] ;
static const int n_name_param =5;
Expression nargs[n_name_param];
Expression getmesh,bbb;
long arg(int i,Stack stack,long a) const{ return nargs[i] ? GetAny<long>( (*nargs[i])(stack) ): a;}
bool arg(int i,Stack stack,bool a) const{ return nargs[i] ? GetAny<bool>( (*nargs[i])(stack) ): a;}
KN<long> * arg(int i,Stack stack) const{ return nargs[i] ? GetAny<KN<long> *>( (*nargs[i])(stack) ): 0;}
Op(const basicAC_F0 & args,Expression t,Expression b) : getmesh(t),bbb(b)
{ args.SetNameParam(n_name_param,name_param,nargs); }
AnyType operator()(Stack s) const ;
};
E_F0 * code(const basicAC_F0 & args) const
{ return new Op(args,to<pmesh>(args[0]),to<bool>(args[1])) ;}
Op_trunc_mesh() :
OneOperator(atype<pmesh>(),atype<pmesh>(),atype<bool>()) {}
};
basicAC_F0::name_and_type Op_trunc_mesh::Op::name_param[Op_trunc_mesh::Op::n_name_param] =
{
{ "split", &typeid(long)},
{ "label", &typeid(long)},
{ "new2old", &typeid(KN<long>*)}, // ajout FH pour P. Jolivet jan 2014
{ "old2new", &typeid(KN<long>*)}, // ajout FH pour P. JoLivet jan 2014
{ "renum",&typeid(bool)}
};
//extern Fem2D::Mesh * BuildMesh(Stack stack, E_BorderN const * const & b,bool justboundary,int nbvmax,) ;
AnyType classBuildMesh::operator()(Stack stack) const {
const E_BorderN * borders = GetAny<const E_BorderN *>((*getborders)(stack));
long nbvx = arg(0,stack,0L);
bool requireborder= arg(3,stack,arg(1,stack,false));
KNM<double> * p=0; p=arg(2,stack,p);
double alea = arg(4,stack,0.);
ffassert( nbvx >= 0);
return SetAny<pmesh>(Add2StackOfPtr2FreeRC(stack,BuildMesh(stack,borders,false,nbvx,requireborder,p,alea)));
}
AnyType BuildMeshFile::operator()(Stack stack) const {
string* filename = GetAny<string* >((*getfilename)(stack));
long nbvx = arg(0,stack,0);
ffassert( nbvx >= 0);
pmesh pmsh=buildmeshbamg( filename,nbvx);
Add2StackOfPtr2FreeRC(stack,pmsh);// 07/2008 FH
return SetAny<pmesh>(pmsh);
}
AnyType Op_trunc_mesh::Op::operator()(Stack stack) const {
// Remark : F.Hecht feb 2016 ...
// WARNING for DDM
// trunc(trunc(Th,op1),op2) =trunc(trunc(Th,op2),op1) => no renumbering ....
using namespace Fem2D;
const Mesh & Th = *GetAny<pmesh>((*getmesh)(stack));
long kkksplit =std::max(1L, arg(0,stack,1L));
long label =arg(1,stack,2L);
KN<long> * pn2o = arg(2,stack);
KN<long> * po2n = arg(3,stack);
KN<int> split(Th.nt);
bool renum=arg(4,stack,false);// change to false too dangerous with ddm the trunc must commute in DDM
split=kkksplit;
long ks=kkksplit*kkksplit;
MeshPoint *mp= MeshPointStack(stack),mps=*mp;
long kk=0;
for (int k=0;k<Th.nt;k++)
{
Triangle & K(Th[k]);
R2 B(1./3.,1./3.);
mp->set(Th,K(B),B,K,0);
if ( GetAny<bool>((*bbb)(stack)) ) kk++;
else split[k]=0 ;
}
if(pn2o)
{
pn2o->resize(kk*ks);
KN<long> &n2o(*pn2o);
int l=0;
for(int k=0; k< Th.nt; ++k)
if( split[k] )
for(int i=0; i< ks; ++i)
n2o[l++] = k;
}
if(po2n)
{
po2n->resize(Th.nt);
KN<long> &o2n(*po2n);
int l=0;
for(int k=0; k< Th.nt; ++k)
if( split[k] )
{
o2n[k] = l;
l+=ks;
}
else o2n[k]=-1;
}
*mp=mps;
if (verbosity>1)
cout << " -- Trunc mesh: Nb of Triangle = " << kk << " label=" <<label <<endl;
Mesh * pmsh = new Mesh(Th,split,false,label);
if(renum) pmsh->renum();
/* deja fait dans bamg2msh
Fem2D::R2 Pn,Px;
m->BoundingBox(Pn,Px);
m->quadtree=new Fem2D::FQuadTree(m,Pn,Px,m->nv);*/
// pmsh->decrement();
Add2StackOfPtr2FreeRC(stack,pmsh);// 07/2008 FH
return SetAny<pmesh>(pmsh);
};
AnyType SplitMesh::operator()(Stack stack) const
{
using Fem2D::Vertex;
using Fem2D::R2;
using Fem2D::BoundaryEdge;
using Fem2D::Mesh;
// using Fem2D::R;
using Fem2D::MeshPointStack;
MeshPoint *mp(MeshPointStack(stack)) , mps=*mp;
const Mesh * Thh = GetAny<pmesh>((*getmesh)(stack));
ffassert(Thh);
int label=1;
const Mesh & Th(*Thh);
// long nbv=Thh->nv;
long nbt=Thh->nt;
KN<int> split(nbt);
R2 B(1./3.,1./3.);
int smax=0;
int smin=100000;
for (int it=0;it<nbt;it++)
{
Triangle & K(Th[it]);
mp->set(Th,K(B),B,K,K.lab);
split[it]=GetAny<long>((*U)(stack));
smin=min(smin,split[it]);
smax=max(smax,split[it]);
}
if(verbosity) cout << " -- Splitmesh " << Thh << " split min: " << smin << " max: " << smax << endl;
Mesh * pth= new Mesh(*Thh,split,false,label);
R2 Pn,Px;
pth->BoundingBox(Pn,Px);
if(!pth->quadtree)
pth->quadtree=new Fem2D::FQuadTree(pth,Pn,Px,pth->nv);
*mp=mps;
// pth->decrement();
Add2StackOfPtr2FreeRC(stack,pth);// 07/2008 FH
return SetAny<pmesh>(pth);
}
AnyType SaveMesh::operator()(Stack stack) const
{
using Fem2D::MeshPointStack;
const Fem2D::Mesh * Thh = GetAny<pmesh>((*getmesh)(stack));
string * fn = GetAny<string*>((*filename)(stack));
if (!xx && !yy ) {
const ::bamg::Triangles * bTh= msh2bamg(*Thh);
(*bTh).Write(fn->c_str(),::bamg::Triangles::AutoMesh);
delete bTh;
}
else {
MeshPoint *mp(MeshPointStack(stack)) , mps=*mp;
ofstream fp((*fn+".points").c_str());
ofstream ff((*fn+".faces").c_str());
fp.precision(12);
if (verbosity>1)
cout << " -- Opening files " << (*fn+".points") << " and " << (*fn+".faces") << endl;
const Fem2D::Mesh & Th=*Thh;
long nbv=Thh->nv;
long nbt=Thh->nt;
ff << nbt << endl;
fp << nbv << endl;
KN<long> num(nbv);
num=-1;
int k=0;
for (int it=0;it<nbt;it++)
{
const Fem2D::Triangle & K(Th[it]);
num[Th(K[0])]=k++;
num[Th(K[1])]=k++;
num[Th(K[2])]=k++;
ff << " 3 " << Th(K[0])+1 << ' ' << Th(K[1])+1 << ' ' << Th(K[2])+1 << ' '
<< " 0 0 0 " << K.lab << '\n';
}
if( verbosity>5)
cout << " - end writing faces " << endl;
for (int iv=0;iv<nbv;iv++)
{
// cout << iv << endl;
const Fem2D::Vertex & v(Th(iv));
ffassert( iv == Th(num[iv]/3,num[iv]%3));
mp->setP(Thh,num[iv]/3,num[iv]%3);
fp << GetAny<double>((*xx)(stack)) << ' ';
fp << GetAny<double>((*yy)(stack)) << ' ';
if (zz)
fp << GetAny<double>((*zz)(stack)) << ' ';
else
fp << " 0 ";
fp << v.lab<< '\n';
}
if( verbosity>5)
cout << " - end writing points " << endl;
*mp= mps;
}
// delete fn; modif mars 2006 auto del ptr
return SetAny<pmesh>(Thh);
}
AnyType MoveMesh::operator()(Stack stack) const
{
using Fem2D::Triangle;
using Fem2D::Vertex;
using Fem2D::R2;
using Fem2D::BoundaryEdge;
using Fem2D::Mesh;
// using Fem2D::R;
using Fem2D::MeshPointStack;
MeshPoint *mp(MeshPointStack(stack)) , mps=*mp;
const Mesh * Thh = GetAny<pmesh>((*getmesh)(stack));
ffassert(Thh);
long nbv=Thh->nv;
long nbt=Thh->nt;
KN<double> u(nbv),v(nbv);
double infini=DBL_MAX;
u=infini;
for (int it=0;it<nbt;it++)
for (int iv=0;iv<3;iv++)
{
int i=(*Thh)(it,iv);
if ( u[i]==infini) { // if nuset the set
mp->setP(Thh,it,iv);
u[i]=GetAny<double>((*U)(stack));
v[i]=GetAny<double>((*V)(stack));
}
}
const Mesh * pth= MoveTheMesh(*Thh,u,v);
if (pth)
for (size_t i=0;i<sol.size();i++)
{ // ale
pair<FEbase<double,v_fes>,int> * s = GetAny<pair<FEbase<double,v_fes>,int>*>( (*sol[i])(stack));
ffassert(s->first.Vh);
ffassert( &s->first.Vh->Th == Thh); // same old mesh
ffassert(0); // a faire ????
}
*mp=mps;
//pth->decrement();
Add2StackOfPtr2FreeRC(stack,pth);// 07/2008 FH
return SetAny<pmesh>(pth);
}
AnyType Adaptation::operator()(Stack stack) const
{
using namespace bamg;
using bamg::Min;
using bamg::Max;
using bamg::Abs;
Real8 err = arg(2,stack,0.01); // coef in the metric
Real8 errg = arg(3,stack,Min(0.01,err));// Modif FH 201217
long nbsx = Max(100L,arg(4,stack,9000L));
long nbsmooth = arg(5,stack,3L);
long nbjacobi = arg(6,stack,0L) ; // if increased will be more smooth
const Real8 raison = arg(7,stack,1.8);
const Real8 omega = arg(8,stack,1.0) ;
bool iso = arg(9,stack,false);
bool AbsError = arg(10,stack,true);
Real8 CutOff = arg(11,stack, 1.0e-6);
verbosity = arg(12,stack, (long) verbosity);
bool inq = arg(13,stack,false);
bool SplitEdgeWith2Boundary = arg(14,stack,true);
double maxsubdiv = Max(Min( arg(15,stack,10.0),10.0),0.1);
double anisomax = Max((double) arg(16,stack,1.0e6),1.0);
bool rescaling = arg(17,stack,true) ;
bool KeepBackVertices = arg(18,stack,true) ;
int givenmetric = arg(19,stack,false) ;
double powerM = arg(20,stack,1.0) ;
double cutoffradian = arg(21,stack,-1.0)* bamg::Pi/180. ;
bool split = arg(22,stack,false) ;
bool nomeshgeneration = arg(23,stack,false) ;
long lwarning=0;
long * pwarning = arg(27,stack,&lwarning) ;
long &warning=*pwarning; // get get warning message ...
// the 24th param is metrix and is store at compilation time
// const E_Array * expmetrix = dynamic_cast<const E_Array *>(nargs[24]);
// the 25th param is periodic and it store at compilation time
// in nbcperiodic,periodic variable
KN<long> reqedges0;
// list of label of required edges , for no adapattion on this part of the boundary.
KN<long> reqedges ( nargs[26] ? GetAny< KN_<long> >( (*nargs[26])(stack) ): (KN_<long>)reqedges0);
if(reqedges.N() && verbosity)
cout << " reqedges labels " << reqedges << endl;
KN<double> *mm11=0, *mm12=0,* mm22=0;
using Fem2D::MeshPoint;
using Fem2D::Mesh;
const Mesh * Thh = GetAny<pmesh>((*getmesh)(stack));
ffassert(Thh);
Triangles * oTh =0;
if (nbcperiodic) {
KN<int> ndfv(Thh->nv);
KN<int> ndfe(Thh->neb);
int nbdfv=0,nbdfe=0;
BuildPeriodic(nbcperiodic,periodic,*Thh,stack,nbdfv,ndfv,nbdfe,ndfe);
oTh = msh2bamg(*Thh,cutoffradian,nbdfv,ndfv,nbdfe,ndfe,reqedges,reqedges.N());
// cerr << " Sorry periodic mesh adaptation is not well implemented "<< endl;
// ExecError("adaptmesh( ... )");
}
else
oTh = msh2bamg(*Thh,cutoffradian,reqedges,reqedges.N());
Triangles &Th(*oTh);
bool mtx=em11 && em22 && em12;
if( mtx )
{
mm11= GetAny<KN<double> *>( (*em11)(stack) );
mm22= GetAny<KN<double> *>( (*em22)(stack) );
mm12= GetAny<KN<double> *>( (*em12)(stack) );
if (mm11->N() != Th.nbv || mm22->N() != Th.nbv || mm12->N() != Th.nbv)
ExecError("The size of3 metrics array must be equal to nb of vertex");
}
KN<double> &m11=*mm11;
KN<double> &m12=*mm12;
KN<double> &m22=*mm22;
Real8 hmax = 0.3*Th.MaximalHmax(); // final largest edge
Real8 hmin = Th.MinimalHmin(); // final smallest edge
Real8 coef =1; // a priori don't touch
// gestion des arguments
hmin = Max(hmin, arg(0,stack,hmin));
hmax = Min(hmax,arg(1,stack,hmax));
if (inq && initgraphique)
if (!withrgraphique ) {initgraphique();withrgraphique=true;}
if (iso) anisomax=1;
if (verbosity>2)
{
cout << endl << endl;
cout << " \t\t ## adapt : nbsol= " << nbsol << ", nbsx = " << nbsx << ", err = " << err ;
cout << ", hmin = " << hmin << ", hmax = " << hmax <<endl;
cout << " \t\t ratio = " << raison << ", nbsmooth = " << nbsmooth ;
cout << ", omega = " << omega << ", coef = " << coef << ", iso = " << iso << endl;
cout << " \t\t AbsError =" << AbsError << ", CutOff = " << CutOff << ", nbjacobi = " << nbjacobi <<endl;
cout << " \t\t maxsubdiv = " << maxsubdiv << " splitpbedge = " << SplitEdgeWith2Boundary <<endl;
cout << " \t\t anisomax = " << anisomax << ", rescaling = " << rescaling << ", power = " << powerM
<< ", KeepBackvertices = " << KeepBackVertices << " IsMetric = " << givenmetric
<< endl << endl ;
}
//
Th.ReMakeTriangleContainingTheVertex();
MeshPoint* mp(Fem2D::MeshPointStack(stack));
Int4 i,iv;
int ksol =0;
for (i=0;i<nbsol;i++)
ksol += typesol[i]+1; // marche en 2d
double * lessol = new double [Th.nbv*ksol];
double *ss = lessol;
// be careful because renum --
// the triangle was no renum
for ( iv=0;iv<Th.nbv;iv++)
Th[iv].color=1; // color
for (Int4 it = 0; it < Thh->nt; it++)
for (Int4 jt = 0; jt < 3; jt++)
{
bamg::Vertex & v= Th(it)[jt];
// const Fem2D::Vertex & vf = (*Thh)[it][jt];
if ( v.color)
{
v.color =0; // uncolor
mp->setP(Thh ,it,jt);
ss = lessol + ksol* Th.Number(v);
for (int j =0; j < ksol; j++)
*ss++= GetAny<double>( (*sol[j])(stack) );
}
}
mp->unset();
// computation of the metric ---
// better thing -> create keyword in the language
// a faire F Hecht .
Metric Mhmax(hmax);
double ch2=2/(hmax*hmax);
double cH2=2/(hmin*hmin);
for ( iv=0;iv<Th.nbv;iv++)
Th[iv].m = Mhmax;
int miss=0;
if (mtx)
for ( iv=0;iv<Th.nbv;iv++)
//if ( (m11[iv]+m22[iv]) > ch2) // modif FH (Thank to J-F Remacle 07/2010), correct 03/2011 FH.
Th[iv].m.IntersectWith(MetricAnIso(m11[iv],m12[iv],m22[iv]));// add inters ..
else miss++;
//if(miss && verbosity>1) cout << " -- Warning: Missing metric on vertices (too large) " << miss << " " << ch2 << endl;
if ( givenmetric)
if (ksol == 1)
{
for (Int4 iv = 0,k=0; iv < Th.nbv ; iv++)
Th[iv].m.IntersectWith(Metric(lessol[k++]));
}
else if (ksol == 3)
{
for (Int4 iv = 0,k=0; iv < Th.nbv ; iv++, k += 3)
{
Metric MM(lessol[k],lessol[k+1],lessol[k+2]);
MatVVP2x2 vp(MM);
vp.Abs();
Th[iv].m.IntersectWith(vp);
}
}
else
lgerror("Adapt mesh: ksol is wrong, IsMetric and ksol != 1 or 3");
else
Th.IntersectConsMetric(lessol,nbsol,typesol,hmin,hmax,sqrt(err)*coef,anisomax,AbsError?0.0:CutOff,nbjacobi,rescaling,powerM,0);
#ifdef DRAWING1
if ( (inq!=0) && initgraphique ) {
if (!withrgraphique) {initgraphique();withrgraphique=true;}
reffecran();
Th.InitDraw();
Th.Draw();
if (!NoWait) Th.inquire();}
#endif
delete [] lessol;
Th.IntersectGeomMetric(errg,iso);
Th.SmoothMetric(raison);
Th.MaxSubDivision(maxsubdiv);
Th.BoundAnisotropy(anisomax);
// end of metric's computation
if (mtx)
for ( iv=0;iv<Th.nbv;iv++)
{
m11[iv] = Th[iv].m.a11 ;
m22[iv] = Th[iv].m.a22 ;
m12[iv] = Th[iv].m.a21;
}
Triangles* nTh = 0;
if ( ! nomeshgeneration)
{
nTh= new Triangles(nbsx,Th,KeepBackVertices); // Adaption is here
if (split)
nTh->SplitElement(1); // modif FH mai 2009 (thank J-M Mirebeau) : Th ->nTh
if(SplitEdgeWith2Boundary)
nTh->SplitInternalEdgeWithBorderVertices();
if(verbosity>3)
nTh->ShowHistogram();
if (nbsmooth)
nTh->SmoothingVertex(nbsmooth,omega);
if(verbosity>2 && nbsmooth)
nTh->ShowHistogram();
if(verbosity>0)
nTh->ShowRegulaty() ;
#ifdef DRAWING
if ((inq!=0) && initgraphique) {
if (!withrgraphique ) {initgraphique();withrgraphique=true;}
reffecran();
nTh->InitDraw();
nTh->Draw();
if(!NoWait) nTh->inquire();}
#else
inq=0;
#endif
Metric M(hmax);
for (iv=0;iv < Th.nbv;iv++)
Th[iv].m = M;
warning = nTh->warning;
const Mesh * g= bamg2msh(nTh,true);
delete nTh;
delete oTh;
//g->decrement();
Add2StackOfPtr2FreeRC(stack,g);// 07/2008 FH
return SetAny<pmesh>(g);
}
else {
if(verbosity>1)
{ cout << " regularty Old mesh / New metrix ";
oTh->ShowRegulaty() ;}
delete oTh;
return SetAny<pmesh>(Thh);
}
}
const Fem2D::Mesh * EmptyTheMesh(const Fem2D::Mesh * const & pTh,long *ssd=0)
{
using namespace Fem2D;
using Fem2D::Triangle;
using Fem2D::Vertex;
using Fem2D::R2;
using Fem2D::BoundaryEdge;
using Fem2D::Mesh;
const Mesh & Th=*pTh;
// using Fem2D::R;
using Fem2D::MeshPointStack;
int nbv=Th.nv;
int nbt=0;
int neb=Th.neb;
KN<int> renum(Th.nv);
renum=-1;
if(ssd)
{
nbt=-1; // pour ne pas retire l'exterieur
int nebb=0;
for (int i=0;i<Th.nt;i++)
for (int e=0;e<3;e++)
{ int ee=e,ii=Th.ElementAdj(i,ee);