1 // Copyright (C) 2007-2012 CEA/DEN, EDF R&D, OPEN CASCADE
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
20 // File : StdMeshers_ViscousLayers2D.cxx
21 // Created : 23 Jul 2012
22 // Author : Edward AGAPOV (eap)
24 #include "StdMeshers_ViscousLayers2D.hxx"
26 #include "SMDS_EdgePosition.hxx"
27 #include "SMDS_FaceOfNodes.hxx"
28 #include "SMDS_FacePosition.hxx"
29 #include "SMDS_MeshNode.hxx"
30 #include "SMDS_SetIterator.hxx"
31 #include "SMESHDS_Group.hxx"
32 #include "SMESHDS_Hypothesis.hxx"
33 #include "SMESH_Algo.hxx"
34 #include "SMESH_ComputeError.hxx"
35 #include "SMESH_ControlsDef.hxx"
36 #include "SMESH_Gen.hxx"
37 #include "SMESH_Group.hxx"
38 #include "SMESH_HypoFilter.hxx"
39 #include "SMESH_Mesh.hxx"
40 #include "SMESH_MesherHelper.hxx"
41 #include "SMESH_ProxyMesh.hxx"
42 #include "SMESH_Quadtree.hxx"
43 #include "SMESH_subMesh.hxx"
44 #include "SMESH_subMeshEventListener.hxx"
45 #include "StdMeshers_FaceSide.hxx"
47 #include "utilities.h"
49 #include <BRepAdaptor_Curve.hxx>
50 #include <BRepAdaptor_Curve2d.hxx>
51 #include <BRep_Tool.hxx>
52 #include <Bnd_B2d.hxx>
53 #include <Bnd_B3d.hxx>
55 #include <GCPnts_AbscissaPoint.hxx>
56 #include <Geom2dAdaptor_Curve.hxx>
57 #include <Geom2dInt_GInter.hxx>
58 #include <Geom2d_Circle.hxx>
59 #include <Geom2d_Line.hxx>
60 #include <Geom2d_TrimmedCurve.hxx>
61 #include <GeomAdaptor_Curve.hxx>
62 #include <Geom_Circle.hxx>
63 #include <Geom_Curve.hxx>
64 #include <Geom_Line.hxx>
65 #include <Geom_TrimmedCurve.hxx>
66 #include <IntRes2d_IntersectionPoint.hxx>
67 #include <Precision.hxx>
68 #include <Standard_ErrorHandler.hxx>
69 #include <TColStd_Array1OfReal.hxx>
71 #include <TopExp_Explorer.hxx>
72 #include <TopTools_IndexedMapOfShape.hxx>
73 #include <TopTools_MapOfShape.hxx>
75 #include <TopoDS_Edge.hxx>
76 #include <TopoDS_Face.hxx>
77 #include <TopoDS_Vertex.hxx>
93 //================================================================================
98 //--------------------------------------------------------------------------------
100 * \brief Proxy Mesh of FACE with viscous layers. It's needed only to
101 * redefine newSubmesh().
103 struct _ProxyMeshOfFace : public SMESH_ProxyMesh
105 //---------------------------------------------------
106 // Proxy sub-mesh of an EDGE. It contains nodes in _uvPtStructVec.
107 struct _EdgeSubMesh : public SMESH_ProxyMesh::SubMesh
109 _EdgeSubMesh(int index=0): SubMesh(index) {}
110 //virtual int NbElements() const { return _elements.size()+1; }
111 virtual int NbNodes() const { return Max( 0, _uvPtStructVec.size()-2 ); }
112 void SetUVPtStructVec(UVPtStructVec& vec) { _uvPtStructVec.swap( vec ); }
114 _ProxyMeshOfFace(const SMESH_Mesh& mesh): SMESH_ProxyMesh(mesh) {}
115 _EdgeSubMesh* GetEdgeSubMesh(int ID) { return (_EdgeSubMesh*) getProxySubMesh(ID); }
116 virtual SubMesh* newSubmesh(int index=0) const { return new _EdgeSubMesh(index); }
118 //--------------------------------------------------------------------------------
120 * \brief SMESH_subMeshEventListener used to store _ProxyMeshOfFace, computed
121 * by _ViscousBuilder2D, in a SMESH_subMesh of the FACE.
122 * This is to delete _ProxyMeshOfFace when StdMeshers_ViscousLayers2D
123 * hypothesis is modified
125 struct _ProxyMeshHolder : public SMESH_subMeshEventListener
127 _ProxyMeshHolder( const TopoDS_Face& face,
128 SMESH_ProxyMesh::Ptr& mesh)
129 : SMESH_subMeshEventListener( /*deletable=*/true, Name() )
131 SMESH_subMesh* faceSM = mesh->GetMesh()->GetSubMesh( face );
132 faceSM->SetEventListener( this, new _Data( mesh ), faceSM );
134 // Finds a proxy mesh of face
135 static SMESH_ProxyMesh::Ptr FindProxyMeshOfFace( const TopoDS_Shape& face,
138 SMESH_ProxyMesh::Ptr proxy;
139 SMESH_subMesh* faceSM = mesh.GetSubMesh( face );
140 if ( EventListenerData* ld = faceSM->GetEventListenerData( Name() ))
141 proxy = static_cast< _Data* >( ld )->_mesh;
145 void ProcessEvent(const int event,
147 SMESH_subMesh* subMesh,
148 EventListenerData* data,
149 const SMESH_Hypothesis* /*hyp*/)
151 if ( event == SMESH_subMesh::CLEAN && eventType == SMESH_subMesh::COMPUTE_EVENT)
152 ((_Data*) data)->_mesh.reset();
155 // holder of a proxy mesh
156 struct _Data : public SMESH_subMeshEventListenerData
158 SMESH_ProxyMesh::Ptr _mesh;
159 _Data( SMESH_ProxyMesh::Ptr& mesh )
160 :SMESH_subMeshEventListenerData( /*isDeletable=*/true), _mesh( mesh )
163 // Returns identifier string
164 static const char* Name() { return "VISCOUS_2D::_ProxyMeshHolder"; }
168 //--------------------------------------------------------------------------------
170 * \brief Segment connecting inner ends of two _LayerEdge's.
174 const gp_XY* _uv[2]; // poiter to _LayerEdge::_uvIn
175 int _indexInLine; // position in _PolyLine
178 _Segment(const gp_XY& p1, const gp_XY& p2):_indexInLine(-1) { _uv[0] = &p1; _uv[1] = &p2; }
179 const gp_XY& p1() const { return *_uv[0]; }
180 const gp_XY& p2() const { return *_uv[1]; }
182 //--------------------------------------------------------------------------------
184 * \brief Tree of _Segment's used for a faster search of _Segment's.
186 struct _SegmentTree : public SMESH_Quadtree
188 typedef boost::shared_ptr< _SegmentTree > Ptr;
190 _SegmentTree( const vector< _Segment >& segments );
191 void GetSegmentsNear( const _Segment& seg, vector< const _Segment* >& found );
192 void GetSegmentsNear( const gp_Ax2d& ray, vector< const _Segment* >& found );
195 _SegmentTree* newChild() const { return new _SegmentTree; }
196 void buildChildrenData();
197 Bnd_B2d* buildRootBox();
199 static int maxNbSegInLeaf() { return 5; }
202 const _Segment* _seg;
204 void Set( const _Segment& seg )
207 _iMin[0] = ( seg._uv[1]->X() < seg._uv[0]->X() );
208 _iMin[1] = ( seg._uv[1]->Y() < seg._uv[0]->Y() );
210 bool IsOut( const _Segment& seg ) const;
211 bool IsOut( const gp_Ax2d& ray ) const;
213 vector< _SegBox > _segments;
215 //--------------------------------------------------------------------------------
217 * \brief Edge normal to FACE boundary, connecting a point on EDGE (_uvOut)
218 * and a point of a layer internal boundary (_uvIn)
222 gp_XY _uvOut; // UV on the FACE boundary
223 gp_XY _uvIn; // UV inside the FACE
224 double _length2D; // distance between _uvOut and _uvIn
226 bool _isBlocked;// is more inflation possible or not
228 gp_XY _normal2D; // to pcurve
229 double _len2dTo3dRatio; // to pass 2D <--> 3D
230 gp_Ax2d _ray; // a ray starting at _uvOut
232 vector<gp_XY> _uvRefined; // divisions by layers
234 bool SetNewLength( const double length );
236 //--------------------------------------------------------------------------------
238 * \brief Poly line composed of _Segment's of one EDGE.
239 * It's used to detect intersection of inflated layers by intersecting
244 StdMeshers_FaceSide* _wire;
245 int _edgeInd; // index of my EDGE in _wire
246 bool _advancable; // true if there is a viscous layer on my EDGE
247 bool _isStraight2D;// pcurve type
248 _PolyLine* _leftLine; // lines of neighbour EDGE's
249 _PolyLine* _rightLine;
250 int _firstPntInd; // index in vector<UVPtStruct> of _wire
253 vector< _LayerEdge > _lEdges; /* _lEdges[0] is usually is not treated
254 as it is equal to the last one of the _leftLine */
255 vector< _Segment > _segments; // segments connecting _uvIn's of _lEdges
256 _SegmentTree::Ptr _segTree;
258 vector< _PolyLine* > _reachableLines; // lines able to interfere with my layer
260 vector< const SMDS_MeshNode* > _leftNodes; // nodes built from a left VERTEX
261 vector< const SMDS_MeshNode* > _rightNodes; // nodes built from a right VERTEX
263 typedef vector< _Segment >::iterator TSegIterator;
264 typedef vector< _LayerEdge >::iterator TEdgeIterator;
266 TIDSortedElemSet _newFaces; // faces generated from this line
268 bool IsCommonEdgeShared( const _PolyLine& other );
269 size_t FirstLEdge() const
271 return ( _leftLine->_advancable && _lEdges.size() > 2 ) ? 1 : 0;
273 bool IsAdjacent( const _Segment& seg, const _LayerEdge* LE=0 ) const
275 if ( LE && seg._indexInLine < _lEdges.size() &&
276 ( seg._uv[0] == & LE->_uvIn ||
277 seg._uv[1] == & LE->_uvIn ))
279 return ( & seg == &_leftLine->_segments.back() ||
280 & seg == &_rightLine->_segments[0] );
283 //--------------------------------------------------------------------------------
285 * \brief Intersector of _Segment's
287 struct _SegmentIntersection
289 gp_XY _vec1, _vec2; // Vec( _seg.p1(), _seg.p2() )
290 gp_XY _vec21; // Vec( _seg2.p1(), _seg1.p1() )
291 double _D; // _vec1.Crossed( _vec2 )
292 double _param1, _param2; // intersection param on _seg1 and _seg2
294 bool Compute(const _Segment& seg1, const _Segment& seg2, bool seg2IsRay = false )
296 const double eps = 1e-10;
297 _vec1 = seg1.p2() - seg1.p1();
298 _vec2 = seg2.p2() - seg2.p1();
299 _vec21 = seg1.p1() - seg2.p1();
300 _D = _vec1.Crossed(_vec2);
301 if ( fabs(_D) < std::numeric_limits<double>::min())
303 _param1 = _vec2.Crossed(_vec21) / _D;
304 if (_param1 < -eps || _param1 > 1 + eps )
306 _param2 = _vec1.Crossed(_vec21) / _D;
307 if (_param2 < -eps || ( !seg2IsRay && _param2 > 1 + eps ))
311 bool Compute( const _Segment& seg1, const gp_Ax2d& ray )
313 gp_XY segEnd = ray.Location().XY() + ray.Direction().XY();
314 _Segment seg2( ray.Location().XY(), segEnd );
315 return Compute( seg1, seg2, true );
317 //gp_XY GetPoint() { return _seg1.p1() + _param1 * _vec1; }
319 //--------------------------------------------------------------------------------
321 typedef map< const SMDS_MeshNode*, _LayerEdge*, TIDCompare > TNode2Edge;
323 //--------------------------------------------------------------------------------
325 * \brief Builder of viscous layers
327 class _ViscousBuilder2D
330 _ViscousBuilder2D(SMESH_Mesh& theMesh,
331 const TopoDS_Face& theFace,
332 const StdMeshers_ViscousLayers2D* theHyp);
333 SMESH_ComputeErrorPtr GetError() const { return _error; }
335 SMESH_ProxyMesh::Ptr Compute();
339 bool findEdgesWithLayers();
340 bool makePolyLines();
342 bool fixCollisions();
346 bool toShrinkForAdjacent( const TopoDS_Face& adjFace,
347 const TopoDS_Edge& E,
348 const TopoDS_Vertex& V);
349 void setLenRatio( _LayerEdge& LE, const gp_Pnt& pOut );
350 void setLayerEdgeData( _LayerEdge& lEdge,
352 Handle(Geom2d_Curve)& pcurve,
354 void adjustCommonEdge( _PolyLine& LL, _PolyLine& LR );
355 void calcLayersHeight(const double totalThick,
356 vector<double>& heights);
357 bool removeMeshFaces(const TopoDS_Shape& face);
359 bool error( const string& text );
360 SMESHDS_Mesh* getMeshDS() { return _mesh->GetMeshDS(); }
361 _ProxyMeshOfFace* getProxyMesh();
364 //void makeGroupOfLE();
371 const StdMeshers_ViscousLayers2D* _hyp;
374 SMESH_ProxyMesh::Ptr _proxyMesh;
375 SMESH_ComputeErrorPtr _error;
378 Handle(Geom_Surface) _surface;
379 SMESH_MesherHelper _helper;
380 TSideVector _faceSideVec; // wires (StdMeshers_FaceSide) of _face
381 vector<_PolyLine> _polyLineVec; // fronts to advance
383 double _fPowN; // to compute thickness of layers
384 double _thickness; // required or possible layers thickness
386 // sub-shapes of _face
387 set<TGeomID> _ignoreShapeIds; // ids of EDGEs w/o layers
388 set<TGeomID> _noShrinkVert; // ids of VERTEXes that are extremities
389 // of EDGEs along which _LayerEdge can't be inflated because no viscous layers
390 // defined on neighbour FACEs sharing an EDGE. Nonetheless _LayerEdge's
391 // are inflated along such EDGEs but then such _LayerEdge's are turned into
392 // a node on VERTEX, i.e. all nodes on a _LayerEdge are melded into one node.
396 //================================================================================
398 * \brief Returns StdMeshers_ViscousLayers2D for the FACE
400 const StdMeshers_ViscousLayers2D* findHyp(SMESH_Mesh& theMesh,
401 const TopoDS_Face& theFace)
403 SMESH_HypoFilter hypFilter
404 ( SMESH_HypoFilter::HasName( StdMeshers_ViscousLayers2D::GetHypType() ));
405 const SMESH_Hypothesis * hyp =
406 theMesh.GetHypothesis( theFace, hypFilter, /*ancestors=*/true );
407 return dynamic_cast< const StdMeshers_ViscousLayers2D* > ( hyp );
410 } // namespace VISCOUS_2D
412 //================================================================================
413 // StdMeshers_ViscousLayers hypothesis
415 StdMeshers_ViscousLayers2D::StdMeshers_ViscousLayers2D(int hypId, int studyId, SMESH_Gen* gen)
416 :StdMeshers_ViscousLayers(hypId, studyId, gen)
418 _name = StdMeshers_ViscousLayers2D::GetHypType();
419 _param_algo_dim = -2; // auxiliary hyp used by 2D algos
421 // --------------------------------------------------------------------------------
422 bool StdMeshers_ViscousLayers2D::SetParametersByMesh(const SMESH_Mesh* theMesh,
423 const TopoDS_Shape& theShape)
428 // --------------------------------------------------------------------------------
430 StdMeshers_ViscousLayers2D::Compute(SMESH_Mesh& theMesh,
431 const TopoDS_Face& theFace)
433 SMESH_ProxyMesh::Ptr pm;
435 const StdMeshers_ViscousLayers2D* vlHyp = VISCOUS_2D::findHyp( theMesh, theFace );
438 VISCOUS_2D::_ViscousBuilder2D builder( theMesh, theFace, vlHyp );
439 pm = builder.Compute();
440 SMESH_ComputeErrorPtr error = builder.GetError();
441 if ( error && !error->IsOK() )
442 theMesh.GetSubMesh( theFace )->GetComputeError() = error;
444 pm.reset( new SMESH_ProxyMesh( theMesh ));
445 if ( getenv("ONLY_VL2D"))
450 pm.reset( new SMESH_ProxyMesh( theMesh ));
454 // --------------------------------------------------------------------------------
455 void StdMeshers_ViscousLayers2D::RestoreListeners() const
457 StudyContextStruct* sc = _gen->GetStudyContext( _studyId );
458 std::map < int, SMESH_Mesh * >::iterator i_smesh = sc->mapMesh.begin();
459 for ( ; i_smesh != sc->mapMesh.end(); ++i_smesh )
461 SMESH_Mesh* smesh = i_smesh->second;
463 !smesh->HasShapeToMesh() ||
464 !smesh->GetMeshDS() ||
465 !smesh->GetMeshDS()->IsUsedHypothesis( this ))
468 // set event listeners to EDGE's of FACE where this hyp is used
469 TopoDS_Shape shape = i_smesh->second->GetShapeToMesh();
470 for ( TopExp_Explorer face( shape, TopAbs_FACE); face.More(); face.Next() )
471 if ( SMESH_Algo* algo = _gen->GetAlgo( *smesh, face.Current() ))
473 const std::list <const SMESHDS_Hypothesis *> & usedHyps =
474 algo->GetUsedHypothesis( *smesh, face.Current(), /*ignoreAuxiliary=*/false );
475 if ( std::find( usedHyps.begin(), usedHyps.end(), this ) != usedHyps.end() )
476 for ( TopExp_Explorer edge( face.Current(), TopAbs_EDGE); edge.More(); edge.Next() )
477 VISCOUS_3D::ToClearSubWithMain( smesh->GetSubMesh( edge.Current() ), face.Current() );
481 // END StdMeshers_ViscousLayers2D hypothesis
482 //================================================================================
484 using namespace VISCOUS_2D;
486 //================================================================================
488 * \brief Constructor of _ViscousBuilder2D
490 //================================================================================
492 _ViscousBuilder2D::_ViscousBuilder2D(SMESH_Mesh& theMesh,
493 const TopoDS_Face& theFace,
494 const StdMeshers_ViscousLayers2D* theHyp):
495 _mesh( &theMesh ), _face( theFace ), _hyp( theHyp ), _helper( theMesh )
497 _helper.SetSubShape( _face );
498 _helper.SetElementsOnShape(true);
500 //_face.Orientation( TopAbs_FORWARD );
501 _surface = BRep_Tool::Surface( _face );
504 _fPowN = pow( _hyp->GetStretchFactor(), _hyp->GetNumberLayers() );
507 //================================================================================
509 * \brief Stores error description and returns false
511 //================================================================================
513 bool _ViscousBuilder2D::error(const string& text )
515 cout << "_ViscousBuilder2D::error " << text << endl;
516 _error->myName = COMPERR_ALGO_FAILED;
517 _error->myComment = string("Viscous layers builder 2D: ") + text;
518 if ( SMESH_subMesh* sm = _mesh->GetSubMesh( _face ) )
520 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
521 if ( smError && smError->myAlgo )
522 _error->myAlgo = smError->myAlgo;
525 //makeGroupOfLE(); // debug
530 //================================================================================
532 * \brief Does its job
534 //================================================================================
536 SMESH_ProxyMesh::Ptr _ViscousBuilder2D::Compute()
538 _error = SMESH_ComputeError::New(COMPERR_OK);
539 _faceSideVec = StdMeshers_FaceSide::GetFaceWires( _face, *_mesh, true, _error );
540 if ( !_error->IsOK() )
543 if ( !findEdgesWithLayers() ) // analysis of a shape
546 if ( ! makePolyLines() ) // creation of fronts
549 if ( ! inflate() ) // advance fronts
552 // remove elements and nodes from _face
553 removeMeshFaces( _face );
555 if ( !shrink() ) // shrink segments on edges w/o layers
558 if ( ! refine() ) // make faces
566 //================================================================================
568 * \brief Finds EDGE's to make viscous layers on.
570 //================================================================================
572 bool _ViscousBuilder2D::findEdgesWithLayers()
574 // collect all EDGEs to ignore defined by hyp
575 int nbMyEdgesIgnored = 0;
576 vector<TGeomID> ids = _hyp->GetBndShapesToIgnore();
577 for ( size_t i = 0; i < ids.size(); ++i )
579 const TopoDS_Shape& s = getMeshDS()->IndexToShape( ids[i] );
580 if ( !s.IsNull() && s.ShapeType() == TopAbs_EDGE ) {
581 _ignoreShapeIds.insert( ids[i] );
582 nbMyEdgesIgnored += ( _helper.IsSubShape( s, _face ));
586 // check all EDGEs of the _face
587 int totalNbEdges = 0;
588 for ( size_t iWire = 0; iWire < _faceSideVec.size(); ++iWire )
590 StdMeshers_FaceSidePtr wire = _faceSideVec[ iWire ];
591 totalNbEdges += wire->NbEdges();
592 for ( int iE = 0; iE < wire->NbEdges(); ++iE )
593 if ( _helper.NbAncestors( wire->Edge( iE ), *_mesh, TopAbs_FACE ) > 1 )
595 // ignore internal EDGEs (shared by several FACEs)
596 TGeomID edgeID = getMeshDS()->ShapeToIndex( wire->Edge( iE ));
597 _ignoreShapeIds.insert( edgeID );
599 // check if ends of an EDGE are to be added to _noShrinkVert
600 PShapeIteratorPtr faceIt = _helper.GetAncestors( wire->Edge( iE ), *_mesh, TopAbs_FACE );
601 while ( const TopoDS_Shape* neighbourFace = faceIt->next() )
603 if ( neighbourFace->IsSame( _face )) continue;
604 SMESH_Algo* algo = _mesh->GetGen()->GetAlgo( *_mesh, *neighbourFace );
605 if ( !algo ) continue;
607 const StdMeshers_ViscousLayers2D* viscHyp = 0;
608 const list <const SMESHDS_Hypothesis *> & allHyps =
609 algo->GetUsedHypothesis(*_mesh, *neighbourFace, /*noAuxiliary=*/false);
610 list< const SMESHDS_Hypothesis *>::const_iterator hyp = allHyps.begin();
611 for ( ; hyp != allHyps.end() && !viscHyp; ++hyp )
612 viscHyp = dynamic_cast<const StdMeshers_ViscousLayers2D*>( *hyp );
614 set<TGeomID> neighbourIgnoreEdges;
616 vector<TGeomID> ids = _hyp->GetBndShapesToIgnore();
617 neighbourIgnoreEdges.insert( ids.begin(), ids.end() );
619 for ( int iV = 0; iV < 2; ++iV )
621 TopoDS_Vertex vertex = iV ? wire->LastVertex(iE) : wire->FirstVertex(iE);
623 _noShrinkVert.insert( getMeshDS()->ShapeToIndex( vertex ));
626 PShapeIteratorPtr edgeIt = _helper.GetAncestors( vertex, *_mesh, TopAbs_EDGE );
627 while ( const TopoDS_Shape* edge = edgeIt->next() )
628 if ( !edge->IsSame( wire->Edge( iE )) &&
629 neighbourIgnoreEdges.count( getMeshDS()->ShapeToIndex( *edge )))
630 _noShrinkVert.insert( getMeshDS()->ShapeToIndex( vertex ));
636 return ( nbMyEdgesIgnored < totalNbEdges );
639 //================================================================================
641 * \brief Create the inner front of the viscous layers and prepare data for infation
643 //================================================================================
645 bool _ViscousBuilder2D::makePolyLines()
647 // Create _PolyLines and _LayerEdge's
649 // count total nb of EDGEs to allocate _polyLineVec
651 for ( size_t iWire = 0; iWire < _faceSideVec.size(); ++iWire )
652 nbEdges += _faceSideVec[ iWire ]->NbEdges();
653 _polyLineVec.resize( nbEdges );
655 // Assign data to _PolyLine's
656 // ---------------------------
659 for ( size_t iWire = 0; iWire < _faceSideVec.size(); ++iWire )
661 StdMeshers_FaceSidePtr wire = _faceSideVec[ iWire ];
662 const vector<UVPtStruct>& points = wire->GetUVPtStruct();
663 if ( points.empty() && wire->NbPoints() > 0 )
664 return error("Invalid node parameters on some EDGE");
666 for ( int iE = 0; iE < wire->NbEdges(); ++iE )
668 _PolyLine& L = _polyLineVec[ iPoLine++ ];
669 L._wire = wire.get();
671 L._advancable = !_ignoreShapeIds.count( wire->EdgeID( iE ));
673 int iRight = iPoLine - (( iE+1 < wire->NbEdges() ) ? 0 : wire->NbEdges() );
674 L._rightLine = &_polyLineVec[ iRight ];
675 _polyLineVec[ iRight ]._leftLine = &L;
677 L._firstPntInd = iPnt;
678 double lastNormPar = wire->LastParameter( iE ) - 1e-10;
679 while ( points[ iPnt ].normParam < lastNormPar )
681 L._lastPntInd = iPnt;
682 L._lEdges.resize( Max( 3, L._lastPntInd - L._firstPntInd + 1 )); // 3 edges minimum
684 // TODO: add more _LayerEdge's to strongly curved EDGEs
685 // in order not to miss collisions
687 Handle(Geom2d_Curve) pcurve = L._wire->Curve2d( L._edgeInd );
688 const bool reverse = (( L._wire->Edge( iE ).Orientation() == TopAbs_REVERSED ) ^
689 (_face.Orientation() == TopAbs_REVERSED ));
690 for ( int i = L._firstPntInd; i <= L._lastPntInd; ++i )
692 _LayerEdge& lEdge = L._lEdges[ i - L._firstPntInd ];
693 const double u = ( i == L._firstPntInd ? wire->FirstU(iE) : points[ i ].param );
694 setLayerEdgeData( lEdge, u, pcurve, reverse );
695 setLenRatio( lEdge, SMESH_TNodeXYZ( points[ i ].node ) );
697 if ( L._lastPntInd - L._firstPntInd + 1 < 3 ) // add 3d _LayerEdge in the middle
699 L._lEdges[2] = L._lEdges[1];
700 const double u = 0.5 * ( wire->FirstU(iE) + wire->LastU(iE) );
701 setLayerEdgeData( L._lEdges[1], u, pcurve, reverse );
702 gp_Pnt p = 0.5 * ( SMESH_TNodeXYZ( points[ L._firstPntInd ].node ) +
703 SMESH_TNodeXYZ( points[ L._lastPntInd ].node ));
704 setLenRatio( L._lEdges[1], p );
709 // Fill _PolyLine's with _segments
710 // --------------------------------
712 double maxLen2dTo3dRatio = 0;
713 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
715 _PolyLine& L = _polyLineVec[ iPoLine ];
716 L._segments.resize( L._lEdges.size() - 1 );
717 for ( size_t i = 1; i < L._lEdges.size(); ++i )
719 _Segment & S = L._segments[i-1];
720 S._uv[0] = & L._lEdges[i-1]._uvIn;
721 S._uv[1] = & L._lEdges[i ]._uvIn;
722 S._indexInLine = i-1;
723 if ( maxLen2dTo3dRatio < L._lEdges[i]._len2dTo3dRatio )
724 maxLen2dTo3dRatio = L._lEdges[i]._len2dTo3dRatio;
726 // // connect _PolyLine's with segments, the 1st _LayerEdge of every _PolyLine
727 // // becomes not connected to any segment
728 // if ( L._leftLine->_advancable )
729 // L._segments[0]._uv[0] = & L._leftLine->_lEdges.back()._uvIn;
731 L._segTree.reset( new _SegmentTree( L._segments ));
734 // Evaluate max possible _thickness if required layers thickness seems too high
735 // ----------------------------------------------------------------------------
737 _thickness = _hyp->GetTotalThickness();
738 _SegmentTree::box_type faceBndBox2D;
739 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
740 faceBndBox2D.Add( *_polyLineVec[ iPoLine]._segTree->getBox() );
741 double boxTol = 1e-3 * sqrt( faceBndBox2D.SquareExtent() );
743 if ( _thickness * maxLen2dTo3dRatio > sqrt( faceBndBox2D.SquareExtent() ) / 10 )
745 vector< const _Segment* > foundSegs;
746 double maxPossibleThick = 0;
747 _SegmentIntersection intersection;
748 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
750 _PolyLine& L1 = _polyLineVec[ iL1 ];
751 _SegmentTree::box_type boxL1 = * L1._segTree->getBox();
752 boxL1.Enlarge( boxTol );
753 // consider case of a circle as well!
754 for ( size_t iL2 = iL1; iL2 < _polyLineVec.size(); ++iL2 )
756 _PolyLine& L2 = _polyLineVec[ iL2 ];
757 _SegmentTree::box_type boxL2 = * L2._segTree->getBox();
758 boxL2.Enlarge( boxTol );
759 if ( boxL1.IsOut( boxL2 ))
761 for ( size_t iLE = 1; iLE < L1._lEdges.size(); ++iLE )
764 L2._segTree->GetSegmentsNear( L1._lEdges[iLE]._ray, foundSegs );
765 for ( size_t i = 0; i < foundSegs.size(); ++i )
766 if ( intersection.Compute( *foundSegs[i], L1._lEdges[iLE]._ray ))
768 double distToL2 = intersection._param2 / L1._lEdges[iLE]._len2dTo3dRatio;
769 double psblThick = distToL2 / ( 1 + L1._advancable + L2._advancable );
770 if ( maxPossibleThick < psblThick )
771 maxPossibleThick = psblThick;
776 _thickness = Min( _hyp->GetTotalThickness(), maxPossibleThick );
779 // Adjust _LayerEdge's at _PolyLine's extremities
780 // -----------------------------------------------
782 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
784 _PolyLine& LL = _polyLineVec[ iPoLine ];
785 _PolyLine& LR = *LL._rightLine;
786 adjustCommonEdge( LL, LR );
788 // recreate _segments if some _LayerEdge's have been removed by adjustCommonEdge()
789 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
791 _PolyLine& L = _polyLineVec[ iPoLine ];
792 // if ( L._segments.size() == L._lEdges.size() - 1 )
794 L._segments.resize( L._lEdges.size() - 1 );
795 for ( size_t i = 1; i < L._lEdges.size(); ++i )
797 _Segment & S = L._segments[i-1];
798 S._uv[0] = & L._lEdges[i-1]._uvIn;
799 S._uv[1] = & L._lEdges[i ]._uvIn;
800 S._indexInLine = i-1;
802 L._segTree.reset( new _SegmentTree( L._segments ));
804 // connect _PolyLine's with segments, the 1st _LayerEdge of every _PolyLine
805 // becomes not connected to any segment
806 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
808 _PolyLine& L = _polyLineVec[ iPoLine ];
809 if ( L._leftLine->_advancable )
810 L._segments[0]._uv[0] = & L._leftLine->_lEdges.back()._uvIn;
813 // Fill _reachableLines.
814 // ----------------------
816 // compute bnd boxes taking into account the layers total thickness
817 vector< _SegmentTree::box_type > lineBoxes( _polyLineVec.size() );
818 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
820 lineBoxes[ iPoLine ] = *_polyLineVec[ iPoLine ]._segTree->getBox();
821 if ( _polyLineVec[ iPoLine ]._advancable )
822 lineBoxes[ iPoLine ].Enlarge( maxLen2dTo3dRatio * _thickness * 2 );
825 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
827 _PolyLine& L1 = _polyLineVec[ iPoLine ];
828 for ( size_t iL2 = 0; iL2 < _polyLineVec.size(); ++iL2 )
830 _PolyLine& L2 = _polyLineVec[ iL2 ];
831 if ( iPoLine == iL2 || lineBoxes[ iPoLine ].IsOut( lineBoxes[ iL2 ]))
833 if ( !L1._advancable && ( L1._leftLine == &L2 || L1._rightLine == &L2 ))
835 // check reachability by _LayerEdge's
836 int iDelta = 1; //Max( 1, L1._lEdges.size() / 100 );
837 for ( size_t iLE = 1; iLE < L1._lEdges.size(); iLE += iDelta )
839 _LayerEdge& LE = L1._lEdges[iLE];
840 if ( !lineBoxes[ iL2 ].IsOut ( LE._uvOut,
841 LE._uvOut + LE._normal2D *_thickness * LE._len2dTo3dRatio ))
843 L1._reachableLines.push_back( & L2 );
848 // add self to _reachableLines
849 Geom2dAdaptor_Curve pcurve( L1._wire->Curve2d( L1._edgeInd ));
850 L1._isStraight2D = ( pcurve.GetType() == GeomAbs_Line );
851 if ( !L1._isStraight2D )
853 // TODO: check carefully
854 L1._reachableLines.push_back( & L1 );
861 //================================================================================
863 * \brief adjust common _LayerEdge of two adjacent _PolyLine's
864 * \param LL - left _PolyLine
865 * \param LR - right _PolyLine
867 //================================================================================
869 void _ViscousBuilder2D::adjustCommonEdge( _PolyLine& LL, _PolyLine& LR )
871 int nbAdvancableL = LL._advancable + LR._advancable;
872 if ( nbAdvancableL == 0 )
875 _LayerEdge& EL = LL._lEdges.back();
876 _LayerEdge& ER = LR._lEdges.front();
877 gp_XY normL = EL._normal2D;
878 gp_XY normR = ER._normal2D;
879 gp_XY tangL ( normL.Y(), -normL.X() );
881 // set common direction to a VERTEX _LayerEdge shared by two _PolyLine's
882 gp_XY normCommon = ( normL * int( LL._advancable ) +
883 normR * int( LR._advancable )).Normalized();
884 EL._normal2D = normCommon;
885 EL._ray.SetLocation ( EL._uvOut );
886 EL._ray.SetDirection( EL._normal2D );
887 if ( nbAdvancableL == 1 ) { // _normal2D is true normal (not average)
888 EL._isBlocked = true; // prevent intersecting with _Segments of _advancable line
891 // update _LayerEdge::_len2dTo3dRatio according to a new direction
892 const vector<UVPtStruct>& points = LL._wire->GetUVPtStruct();
893 setLenRatio( EL, SMESH_TNodeXYZ( points[ LL._lastPntInd ].node ));
897 const double dotNormTang = normR * tangL;
898 const bool largeAngle = Abs( dotNormTang ) > 0.2;
899 if ( largeAngle ) // not 180 degrees
901 // recompute _len2dTo3dRatio to take into account angle between EDGEs
902 gp_Vec2d oldNorm( LL._advancable ? normL : normR );
903 double angleFactor = 1. / Max( 0.3, Cos( oldNorm.Angle( normCommon )));
904 EL._len2dTo3dRatio *= angleFactor;
905 ER._len2dTo3dRatio = EL._len2dTo3dRatio;
907 gp_XY normAvg = ( normL + normR ).Normalized(); // average normal at VERTEX
909 if ( dotNormTang < 0. ) // ---------------------------- CONVEX ANGLE
911 // Remove _LayerEdge's intersecting the normAvg to avoid collisions
914 // find max length of the VERTEX based _LayerEdge whose direction is normAvg
915 double maxLen2D = _thickness * EL._len2dTo3dRatio;
916 const gp_XY& pCommOut = ER._uvOut;
917 gp_XY pCommIn = pCommOut + normAvg * maxLen2D;
918 _Segment segCommon( pCommOut, pCommIn );
919 _SegmentIntersection intersection;
920 vector< const _Segment* > foundSegs;
921 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
923 _PolyLine& L1 = _polyLineVec[ iL1 ];
924 const _SegmentTree::box_type* boxL1 = L1._segTree->getBox();
925 if ( boxL1->IsOut ( pCommOut, pCommIn ))
927 for ( size_t iLE = 1; iLE < L1._lEdges.size(); ++iLE )
930 L1._segTree->GetSegmentsNear( segCommon, foundSegs );
931 for ( size_t i = 0; i < foundSegs.size(); ++i )
932 if ( intersection.Compute( *foundSegs[i], segCommon ) &&
933 intersection._param2 > 1e-10 )
935 double len2D = intersection._param2 * maxLen2D / ( 2 + L1._advancable );
936 if ( len2D < maxLen2D ) {
938 pCommIn = pCommOut + normAvg * maxLen2D; // here length of segCommon changes
944 // remove _LayerEdge's intersecting segCommon
945 for ( int isR = 0; isR < 2; ++isR ) // loop on [ LL, LR ]
947 _PolyLine& L = isR ? LR : LL;
948 _PolyLine::TEdgeIterator eIt = isR ? L._lEdges.begin()+1 : L._lEdges.end()-2;
949 int dIt = isR ? +1 : -1;
950 if ( nbAdvancableL == 1 && L._advancable && normL * normR > -0.01 )
951 continue; // obtuse internal angle
952 // at least 3 _LayerEdge's should remain in a _PolyLine
953 if ( L._lEdges.size() < 4 ) continue;
955 _SegmentIntersection lastIntersection;
956 for ( ; iLE < L._lEdges.size(); ++iLE, eIt += dIt )
958 gp_XY uvIn = eIt->_uvOut + eIt->_normal2D * _thickness * eIt->_len2dTo3dRatio;
959 _Segment segOfEdge( eIt->_uvOut, uvIn );
960 if ( !intersection.Compute( segCommon, segOfEdge ))
962 lastIntersection._param1 = intersection._param1;
963 lastIntersection._param2 = intersection._param2;
965 if ( iLE >= L._lEdges.size () - 1 )
967 // all _LayerEdge's intersect the segCommon, limit inflation
968 // of remaining 2 _LayerEdge's
969 vector< _LayerEdge > newEdgeVec( Min( 3, L._lEdges.size() ));
970 newEdgeVec.front() = L._lEdges.front();
971 newEdgeVec.back() = L._lEdges.back();
972 if ( newEdgeVec.size() == 3 )
973 newEdgeVec[1] = L._lEdges[ L._lEdges.size() / 2 ];
974 L._lEdges.swap( newEdgeVec );
975 if ( !isR ) std::swap( lastIntersection._param1 , lastIntersection._param2 );
976 L._lEdges.front()._len2dTo3dRatio *= lastIntersection._param1; // ??
977 L._lEdges.back ()._len2dTo3dRatio *= lastIntersection._param2;
981 // eIt points to the _LayerEdge not intersecting with segCommon
983 LR._lEdges.erase( LR._lEdges.begin()+1, eIt );
985 LL._lEdges.erase( eIt, --LL._lEdges.end() );
986 // eIt = isR ? L._lEdges.begin()+1 : L._lEdges.end()-2;
987 // for ( size_t i = 1; i < iLE; ++i, eIt += dIt )
988 // eIt->_isBlocked = true;
992 else // ------------------------------------------ CONCAVE ANGLE
994 if ( nbAdvancableL == 1 )
996 // make that the _LayerEdge at VERTEX is not shared by LL and LR:
997 // different normals is a sign that they are not shared
998 _LayerEdge& notSharedEdge = LL._advancable ? LR._lEdges[0] : LL._lEdges.back();
999 _LayerEdge& sharedEdge = LR._advancable ? LR._lEdges[0] : LL._lEdges.back();
1001 notSharedEdge._normal2D.SetCoord( 0.,0. );
1002 sharedEdge._normal2D = normAvg;
1003 sharedEdge._isBlocked = false;
1004 notSharedEdge._isBlocked = true;
1010 //================================================================================
1012 * \brief initialize data of a _LayerEdge
1014 //================================================================================
1016 void _ViscousBuilder2D::setLayerEdgeData( _LayerEdge& lEdge,
1018 Handle(Geom2d_Curve)& pcurve,
1021 gp_Pnt2d uv; gp_Vec2d tangent;
1022 pcurve->D1( u, uv, tangent );
1023 tangent.Normalize();
1026 lEdge._uvOut = lEdge._uvIn = uv.XY();
1027 lEdge._normal2D.SetCoord( -tangent.Y(), tangent.X() );
1028 lEdge._ray.SetLocation( lEdge._uvOut );
1029 lEdge._ray.SetDirection( lEdge._normal2D );
1030 lEdge._isBlocked = false;
1031 lEdge._length2D = 0;
1034 //================================================================================
1036 * \brief Compute and set _LayerEdge::_len2dTo3dRatio
1038 //================================================================================
1040 void _ViscousBuilder2D::setLenRatio( _LayerEdge& LE, const gp_Pnt& pOut )
1042 const double probeLen2d = 1e-3;
1044 gp_Pnt2d p2d = LE._uvOut + LE._normal2D * probeLen2d;
1045 gp_Pnt p3d = _surface->Value( p2d.X(), p2d.Y() );
1046 double len3d = p3d.Distance( pOut );
1047 if ( len3d < std::numeric_limits<double>::min() )
1048 LE._len2dTo3dRatio = std::numeric_limits<double>::min();
1050 LE._len2dTo3dRatio = probeLen2d / len3d;
1053 //================================================================================
1055 * \brief Increase length of _LayerEdge's to reach the required thickness of layers
1057 //================================================================================
1059 bool _ViscousBuilder2D::inflate()
1061 // Limit size of inflation step by geometry size found by
1062 // itersecting _LayerEdge's with _Segment's
1063 double minSize = _thickness, maxSize = 0;
1064 vector< const _Segment* > foundSegs;
1065 _SegmentIntersection intersection;
1066 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
1068 _PolyLine& L1 = _polyLineVec[ iL1 ];
1069 for ( size_t iL2 = 0; iL2 < L1._reachableLines.size(); ++iL2 )
1071 _PolyLine& L2 = * L1._reachableLines[ iL2 ];
1072 for ( size_t iLE = 1; iLE < L1._lEdges.size(); ++iLE )
1075 L2._segTree->GetSegmentsNear( L1._lEdges[iLE]._ray, foundSegs );
1076 for ( size_t i = 0; i < foundSegs.size(); ++i )
1077 if ( ! L1.IsAdjacent( *foundSegs[i], & L1._lEdges[iLE] ) &&
1078 intersection.Compute( *foundSegs[i], L1._lEdges[iLE]._ray ))
1080 double distToL2 = intersection._param2 / L1._lEdges[iLE]._len2dTo3dRatio;
1081 double size = distToL2 / ( 1 + L1._advancable + L2._advancable );
1082 if ( size < minSize )
1084 if ( size > maxSize )
1090 if ( minSize > maxSize ) // no collisions possible
1091 maxSize = _thickness;
1093 cout << "-- minSize = " << minSize << ", maxSize = " << maxSize << endl;
1096 double curThick = 0, stepSize = minSize;
1098 if ( maxSize > _thickness )
1099 maxSize = _thickness;
1100 while ( curThick < maxSize )
1102 curThick += stepSize * 1.25;
1103 if ( curThick > _thickness )
1104 curThick = _thickness;
1106 // Elongate _LayerEdge's
1107 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1109 _PolyLine& L = _polyLineVec[ iL ];
1110 if ( !L._advancable ) continue;
1111 bool lenChange = false;
1112 for ( size_t iLE = L.FirstLEdge(); iLE < L._lEdges.size(); ++iLE )
1113 lenChange |= L._lEdges[iLE].SetNewLength( curThick );
1114 // for ( int k=0; k<L._segments.size(); ++k)
1115 // cout << "( " << L._segments[k].p1().X() << ", " <<L._segments[k].p1().Y() << " ) "
1116 // << "( " << L._segments[k].p2().X() << ", " <<L._segments[k].p2().Y() << " ) "
1119 L._segTree.reset( new _SegmentTree( L._segments ));
1122 // Avoid intersection of _Segment's
1123 bool allBlocked = fixCollisions();
1126 break; // no more inflating possible
1128 stepSize = Max( stepSize , _thickness / 10. );
1132 // if (nbSteps == 0 )
1133 // return error("failed at the very first inflation step");
1136 // remove _LayerEdge's of one line intersecting with each other
1137 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1139 _PolyLine& L = _polyLineVec[ iL ];
1140 if ( !L._advancable ) continue;
1142 // replace an inactive (1st) _LayerEdge with an active one of a neighbour _PolyLine
1143 if ( /*!L._leftLine->_advancable &&*/ L.IsCommonEdgeShared( *L._leftLine ) ) {
1144 L._lEdges[0] = L._leftLine->_lEdges.back();
1146 if ( !L._rightLine->_advancable && L.IsCommonEdgeShared( *L._rightLine ) ) {
1147 L._lEdges.back() = L._rightLine->_lEdges[0];
1150 _SegmentIntersection intersection;
1151 for ( int isR = 0; ( isR < 2 && L._lEdges.size() > 2 ); ++isR )
1153 int nbRemove = 0, deltaIt = isR ? -1 : +1;
1154 _PolyLine::TEdgeIterator eIt = isR ? L._lEdges.end()-1 : L._lEdges.begin();
1155 if ( eIt->_length2D == 0 ) continue;
1156 _Segment seg1( eIt->_uvOut, eIt->_uvIn );
1157 for ( eIt += deltaIt; nbRemove < L._lEdges.size()-1; eIt += deltaIt )
1159 _Segment seg2( eIt->_uvOut, eIt->_uvIn );
1160 if ( !intersection.Compute( seg1, seg2 ))
1164 if ( nbRemove > 0 ) {
1165 if ( nbRemove == L._lEdges.size()-1 ) // 1st and last _LayerEdge's intersect
1168 _LayerEdge& L0 = L._lEdges.front();
1169 _LayerEdge& L1 = L._lEdges.back();
1170 L0._length2D *= intersection._param1 * 0.5;
1171 L1._length2D *= intersection._param2 * 0.5;
1172 L0._uvIn = L0._uvOut + L0._normal2D * L0._length2D;
1173 L1._uvIn = L1._uvOut + L1._normal2D * L1._length2D;
1174 if ( L.IsCommonEdgeShared( *L._leftLine ))
1175 L._leftLine->_lEdges.back() = L0;
1178 L._lEdges.erase( L._lEdges.end()-nbRemove-1,
1179 L._lEdges.end()-nbRemove );
1181 L._lEdges.erase( L._lEdges.begin()+1,
1182 L._lEdges.begin()+1+nbRemove );
1189 //================================================================================
1191 * \brief Remove intersection of _PolyLine's
1193 //================================================================================
1195 bool _ViscousBuilder2D::fixCollisions()
1197 // look for intersections of _Segment's by intersecting _LayerEdge's with
1199 //double maxStep = 0, minStep = 1e+100;
1200 vector< const _Segment* > foundSegs;
1201 _SegmentIntersection intersection;
1203 list< pair< _LayerEdge*, double > > edgeLenLimitList;
1204 list< _LayerEdge* > blockedEdgesList;
1206 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
1208 _PolyLine& L1 = _polyLineVec[ iL1 ];
1209 //if ( !L1._advancable ) continue;
1210 for ( size_t iL2 = 0; iL2 < L1._reachableLines.size(); ++iL2 )
1212 _PolyLine& L2 = * L1._reachableLines[ iL2 ];
1213 for ( size_t iLE = L1.FirstLEdge(); iLE < L1._lEdges.size(); ++iLE )
1215 _LayerEdge& LE1 = L1._lEdges[iLE];
1216 if ( LE1._isBlocked ) continue;
1218 L2._segTree->GetSegmentsNear( LE1._ray, foundSegs );
1219 for ( size_t i = 0; i < foundSegs.size(); ++i )
1221 if ( ! L1.IsAdjacent( *foundSegs[i], &LE1 ) &&
1222 intersection.Compute( *foundSegs[i], LE1._ray ))
1224 const double dist2DToL2 = intersection._param2;
1225 double newLen2D = dist2DToL2 / 2;
1226 if ( newLen2D < 1.1 * LE1._length2D ) // collision!
1228 if ( newLen2D < LE1._length2D )
1230 blockedEdgesList.push_back( &LE1 );
1231 if ( L1._advancable )
1233 edgeLenLimitList.push_back( make_pair( &LE1, newLen2D ));
1234 blockedEdgesList.push_back( &L2._lEdges[ foundSegs[i]->_indexInLine ]);
1235 blockedEdgesList.push_back( &L2._lEdges[ foundSegs[i]->_indexInLine + 1 ]);
1237 else // here dist2DToL2 < 0 and LE1._length2D == 0
1239 _LayerEdge LE2[2] = { L2._lEdges[ foundSegs[i]->_indexInLine ],
1240 L2._lEdges[ foundSegs[i]->_indexInLine + 1 ] };
1241 _Segment outSeg2( LE2[0]._uvOut, LE2[1]._uvOut );
1242 intersection.Compute( outSeg2, LE1._ray );
1243 newLen2D = intersection._param2 / 2;
1245 edgeLenLimitList.push_back( make_pair( &LE2[0], newLen2D ));
1246 edgeLenLimitList.push_back( make_pair( &LE2[1], newLen2D ));
1256 // set limited length to _LayerEdge's
1257 list< pair< _LayerEdge*, double > >::iterator edge2Len = edgeLenLimitList.begin();
1258 for ( ; edge2Len != edgeLenLimitList.end(); ++edge2Len )
1260 _LayerEdge* LE = edge2Len->first;
1261 LE->SetNewLength( edge2Len->second / LE->_len2dTo3dRatio );
1262 LE->_isBlocked = true;
1265 // block inflation of _LayerEdge's
1266 list< _LayerEdge* >::iterator edge = blockedEdgesList.begin();
1267 for ( ; edge != blockedEdgesList.end(); ++edge )
1268 (*edge)->_isBlocked = true;
1270 // find a not blocked _LayerEdge
1271 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1273 _PolyLine& L = _polyLineVec[ iL ];
1274 if ( !L._advancable ) continue;
1275 for ( size_t iLE = L.FirstLEdge(); iLE < L._lEdges.size(); ++iLE )
1276 if ( !L._lEdges[ iLE ]._isBlocked )
1283 //================================================================================
1285 * \brief Create new edges and shrink edges existing on a non-advancable _PolyLine
1286 * adjacent to an advancable one.
1288 //================================================================================
1290 bool _ViscousBuilder2D::shrink()
1292 gp_Pnt2d uv; //gp_Vec2d tangent;
1293 _SegmentIntersection intersection;
1296 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
1298 _PolyLine& L = _polyLineVec[ iL1 ]; // line with no layers
1299 if ( L._advancable )
1301 const int nbAdvancable = ( L._rightLine->_advancable + L._leftLine->_advancable );
1302 if ( nbAdvancable == 0 )
1305 const TopoDS_Edge& E = L._wire->Edge ( L._edgeInd );
1306 const int edgeID = L._wire->EdgeID ( L._edgeInd );
1307 const double edgeLen = L._wire->EdgeLength( L._edgeInd );
1308 Handle(Geom2d_Curve) pcurve = L._wire->Curve2d ( L._edgeInd );
1309 const bool edgeReversed = ( E.Orientation() == TopAbs_REVERSED );
1311 SMESH_MesherHelper helper( *_mesh ); // to create nodes and edges on E
1312 helper.SetSubShape( E );
1313 helper.SetElementsOnShape( true );
1315 // Check a FACE adjacent to _face by E
1316 bool existingNodesFound = false;
1317 TopoDS_Face adjFace;
1318 PShapeIteratorPtr faceIt = _helper.GetAncestors( E, *_mesh, TopAbs_FACE );
1319 while ( const TopoDS_Shape* f = faceIt->next() )
1320 if ( !_face.IsSame( *f ))
1322 adjFace = TopoDS::Face( *f );
1323 SMESH_ProxyMesh::Ptr pm = _ProxyMeshHolder::FindProxyMeshOfFace( adjFace, *_mesh );
1324 if ( !pm || pm->NbProxySubMeshes() == 0 )
1326 // There are no viscous layers on an adjacent FACE, clear it's 2D mesh
1327 removeMeshFaces( adjFace );
1331 // There are viscous layers on the adjacent FACE; shrink must be already done;
1335 const vector<UVPtStruct>& points = L._wire->GetUVPtStruct();
1336 int iPFrom = L._firstPntInd, iPTo = L._lastPntInd;
1337 if ( L._leftLine->_advancable )
1339 vector<gp_XY>& uvVec = L._lEdges.front()._uvRefined;
1340 for ( int i = 0; i < _hyp->GetNumberLayers(); ++i ) {
1341 const UVPtStruct& uvPt = points[ iPFrom + i + 1 ];
1342 L._leftNodes.push_back( uvPt.node );
1343 uvVec.push_back ( pcurve->Value( uvPt.param ).XY() );
1346 if ( L._rightLine->_advancable )
1348 vector<gp_XY>& uvVec = L._lEdges.back()._uvRefined;
1349 for ( int i = 0; i < _hyp->GetNumberLayers(); ++i ) {
1350 const UVPtStruct& uvPt = points[ iPTo - i - 1 ];
1351 L._rightNodes.push_back( uvPt.node );
1352 uvVec.push_back ( pcurve->Value( uvPt.param ).XY() );
1355 // make proxy sub-mesh data of present nodes
1357 if ( L._leftLine->_advancable ) iPFrom += _hyp->GetNumberLayers();
1358 if ( L._rightLine->_advancable ) iPTo -= _hyp->GetNumberLayers();
1359 UVPtStructVec nodeDataVec( & points[ iPFrom ], & points[ iPTo + 1 ]);
1361 double normSize = nodeDataVec.back().normParam - nodeDataVec.front().normParam;
1362 for ( int iP = nodeDataVec.size()-1; iP >= 0 ; --iP )
1363 nodeDataVec[iP].normParam =
1364 ( nodeDataVec[iP].normParam - nodeDataVec[0].normParam ) / normSize;
1366 const SMDS_MeshNode* n = nodeDataVec.front().node;
1367 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
1368 nodeDataVec.front().param = L._wire->FirstU( L._edgeInd );
1369 n = nodeDataVec.back().node;
1370 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
1371 nodeDataVec.back().param = L._wire->LastU( L._edgeInd );
1373 _ProxyMeshOfFace::_EdgeSubMesh* myEdgeSM = getProxyMesh()->GetEdgeSubMesh( edgeID );
1374 myEdgeSM->SetUVPtStructVec( nodeDataVec );
1376 existingNodesFound = true;
1378 } // loop on FACEs sharing E
1380 if ( existingNodesFound )
1381 continue; // nothing more to do in this case
1383 double u1 = L._wire->FirstU( L._edgeInd ), uf = u1;
1384 double u2 = L._wire->LastU ( L._edgeInd ), ul = u2;
1386 // a ratio to pass 2D <--> 1D
1387 const double len1D = 1e-3;
1388 const double len2D = pcurve->Value(uf).Distance( pcurve->Value(uf+len1D));
1389 double len1dTo2dRatio = len1D / len2D;
1391 // create a vector of proxy nodes
1392 const vector<UVPtStruct>& points = L._wire->GetUVPtStruct();
1393 UVPtStructVec nodeDataVec( & points[ L._firstPntInd ],
1394 & points[ L._lastPntInd + 1 ]);
1395 nodeDataVec.front().param = u1; // U on vertex is correct on only one of shared edges
1396 nodeDataVec.back ().param = u2;
1397 nodeDataVec.front().normParam = 0;
1398 nodeDataVec.back ().normParam = 1;
1400 // Get length of existing segments (from an edge start to a node) and their nodes
1401 vector< double > segLengths( nodeDataVec.size() - 1 );
1402 BRepAdaptor_Curve curve( E );
1403 for ( size_t iP = 1; iP < nodeDataVec.size(); ++iP )
1405 const double len = GCPnts_AbscissaPoint::Length( curve, uf, nodeDataVec[iP].param );
1406 segLengths[ iP-1 ] = len;
1409 // Move first and last parameters on EDGE (U of n1) according to layers' thickness
1410 // and create nodes of layers on EDGE ( -x-x-x )
1414 // x-----x-----x-----x-----
1419 // x-x-x-x-----x-----x----
1422 int isRShrinkedForAdjacent;
1423 UVPtStructVec nodeDataForAdjacent;
1424 for ( int isR = 0; isR < 2; ++isR )
1426 _PolyLine* L2 = isR ? L._rightLine : L._leftLine; // line with layers
1427 if ( !L2->_advancable &&
1428 !toShrinkForAdjacent( adjFace, E, L._wire->FirstVertex( L._edgeInd + isR )))
1431 double & u = isR ? u2 : u1; // param to move
1432 double u0 = isR ? ul : uf; // init value of the param to move
1433 int iPEnd = isR ? nodeDataVec.size() - 1 : 0;
1435 _LayerEdge& nearLE = isR ? L._lEdges.back() : L._lEdges.front();
1436 _LayerEdge& farLE = isR ? L._lEdges.front() : L._lEdges.back();
1438 // try to find length of advancement along L by intersecting L with
1439 // an adjacent _Segment of L2
1441 double& length2D = nearLE._length2D;
1442 double length1D = 0;
1443 sign = ( isR ^ edgeReversed ) ? -1. : 1.;
1445 bool isConvex = false;
1446 if ( L2->_advancable )
1448 const uvPtStruct& tang2P1 = points[ isR ? L2->_firstPntInd : L2->_lastPntInd ];
1449 const uvPtStruct& tang2P2 = points[ isR ? L2->_firstPntInd+1 : L2->_lastPntInd-1 ];
1450 gp_XY seg2Dir( tang2P2.u - tang2P1.u,
1451 tang2P2.v - tang2P1.v );
1452 int iFSeg2 = isR ? 0 : L2->_segments.size() - 1;
1453 int iLSeg2 = isR ? 1 : L2->_segments.size() - 2;
1454 gp_XY uvLSeg2In = L2->_lEdges[ iLSeg2 ]._uvIn;
1455 Handle(Geom2d_Line) seg2Line = new Geom2d_Line( uvLSeg2In, seg2Dir );
1457 Geom2dAdaptor_Curve edgeCurve( pcurve, Min( uf, ul ), Max( uf, ul ));
1458 Geom2dAdaptor_Curve seg2Curve( seg2Line );
1459 Geom2dInt_GInter curveInt( edgeCurve, seg2Curve, 1e-7, 1e-7 );
1460 isConvex = ( curveInt.IsDone() && !curveInt.IsEmpty() );
1463 length1D = Abs( u - curveInt.Point( 1 ).ParamOnFirst() );
1464 double maxDist2d = 2 * L2->_lEdges[ iLSeg2 ]._length2D;
1465 isConvex = ( length1D < maxDist2d * len1dTo2dRatio );
1472 if ( !isConvex ) { /* concave VERTEX */ /* o-----o---
1478 length2D = L2->_lEdges[ iFSeg2 ]._length2D;
1479 //if ( L2->_advancable ) continue;
1482 else // L2 is advancable but in the face adjacent by L
1484 length2D = farLE._length2D;
1485 if ( length2D == 0 ) {
1486 _LayerEdge& neighborLE =
1487 ( isR ? L._leftLine->_lEdges.back() : L._rightLine->_lEdges.front() );
1488 length2D = neighborLE._length2D;
1489 if ( length2D == 0 )
1490 length2D = _thickness * nearLE._len2dTo3dRatio;
1494 // move u to the internal boundary of layers
1496 // x-x-x-x-----x-----x----
1497 double maxLen3D = Min( _thickness, edgeLen / ( 1 + nbAdvancable ));
1498 double maxLen2D = maxLen3D * nearLE._len2dTo3dRatio;
1499 if ( !length2D ) length2D = length1D / len1dTo2dRatio;
1500 if ( Abs( length2D ) > maxLen2D )
1501 length2D = maxLen2D;
1502 nearLE._uvIn = nearLE._uvOut + nearLE._normal2D * length2D;
1504 u += length2D * len1dTo2dRatio * sign;
1505 nodeDataVec[ iPEnd ].param = u;
1507 gp_Pnt2d newUV = pcurve->Value( u );
1508 nodeDataVec[ iPEnd ].u = newUV.X();
1509 nodeDataVec[ iPEnd ].v = newUV.Y();
1511 // compute params of layers on L
1512 vector<double> heights;
1513 calcLayersHeight( u - u0, heights );
1515 vector< double > params( heights.size() );
1516 for ( size_t i = 0; i < params.size(); ++i )
1517 params[ i ] = u0 + heights[ i ];
1519 // create nodes of layers and edges between them
1521 vector< const SMDS_MeshNode* >& layersNode = isR ? L._rightNodes : L._leftNodes;
1522 vector<gp_XY>& nodeUV = ( isR ? L._lEdges.back() : L._lEdges[0] )._uvRefined;
1523 nodeUV.resize ( _hyp->GetNumberLayers() );
1524 layersNode.resize( _hyp->GetNumberLayers() );
1525 const SMDS_MeshNode* vertexNode = nodeDataVec[ iPEnd ].node;
1526 const SMDS_MeshNode * prevNode = vertexNode;
1527 for ( size_t i = 0; i < params.size(); ++i )
1529 gp_Pnt p = curve.Value( params[i] );
1530 layersNode[ i ] = helper.AddNode( p.X(), p.Y(), p.Z(), /*id=*/0, params[i] );
1531 nodeUV [ i ] = pcurve->Value( params[i] ).XY();
1532 helper.AddEdge( prevNode, layersNode[ i ] );
1533 prevNode = layersNode[ i ];
1536 // store data of layer nodes made for adjacent FACE
1537 if ( !L2->_advancable )
1539 isRShrinkedForAdjacent = isR;
1540 nodeDataForAdjacent.resize( _hyp->GetNumberLayers() );
1542 size_t iFrw = 0, iRev = nodeDataForAdjacent.size()-1, *i = isR ? &iRev : &iFrw;
1543 nodeDataForAdjacent[ *i ] = points[ isR ? L._lastPntInd : L._firstPntInd ];
1544 nodeDataForAdjacent[ *i ].param = u0;
1545 nodeDataForAdjacent[ *i ].normParam = isR;
1546 for ( ++iFrw, --iRev; iFrw < layersNode.size(); ++iFrw, --iRev )
1548 nodeDataForAdjacent[ *i ].node = layersNode[ iFrw - 1 ];
1549 nodeDataForAdjacent[ *i ].u = nodeUV [ iFrw - 1 ].X();
1550 nodeDataForAdjacent[ *i ].v = nodeUV [ iFrw - 1 ].Y();
1551 nodeDataForAdjacent[ *i ].param = params [ iFrw - 1 ];
1554 // replace a node on vertex by a node of last (most internal) layer
1555 // in a segment on E
1556 SMDS_ElemIteratorPtr segIt = vertexNode->GetInverseElementIterator( SMDSAbs_Edge );
1557 const SMDS_MeshNode* segNodes[3];
1558 while ( segIt->more() )
1560 const SMDS_MeshElement* segment = segIt->next();
1561 if ( segment->getshapeId() != edgeID ) continue;
1563 const int nbNodes = segment->NbNodes();
1564 for ( int i = 0; i < nbNodes; ++i )
1566 const SMDS_MeshNode* n = segment->GetNode( i );
1567 segNodes[ i ] = ( n == vertexNode ? layersNode.back() : n );
1569 getMeshDS()->ChangeElementNodes( segment, segNodes, nbNodes );
1572 nodeDataVec[ iPEnd ].node = layersNode.back();
1574 } // loop on the extremities of L
1576 // Shrink edges to fit in between the layers at EDGE ends
1578 double newLength = GCPnts_AbscissaPoint::Length( curve, u1, u2 );
1579 double lenRatio = newLength / edgeLen * ( edgeReversed ? -1. : 1. );
1580 for ( size_t iP = 1; iP < nodeDataVec.size()-1; ++iP )
1582 const SMDS_MeshNode* oldNode = nodeDataVec[iP].node;
1584 GCPnts_AbscissaPoint discret( curve, segLengths[iP-1] * lenRatio, u1 );
1585 if ( !discret.IsDone() )
1586 throw SALOME_Exception(LOCALIZED("GCPnts_AbscissaPoint failed"));
1588 nodeDataVec[iP].param = discret.Parameter();
1589 if ( oldNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_EDGE )
1590 throw SALOME_Exception(SMESH_Comment("ViscousBuilder2D: not SMDS_TOP_EDGE node position: ")
1591 << oldNode->GetPosition()->GetTypeOfPosition()
1592 << " of node " << oldNode->GetID());
1593 SMDS_EdgePosition* pos = static_cast<SMDS_EdgePosition*>( oldNode->GetPosition() );
1594 pos->SetUParameter( nodeDataVec[iP].param );
1596 gp_Pnt newP = curve.Value( nodeDataVec[iP].param );
1597 getMeshDS()->MoveNode( oldNode, newP.X(), newP.Y(), newP.Z() );
1599 gp_Pnt2d newUV = pcurve->Value( nodeDataVec[iP].param ).XY();
1600 nodeDataVec[iP].u = newUV.X();
1601 nodeDataVec[iP].v = newUV.Y();
1602 nodeDataVec[iP].normParam = segLengths[iP-1] / edgeLen;
1603 // nodeDataVec[iP].x = segLengths[iP-1] / edgeLen;
1604 // nodeDataVec[iP].y = segLengths[iP-1] / edgeLen;
1607 // Add nodeDataForAdjacent to nodeDataVec
1609 if ( !nodeDataForAdjacent.empty() )
1611 const double par1 = isRShrinkedForAdjacent ? u2 : uf;
1612 const double par2 = isRShrinkedForAdjacent ? ul : u1;
1613 const double shrinkLen = GCPnts_AbscissaPoint::Length( curve, par1, par2 );
1615 // compute new normParam for nodeDataVec
1616 for ( size_t iP = 0; iP < nodeDataVec.size()-1; ++iP )
1617 nodeDataVec[iP+1].normParam = segLengths[iP] / ( edgeLen + shrinkLen );
1618 double normDelta = 1 - nodeDataVec.back().normParam;
1619 if ( !isRShrinkedForAdjacent )
1620 for ( size_t iP = 0; iP < nodeDataVec.size(); ++iP )
1621 nodeDataVec[iP].normParam += normDelta;
1623 // compute new normParam for nodeDataForAdjacent
1624 const double deltaR = isRShrinkedForAdjacent ? nodeDataVec.back().normParam : 0;
1625 for ( size_t iP = !isRShrinkedForAdjacent; iP < nodeDataForAdjacent.size(); ++iP )
1627 double lenFromPar1 =
1628 GCPnts_AbscissaPoint::Length( curve, par1, nodeDataForAdjacent[iP].param );
1629 nodeDataForAdjacent[iP].normParam = deltaR + normDelta * lenFromPar1 / shrinkLen;
1631 // concatenate nodeDataVec and nodeDataForAdjacent
1632 nodeDataVec.insert(( isRShrinkedForAdjacent ? nodeDataVec.end() : nodeDataVec.begin() ),
1633 nodeDataForAdjacent.begin(), nodeDataForAdjacent.end() );
1636 // Extend nodeDataVec by a node located at the end of not shared _LayerEdge
1637 /* n - to add to nodeDataVec
1646 for ( int isR = 0; isR < 2; ++isR )
1648 _PolyLine& L2 = *( isR ? L._rightLine : L._leftLine ); // line with layers
1649 if ( ! L2._advancable || L.IsCommonEdgeShared( L2 ) )
1651 vector< const SMDS_MeshNode* >& layerNodes2 = isR ? L2._leftNodes : L2._rightNodes;
1652 _LayerEdge& LE2 = isR ? L2._lEdges.front() : L2._lEdges.back();
1653 if ( layerNodes2.empty() )
1655 // refine the not shared _LayerEdge
1656 vector<double> layersHeight;
1657 calcLayersHeight( LE2._length2D, layersHeight );
1659 vector<gp_XY>& nodeUV2 = LE2._uvRefined;
1660 nodeUV2.resize ( _hyp->GetNumberLayers() );
1661 layerNodes2.resize( _hyp->GetNumberLayers() );
1662 for ( size_t i = 0; i < layersHeight.size(); ++i )
1664 gp_XY uv = LE2._uvOut + LE2._normal2D * layersHeight[i];
1665 gp_Pnt p = _surface->Value( uv.X(), uv.Y() );
1667 layerNodes2[ i ] = _helper.AddNode( p.X(), p.Y(), p.Z(), /*id=*/0, uv.X(), uv.Y() );
1670 UVPtStruct ptOfNode;
1671 ptOfNode.u = LE2._uvRefined.back().X();
1672 ptOfNode.v = LE2._uvRefined.back().Y();
1673 ptOfNode.node = layerNodes2.back();
1674 ptOfNode.param = isR ? ul : uf;
1675 ptOfNode.normParam = isR ? 1 : 0;
1677 nodeDataVec.insert(( isR ? nodeDataVec.end() : nodeDataVec.begin() ), ptOfNode );
1679 // recompute normParam of nodes in nodeDataVec
1680 newLength = GCPnts_AbscissaPoint::Length( curve,
1681 nodeDataVec.front().param,
1682 nodeDataVec.back().param);
1683 for ( size_t iP = 1; iP < nodeDataVec.size(); ++iP )
1685 const double len = GCPnts_AbscissaPoint::Length( curve,
1686 nodeDataVec.front().param,
1687 nodeDataVec[iP].param );
1688 nodeDataVec[iP].normParam = len / newLength;
1692 // create a proxy sub-mesh containing the moved nodes
1693 _ProxyMeshOfFace::_EdgeSubMesh* edgeSM = getProxyMesh()->GetEdgeSubMesh( edgeID );
1694 edgeSM->SetUVPtStructVec( nodeDataVec );
1696 // set a sub-mesh event listener to remove just created edges when
1697 // "ViscousLayers2D" hypothesis is modified
1698 VISCOUS_3D::ToClearSubWithMain( _mesh->GetSubMesh( E ), _face );
1700 } // loop on _polyLineVec
1705 //================================================================================
1707 * \brief Returns true if there will be a shrinked mesh on EDGE E of FACE adjFace
1710 //================================================================================
1712 bool _ViscousBuilder2D::toShrinkForAdjacent( const TopoDS_Face& adjFace,
1713 const TopoDS_Edge& E,
1714 const TopoDS_Vertex& V)
1716 if ( const StdMeshers_ViscousLayers2D* vlHyp = findHyp( *_mesh, adjFace ))
1718 VISCOUS_2D::_ViscousBuilder2D builder( *_mesh, adjFace, vlHyp );
1719 builder._faceSideVec = StdMeshers_FaceSide::GetFaceWires( adjFace, *_mesh, true, _error );
1720 builder.findEdgesWithLayers();
1722 PShapeIteratorPtr edgeIt = _helper.GetAncestors( V, *_mesh, TopAbs_EDGE );
1723 while ( const TopoDS_Shape* edgeAtV = edgeIt->next() )
1725 if ( !edgeAtV->IsSame( E ) &&
1726 _helper.IsSubShape( *edgeAtV, adjFace ) &&
1727 !builder._ignoreShapeIds.count( getMeshDS()->ShapeToIndex( *edgeAtV )))
1736 //================================================================================
1740 //================================================================================
1742 bool _ViscousBuilder2D::refine()
1744 // store a proxyMesh in a sub-mesh
1745 // make faces on each _PolyLine
1746 vector< double > layersHeight;
1747 double prevLen2D = -1;
1748 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1750 _PolyLine& L = _polyLineVec[ iL ];
1751 if ( !L._advancable ) continue;
1753 // replace an inactive (1st) _LayerEdge with an active one of a neighbour _PolyLine
1754 size_t iLE = 0, nbLE = L._lEdges.size();
1755 const bool leftEdgeShared = L.IsCommonEdgeShared( *L._leftLine );
1756 const bool rightEdgeShared = L.IsCommonEdgeShared( *L._rightLine );
1757 if ( /*!L._leftLine->_advancable &&*/ leftEdgeShared )
1759 L._lEdges[0] = L._leftLine->_lEdges.back();
1760 iLE += int( !L._leftLine->_advancable );
1762 if ( !L._rightLine->_advancable && rightEdgeShared )
1764 L._lEdges.back() = L._rightLine->_lEdges[0];
1768 // limit length of neighbour _LayerEdge's to avoid sharp change of layers thickness
1769 vector< double > segLen( L._lEdges.size() );
1771 for ( size_t i = 1; i < segLen.size(); ++i )
1773 // accumulate length of segments
1774 double sLen = (L._lEdges[i-1]._uvOut - L._lEdges[i]._uvOut ).Modulus();
1775 segLen[i] = segLen[i-1] + sLen;
1777 for ( int isR = 0; isR < 2; ++isR )
1779 size_t iF = 0, iL = L._lEdges.size()-1;
1780 size_t *i = isR ? &iL : &iF;
1782 _LayerEdge* prevLE = & L._lEdges[ *i ];
1784 for ( ++iF, --iL; iF < L._lEdges.size()-1; ++iF, --iL )
1786 _LayerEdge& LE = L._lEdges[*i];
1787 if ( prevLE->_length2D > 0 ) {
1788 gp_XY tangent ( LE._normal2D.Y(), -LE._normal2D.X() );
1789 weight += Abs( tangent * ( prevLE->_uvIn - LE._uvIn )) / segLen.back();
1790 gp_XY prevTang = ( LE._uvOut - prevLE->_uvOut );
1791 gp_XY prevNorm = gp_XY( -prevTang.Y(), prevTang.X() );
1792 double prevProj = prevNorm * ( prevLE->_uvIn - prevLE->_uvOut );
1793 if ( prevProj > 0 ) {
1794 prevProj /= prevTang.Modulus();
1795 if ( LE._length2D < prevProj )
1796 weight += 0.75 * ( 1 - weight ); // length decrease is more preferable
1797 LE._length2D = weight * LE._length2D + ( 1 - weight ) * prevProj;
1798 LE._uvIn = LE._uvOut + LE._normal2D * LE._length2D;
1805 // calculate intermediate UV on _LayerEdge's ( _LayerEdge::_uvRefined )
1806 for ( ; iLE < nbLE; ++iLE )
1808 _LayerEdge& LE = L._lEdges[iLE];
1809 if ( fabs( LE._length2D - prevLen2D ) > LE._length2D / 100. )
1811 calcLayersHeight( LE._length2D, layersHeight );
1812 prevLen2D = LE._length2D;
1814 for ( size_t i = 0; i < layersHeight.size(); ++i )
1815 LE._uvRefined.push_back( LE._uvOut + LE._normal2D * layersHeight[i] );
1818 // nodes to create 1 layer of faces
1819 vector< const SMDS_MeshNode* > outerNodes( L._lastPntInd - L._firstPntInd + 1 );
1820 vector< const SMDS_MeshNode* > innerNodes( L._lastPntInd - L._firstPntInd + 1 );
1822 // initialize outerNodes by node on the L._wire
1823 const vector<UVPtStruct>& points = L._wire->GetUVPtStruct();
1824 for ( int i = L._firstPntInd; i <= L._lastPntInd; ++i )
1825 outerNodes[ i-L._firstPntInd ] = points[i].node;
1827 // compute normalized [0;1] node parameters of outerNodes
1828 vector< double > normPar( L._lastPntInd - L._firstPntInd + 1 );
1830 normF = L._wire->FirstParameter( L._edgeInd ),
1831 normL = L._wire->LastParameter ( L._edgeInd ),
1832 normDist = normL - normF;
1833 for ( int i = L._firstPntInd; i <= L._lastPntInd; ++i )
1834 normPar[ i - L._firstPntInd ] = ( points[i].normParam - normF ) / normDist;
1836 // Create layers of faces
1838 bool hasLeftNode = ( !L._leftLine->_rightNodes.empty() && leftEdgeShared );
1839 bool hasRightNode = ( !L._rightLine->_leftNodes.empty() && rightEdgeShared );
1840 bool hasOwnLeftNode = ( !L._leftNodes.empty() );
1841 bool hasOwnRightNode = ( !L._rightNodes.empty() );
1843 iN0 = ( hasLeftNode || hasOwnLeftNode || _polyLineVec.size() == 1 ),
1844 nbN = innerNodes.size() - ( hasRightNode || hasOwnRightNode );
1845 L._leftNodes .reserve( _hyp->GetNumberLayers() );
1846 L._rightNodes.reserve( _hyp->GetNumberLayers() );
1847 for ( int iF = 0; iF < _hyp->GetNumberLayers(); ++iF ) // loop on layers of faces
1849 // get accumulated length of intermediate segments
1850 for ( iS = 1; iS < segLen.size(); ++iS )
1852 double sLen = (L._lEdges[iS-1]._uvRefined[iF] - L._lEdges[iS]._uvRefined[iF] ).Modulus();
1853 segLen[iS] = segLen[iS-1] + sLen;
1855 // normalize the accumulated length
1856 for ( iS = 1; iS < segLen.size(); ++iS )
1857 segLen[iS] /= segLen.back();
1859 // create innerNodes of a current layer
1861 for ( size_t i = iN0; i < nbN; ++i )
1863 while ( normPar[i] > segLen[iS+1] )
1865 double r = ( normPar[i] - segLen[iS] ) / ( segLen[iS+1] - segLen[iS] );
1866 gp_XY uv = r * L._lEdges[iS+1]._uvRefined[iF] + (1-r) * L._lEdges[iS]._uvRefined[iF];
1867 gp_Pnt p = _surface->Value( uv.X(), uv.Y() );
1868 innerNodes[i] = _helper.AddNode( p.X(), p.Y(), p.Z(), /*id=*/0, uv.X(), uv.Y() );
1870 // use nodes created for adjacent _PolyLine's
1871 if ( hasOwnLeftNode ) innerNodes.front() = L._leftNodes [ iF ];
1872 else if ( hasLeftNode ) innerNodes.front() = L._leftLine->_rightNodes[ iF ];
1873 if ( hasOwnRightNode ) innerNodes.back() = L._rightNodes[ iF ];
1874 else if ( hasRightNode ) innerNodes.back() = L._rightLine->_leftNodes[ iF ];
1875 if ( _polyLineVec.size() == 1 ) innerNodes.front() = innerNodes.back(); // circle
1876 if ( !hasOwnLeftNode ) L._leftNodes.push_back( innerNodes.front() );
1877 if ( !hasOwnRightNode ) L._rightNodes.push_back( innerNodes.back() );
1880 // TODO care of orientation
1881 for ( size_t i = 1; i < innerNodes.size(); ++i )
1882 if ( SMDS_MeshElement* f = _helper.AddFace( outerNodes[ i-1 ], outerNodes[ i ],
1883 innerNodes[ i ], innerNodes[ i-1 ]))
1884 L._newFaces.insert( L._newFaces.end(), f );
1886 outerNodes.swap( innerNodes );
1888 // faces between not shared _LayerEdge's (at concave VERTEX)
1889 for ( int isR = 0; isR < 2; ++isR )
1891 if ( isR ? rightEdgeShared : leftEdgeShared )
1893 vector< const SMDS_MeshNode* > &
1894 lNodes = (isR ? L._rightNodes : L._leftLine->_rightNodes ),
1895 rNodes = (isR ? L._rightLine->_leftNodes : L._leftNodes );
1896 if ( lNodes.empty() || rNodes.empty() || lNodes.size() != rNodes.size() )
1899 for ( size_t i = 1; i < lNodes.size(); ++i )
1900 _helper.AddFace( lNodes[ i-1 ], rNodes[ i-1 ],
1901 rNodes[ i ], lNodes[ i ]);
1903 const UVPtStruct& ptOnVertex = points[ isR ? L._lastPntInd : L._firstPntInd ];
1904 _helper.AddFace( ptOnVertex.node, rNodes[ 0 ], lNodes[ 0 ]);
1907 // Fill the _ProxyMeshOfFace
1909 UVPtStructVec nodeDataVec( outerNodes.size() ); // outerNodes swapped with innerNodes
1910 for ( size_t i = 0; i < outerNodes.size(); ++i )
1912 gp_XY uv = _helper.GetNodeUV( _face, outerNodes[i] );
1913 nodeDataVec[i].u = uv.X();
1914 nodeDataVec[i].v = uv.Y();
1915 nodeDataVec[i].node = outerNodes[i];
1916 nodeDataVec[i].param = points [i + L._firstPntInd].param;
1917 nodeDataVec[i].normParam = normPar[i];
1918 nodeDataVec[i].x = normPar[i];
1919 nodeDataVec[i].y = normPar[i];
1921 nodeDataVec.front().param = L._wire->FirstU( L._edgeInd );
1922 nodeDataVec.back() .param = L._wire->LastU ( L._edgeInd );
1924 _ProxyMeshOfFace::_EdgeSubMesh* edgeSM
1925 = getProxyMesh()->GetEdgeSubMesh( L._wire->EdgeID( L._edgeInd ));
1926 edgeSM->SetUVPtStructVec( nodeDataVec );
1928 } // loop on _PolyLine's
1933 //================================================================================
1935 * \brief Improve quality of the created mesh elements
1937 //================================================================================
1939 bool _ViscousBuilder2D::improve()
1944 // fixed nodes on EDGE's
1945 std::set<const SMDS_MeshNode*> fixedNodes;
1946 for ( size_t iWire = 0; iWire < _faceSideVec.size(); ++iWire )
1948 StdMeshers_FaceSidePtr wire = _faceSideVec[ iWire ];
1949 const vector<UVPtStruct>& points = wire->GetUVPtStruct();
1950 for ( size_t i = 0; i < points.size(); ++i )
1951 fixedNodes.insert( fixedNodes.end(), points[i].node );
1953 // fixed proxy nodes
1954 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1956 _PolyLine& L = _polyLineVec[ iL ];
1957 const TopoDS_Edge& E = L._wire->Edge( L._edgeInd );
1958 if ( const SMESH_ProxyMesh::SubMesh* sm = _proxyMesh->GetProxySubMesh( E ))
1960 const UVPtStructVec& points = sm->GetUVPtStructVec();
1961 for ( size_t i = 0; i < points.size(); ++i )
1962 fixedNodes.insert( fixedNodes.end(), points[i].node );
1964 for ( size_t i = 0; i < L._rightNodes.size(); ++i )
1965 fixedNodes.insert( fixedNodes.end(), L._rightNodes[i] );
1969 SMESH_MeshEditor editor( _mesh );
1970 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1972 _PolyLine& L = _polyLineVec[ iL ];
1973 if ( L._isStraight2D ) continue;
1974 // SMESH_MeshEditor::SmoothMethod how =
1975 // L._isStraight2D ? SMESH_MeshEditor::LAPLACIAN : SMESH_MeshEditor::CENTROIDAL;
1976 //editor.Smooth( L._newFaces, fixedNodes, how, /*nbIt = */3 );
1977 //editor.Smooth( L._newFaces, fixedNodes, SMESH_MeshEditor::LAPLACIAN, /*nbIt = */1 );
1978 editor.Smooth( L._newFaces, fixedNodes, SMESH_MeshEditor::CENTROIDAL, /*nbIt = */3 );
1983 //================================================================================
1985 * \brief Remove elements and nodes from a face
1987 //================================================================================
1989 bool _ViscousBuilder2D::removeMeshFaces(const TopoDS_Shape& face)
1991 // we don't use SMESH_subMesh::ComputeStateEngine() because of a listener
1992 // which clears EDGEs together with _face.
1993 bool thereWereElems = false;
1994 SMESH_subMesh* sm = _mesh->GetSubMesh( face );
1995 if ( SMESHDS_SubMesh* smDS = sm->GetSubMeshDS() )
1997 SMDS_ElemIteratorPtr eIt = smDS->GetElements();
1998 thereWereElems = eIt->more();
1999 while ( eIt->more() ) getMeshDS()->RemoveFreeElement( eIt->next(), smDS );
2000 SMDS_NodeIteratorPtr nIt = smDS->GetNodes();
2001 while ( nIt->more() ) getMeshDS()->RemoveFreeNode( nIt->next(), smDS );
2003 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
2005 return thereWereElems;
2008 //================================================================================
2010 * \brief Creates a _ProxyMeshOfFace and store it in a sub-mesh of FACE
2012 //================================================================================
2014 _ProxyMeshOfFace* _ViscousBuilder2D::getProxyMesh()
2016 if ( _proxyMesh.get() )
2017 return (_ProxyMeshOfFace*) _proxyMesh.get();
2019 _ProxyMeshOfFace* proxyMeshOfFace = new _ProxyMeshOfFace( *_mesh );
2020 _proxyMesh.reset( proxyMeshOfFace );
2021 new _ProxyMeshHolder( _face, _proxyMesh );
2023 return proxyMeshOfFace;
2026 //================================================================================
2028 * \brief Calculate height of layers for the given thickness. Height is measured
2029 * from the outer boundary
2031 //================================================================================
2033 void _ViscousBuilder2D::calcLayersHeight(const double totalThick,
2034 vector<double>& heights)
2036 heights.resize( _hyp->GetNumberLayers() );
2038 if ( _fPowN - 1 <= numeric_limits<double>::min() )
2039 h0 = totalThick / _hyp->GetNumberLayers();
2041 h0 = totalThick * ( _hyp->GetStretchFactor() - 1 )/( _fPowN - 1 );
2043 double hSum = 0, hi = h0;
2044 for ( int i = 0; i < _hyp->GetNumberLayers(); ++i )
2047 heights[ i ] = hSum;
2048 hi *= _hyp->GetStretchFactor();
2052 //================================================================================
2054 * \brief Elongate this _LayerEdge
2056 //================================================================================
2058 bool _LayerEdge::SetNewLength( const double length3D )
2060 if ( _isBlocked ) return false;
2062 //_uvInPrev = _uvIn;
2063 _length2D = length3D * _len2dTo3dRatio;
2064 _uvIn = _uvOut + _normal2D * _length2D;
2068 //================================================================================
2070 * \brief Return true if _LayerEdge at a common VERTEX between EDGEs with
2071 * and w/o layer is common to the both _PolyLine's. If this is true, nodes
2072 * of this _LayerEdge are inflated along a _PolyLine w/o layer, else the nodes
2073 * are inflated along _normal2D of _LayerEdge of EDGE with layer
2075 //================================================================================
2077 bool _PolyLine::IsCommonEdgeShared( const _PolyLine& other )
2079 const double tol = 1e-30;
2081 if ( & other == _leftLine )
2082 return _lEdges[0]._normal2D.IsEqual( _leftLine->_lEdges.back()._normal2D, tol );
2084 if ( & other == _rightLine )
2085 return _lEdges.back()._normal2D.IsEqual( _rightLine->_lEdges[0]._normal2D, tol );
2090 //================================================================================
2092 * \brief Constructor of SegmentTree
2094 //================================================================================
2096 _SegmentTree::_SegmentTree( const vector< _Segment >& segments ):
2099 _segments.resize( segments.size() );
2100 for ( size_t i = 0; i < segments.size(); ++i )
2101 _segments[i].Set( segments[i] );
2106 //================================================================================
2108 * \brief Return the maximal bnd box
2110 //================================================================================
2112 _SegmentTree::box_type* _SegmentTree::buildRootBox()
2114 _SegmentTree::box_type* box = new _SegmentTree::box_type;
2115 for ( size_t i = 0; i < _segments.size(); ++i )
2117 box->Add( *_segments[i]._seg->_uv[0] );
2118 box->Add( *_segments[i]._seg->_uv[1] );
2123 //================================================================================
2125 * \brief Redistrubute _segments among children
2127 //================================================================================
2129 void _SegmentTree::buildChildrenData()
2131 for ( int i = 0; i < _segments.size(); ++i )
2132 for (int j = 0; j < nbChildren(); j++)
2133 if ( !myChildren[j]->getBox()->IsOut( *_segments[i]._seg->_uv[0],
2134 *_segments[i]._seg->_uv[1] ))
2135 ((_SegmentTree*)myChildren[j])->_segments.push_back( _segments[i]);
2137 SMESHUtils::FreeVector( _segments ); // = _elements.clear() + free memory
2139 for (int j = 0; j < nbChildren(); j++)
2141 _SegmentTree* child = static_cast<_SegmentTree*>( myChildren[j]);
2142 child->myIsLeaf = ( child->_segments.size() <= maxNbSegInLeaf() );
2146 //================================================================================
2148 * \brief Return elements which can include the point
2150 //================================================================================
2152 void _SegmentTree::GetSegmentsNear( const _Segment& seg,
2153 vector< const _Segment* >& found )
2155 if ( getBox()->IsOut( *seg._uv[0], *seg._uv[1] ))
2160 for ( int i = 0; i < _segments.size(); ++i )
2161 if ( !_segments[i].IsOut( seg ))
2162 found.push_back( _segments[i]._seg );
2166 for (int i = 0; i < nbChildren(); i++)
2167 ((_SegmentTree*) myChildren[i])->GetSegmentsNear( seg, found );
2172 //================================================================================
2174 * \brief Return segments intersecting a ray
2176 //================================================================================
2178 void _SegmentTree::GetSegmentsNear( const gp_Ax2d& ray,
2179 vector< const _Segment* >& found )
2181 if ( getBox()->IsOut( ray ))
2186 for ( int i = 0; i < _segments.size(); ++i )
2187 if ( !_segments[i].IsOut( ray ))
2188 found.push_back( _segments[i]._seg );
2192 for (int i = 0; i < nbChildren(); i++)
2193 ((_SegmentTree*) myChildren[i])->GetSegmentsNear( ray, found );
2197 //================================================================================
2199 * \brief Classify a _Segment
2201 //================================================================================
2203 bool _SegmentTree::_SegBox::IsOut( const _Segment& seg ) const
2205 const double eps = std::numeric_limits<double>::min();
2206 for ( int iC = 0; iC < 2; ++iC )
2208 if ( seg._uv[0]->Coord(iC+1) < _seg->_uv[ _iMin[iC]]->Coord(iC+1)+eps &&
2209 seg._uv[1]->Coord(iC+1) < _seg->_uv[ _iMin[iC]]->Coord(iC+1)+eps )
2211 if ( seg._uv[0]->Coord(iC+1) > _seg->_uv[ 1-_iMin[iC]]->Coord(iC+1)-eps &&
2212 seg._uv[1]->Coord(iC+1) > _seg->_uv[ 1-_iMin[iC]]->Coord(iC+1)-eps )
2218 //================================================================================
2220 * \brief Classify a ray
2222 //================================================================================
2224 bool _SegmentTree::_SegBox::IsOut( const gp_Ax2d& ray ) const
2226 double distBoxCenter2Ray =
2227 ray.Direction().XY() ^ ( ray.Location().XY() - 0.5 * (*_seg->_uv[0] + *_seg->_uv[1]));
2229 double boxSectionDiam =
2230 Abs( ray.Direction().X() ) * ( _seg->_uv[1-_iMin[1]]->Y() - _seg->_uv[_iMin[1]]->Y() ) +
2231 Abs( ray.Direction().Y() ) * ( _seg->_uv[1-_iMin[0]]->X() - _seg->_uv[_iMin[0]]->X() );
2233 return Abs( distBoxCenter2Ray ) > 0.5 * boxSectionDiam;