mirror of
https://github.com/NGSolve/netgen.git
synced 2024-12-27 14:20:34 +05:00
284 lines
5.5 KiB
C++
284 lines
5.5 KiB
C++
#ifndef FILE_ADFRONT2
|
|
#define FILE_ADFRONT2
|
|
|
|
/**************************************************************************/
|
|
/* File: adfront2.hpp */
|
|
/* Author: Joachim Schoeberl */
|
|
/* Date: 01. Okt. 95 */
|
|
/**************************************************************************/
|
|
|
|
|
|
/**
|
|
|
|
Advancing front class for surfaces
|
|
|
|
*/
|
|
|
|
///
|
|
class FrontPoint2
|
|
{
|
|
/// coordinates
|
|
Point<3> p;
|
|
/// global node index
|
|
PointIndex globalindex;
|
|
/// number of front lines connected to point
|
|
int nlinetopoint;
|
|
/// distance to original boundary
|
|
int frontnr;
|
|
|
|
bool onsurface;
|
|
|
|
public:
|
|
///
|
|
MultiPointGeomInfo * mgi;
|
|
|
|
///
|
|
FrontPoint2 ()
|
|
{
|
|
globalindex = -1;
|
|
nlinetopoint = 0;
|
|
frontnr = INT_MAX-10; // attention: overflow on calculating INT_MAX + 1
|
|
mgi = NULL;
|
|
onsurface = true;
|
|
}
|
|
|
|
///
|
|
FrontPoint2 (const Point<3> & ap, PointIndex agi,
|
|
MultiPointGeomInfo * amgi, bool aonsurface = true);
|
|
///
|
|
~FrontPoint2 () { ; }
|
|
|
|
///
|
|
const Point<3> & P () const { return p; }
|
|
///
|
|
operator const Point<3> & () const { return p; }
|
|
///
|
|
PointIndex GlobalIndex () const { return globalindex; }
|
|
|
|
///
|
|
void AddLine () { nlinetopoint++; }
|
|
///
|
|
void RemoveLine ()
|
|
{
|
|
nlinetopoint--;
|
|
if (nlinetopoint == 0)
|
|
nlinetopoint = -1;
|
|
}
|
|
|
|
///
|
|
bool Valid () const
|
|
{ return nlinetopoint >= 0; }
|
|
|
|
///
|
|
bool OnSurface() const
|
|
{ return onsurface; }
|
|
|
|
///
|
|
void DecFrontNr (int afrontnr)
|
|
{
|
|
if (frontnr > afrontnr) frontnr = afrontnr;
|
|
}
|
|
|
|
///
|
|
int FrontNr () const { return frontnr; }
|
|
};
|
|
|
|
|
|
///
|
|
class FrontLine
|
|
{
|
|
private:
|
|
/// Point Indizes
|
|
INDEX_2 l;
|
|
/// quality class
|
|
int lineclass;
|
|
/// geometry specific data
|
|
PointGeomInfo geominfo[2];
|
|
public:
|
|
|
|
FrontLine ()
|
|
{
|
|
lineclass = 1;
|
|
}
|
|
|
|
///
|
|
FrontLine (const INDEX_2 & al)
|
|
{
|
|
l = al;
|
|
lineclass = 1;
|
|
}
|
|
|
|
|
|
///
|
|
const INDEX_2 & L () const
|
|
{
|
|
return l;
|
|
}
|
|
|
|
///
|
|
int LineClass() const
|
|
{
|
|
return lineclass;
|
|
}
|
|
|
|
///
|
|
void IncrementClass ()
|
|
{
|
|
lineclass++;
|
|
}
|
|
///
|
|
void ResetClass ()
|
|
{
|
|
lineclass = 1;
|
|
}
|
|
|
|
///
|
|
bool Valid () const
|
|
{
|
|
return l.I1() != -1;
|
|
}
|
|
///
|
|
void Invalidate ()
|
|
{
|
|
l.I1() = -1;
|
|
l.I2() = -1;
|
|
lineclass = 1000;
|
|
}
|
|
|
|
void SetGeomInfo (const PointGeomInfo & gi1, const PointGeomInfo & gi2)
|
|
{
|
|
geominfo[0] = gi1;
|
|
geominfo[1] = gi2;
|
|
}
|
|
|
|
const PointGeomInfo * GetGeomInfo () const
|
|
{ return geominfo; }
|
|
|
|
const PointGeomInfo & GetGeomInfo (int endp) const
|
|
{ return geominfo[endp-1]; }
|
|
|
|
friend class AdFront2;
|
|
};
|
|
|
|
|
|
class AdFront2
|
|
{
|
|
|
|
///
|
|
Array<FrontPoint2> points; /// front points
|
|
Array<FrontLine> lines; /// front lines
|
|
|
|
Box3d boundingbox;
|
|
Box3dTree linesearchtree; /// search tree for lines
|
|
Point3dTree pointsearchtree; /// search tree for points
|
|
Point3dTree cpointsearchtree; /// search tree for cone points (not used ???)
|
|
|
|
Array<int> delpointl; /// list of deleted front points
|
|
Array<int> dellinel; /// list of deleted front lines
|
|
|
|
int nfl; /// number of front lines;
|
|
INDEX_2_HASHTABLE<int> * allflines; /// all front lines ever have been
|
|
|
|
Array<int> invpindex;
|
|
|
|
int minval;
|
|
int starti;
|
|
|
|
public:
|
|
///
|
|
// AdFront2 ();
|
|
AdFront2 (const Box3d & aboundingbox);
|
|
///
|
|
~AdFront2 ();
|
|
|
|
///
|
|
// void GetPoints (Array<Point<3> > & apoints) const;
|
|
///
|
|
void Print (ostream & ost) const;
|
|
|
|
///
|
|
bool Empty () const
|
|
{
|
|
return nfl == 0;
|
|
}
|
|
///
|
|
int GetNFL () const { return nfl; }
|
|
|
|
const FrontLine & GetLine (int nr) { return lines[nr]; }
|
|
const FrontPoint2 & GetPoint (int nr) { return points[nr]; }
|
|
|
|
|
|
///
|
|
int SelectBaseLine (Point<3> & p1, Point<3> & p2,
|
|
const PointGeomInfo *& geominfo1,
|
|
const PointGeomInfo *& geominfo2,
|
|
int & qualclass);
|
|
|
|
///
|
|
int GetLocals (int baseline,
|
|
Array<Point3d> & locpoints,
|
|
Array<MultiPointGeomInfo> & pgeominfo,
|
|
Array<INDEX_2> & loclines, // local index
|
|
Array<int> & pindex,
|
|
Array<int> & lindex,
|
|
double xh);
|
|
|
|
///
|
|
void DeleteLine (int li);
|
|
///
|
|
int AddPoint (const Point<3> & p, PointIndex globind,
|
|
MultiPointGeomInfo * mgi = NULL,
|
|
bool pointonsurface = true);
|
|
///
|
|
int AddLine (int pi1, int pi2,
|
|
const PointGeomInfo & gi1, const PointGeomInfo & gi2);
|
|
///
|
|
int ExistsLine (int gpi1, int gpi2);
|
|
|
|
///
|
|
void IncrementClass (int li)
|
|
{
|
|
lines[li].IncrementClass();
|
|
}
|
|
|
|
///
|
|
void ResetClass (int li)
|
|
{
|
|
lines[li].ResetClass();
|
|
}
|
|
|
|
///
|
|
const PointGeomInfo & GetLineGeomInfo (int li, int lend) const
|
|
{ return lines[li].GetGeomInfo (lend); }
|
|
///
|
|
|
|
PointIndex GetGlobalIndex (int pi) const
|
|
{
|
|
return points[pi].GlobalIndex();
|
|
}
|
|
|
|
|
|
/// is Point p inside Surface (flat geometry only)
|
|
bool Inside (const Point<2> & p) const;
|
|
|
|
bool SameSide (const Point<2> & lp1, const Point<2> & lp2,
|
|
const Array<int> * /* testfaces */ = NULL) const;
|
|
/*
|
|
{
|
|
return Inside (lp1) == Inside (lp2);
|
|
}
|
|
*/
|
|
|
|
///
|
|
void SetStartFront ();
|
|
///
|
|
void PrintOpenSegments (ostream & ost) const;
|
|
};
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|