#ifndef FILE_STLTOOL #define FILE_STLTOOL //#include "gprim/gprim.hh" /**************************************************************************/ /* File: stlgeom.hh */ /* Author: Joachim Schoeberl */ /* Author2: Johannes Gerstmayr */ /* Date: 20. Nov. 99 */ /**************************************************************************/ namespace netgen { // use one normal vector for whole chart extern int usechartnormal; extern int chartdebug; extern int geomsearchtreeon; extern int AddPointIfNotExists(NgArray& ap, const Point3d& p, double eps = 1e-8); //get distance from line lp1-lp2 to point p extern double GetDistFromLine(const Point<3>& lp1, const Point<3>& lp2, Point<3>& p); extern double GetDistFromInfiniteLine(const Point<3>& lp1, const Point<3>& lp2, const Point<3>& p); extern void FIOReadInt(istream& ios, int& i); extern void FIOWriteInt(ostream& ios, const int& i); extern void FIOReadDouble(istream& ios, double& i); extern void FIOWriteDouble(ostream& ios, const double& i); extern void FIOReadFloat(istream& ios, float& i); extern void FIOWriteFloat(ostream& ios, const float& i); extern void FIOReadString(istream& ios, char* str, int len); extern void FIOReadStringE(istream& ios, char* str, int len); extern void FIOWriteString(ostream& ios, char* str, int len); typedef NgArray * ArrayINTPTR; class STLGeometry; class STLParameters; // typedef int ChartId class ChartId { int i; public: class t_invalid { public: constexpr t_invalid() = default; }; static constexpr t_invalid INVALID{}; ChartId() { } constexpr ChartId(t_invalid inv) : i(0) { ; } constexpr ChartId(int ai) : i(ai) { } operator int() const { return i; } ChartId operator++ (int) { ChartId hi(*this); i++; return hi; } ChartId & operator++ () { i++; return *this; } }; } namespace ngcore { template<> constexpr netgen::ChartId IndexBASE () { return netgen::ChartId(1); } } namespace netgen { class STLChart { private: STLGeometry * geometry; Array charttrigs; // trigs which only belong to this chart Array outertrigs; // trigs which belong to other charts BoxTree<3,STLTrigId> * searchtree; // ADT containing outer trigs NgArray olimit; //outer limit of outer chart NgArray ilimit; //outer limit of inner chart const STLParameters& stlparam; public: STLChart(STLGeometry * ageometry, const STLParameters& astlparam); ~STLChart(); void AddChartTrig(STLTrigId i); void AddOuterTrig(STLTrigId i); bool IsInWholeChart(int nr) const; STLTrigId GetChartTrig1(int i) const {return charttrigs[i-1];} STLTrigId GetOuterTrig1(int i) const {return outertrigs[i-1];} //get all trigs: STLTrigId GetTrig1(int i) const { if (i <= charttrigs.Size()) {return charttrigs[i-1];} else {return outertrigs[i-charttrigs.Size()-1];} } size_t GetNChartT() const {return charttrigs.Size();} size_t GetNOuterT() const {return outertrigs.Size();} size_t GetNT() const {return charttrigs.Size()+outertrigs.Size(); } void GetTrianglesInBox (const Point3d & pmin, const Point3d & pmax, NgArray & trias) const; void AddOLimit(twoint l) {olimit.Append(l);} void AddILimit(twoint l) {ilimit.Append(l);} void ClearOLimit() {olimit.SetSize(0);} void ClearILimit() {ilimit.SetSize(0);} size_t GetNOLimit() const {return olimit.Size();} size_t GetNILimit() const {return ilimit.Size();} twoint GetOLimit(int i) const {return olimit.Get(i);} twoint GetILimit(int i) const {return ilimit.Get(i);} //move triangles trigs (local chart-trig numbers) to outer chart void MoveToOuterChart(const NgArray& trigs); void DelChartTrigs(const NgArray& trigs); // define local coordinate system, JS: private: Vec<3> normal; Point<3> pref; Vec<3> t1, t2; public: void SetNormal (const Point<3> & apref, const Vec<3> & anormal); const Vec<3> & GetNormal () const { return normal; } Point<2> Project2d (const Point<3> & p3d) const { Vec<3> v = p3d-pref; return Point<2> (t1 * v, t2 * v); } }; class STLBoundarySeg { Point<3> p1, p2, center; Point<2> p2d1, p2d2; Box<2> boundingbox; double rad; STLPointId i1, i2; bool smoothedge; public: STLBoundarySeg () { ; } STLBoundarySeg (STLPointId ai1, STLPointId ai2, const Array,STLPointId> & points, const STLChart * chart) : p1(points[ai1]), p2(points[ai2]), i1(ai1), i2(ai2) { center = ::netgen::Center (p1, p2); rad = Dist (p1, center); p2d1 = chart->Project2d (p1); p2d2 = chart->Project2d (p2); boundingbox.Set (p2d1); boundingbox.Add (p2d2); } int operator== (const STLBoundarySeg & s2) const { return i1 == s2.i1 && i2 == s2.i2; } void Swap (); STLPointId I1() const { return i1; } STLPointId I2() const { return i2; } const Point<3> & P1() const { return p1; } const Point<3> & P2() const { return p2; } const Point<2> & P2D1() const { return p2d1; } const Point<2> & P2D2() const { return p2d2; } const Point<2> & P2DMin() const { return boundingbox.PMin(); } const Point<2> & P2DMax() const { return boundingbox.PMax(); } const Point<3> & Center() const { return center; } const Box<2> & BoundingBox() const { return boundingbox; } double Radius () const { return rad; } void SetSmoothEdge (bool se) { smoothedge = se; } bool IsSmoothEdge () const { return smoothedge; } friend class STLBoundary; }; class STLBoundary { private: STLGeometry * geometry; const STLChart * chart; // NgArray boundary; ClosedHashTable boundary_ht; BoxTree<2,INDEX_2> * searchtree = nullptr; public: STLBoundary(STLGeometry * ageometry); ~STLBoundary() { delete searchtree; } void Clear() { /* boundary.SetSize(0); */ boundary_ht = ClosedHashTable(); } void SetChart (const STLChart * achart) { chart = achart; } //don't check, if already exists! // void AddNewSegment(const STLBoundarySeg & seg) {boundary.Append(seg);}; //check if segment exists // void AddOrDelSegment(const STLBoundarySeg & seg); //addordelsegment for all 3 triangle segments! void AddTriangle(const STLTriangle & t); int NOSegments() {return boundary_ht.UsedElements();}; // const STLBoundarySeg & GetSegment(int i) {return boundary.Get(i);} void BuildSearchTree(); void DeleteSearchTree(); bool TestSeg(const Point<3> & p1, const Point<3> & p2, const Vec<3> & sn, double sinchartangle, int divisions, Array,STLPointId>& points, double eps); bool TestSegChartNV(const Point3d& p1, const Point3d& p2, const Vec3d& sn); }; class STLDoctorParams { public: int drawmeshededges; double geom_tol_fact; double longlinefact; int showexcluded; int selectmode; //0==trig, 1==edge, 2==point, 3==multiedge, 4==line cluster int edgeselectmode; int useexternaledges; int showfaces; int showedgecornerpoints; int showtouchedtrigchart; int conecheck; int spiralcheck; int selecttrig; int nodeofseltrig; int selectwithmouse; int showmarkedtrigs; double dirtytrigfact; double smoothangle; double smoothnormalsweight; int showvicinity; int vicinity; /// STLDoctorParams(); /// void Print (ostream & ost) const; }; DLL_HEADER extern STLDoctorParams stldoctor; // TODO change enable flag to optional parameters class DLL_HEADER STLParameters { public: /// angle for edge detection double yangle = 30.; double contyangle = 20.; //edges continued with contyangle /// angle of geometry edge at which the mesher should set a point double edgecornerangle = 60.; /// angle inside on chart double chartangle = 15.; /// angle for overlapping parts of char double outerchartangle = 70.; /// 0 .. no, 1 .. local, (2 .. global) int usesearchtree = 0; /// double resthatlasfac = 2.; bool resthatlasenable = true; double atlasminh = 0.1; double resthsurfcurvfac = 2.; bool resthsurfcurvenable = false; double resthchartdistfac = 1.2; bool resthchartdistenable = true; double resthcloseedgefac = 1.; bool resthcloseedgeenable = true; double resthedgeanglefac = 1.; bool resthedgeangleenable = false; double resthsurfmeshcurvfac = 1.; bool resthsurfmeshcurvenable = false; double resthlinelengthfac = 0.5; bool resthlinelengthenable = true; /// bool recalc_h_opt = true; /// STLParameters(); /// void Print (ostream & ost) const; }; void STLMeshing (STLGeometry & geom, Mesh & mesh, const MeshingParameters& mparam, const STLParameters& stlpar); int STLSurfaceMeshing (STLGeometry & geom, Mesh & mesh, const MeshingParameters& mparam, const STLParameters& stlpar); void STLSurfaceOptimization (STLGeometry & geom, Mesh & mesh, const MeshingParameters & mparam); } // namespace netgen #endif