void SplineSeg<D> :: GetPoints (int n, ARRAY<Point<D> > & points)
{
points.SetSize (n);
if (n >= 2)
for (int i = 0; i < n; i++)
points[i] = GetPoint(double(i) / (n-1));
}
void Primitive ::
GetTangentialVecSurfaceIndices (const Point<3> & p, const Vec<3> & v,
ARRAY<int> & surfind, double eps) const
{
cout << "get tangvecsurfind not implemented" << endl;
surfind.SetSize (0);
}
void Intersection (const FlatArray<T> & in1, const FlatArray<T> & in2, const FlatArray<T> & in3,
ARRAY<T> & out)
{
out.SetSize(0);
for(int i=0; i<in1.Size(); i++)
if(in2.Contains(in1[i]) && in3.Contains(in1[i]))
out.Append(in1[i]);
}
void CHotKeys::GetKeys(ARRAY& keys)
{
INT_PTR count = GetSize();
keys.SetSize(count);
for(int i=0; i < count; i++)
{
keys[i] = ElementAt(i)->GetKey();
}
}
void QickSort (const ARRAY<double> & values,
ARRAY<int> & order)
{
int i, n = values.Size();
order.SetSize (n);
for (i = 1; i <= n; i++)
order.Elem(i) = i;
QickSortRec (values, order, 1, order.Size());
}
void LineSeg<D> :: LineIntersections (const double a, const double b, const double c,
ARRAY < Point<D> > & points, const double eps) const
{
points.SetSize(0);
double denom = -a*p2(0)+a*p1(0)-b*p2(1)+b*p1(1);
if(fabs(denom) < 1e-20)
return;
double t = (a*p1(0)+b*p1(1)+c)/denom;
if((t > -eps) && (t < 1.+eps))
points.Append(GetPoint(t));
}
void Sort (const ARRAY<double> & values,
ARRAY<int> & order)
{
int n = values.Size();
int i, j;
order.SetSize (n);
for (i = 1; i <= n; i++)
order.Elem(i) = i;
for (i = 1; i <= n-1; i++)
for (j = 1; j <= n-1; j++)
if (values.Get(order.Elem(j)) > values.Get(order.Elem(j+1)))
{
Swap (order.Elem(j), order.Elem(j+1));
}
}
void Polyhedra :: GetPolySurfs(ARRAY < ARRAY<int> * > & polysurfs)
{
int maxnum = -1;
for(int i = 0; i<faces.Size(); i++)
{
if(faces[i].inputnr > maxnum)
maxnum = faces[i].inputnr;
}
polysurfs.SetSize(maxnum+1);
for(int i=0; i<polysurfs.Size(); i++)
polysurfs[i] = new ARRAY<int>;
for(int i = 0; i<faces.Size(); i++)
polysurfs[faces[i].inputnr]->Append(faces[i].planenr);
}
void SplineSeg3<D> :: LineIntersections (const double a, const double b, const double c,
ARRAY < Point<D> > & points, const double eps) const
{
points.SetSize(0);
double t;
const double c1 = a*p1(0) - sqrt(2.)*a*p2(0) + a*p3(0)
+ b*p1(1) - sqrt(2.)*b*p2(1) + b*p3(1)
+ (2.-sqrt(2.))*c;
const double c2 = -2.*a*p1(0) + sqrt(2.)*a*p2(0) -2.*b*p1(1) + sqrt(2.)*b*p2(1) + (sqrt(2.)-2.)*c;
const double c3 = a*p1(0) + b*p1(1) + c;
if(fabs(c1) < 1e-20)
{
if(fabs(c2) < 1e-20)
return;
t = -c3/c2;
if((t > -eps) && (t < 1.+eps))
points.Append(GetPoint(t));
return;
}
const double discr = c2*c2-4.*c1*c3;
if(discr < 0)
return;
if(fabs(discr/(c1*c1)) < 1e-14)
{
t = -0.5*c2/c1;
if((t > -eps) && (t < 1.+eps))
points.Append(GetPoint(t));
return;
}
t = (-c2 + sqrt(discr))/(2.*c1);
if((t > -eps) && (t < 1.+eps))
points.Append(GetPoint(t));
t = (-c2 - sqrt(discr))/(2.*c1);
if((t > -eps) && (t < 1.+eps))
points.Append(GetPoint(t));
}
void CircleSeg<D> :: LineIntersections (const double a, const double b, const double c,
ARRAY < Point<D> > & points, const double eps) const
{
points.SetSize(0);
double px=0,py=0;
if(fabs(b) > 1e-20)
py = -c/b;
else
px = -c/a;
const double c1 = a*a + b*b;
const double c2 = 2. * ( a*(py-pm(1)) - b*(px-pm(0)));
const double c3 = pow(px-pm(0),2) + pow(py-pm(1),2) - pow(Radius(),2);
const double discr = c2*c2 - 4*c1*c3;
if(discr < 0)
return;
ARRAY<double> t;
if(fabs(discr) < 1e-20)
t.Append(-0.5*c2/c1);
else
{
t.Append((-c2+sqrt(discr))/(2.*c1));
t.Append((-c2-sqrt(discr))/(2.*c1));
}
for(int i=0; i<t.Size(); i++)
{
Point<D> p (px-t[i]*b,py+t[i]*a);
double angle = atan2(p(1),p(0))+M_PI;
if(angle > StartAngle()-eps && angle < EndAngle()+eps)
points.Append(p);
}
}
void CCopyProperties::OnDeleteCopyData()
{
int nCount = m_lCopyData.GetSelCount();
if(nCount)
{
m_bDeletedData = true;
//Get the selected indexes
ARRAY items;
items.SetSize(nCount);
m_lCopyData.GetSelItems(nCount, items.GetData());
items.SortDescending();
//Get the selected itemdata
for(int i = 0; i < nCount; i++)
{
m_DeletedData.Add(m_lCopyData.GetItemData(items[i]));
m_lCopyData.DeleteString(items[i]);
}
}
}
void CCopyProperties::OnDeleteCopyData()
{
int nCount = m_lCopyData.GetSelCount();
if(nCount)
{
m_bDeletedData = true;
//Get the selected indexes
ARRAY items;
items.SetSize(nCount);
m_lCopyData.GetSelItems(nCount, items.GetData());
items.SortDescending();
//Get the selected itemdata
for(int i = 0; i < nCount; i++)
{
int row = items[i];
m_DeletedData.Add((int)m_lCopyData.GetItemData(row));
m_lCopyData.DeleteString(row);
int newRow = row-1;
if(newRow < 0)
{
newRow = 0;
}
if(newRow >= 0 && newRow < m_lCopyData.GetCount())
{
m_lCopyData.SetSel(newRow);
m_lCopyData.SetCurSel(newRow);
m_lCopyData.SetCaretIndex(newRow);
m_lCopyData.SetAnchorIndex(newRow);
}
}
}
}
void Polyhedra :: GetPrimitiveData (const char *& classname,
ARRAY<double> & coeffs) const
{
classname = "Polyhedra";
coeffs.SetSize(0);
coeffs.Append (points.Size());
coeffs.Append (faces.Size());
coeffs.Append (planes.Size());
/*
int i, j;
for (i = 1; i <= planes.Size(); i++)
{
planes.Elem(i)->Print (*testout);
}
for (i = 1; i <= faces.Size(); i++)
{
(*testout) << "face " << i << " has plane " << faces.Get(i).planenr << endl;
for (j = 1; j <= 3; j++)
(*testout) << points.Get(faces.Get(i).pnums[j-1]);
(*testout) << endl;
}
*/
}
/** calculates lineintersections:
for lines $$ a x + b y + c = 0 $$ the interecting points are calculated
and stored in points */
virtual void LineIntersections (const double a, const double b, const double c,
ARRAY < Point<2> > & points, const double eps) const
{points.SetSize(0);}
inline int FindInnerPoint2 (POINTARRAY & points,
FACEARRAY & faces,
Point3d & p)
{
static int timer = NgProfiler::CreateTimer ("FindInnerPoint2");
NgProfiler::RegionTimer reg (timer);
ARRAY<Vec3d> a;
ARRAY<double> c;
Mat<3> m, inv;
Vec<3> rs, x, pmin;
int nf = faces.Size();
a.SetSize (nf);
c.SetSize (nf);
for (int i = 0; i < nf; i++)
{
Point3d p1 = points.Get(faces[i][0]);
a[i] = Cross (points.Get(faces[i][1]) - p1,
points.Get(faces[i][2]) - p1);
a[i] /= a[i].Length();
c[i] = - (a[i].X() * p1.X() + a[i].Y() * p1.Y() + a[i].Z() * p1.Z());
}
x = 0;
double hmax = 0;
for (int i = 0; i < nf; i++)
{
const Element2d & el = faces[i];
for (int j = 1; j <= 3; j++)
{
double hi = Dist (points.Get(el.PNumMod(j)),
points.Get(el.PNumMod(j+1)));
if (hi > hmax) hmax = hi;
}
}
double fmin = 0;
for (int i1 = 1; i1 <= nf; i1++)
for (int i2 = i1+1; i2 <= nf; i2++)
for (int i3 = i2+1; i3 <= nf; i3++)
for (int i4 = i3+1; i4 <= nf; i4++)
{
m(0, 0) = a.Get(i1).X() - a.Get(i2).X();
m(0, 1) = a.Get(i1).Y() - a.Get(i2).Y();
m(0, 2) = a.Get(i1).Z() - a.Get(i2).Z();
rs(0) = c.Get(i2) - c.Get(i1);
m(1, 0) = a.Get(i1).X() - a.Get(i3).X();
m(1, 1) = a.Get(i1).Y() - a.Get(i3).Y();
m(1, 2) = a.Get(i1).Z() - a.Get(i3).Z();
rs(1) = c.Get(i3) - c.Get(i1);
m(2, 0) = a.Get(i1).X() - a.Get(i4).X();
m(2, 1) = a.Get(i1).Y() - a.Get(i4).Y();
m(2, 2) = a.Get(i1).Z() - a.Get(i4).Z();
rs(2) = c.Get(i4) - c.Get(i1);
if (fabs (Det (m)) > 1e-10)
{
CalcInverse (m, inv);
x = inv * rs;
double f = -1e10;
for (int i = 0; i < nf; i++)
{
double hd =
x(0) * a[i].X() + x(1) * a[i].Y() + x(2) * a[i].Z() + c[i];
if (hd > f) f = hd;
if (hd > fmin) break;
}
if (f < fmin)
{
fmin = f;
pmin = x;
}
}
}
p = Point3d (pmin(0), pmin(1), pmin(2));
(*testout) << "fmin = " << fmin << endl;
return (fmin < -1e-3 * hmax);
}
void Primitive :: GetPrimitiveData (const char *& classname,
ARRAY<double> & coeffs) const
{
classname = "undef";
coeffs.SetSize (0);
}
void Clear() {
boundary.SetSize(0);
};
void WriteTETFormat (const Mesh & mesh,
const string & filename)//, const string& problemType )
{
string problemType = "";
if(!mesh.PureTetMesh())
throw NgException("Can only export pure tet mesh in this format");
cout << "starting .tet export to file " << filename << endl;
ARRAY<int> point_ids,edge_ids,face_ids;
ARRAY<int> elnum(mesh.GetNE());
elnum = -1;
ARRAY<int> userdata_int;
ARRAY<double> userdata_double;
ARRAY<int> ports;
ARRAY<int> uid_to_group_3D, uid_to_group_2D, uid_to_group_1D, uid_to_group_0D;
int pos_int = 0;
int pos_double = 0;
bool haveuserdata =
(mesh.GetUserData("TETmesh:double",userdata_double) &&
mesh.GetUserData("TETmesh:int",userdata_int) &&
mesh.GetUserData("TETmesh:ports",ports) &&
mesh.GetUserData("TETmesh:point_id",point_ids,PointIndex::BASE) &&
mesh.GetUserData("TETmesh:uid_to_group_3D",uid_to_group_3D) &&
mesh.GetUserData("TETmesh:uid_to_group_2D",uid_to_group_2D) &&
mesh.GetUserData("TETmesh:uid_to_group_1D",uid_to_group_1D) &&
mesh.GetUserData("TETmesh:uid_to_group_0D",uid_to_group_0D));
int version,subversion;
if(haveuserdata)
{
version = int(userdata_double[0]);
subversion = int(10*(userdata_double[0] - version));
pos_double++;
}
else
{
version = 2;
subversion = 0;
}
if(version >= 2)
{
// test if ids are disjunct, if not version 2.0 not possible
int maxbc(-1),mindomain(-1);
for(ElementIndex i=0; i<mesh.GetNE(); i++)
if(i==0 || mesh[i].GetIndex() < mindomain)
mindomain = mesh[i].GetIndex();
for(int i=1; i<=mesh.GetNFD(); i++)
if(i==1 || mesh.GetFaceDescriptor(i).BCProperty() > maxbc)
maxbc = mesh.GetFaceDescriptor(i).BCProperty();
if(maxbc >= mindomain)
{
cout << "WARNING: writing version " << version << "." << subversion << " tetfile not possible, ";
version = 1; subversion = 1;
cout << "using version " << version << "." << subversion << endl;
}
}
int startsize = point_ids.Size();
point_ids.SetSize(mesh.GetNP()+1);
for(int i=startsize; i<point_ids.Size(); i++)
point_ids[i] = -1;
for(int i=0; i<PointIndex::BASE; i++)
point_ids[i] = -1;
INDEX_2_CLOSED_HASHTABLE<int> edgenumbers(6*mesh.GetNE()+3*mesh.GetNSE());;
INDEX_3_CLOSED_HASHTABLE<int> facenumbers(4*mesh.GetNE()+mesh.GetNSE());
ARRAY<INDEX_2> edge2node;
ARRAY<INDEX_3> face2edge;
ARRAY<INDEX_4> element2face;
int numelems(0),numfaces(0),numedges(0),numnodes(0);
for(SegmentIndex si = 0; si < mesh.GetNSeg(); si++)
{
const Segment & seg = mesh[si];
INDEX_2 i2(seg.p1,seg.p2);
i2.Sort();
if(edgenumbers.Used(i2))
continue;
numedges++;
edgenumbers.Set(i2,numedges);
edge2node.Append(i2);
edge_ids.Append(seg.edgenr);
if(point_ids[seg.p1] == -1)
point_ids[seg.p1] = (version >= 2) ? seg.edgenr : 0;
if(point_ids[seg.p2] == -1)
point_ids[seg.p2] = (version >= 2) ? seg.edgenr : 0;
}
for(SurfaceElementIndex si = 0; si < mesh.GetNSE(); si++)
{
if(mesh[si].IsDeleted())
continue;
const Element2d & elem = mesh[si];
numfaces++;
INDEX_3 i3(elem[0], elem[1], elem[2]);
int min = i3[0];
int minpos = 0;
for(int j=1; j<3; j++)
if(i3[j] < min)
{
min = i3[j]; minpos = j;
}
if(minpos == 1)
{
int aux = i3[0]; i3[0] = i3[1]; i3[1] = i3[2]; i3[2] = aux;
}
else if(minpos == 2)
{
int aux = i3[0]; i3[0] = i3[2]; i3[2] = i3[1]; i3[1] = aux;
}
facenumbers.Set(i3,numfaces);
int bc = mesh.GetFaceDescriptor(elem.GetIndex()).BCProperty();
face_ids.Append(bc);
for(int j=0; j<3; j++)
if(point_ids[elem[j]] == -1)
point_ids[elem[j]] = (version >= 2) ? bc : 0;
INDEX_2 i2a,i2b;
INDEX_3 f_to_n;
for(int j=0; j<3; j++)
{
i2a = INDEX_2(i3[j],i3[(j+1)%3]);
i2b[0] = i2a[1]; i2b[1] = i2a[0];
if(edgenumbers.Used(i2a))
f_to_n[j] = edgenumbers.Get(i2a);
else if(edgenumbers.Used(i2b))
f_to_n[j] = -edgenumbers.Get(i2b);
else
{
numedges++;
edgenumbers.Set(i2a,numedges);
edge2node.Append(i2a);
f_to_n[j] = numedges;
if(version >= 2)
edge_ids.Append(bc);
else
edge_ids.Append(0);
}
}
face2edge.Append(f_to_n);
}
for(ElementIndex ei = 0; ei < mesh.GetNE(); ei++)
{
const Element & el = mesh[ei];
if(el.IsDeleted())
continue;
numelems++;
elnum[ei] = numelems;
static int tetfaces[4][3] =
{ { 0, 2, 1 },
{ 0, 1, 3 },
{ 1, 2, 3 },
{ 2, 0, 3 } };
for(int j=0; j<4; j++)
if(point_ids[el[j]] == -1)
point_ids[el[j]] = (version >= 2) ? el.GetIndex() : 0;
INDEX_4 e_to_f;
for(int i = 0; i < 4; i++)
{
INDEX_3 i3a(el[tetfaces[i][0]],el[tetfaces[i][1]],el[tetfaces[i][2]]);
int min = i3a[0];
int minpos = 0;
for(int j=1; j<3; j++)
if(i3a[j] < min)
{
min = i3a[j]; minpos = j;
}
if(minpos == 1)
{
int aux = i3a[0]; i3a[0] = i3a[1]; i3a[1] = i3a[2]; i3a[2] = aux;
}
else if(minpos == 2)
{
int aux = i3a[0]; i3a[0] = i3a[2]; i3a[2] = i3a[1]; i3a[1] = aux;
}
INDEX_3 i3b(i3a[0],i3a[2],i3a[1]);
if(facenumbers.Used(i3a))
e_to_f[i] = facenumbers.Get(i3a);
else if(facenumbers.Used(i3b))
e_to_f[i] = -facenumbers.Get(i3b);
else
{
numfaces++;
facenumbers.Set(i3a,numfaces);
e_to_f[i] = numfaces;
if(version >= 2)
face_ids.Append(el.GetIndex());
else
face_ids.Append(0);
INDEX_2 i2a,i2b;
INDEX_3 f_to_n;
for(int j=0; j<3; j++)
{
i2a = INDEX_2(i3a[j],i3a[(j+1)%3]);
i2b[0] = i2a[1]; i2b[1] = i2a[0];
if(edgenumbers.Used(i2a))
f_to_n[j] = edgenumbers.Get(i2a);
else if(edgenumbers.Used(i2b))
f_to_n[j] = -edgenumbers.Get(i2b);
else
{
numedges++;
edgenumbers.Set(i2a,numedges);
edge2node.Append(i2a);
f_to_n[j] = numedges;
if(version >= 2)
edge_ids.Append(el.GetIndex());
else
edge_ids.Append(0);
}
}
face2edge.Append(f_to_n);
}
}
element2face.Append(e_to_f);
}
ofstream outfile(filename.c_str());
outfile.precision(16);
int unitcode;
double tolerance;
double dS1,dS2, alphaDeg;
double x3D,y3D,z3D;
int modelverts(0), modeledges(0), modelfaces(0), modelcells(0);
int numObj0D,numObj1D,numObj2D,numObj3D;
int numports = ports.Size();
ARRAY<int> nodenum(point_ids.Size()+1);
nodenum = -1;
numnodes = 0;
for(int i=0; i<point_ids.Size(); i++)
{
if(point_ids[i] != -1)
{
numnodes++;
nodenum[i] = numnodes;
}
}
if(haveuserdata)
{
unitcode = userdata_int[pos_int];
pos_int++;
tolerance = userdata_double[pos_double];
pos_double++;
dS1 = userdata_double[pos_double];
pos_double++;
dS2 = userdata_double[pos_double];
pos_double++;
alphaDeg = userdata_double[pos_double];
pos_double++;
x3D = userdata_double[pos_double];
pos_double++;
y3D = userdata_double[pos_double];
pos_double++;
z3D = userdata_double[pos_double];
pos_double++;
if(version == 2)
{
modelverts = userdata_int[pos_int];
pos_int++;
modeledges = userdata_int[pos_int];
pos_int++;
modelfaces = userdata_int[pos_int];
pos_int++;
modelcells = userdata_int[pos_int];
pos_int++;
}
numObj3D = userdata_int[pos_int];
pos_int++;
numObj2D = userdata_int[pos_int];
pos_int++;
numObj1D = userdata_int[pos_int];
pos_int++;
numObj0D = userdata_int[pos_int];
pos_int++;
}
else
{
unitcode = 3;
tolerance = 1e-5;
dS1 = dS2 = alphaDeg = 0;
x3D = y3D = z3D = 0;
modelverts = modeledges = modelfaces = modelcells = 0;
numObj3D = numObj2D = numObj1D = numObj0D = 0;
}
string uidpid;
if(version == 1)
uidpid = "PID";
else if (version == 2)
uidpid = "UID";
ARRAY< ARRAY<int,PointIndex::BASE>* > idmaps;
for(int i=1; i<=mesh.GetIdentifications().GetMaxNr(); i++)
{
if(mesh.GetIdentifications().GetType(i) == Identifications::PERIODIC)
{
idmaps.Append(new ARRAY<int,PointIndex::BASE>);
mesh.GetIdentifications().GetMap(i,*idmaps.Last(),true);
}
}
ARRAY<int> id_num,id_type;
ARRAY< ARRAY<int> *> id_groups;
// sst 2008-03-12: Write problem class...
{
std::string block;
block = "// CST Tetrahedral ";
block += !problemType.empty() ? problemType : "High Frequency";
block += " Mesh, Version no.:\n";
size_t size = block.size()-3;
block += "// ";
block.append( size, '^' );
block += "\n";
outfile
<< block
<< version << "." << subversion << "\n\n";
}
outfile
<< "// User Units Code (1=CM 2=MM 3=M 4=MIC 5=NM 6=FT 7=IN 8=MIL):\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< unitcode << "\n\n" \
<< "// Geometric coord \"zero\" tolerance threshold:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< tolerance << "\n\n" \
<< "// Periodic UnitCell dS1 , dS2 , alphaDeg:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< dS1 << " " << dS2 << " " << alphaDeg <<"\n\n" \
<< "// Periodic UnitCell origin in global coords (x3D,y3D,z3D):\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< x3D << " " << y3D << " " << z3D << "\n" << endl;
if(version == 2)
{
outfile << "// Model entity count: Vertices, Edges, Faces, Cells:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< modelverts << " " << modeledges << " " << modelfaces << " " << modelcells << endl << endl;
}
outfile << "// Topological mesh-entity counts (#elements,#faces,#edges,#nodes):\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
outfile << numelems << " "
<< numfaces << " "
<< numedges << " "
<< numnodes << endl << endl;
outfile << "// NodeID, X, Y, Z, Type (0=Reg 1=PMaster 2=PSlave 3=CPMaster 4=CPSlave), "<< uidpid <<":\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
id_num.SetSize(mesh.GetNP()+1);
id_type.SetSize(mesh.GetNP()+1);
id_num = 0;
id_type = 0;
int n2,n4,n8;
n2 = n4 = n8 = 0;
for(int i=PointIndex::BASE; i<mesh.GetNP()+PointIndex::BASE; i++)
{
if(id_num[i] != 0)
continue;
if(nodenum[i] == -1)
continue;
ARRAY<int> group;
group.Append(i);
for(int j=0; j<idmaps.Size(); j++)
{
startsize = group.Size();
for(int k=0; k<startsize; k++)
{
int id = (*idmaps[j])[group[k]];
if(id != 0 && !group.Contains(id) && nodenum[id] != -1)
{
group.Append(id);
id_num[id] = j+1+id_num[group[k]];
}
}
}
if(group.Size() > 1)
{
id_groups.Append(new ARRAY<int>(group));
if(group.Size() == 2)
{
id_type[i] = 1;
id_type[group[1]] = 2;
n2++;
}
else if(group.Size() == 4)
{
id_type[i] = 3;
for(int j=1; j<group.Size(); j++)
id_type[group[j]] = 4;
n4++;
}
else if(group.Size() == 8)
{
id_type[i] = 5;
for(int j=1; j<group.Size(); j++)
id_type[group[j]] = 6;
n8++;
}
else
cerr << "ERROR: Identification group size = " << group.Size() << endl;
}
}
for(PointIndex i=PointIndex::BASE; i<mesh.GetNP()+PointIndex::BASE; i++)
{
if(nodenum[i] == -1)
continue;
outfile << nodenum[i] << " "
<< mesh[i](0) << " "
<< mesh[i](1) << " "
<< mesh[i](2) << " " << id_type[i] << " ";
if(i-PointIndex::BASE < point_ids.Size())
outfile << point_ids[i];
else
outfile << "0";
outfile << "\n";
}
outfile << endl;
outfile << "\n// Number of Periodic Master Nodes:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< n2 << "\n" \
<< "\n" \
<< "// MasterNodeID, SlaveNodeID, TranslCode (1=dS1 2=dS2 3=dS1+dS2):\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<id_groups.Size(); i++)
{
if(id_groups[i]->Size() != 2)
continue;
for(int j=0; j<id_groups[i]->Size(); j++)
outfile << nodenum[(*id_groups[i])[j]] << " ";
for(int j=1; j<id_groups[i]->Size(); j++)
outfile << id_num[(*id_groups[i])[j]] << " ";
outfile << "\n";
delete id_groups[i];
id_groups[i] = NULL;
}
outfile << endl;
outfile << "// Number of Corner Periodic Master Nodes:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< n4 << "\n" \
<< "\n" \
<< "// MasterNodeID, 3-SlaveNodeID's, 3-TranslCodes (1=dS1 2=dS2 3=dS1+dS2):\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<id_groups.Size(); i++)
{
if(!id_groups[i] || id_groups[i]->Size() != 4)
continue;
for(int j=0; j<id_groups[i]->Size(); j++)
outfile << nodenum[(*id_groups[i])[j]] << " ";
for(int j=1; j<id_groups[i]->Size(); j++)
{
outfile << id_num[(*id_groups[i])[j]] << " ";
}
outfile << "\n";
delete id_groups[i];
id_groups[i] = NULL;
}
outfile << endl;
outfile << "// Number of Cubic Periodic Master Nodes:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< n8 << "\n" \
<< "\n" \
<< "// MasterNodeID, 7-SlaveNodeID's, TranslCodes:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<id_groups.Size(); i++)
{
if(!id_groups[i] || id_groups[i]->Size() != 8)
continue;
for(int j=0; j<id_groups[i]->Size(); j++)
outfile << nodenum[(*id_groups[i])[j]] << " ";
for(int j=1; j<id_groups[i]->Size(); j++)
outfile << id_num[(*id_groups[i])[j]] << " ";
outfile << "\n";
delete id_groups[i];
id_groups[i] = NULL;
}
outfile << endl;
outfile << "// EdgeID, NodeID0, NodeID1, Type (0=Reg 1=PMaster 2=PSlave 3=CPMaster 4=CPSlave), "<<uidpid<<":\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
ARRAY< ARRAY<int>* > vertex_to_edge(mesh.GetNP()+1);
for(int i=0; i<=mesh.GetNP(); i++)
vertex_to_edge[i] = new ARRAY<int>;
ARRAY< ARRAY<int,PointIndex::BASE>* > idmaps_edge(idmaps.Size());
for(int i=0; i<idmaps_edge.Size(); i++)
{
idmaps_edge[i] = new ARRAY<int,PointIndex::BASE>(numedges);
(*idmaps_edge[i]) = 0;
}
ARRAY<int> possible;
for(int i=0; i<edge2node.Size(); i++)
{
const INDEX_2 & v = edge2node[i];
for(int j=0; j<idmaps.Size(); j++)
{
INDEX_2 vid((*idmaps[j])[v[0]], (*idmaps[j])[v[1]]);
if(vid[0] != 0 && vid[0] != v[0] && vid[1] != 0 && vid[1] != v[1])
{
Intersection(*vertex_to_edge[vid[0]],*vertex_to_edge[vid[1]],possible);
if(possible.Size() == 1)
{
(*idmaps_edge[j])[possible[0]] = i+1;
(*idmaps_edge[j])[i+1] = possible[0];
}
else if(possible.Size() > 0)
{
cerr << "ERROR: too many possible edge identifications" << endl;
(*testout) << "ERROR: too many possible edge identifications" << endl
<< "*vertex_to_edge["<<vid[0]<<"] " << *vertex_to_edge[vid[0]] << endl
<< "*vertex_to_edge["<<vid[1]<<"] " << *vertex_to_edge[vid[1]] << endl
<< "possible " << possible << endl;
}
}
}
vertex_to_edge[v[0]]->Append(i+1);
vertex_to_edge[v[1]]->Append(i+1);
}
for(int i=0; i<vertex_to_edge.Size(); i++)
delete vertex_to_edge[i];
id_groups.SetSize(0);
id_num.SetSize(numedges+1);
id_num = 0;
id_type.SetSize(numedges+1);
id_type = 0;
n2 = n4 = n8 = 0;
for(int i=1; i<=edge2node.Size(); i++)
{
if(id_num[i] != 0)
continue;
ARRAY<int> group;
group.Append(i);
for(int j=0; j<idmaps_edge.Size(); j++)
{
startsize = group.Size();
for(int k=0; k<startsize; k++)
{
int id = (*idmaps_edge[j])[group[k]];
if(id != 0 && !group.Contains(id))
{
group.Append(id);
id_num[id] = j+1+id_num[group[k]];
}
}
}
if(group.Size() > 1)
{
id_num[i] = 1;
id_groups.Append(new ARRAY<int>(group));
if(group.Size() == 2)
{
id_type[i] = 1;
id_type[group[1]] = 2;
n2++;
}
else if(group.Size() == 4)
{
id_type[i] = 3;
for(int j=1; j<group.Size(); j++)
id_type[group[j]] = 4;
n4++;
}
else
{
cerr << "ERROR: edge identification group size = " << group.Size() << endl;
(*testout) << "edge group " << group << endl;
for(int j=0; j<idmaps_edge.Size(); j++)
{
(*testout) << "edge id map " << j << endl << *idmaps_edge[j] << endl;
}
}
}
}
for(int i=1; i<=edge2node.Size(); i++)
{
if(id_num[i] != 0)
continue;
ARRAY<int> group;
group.Append(i);
for(int j=0; j<idmaps_edge.Size(); j++)
{
startsize = group.Size();
for(int k=0; k<startsize; k++)
{
int id = (*idmaps_edge[j])[group[k]];
if(id != 0 && !group.Contains(id))
{
group.Append(id);
id_num[id] = j+1+id_num[group[k]];
}
}
}
if(group.Size() > 1)
{
id_num[i] = 1;
id_groups.Append(new ARRAY<int>(group));
if(group.Size() == 2)
{
id_type[i] = 1;
id_type[group[1]] = 2;
n2++;
}
else if(group.Size() == 4)
{
id_type[i] = 3;
for(int j=1; j<group.Size(); j++)
id_type[group[j]] = 4;
n4++;
}
else
{
cerr << "ERROR: edge identification group size = " << group.Size() << endl;
(*testout) << "edge group " << group << endl;
for(int j=0; j<idmaps_edge.Size(); j++)
{
(*testout) << "edge id map " << j << endl << *idmaps_edge[j] << endl;
}
}
}
}
for(int i=0; i<edge2node.Size(); i++)
outfile << i+1 << " " << nodenum[edge2node[i][0]] << " " << nodenum[edge2node[i][1]]
<< " " << id_type[i+1] << " " << edge_ids[i] << "\n";
outfile << endl;
outfile << "// Number of Periodic Master Edges:\n"\
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n"\
<< n2 << "\n" \
<< "\n"\
<< "// MasterEdgeID, SlaveEdgeID, TranslCode (1=dS1 2=dS2 3=dS1+dS2):\n"\
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<id_groups.Size(); i++)
{
if(id_groups[i]->Size() != 2)
continue;
for(int j=0; j<id_groups[i]->Size(); j++)
outfile << (*id_groups[i])[j] << " ";
for(int j=1; j<id_groups[i]->Size(); j++)
outfile << id_num[(*id_groups[i])[j]] << " ";
outfile << "\n";
delete id_groups[i];
id_groups[i] = NULL;
}
outfile << endl;
outfile << "// Number of Corner Periodic Master Edges:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n"\
<< n4 << "\n" \
<< "\n"\
<< "// MasterEdgeID, 3 SlaveEdgeID's, 3 TranslCode (1=dS1 2=dS2 3=dS1+dS2):\n"\
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<id_groups.Size(); i++)
{
if(!id_groups[i] || id_groups[i]->Size() != 4)
continue;
for(int j=0; j<id_groups[i]->Size(); j++)
outfile << (*id_groups[i])[j] << " ";
for(int j=1; j<id_groups[i]->Size(); j++)
outfile << id_num[(*id_groups[i])[j]] << " ";
outfile << "\n";
delete id_groups[i];
id_groups[i] = NULL;
}
outfile << endl;
outfile << "// FaceID, EdgeID0, EdgeID1, EdgeID2, FaceType (0=Reg 1=PMaster 2=PSlave), "<<uidpid<<":\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
ARRAY< ARRAY<int>* > edge_to_face(numedges+1);
for(int i=0; i<edge_to_face.Size(); i++)
edge_to_face[i] = new ARRAY<int>;
for(int i=0; i<idmaps.Size(); i++)
{
idmaps[i]->SetSize(numfaces);
(*idmaps[i]) = 0;
}
for(int i=0; i<face2edge.Size(); i++)
{
for(int j=0; j<idmaps_edge.Size(); j++)
{
int e1id,e2id,e3id;
e1id = (*idmaps_edge[j])[abs(face2edge[i][0])];
e2id = (*idmaps_edge[j])[abs(face2edge[i][1])];
e3id = (*idmaps_edge[j])[abs(face2edge[i][2])];
if(e1id != 0 && e1id != abs(face2edge[i][0]) &&
e2id != 0 && e2id != abs(face2edge[i][1]) &&
e3id != 0 && e3id != abs(face2edge[i][2]))
{
Intersection(*edge_to_face[e1id],*edge_to_face[e2id],*edge_to_face[e3id],possible);
if(possible.Size() == 1)
{
(*idmaps[j])[possible[0]] = i+1;
(*idmaps[j])[i+1] = possible[0];
}
else if(possible.Size() > 0)
cerr << "ERROR: too many possible face identifications" << endl;
}
}
edge_to_face[abs(face2edge[i][0])]->Append(i+1);
edge_to_face[abs(face2edge[i][1])]->Append(i+1);
edge_to_face[abs(face2edge[i][2])]->Append(i+1);
}
for(int i=0; i<edge_to_face.Size(); i++)
delete edge_to_face[i];
for(int i=0; i<idmaps_edge.Size(); i++)
delete idmaps_edge[i];
id_groups.SetSize(0);
id_num.SetSize(numfaces+1);
id_num = 0;
n2 = n4 = n8 = 0;
for(int i=1; i<=numfaces; i++)
{
if(id_num[i] != 0)
continue;
ARRAY<int> group;
group.Append(i);
for(int j=0; j<idmaps.Size(); j++)
{
startsize = group.Size();
for(int k=0; k<startsize; k++)
{
int id = (*idmaps[j])[group[k]];
if(id != 0 && !group.Contains(id))
{
group.Append(id);
id_num[id] = j+1+id_num[group[k]];
}
}
}
if(group.Size() > 1)
{
id_num[i] = -1;
id_groups.Append(new ARRAY<int>(group));
if(group.Size() == 2)
n2++;
else
cerr << "ERROR: face identification group size = " << group.Size() << endl;
}
}
for(int i=0; i<idmaps.Size(); i++)
delete idmaps[i];
for(int i=0; i<face2edge.Size(); i++)
{
outfile << i+1 << " ";
for(int j=0; j<3; j++)
outfile << face2edge[i][j] << " ";
if(id_num[i+1] == 0)
outfile << 0;
else if(id_num[i+1] == -1)
outfile << 1;
else
outfile << 2;
outfile << " " << face_ids[i] <<"\n";
}
outfile << endl;
outfile << "// Number of Periodic Master Faces:\n"\
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n"\
<< n2 << "\n" \
<< "\n"\
<< "// MasterFaceID, SlaveFaceID, TranslCode (1=dS1 2=dS2):\n"\
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<id_groups.Size(); i++)
{
if(id_groups[i]->Size() != 2)
continue;
for(int j=0; j<id_groups[i]->Size(); j++)
outfile << (*id_groups[i])[j] << " ";
for(int j=1; j<id_groups[i]->Size(); j++)
outfile << id_num[(*id_groups[i])[j]] << " ";
outfile << "\n";
delete id_groups[i];
}
outfile << endl;
outfile << "// ElemID, FaceID0, FaceID1, FaceID2, FaceID3, "<<uidpid<<":\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(ElementIndex i=0; i<mesh.GetNE(); i++)
{
if(elnum[i] >= 0)
{
outfile << elnum[i] << " ";
for(int j=0; j<4; j++)
outfile << element2face[elnum[i]-1][j] << " ";
outfile << mesh[i].GetIndex() << "\n";
}
}
outfile << endl;
outfile << "// ElemID, NodeID0, NodeID1, NodeID2, NodeID3:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(ElementIndex i=0; i<mesh.GetNE(); i++)
{
if(elnum[i] >= 0)
outfile << elnum[i] << " "
<< nodenum[mesh[i][1]] << " " << nodenum[mesh[i][0]] << " " << nodenum[mesh[i][2]] << " " << nodenum[mesh[i][3]] << "\n";
}
outfile << endl;
outfile << "// Physical Object counts (#Obj3D,#Obj2D,#Obj1D,#Obj0D):\n"
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n"
<< " "<< numObj3D << " " << numObj2D << " " << numObj1D << " " << numObj0D << "\n" \
<< "\n" \
<< "// Number of Ports (Ports are a subset of Object2D list):\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n" \
<< numports << "\n" \
<< endl;
ARRAY< ARRAY<int> * > groups;
int maxg = -1;
for(int i = 0; i<uid_to_group_3D.Size(); i++)
if(uid_to_group_3D[i] > maxg)
maxg = uid_to_group_3D[i];
for(int i = 0; i<uid_to_group_2D.Size(); i++)
if(uid_to_group_2D[i] > maxg)
maxg = uid_to_group_2D[i];
for(int i = 0; i<uid_to_group_1D.Size(); i++)
if(uid_to_group_1D[i] > maxg)
maxg = uid_to_group_1D[i];
for(int i = 0; i<uid_to_group_0D.Size(); i++)
if(uid_to_group_0D[i] > maxg)
maxg = uid_to_group_0D[i];
groups.SetSize(maxg+1);
for(int i=0; i<groups.Size(); i++)
groups[i] = new ARRAY<int>;
for(ElementIndex i=0; i<mesh.GetNE(); i++)
if(uid_to_group_3D[mesh[i].GetIndex()] >= 0)
groups[uid_to_group_3D[mesh[i].GetIndex()]]->Append(i+1);
outfile << "// Object3D GroupID, #Elems <immediately followed by> ElemID List:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<numObj3D; i++)
{
outfile << i << " " << groups[i]->Size() << "\n";
for(int j=0; j<groups[i]->Size(); j++)
outfile << (*groups[i])[j] << "\n";
}
for(int i=0; i<groups.Size(); i++)
groups[i]->SetSize(0);
for(int i=0; i<face_ids.Size(); i++)
if(uid_to_group_2D[face_ids[i]] >= 0)
groups[uid_to_group_2D[face_ids[i]]]->Append(i+1);
outfile << "// Object2D GroupID, #Faces <immediately followed by> FaceID List:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<numObj2D; i++)
{
outfile << i << " " << groups[i]->Size() << "\n";
for(int j=0; j<groups[i]->Size(); j++)
{
outfile << (*groups[i])[j];
if(ports.Contains(face_ids[(*groups[i])[j]-1]))
outfile << " P";
outfile << "\n";
}
}
outfile << endl;
for(int i=0; i<groups.Size(); i++)
groups[i]->SetSize(0);
for(int i=0; i<edge_ids.Size(); i++)
if(uid_to_group_1D[edge_ids[i]] >= 0)
groups[uid_to_group_1D[edge_ids[i]]]->Append(i+1);
outfile << "// Object1D GroupID, #Edges <immediately followed by> EdgeID List:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<numObj1D; i++)
{
outfile << i << " " << groups[i]->Size() << "\n";
for(int j=0; j<groups[i]->Size(); j++)
outfile << (*groups[i])[j] << "\n";
}
outfile << endl;
for(int i=0; i<groups.Size(); i++)
groups[i]->SetSize(0);
for(PointIndex i=PointIndex::BASE; i<mesh.GetNP()+PointIndex::BASE; i++)
{
if(i-PointIndex::BASE < point_ids.Size())
{
if(uid_to_group_0D[point_ids[i]] >= 0)
groups[uid_to_group_0D[point_ids[i]]]->Append(i+1-PointIndex::BASE);
}
else
groups[uid_to_group_0D[0]]->Append(i+1-PointIndex::BASE);
}
outfile << "// Object0D GroupID, #Nodes <immediately followed by> NodeID List:\n" \
<< "// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
for(int i=0; i<numObj0D; i++)
{
outfile << i << " " << groups[i]->Size() << "\n";
for(int j=0; j<groups[i]->Size(); j++)
outfile << (*groups[i])[j] << "\n";
}
outfile << endl;
for(int i=0; i<groups.Size(); i++)
delete groups[i];
outfile.close();
cout << ".tet export done" << endl;
}
void ClearILimit() {
ilimit->SetSize(0);
}
void LocalH ::
FindInnerBoxesRec2 (GradingBox * box,
class AdFront3 * adfront,
ARRAY<Box3d> & faceboxes,
ARRAY<int> & faceinds, int nfinbox)
{
if (!box) return;
int i, j;
GradingBox * father = box -> father;
Point3d c(box->xmid[0], box->xmid[1], box->xmid[2]);
Vec3d v(box->h2, box->h2, box->h2);
Box3d boxc(c-v, c+v);
Point3d fc(father->xmid[0], father->xmid[1], father->xmid[2]);
Vec3d fv(father->h2, father->h2, father->h2);
Box3d fboxc(fc-fv, fc+fv);
Box3d boxcfc(c,fc);
static ARRAY<int> faceused;
static ARRAY<int> faceused2;
static ARRAY<int> facenotused;
faceused.SetSize(0);
facenotused.SetSize(0);
faceused2.SetSize(0);
for (j = 1; j <= nfinbox; j++)
{
// adfront->GetFaceBoundingBox (faceinds.Get(j), facebox);
const Box3d & facebox = faceboxes.Get(faceinds.Get(j));
if (boxc.Intersect (facebox))
faceused.Append(faceinds.Get(j));
else
facenotused.Append(faceinds.Get(j));
if (boxcfc.Intersect (facebox))
faceused2.Append (faceinds.Get(j));
}
for (j = 1; j <= faceused.Size(); j++)
faceinds.Elem(j) = faceused.Get(j);
for (j = 1; j <= facenotused.Size(); j++)
faceinds.Elem(j+faceused.Size()) = facenotused.Get(j);
if (!father->flags.cutboundary)
{
box->flags.isinner = father->flags.isinner;
box->flags.pinner = father->flags.pinner;
}
else
{
Point3d cf(father->xmid[0], father->xmid[1], father->xmid[2]);
if (father->flags.isinner)
box->flags.pinner = 1;
else
{
if (adfront->SameSide (c, cf, &faceused2))
box->flags.pinner = father->flags.pinner;
else
box->flags.pinner = 1 - father->flags.pinner;
}
if (box->flags.cutboundary)
box->flags.isinner = 0;
else
box->flags.isinner = box->flags.pinner;
}
int nf = faceused.Size();
for (i = 0; i < 8; i++)
FindInnerBoxesRec2 (box->childs[i], adfront, faceboxes, faceinds, nf);
}
void ClearOLimit() {
olimit->SetSize(0);
}
void MeshOptimize2d :: GenericImprove (Mesh & mesh)
{
if (!faceindex)
{
if (writestatus)
PrintMessage (3, "Generic Improve");
for (faceindex = 1; faceindex <= mesh.GetNFD(); faceindex++)
GenericImprove (mesh);
faceindex = 0;
}
// int j, k, l, ri;
int np = mesh.GetNP();
int ne = mesh.GetNSE();
// SurfaceElementIndex sei;
// for (SurfaceElementIndex sei = 0; sei < ne; sei++)
// {
// const Element2d & el = mesh[sei];
// (*testout) << "element " << sei << ": " <<flush;
// for(int j=0; j<el.GetNP(); j++)
// (*testout) << el[j] << " " << flush;
// (*testout) << "IsDeleted() " << el.IsDeleted()<< endl;
// }
bool ok;
int olddef, newdef;
ARRAY<ImprovementRule*> rules;
ARRAY<SurfaceElementIndex> elmap;
ARRAY<int> elrot;
ARRAY<PointIndex> pmap;
ARRAY<PointGeomInfo> pgi;
int surfnr = mesh.GetFaceDescriptor (faceindex).SurfNr();
ImprovementRule * r1;
// 2 triangles to quad
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3));
r1->oldels.Append (Element2d (3, 2, 4));
r1->newels.Append (Element2d (1, 2, 4, 3));
r1->deledges.Append (INDEX_2 (2,3));
r1->onp = 4;
r1->bonus = 2;
rules.Append (r1);
// 2 quad to 1 quad
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (4, 3, 2, 5));
r1->newels.Append (Element2d (1, 2, 5, 4));
r1->deledges.Append (INDEX_2 (2, 3));
r1->deledges.Append (INDEX_2 (3, 4));
r1->onp = 5;
r1->bonus = 0;
rules.Append (r1);
// swap quads
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (3, 2, 5, 6));
r1->newels.Append (Element2d (1, 6, 3, 4));
r1->newels.Append (Element2d (1, 2, 5, 6));
r1->deledges.Append (INDEX_2 (2, 3));
r1->onp = 6;
r1->bonus = 0;
rules.Append (r1);
// three quads to 2
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (2, 5, 6, 3));
r1->oldels.Append (Element2d (3, 6, 7, 4));
r1->newels.Append (Element2d (1, 2, 5, 4));
r1->newels.Append (Element2d (4, 5, 6, 7));
r1->deledges.Append (INDEX_2 (2, 3));
r1->deledges.Append (INDEX_2 (3, 4));
r1->deledges.Append (INDEX_2 (3, 6));
r1->onp = 7;
r1->bonus = -1;
rules.Append (r1);
// quad + 2 connected trigs to quad
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (2, 5, 3));
r1->oldels.Append (Element2d (3, 5, 4));
r1->newels.Append (Element2d (1, 2, 5, 4));
r1->deledges.Append (INDEX_2 (2, 3));
r1->deledges.Append (INDEX_2 (3, 4));
r1->deledges.Append (INDEX_2 (3, 5));
r1->onp = 5;
r1->bonus = 0;
rules.Append (r1);
// quad + 2 non-connected trigs to quad (a and b)
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (2, 6, 3));
r1->oldels.Append (Element2d (1, 4, 5));
r1->newels.Append (Element2d (1, 3, 4, 5));
r1->newels.Append (Element2d (1, 2, 6, 3));
r1->deledges.Append (INDEX_2 (1, 4));
r1->deledges.Append (INDEX_2 (2, 3));
r1->onp = 6;
r1->bonus = 0;
rules.Append (r1);
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (2, 6, 3));
r1->oldels.Append (Element2d (1, 4, 5));
r1->newels.Append (Element2d (1, 2, 4, 5));
r1->newels.Append (Element2d (4, 2, 6, 3));
r1->deledges.Append (INDEX_2 (1, 4));
r1->deledges.Append (INDEX_2 (2, 3));
r1->onp = 6;
r1->bonus = 0;
rules.Append (r1);
// two quad + trig -> one quad + trig
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (2, 5, 6, 3));
r1->oldels.Append (Element2d (4, 3, 6));
r1->newels.Append (Element2d (1, 2, 6, 4));
r1->newels.Append (Element2d (2, 5, 6));
r1->deledges.Append (INDEX_2 (2, 3));
r1->deledges.Append (INDEX_2 (3, 4));
r1->deledges.Append (INDEX_2 (3, 6));
r1->onp = 6;
r1->bonus = -1;
rules.Append (r1);
// swap quad + trig (a and b)
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (2, 5, 3));
r1->newels.Append (Element2d (2, 5, 3, 4));
r1->newels.Append (Element2d (1, 2, 4));
r1->deledges.Append (INDEX_2 (2, 3));
r1->onp = 5;
r1->bonus = 0;
rules.Append (r1);
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (2, 5, 3));
r1->newels.Append (Element2d (1, 2, 5, 3));
r1->newels.Append (Element2d (1, 3, 4));
r1->deledges.Append (INDEX_2 (2, 3));
r1->onp = 5;
r1->bonus = 0;
rules.Append (r1);
// 2 quads to quad + 2 trigs
r1 = new ImprovementRule;
r1->oldels.Append (Element2d (1, 2, 3, 4));
r1->oldels.Append (Element2d (3, 2, 5, 6));
r1->newels.Append (Element2d (1, 5, 6, 4));
r1->newels.Append (Element2d (1, 2, 5));
r1->newels.Append (Element2d (4, 6, 3));
r1->deledges.Append (INDEX_2 (2, 3));
r1->onp = 6;
r1->bonus = 0;
// rules.Append (r1);
ARRAY<int> mapped(rules.Size());
ARRAY<int> used(rules.Size());
used = 0;
mapped = 0;
for (int ri = 0; ri < rules.Size(); ri++)
{
ImprovementRule & rule = *rules[ri];
rule.incelsonnode.SetSize (rule.onp);
rule.reused.SetSize (rule.onp);
for (int j = 1; j <= rule.onp; j++)
{
rule.incelsonnode.Elem(j) = 0;
rule.reused.Elem(j) = 0;
}
for (int j = 1; j <= rule.oldels.Size(); j++)
{
const Element2d & el = rule.oldels.Elem(j);
for (int k = 1; k <= el.GetNP(); k++)
rule.incelsonnode.Elem(el.PNum(k))--;
}
for (int j = 1; j <= rule.newels.Size(); j++)
{
const Element2d & el = rule.newels.Elem(j);
for (int k = 1; k <= el.GetNP(); k++)
{
rule.incelsonnode.Elem(el.PNum(k))++;
rule.reused.Elem(el.PNum(k)) = 1;
}
}
}
TABLE<int,PointIndex::BASE> elonnode(np);
ARRAY<int,PointIndex::BASE> nelonnode(np);
TABLE<SurfaceElementIndex> nbels(ne);
nelonnode = -4;
for (SurfaceElementIndex sei = 0; sei < ne; sei++)
{
const Element2d & el = mesh[sei];
if (el.GetIndex() == faceindex && !el.IsDeleted())
{
for (int j = 0; j < el.GetNP(); j++)
elonnode.Add (el[j], sei);
}
if(!el.IsDeleted())
{
for (int j = 0; j < el.GetNP(); j++)
nelonnode[el[j]]++;
}
}
for (SurfaceElementIndex sei = 0; sei < ne; sei++)
{
const Element2d & el = mesh[sei];
if (el.GetIndex() == faceindex && !el.IsDeleted())
{
for (int j = 0; j < el.GetNP(); j++)
{
for (int k = 0; k < elonnode[el[j]].Size(); k++)
{
int nbel = elonnode[el[j]] [k];
bool inuse = false;
for (int l = 0; l < nbels[sei].Size(); l++)
if (nbels[sei][l] == nbel)
inuse = true;
if (!inuse)
nbels.Add (sei, nbel);
}
}
}
}
for (int ri = 0; ri < rules.Size(); ri++)
{
const ImprovementRule & rule = *rules[ri];
elmap.SetSize (rule.oldels.Size());
elrot.SetSize (rule.oldels.Size());
pmap.SetSize (rule.onp);
pgi.SetSize (rule.onp);
for (SurfaceElementIndex sei = 0; sei < ne; sei++)
{
if (multithread.terminate)
break;
if (mesh[sei].IsDeleted()) continue;
elmap[0] = sei;
FlatArray<SurfaceElementIndex> neighbours = nbels[sei];
for (elrot[0] = 0; elrot[0] < mesh[sei].GetNP(); elrot[0]++)
{
const Element2d & el0 = mesh[sei];
const Element2d & rel0 = rule.oldels[0];
if (el0.GetIndex() != faceindex) continue;
if (el0.IsDeleted()) continue;
if (el0.GetNP() != rel0.GetNP()) continue;
pmap = -1;
for (int k = 0; k < el0.GetNP(); k++)
{
pmap.Elem(rel0[k]) = el0.PNumMod(k+elrot[0]+1);
pgi.Elem(rel0[k]) = el0.GeomInfoPiMod(k+elrot[0]+1);
}
ok = 1;
for (int i = 1; i < elmap.Size(); i++)
{
// try to find a mapping for reference-element i
const Element2d & rel = rule.oldels[i];
bool possible = 0;
for (elmap[i] = 0; elmap[i] < neighbours.Size(); elmap[i]++)
{
const Element2d & el = mesh[neighbours[elmap[i]]];
if (el.IsDeleted()) continue;
if (el.GetNP() != rel.GetNP()) continue;
for (elrot[i] = 0; elrot[i] < rel.GetNP(); elrot[i]++)
{
possible = 1;
for (int k = 0; k < rel.GetNP(); k++)
if (pmap.Elem(rel[k]) != -1 &&
pmap.Elem(rel[k]) != el.PNumMod (k+elrot[i]+1))
possible = 0;
if (possible)
{
for (int k = 0; k < el.GetNP(); k++)
{
pmap.Elem(rel[k]) = el.PNumMod(k+elrot[i]+1);
pgi.Elem(rel[k]) = el.GeomInfoPiMod(k+elrot[i]+1);
}
break;
}
}
if (possible) break;
}
if (!possible)
{
ok = 0;
break;
}
elmap[i] = neighbours[elmap[i]];
}
for(int i=0; ok && i<rule.deledges.Size(); i++)
{
ok = !mesh.IsSegment(pmap.Elem(rule.deledges[i].I1()),
pmap.Elem(rule.deledges[i].I2()));
}
if (!ok) continue;
mapped[ri]++;
olddef = 0;
for (int j = 1; j <= pmap.Size(); j++)
olddef += sqr (nelonnode[pmap.Get(j)]);
olddef += rule.bonus;
newdef = 0;
for (int j = 1; j <= pmap.Size(); j++)
if (rule.reused.Get(j))
newdef += sqr (nelonnode[pmap.Get(j)] +
rule.incelsonnode.Get(j));
if (newdef > olddef)
continue;
// calc metric badness
double bad1 = 0, bad2 = 0;
Vec<3> n;
SelectSurfaceOfPoint (mesh.Point(pmap.Get(1)), pgi.Get(1));
GetNormalVector (surfnr, mesh.Point(pmap.Get(1)), pgi.Elem(1), n);
for (int j = 1; j <= rule.oldels.Size(); j++)
bad1 += mesh.SurfaceElement(elmap.Get(j)).CalcJacobianBadness (mesh.Points(), n);
// check new element:
for (int j = 1; j <= rule.newels.Size(); j++)
{
const Element2d & rnel = rule.newels.Get(j);
Element2d nel(rnel.GetNP());
for (int k = 1; k <= rnel.GetNP(); k++)
nel.PNum(k) = pmap.Get(rnel.PNum(k));
bad2 += nel.CalcJacobianBadness (mesh.Points(), n);
}
if (bad2 > 1e3) continue;
if (newdef == olddef && bad2 > bad1) continue;
// generate new element:
for (int j = 1; j <= rule.newels.Size(); j++)
{
const Element2d & rnel = rule.newels.Get(j);
Element2d nel(rnel.GetNP());
nel.SetIndex (faceindex);
for (int k = 1; k <= rnel.GetNP(); k++)
{
nel.PNum(k) = pmap.Get(rnel.PNum(k));
nel.GeomInfoPi(k) = pgi.Get(rnel.PNum(k));
}
mesh.AddSurfaceElement(nel);
}
for (int j = 0; j < rule.oldels.Size(); j++)
mesh.DeleteSurfaceElement ( elmap[j] );
for (int j = 1; j <= pmap.Size(); j++)
nelonnode[pmap.Get(j)] += rule.incelsonnode.Get(j);
used[ri]++;
}
}
}
mesh.Compress();
for (int ri = 0; ri < rules.Size(); ri++)
{
PrintMessage (5, "rule ", ri+1, " ",
mapped[ri], "/", used[ri], " mapped/used");
}
}
