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>
91 //================================================================================
96 //--------------------------------------------------------------------------------
98 * \brief Proxy Mesh of FACE with viscous layers. It's needed only to
99 * redefine newSubmesh().
101 struct _ProxyMeshOfFace : public SMESH_ProxyMesh
103 //---------------------------------------------------
104 // Proxy sub-mesh of an EDGE. It contains nodes in _uvPtStructVec.
105 struct _EdgeSubMesh : public SMESH_ProxyMesh::SubMesh
107 _EdgeSubMesh(int index=0): SubMesh(index) {}
108 //virtual int NbElements() const { return _elements.size()+1; }
109 virtual int NbNodes() const { return Max( 0, _uvPtStructVec.size()-2 ); }
110 void SetUVPtStructVec(UVPtStructVec& vec) { _uvPtStructVec.swap( vec ); }
112 _ProxyMeshOfFace(const SMESH_Mesh& mesh): SMESH_ProxyMesh(mesh) {}
113 _EdgeSubMesh* GetEdgeSubMesh(int ID) { return (_EdgeSubMesh*) getProxySubMesh(ID); }
114 virtual SubMesh* newSubmesh(int index=0) const { return new _EdgeSubMesh(index); }
116 //--------------------------------------------------------------------------------
118 * \brief SMESH_subMeshEventListener used to store _ProxyMeshOfFace, computed
119 * by _ViscousBuilder2D, in a SMESH_subMesh of the FACE.
120 * This is to delete _ProxyMeshOfFace when StdMeshers_ViscousLayers2D
121 * hypothesis is modified
123 struct _ProxyMeshHolder : public SMESH_subMeshEventListener
125 _ProxyMeshHolder( const TopoDS_Face& face,
126 SMESH_ProxyMesh::Ptr& mesh)
127 : SMESH_subMeshEventListener( /*deletable=*/true, Name() )
129 SMESH_subMesh* faceSM = mesh->GetMesh()->GetSubMesh( face );
130 faceSM->SetEventListener( this, new _Data( mesh ), faceSM );
132 // Finds a proxy mesh of face
133 static SMESH_ProxyMesh::Ptr FindProxyMeshOfFace( const TopoDS_Shape& face,
136 SMESH_ProxyMesh::Ptr proxy;
137 SMESH_subMesh* faceSM = mesh.GetSubMesh( face );
138 if ( EventListenerData* ld = faceSM->GetEventListenerData( Name() ))
139 proxy = static_cast< _Data* >( ld )->_mesh;
143 void ProcessEvent(const int event,
145 SMESH_subMesh* subMesh,
146 EventListenerData* data,
147 const SMESH_Hypothesis* /*hyp*/)
149 if ( event == SMESH_subMesh::CLEAN && eventType == SMESH_subMesh::COMPUTE_EVENT)
150 ((_Data*) data)->_mesh.reset();
153 // holder of a proxy mesh
154 struct _Data : public SMESH_subMeshEventListenerData
156 SMESH_ProxyMesh::Ptr _mesh;
157 _Data( SMESH_ProxyMesh::Ptr& mesh )
158 :SMESH_subMeshEventListenerData( /*isDeletable=*/true), _mesh( mesh )
161 // Returns identifier string
162 static const char* Name() { return "VISCOUS_2D::_ProxyMeshHolder"; }
166 //--------------------------------------------------------------------------------
168 * \brief Segment connecting inner ends of two _LayerEdge's.
172 const gp_XY* _uv[2]; // poiter to _LayerEdge::_uvIn
173 int _indexInLine; // position in _PolyLine
176 _Segment(const gp_XY& p1, const gp_XY& p2):_indexInLine(-1) { _uv[0] = &p1; _uv[1] = &p2; }
177 const gp_XY& p1() const { return *_uv[0]; }
178 const gp_XY& p2() const { return *_uv[1]; }
180 //--------------------------------------------------------------------------------
182 * \brief Tree of _Segment's used for a faster search of _Segment's.
184 struct _SegmentTree : public SMESH_Quadtree
186 typedef boost::shared_ptr< _SegmentTree > Ptr;
188 _SegmentTree( const vector< _Segment >& segments );
189 void GetSegmentsNear( const _Segment& seg, vector< const _Segment* >& found );
190 void GetSegmentsNear( const gp_Ax2d& ray, vector< const _Segment* >& found );
193 _SegmentTree* newChild() const { return new _SegmentTree; }
194 void buildChildrenData();
195 Bnd_B2d* buildRootBox();
197 static int maxNbSegInLeaf() { return 5; }
200 const _Segment* _seg;
202 void Set( const _Segment& seg )
205 _iMin[0] = ( seg._uv[1]->X() < seg._uv[0]->X() );
206 _iMin[1] = ( seg._uv[1]->Y() < seg._uv[0]->Y() );
208 bool IsOut( const _Segment& seg ) const;
209 bool IsOut( const gp_Ax2d& ray ) const;
211 vector< _SegBox > _segments;
213 //--------------------------------------------------------------------------------
215 * \brief Edge normal to FACE boundary, connecting a point on EDGE (_uvOut)
216 * and a point of a layer internal boundary (_uvIn)
220 gp_XY _uvOut; // UV on the FACE boundary
221 gp_XY _uvIn; // UV inside the FACE
222 double _length2D; // distance between _uvOut and _uvIn
224 bool _isBlocked;// is more inflation possible or not
226 gp_XY _normal2D; // to pcurve
227 double _len2dTo3dRatio; // to pass 2D <--> 3D
228 gp_Ax2d _ray; // a ray starting at _uvOut
230 vector<gp_XY> _uvRefined; // divisions by layers
232 bool SetNewLength( const double length );
234 //--------------------------------------------------------------------------------
236 * \brief Poly line composed of _Segment's of one EDGE.
237 * It's used to detect intersection of inflated layers by intersecting
242 StdMeshers_FaceSide* _wire;
243 int _edgeInd; // index of my EDGE in _wire
244 bool _advancable; // true if there is a viscous layer on my EDGE
245 _PolyLine* _leftLine; // lines of neighbour EDGE's
246 _PolyLine* _rightLine;
247 int _firstPntInd; // index in vector<UVPtStruct> of _wire
250 vector< _LayerEdge > _lEdges; /* _lEdges[0] is usually is not treated
251 as it is equal to the last one of the _leftLine */
252 vector< _Segment > _segments; // segments connecting _uvIn's of _lEdges
253 _SegmentTree::Ptr _segTree;
255 vector< _PolyLine* > _reachableLines; // lines able to interfere with my layer
257 vector< const SMDS_MeshNode* > _leftNodes; // nodes built from a left VERTEX
258 vector< const SMDS_MeshNode* > _rightNodes; // nodes built from a right VERTEX
260 typedef vector< _Segment >::iterator TSegIterator;
261 typedef vector< _LayerEdge >::iterator TEdgeIterator;
263 bool IsCommonEdgeShared( const _PolyLine& other );
264 size_t FirstLEdge() const
266 return ( _leftLine->_advancable && _lEdges.size() > 2 ) ? 1 : 0;
268 bool IsAdjacent( const _Segment& seg, const _LayerEdge* LE=0 ) const
270 if ( LE && seg._indexInLine < _lEdges.size() &&
271 ( seg._uv[0] == & LE->_uvIn ||
272 seg._uv[1] == & LE->_uvIn ))
274 return ( & seg == &_leftLine->_segments.back() ||
275 & seg == &_rightLine->_segments[0] );
278 //--------------------------------------------------------------------------------
280 * \brief Intersector of _Segment's
282 struct _SegmentIntersection
284 gp_XY _vec1, _vec2; // Vec( _seg.p1(), _seg.p2() )
285 gp_XY _vec21; // Vec( _seg2.p1(), _seg1.p1() )
286 double _D; // _vec1.Crossed( _vec2 )
287 double _param1, _param2; // intersection param on _seg1 and _seg2
289 bool Compute(const _Segment& seg1, const _Segment& seg2, bool seg2IsRay = false )
291 _vec1 = seg1.p2() - seg1.p1();
292 _vec2 = seg2.p2() - seg2.p1();
293 _vec21 = seg1.p1() - seg2.p1();
294 _D = _vec1.Crossed(_vec2);
295 if ( fabs(_D) < std::numeric_limits<double>::min())
297 _param1 = _vec2.Crossed(_vec21) / _D;
298 if (_param1 < 0 || _param1 > 1 )
300 _param2 = _vec1.Crossed(_vec21) / _D;
301 if (_param2 < 0 || ( !seg2IsRay && _param2 > 1 ))
305 bool Compute( const _Segment& seg1, const gp_Ax2d& ray )
307 gp_XY segEnd = ray.Location().XY() + ray.Direction().XY();
308 _Segment seg2( ray.Location().XY(), segEnd );
309 return Compute( seg1, seg2, true );
311 //gp_XY GetPoint() { return _seg1.p1() + _param1 * _vec1; }
313 //--------------------------------------------------------------------------------
315 typedef map< const SMDS_MeshNode*, _LayerEdge*, TIDCompare > TNode2Edge;
317 //--------------------------------------------------------------------------------
319 * \brief Builder of viscous layers
321 class _ViscousBuilder2D
324 _ViscousBuilder2D(SMESH_Mesh& theMesh,
325 const TopoDS_Face& theFace,
326 const StdMeshers_ViscousLayers2D* theHyp);
327 SMESH_ComputeErrorPtr GetError() const { return _error; }
329 SMESH_ProxyMesh::Ptr Compute();
333 bool findEdgesWithLayers();
334 bool makePolyLines();
336 bool fixCollisions();
339 bool toShrinkForAdjacent( const TopoDS_Face& adjFace,
340 const TopoDS_Edge& E,
341 const TopoDS_Vertex& V);
342 void setLenRatio( _LayerEdge& LE, const gp_Pnt& pOut );
343 void adjustCommonEdge( _PolyLine& LL, _PolyLine& LR );
344 void calcLayersHeight(const double totalThick,
345 vector<double>& heights);
346 bool removeMeshFaces(const TopoDS_Shape& face);
348 bool error( const string& text );
349 SMESHDS_Mesh* getMeshDS() { return _mesh->GetMeshDS(); }
350 _ProxyMeshOfFace* getProxyMesh();
353 //void makeGroupOfLE();
360 const StdMeshers_ViscousLayers2D* _hyp;
363 SMESH_ProxyMesh::Ptr _proxyMesh;
364 SMESH_ComputeErrorPtr _error;
367 Handle(Geom_Surface) _surface;
368 SMESH_MesherHelper _helper;
369 TSideVector _faceSideVec; // wires (StdMeshers_FaceSide) of _face
370 vector<_PolyLine> _polyLineVec; // fronts to advance
372 double _fPowN; // to compute thickness of layers
373 double _thickness; // required or possible layers thickness
375 // sub-shapes of _face
376 set<TGeomID> _ignoreShapeIds; // ids of EDGEs w/o layers
377 set<TGeomID> _noShrinkVert; // ids of VERTEXes that are extremities
378 // of EDGEs along which _LayerEdge can't be inflated because no viscous layers
379 // defined on neighbour FACEs sharing an EDGE. Nonetheless _LayerEdge's
380 // are inflated along such EDGEs but then such _LayerEdge's are turned into
381 // a node on VERTEX, i.e. all nodes on a _LayerEdge are melded into one node.
385 //================================================================================
387 * \brief Returns StdMeshers_ViscousLayers2D for the FACE
389 const StdMeshers_ViscousLayers2D* findHyp(SMESH_Mesh& theMesh,
390 const TopoDS_Face& theFace)
392 SMESH_HypoFilter hypFilter
393 ( SMESH_HypoFilter::HasName( StdMeshers_ViscousLayers2D::GetHypType() ));
394 const SMESH_Hypothesis * hyp =
395 theMesh.GetHypothesis( theFace, hypFilter, /*ancestors=*/true );
396 return dynamic_cast< const StdMeshers_ViscousLayers2D* > ( hyp );
399 } // namespace VISCOUS_2D
401 //================================================================================
402 // StdMeshers_ViscousLayers hypothesis
404 StdMeshers_ViscousLayers2D::StdMeshers_ViscousLayers2D(int hypId, int studyId, SMESH_Gen* gen)
405 :StdMeshers_ViscousLayers(hypId, studyId, gen)
407 _name = StdMeshers_ViscousLayers2D::GetHypType();
408 _param_algo_dim = -2; // auxiliary hyp used by 2D algos
410 // --------------------------------------------------------------------------------
411 bool StdMeshers_ViscousLayers2D::SetParametersByMesh(const SMESH_Mesh* theMesh,
412 const TopoDS_Shape& theShape)
417 // --------------------------------------------------------------------------------
419 StdMeshers_ViscousLayers2D::Compute(SMESH_Mesh& theMesh,
420 const TopoDS_Face& theFace)
422 SMESH_ProxyMesh::Ptr pm;
424 const StdMeshers_ViscousLayers2D* vlHyp = VISCOUS_2D::findHyp( theMesh, theFace );
427 VISCOUS_2D::_ViscousBuilder2D builder( theMesh, theFace, vlHyp );
428 pm = builder.Compute();
429 SMESH_ComputeErrorPtr error = builder.GetError();
430 if ( error && !error->IsOK() )
431 theMesh.GetSubMesh( theFace )->GetComputeError() = error;
433 pm.reset( new SMESH_ProxyMesh( theMesh ));
438 pm.reset( new SMESH_ProxyMesh( theMesh ));
442 // --------------------------------------------------------------------------------
443 void StdMeshers_ViscousLayers2D::RestoreListeners() const
445 StudyContextStruct* sc = _gen->GetStudyContext( _studyId );
446 std::map < int, SMESH_Mesh * >::iterator i_smesh = sc->mapMesh.begin();
447 for ( ; i_smesh != sc->mapMesh.end(); ++i_smesh )
449 SMESH_Mesh* smesh = i_smesh->second;
451 !smesh->HasShapeToMesh() ||
452 !smesh->GetMeshDS() ||
453 !smesh->GetMeshDS()->IsUsedHypothesis( this ))
456 // set event listeners to EDGE's of FACE where this hyp is used
457 TopoDS_Shape shape = i_smesh->second->GetShapeToMesh();
458 for ( TopExp_Explorer face( shape, TopAbs_FACE); face.More(); face.Next() )
459 if ( SMESH_Algo* algo = _gen->GetAlgo( *smesh, face.Current() ))
461 const std::list <const SMESHDS_Hypothesis *> & usedHyps =
462 algo->GetUsedHypothesis( *smesh, face.Current(), /*ignoreAuxiliary=*/false );
463 if ( std::find( usedHyps.begin(), usedHyps.end(), this ) != usedHyps.end() )
464 for ( TopExp_Explorer edge( face.Current(), TopAbs_EDGE); edge.More(); edge.Next() )
465 VISCOUS_3D::ToClearSubWithMain( smesh->GetSubMesh( edge.Current() ), face.Current() );
469 // END StdMeshers_ViscousLayers2D hypothesis
470 //================================================================================
472 using namespace VISCOUS_2D;
474 //================================================================================
476 * \brief Constructor of _ViscousBuilder2D
478 //================================================================================
480 _ViscousBuilder2D::_ViscousBuilder2D(SMESH_Mesh& theMesh,
481 const TopoDS_Face& theFace,
482 const StdMeshers_ViscousLayers2D* theHyp):
483 _mesh( &theMesh ), _face( theFace ), _hyp( theHyp ), _helper( theMesh )
485 _helper.SetSubShape( _face );
486 _helper.SetElementsOnShape(true);
488 _surface = BRep_Tool::Surface( theFace );
491 _fPowN = pow( _hyp->GetStretchFactor(), _hyp->GetNumberLayers() );
494 //================================================================================
496 * \brief Stores error description and returns false
498 //================================================================================
500 bool _ViscousBuilder2D::error(const string& text )
502 cout << "_ViscousBuilder2D::error " << text << endl;
503 _error->myName = COMPERR_ALGO_FAILED;
504 _error->myComment = string("Viscous layers builder 2D: ") + text;
505 if ( SMESH_subMesh* sm = _mesh->GetSubMesh( _face ) )
507 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
508 if ( smError && smError->myAlgo )
509 _error->myAlgo = smError->myAlgo;
512 //makeGroupOfLE(); // debug
517 //================================================================================
519 * \brief Does its job
521 //================================================================================
523 SMESH_ProxyMesh::Ptr _ViscousBuilder2D::Compute()
525 _error = SMESH_ComputeError::New(COMPERR_OK);
526 _faceSideVec = StdMeshers_FaceSide::GetFaceWires( _face, *_mesh, true, _error );
527 if ( !_error->IsOK() )
532 if ( !findEdgesWithLayers() ) // analysis of a shape
535 if ( ! makePolyLines() ) // creation of fronts
538 if ( ! inflate() ) // advance fronts
541 if ( !shrink() ) // shrink segments on edges w/o layers
544 if ( ! refine() ) // make faces
547 // for ( size_t i = 0; i < _facesToRecompute.size(); ++i )
548 // _mesh->GetSubMesh( _facesToRecompute[i] )->ComputeStateEngine( SMESH_subMesh::COMPUTE );
550 //makeGroupOfLE(); // debug
551 //debugDump.Finish();
556 //================================================================================
558 * \brief Finds EDGE's to make viscous layers on.
560 //================================================================================
562 bool _ViscousBuilder2D::findEdgesWithLayers()
564 // collect all EDGEs to ignore defined by hyp
565 int nbMyEdgesIgnored = 0;
566 vector<TGeomID> ids = _hyp->GetBndShapesToIgnore();
567 for ( size_t i = 0; i < ids.size(); ++i )
569 const TopoDS_Shape& s = getMeshDS()->IndexToShape( ids[i] );
570 if ( !s.IsNull() && s.ShapeType() == TopAbs_EDGE ) {
571 _ignoreShapeIds.insert( ids[i] );
572 nbMyEdgesIgnored += ( _helper.IsSubShape( s, _face ));
576 // check all EDGEs of the _face
577 int totalNbEdges = 0;
578 for ( size_t iWire = 0; iWire < _faceSideVec.size(); ++iWire )
580 StdMeshers_FaceSidePtr wire = _faceSideVec[ iWire ];
581 totalNbEdges += wire->NbEdges();
582 for ( int iE = 0; iE < wire->NbEdges(); ++iE )
583 if ( _helper.NbAncestors( wire->Edge( iE ), *_mesh, TopAbs_FACE ) > 1 )
585 // ignore internal EDGEs (shared by several FACEs)
586 TGeomID edgeID = getMeshDS()->ShapeToIndex( wire->Edge( iE ));
587 _ignoreShapeIds.insert( edgeID );
589 // check if ends of an EDGE are to be added to _noShrinkVert
590 PShapeIteratorPtr faceIt = _helper.GetAncestors( wire->Edge( iE ), *_mesh, TopAbs_FACE );
591 while ( const TopoDS_Shape* neighbourFace = faceIt->next() )
593 if ( neighbourFace->IsSame( _face )) continue;
594 SMESH_Algo* algo = _mesh->GetGen()->GetAlgo( *_mesh, *neighbourFace );
595 if ( !algo ) continue;
597 const StdMeshers_ViscousLayers2D* viscHyp = 0;
598 const list <const SMESHDS_Hypothesis *> & allHyps =
599 algo->GetUsedHypothesis(*_mesh, *neighbourFace, /*noAuxiliary=*/false);
600 list< const SMESHDS_Hypothesis *>::const_iterator hyp = allHyps.begin();
601 for ( ; hyp != allHyps.end() && !viscHyp; ++hyp )
602 viscHyp = dynamic_cast<const StdMeshers_ViscousLayers2D*>( *hyp );
604 set<TGeomID> neighbourIgnoreEdges;
606 vector<TGeomID> ids = _hyp->GetBndShapesToIgnore();
607 neighbourIgnoreEdges.insert( ids.begin(), ids.end() );
609 for ( int iV = 0; iV < 2; ++iV )
611 TopoDS_Vertex vertex = iV ? wire->LastVertex(iE) : wire->FirstVertex(iE);
613 _noShrinkVert.insert( getMeshDS()->ShapeToIndex( vertex ));
616 PShapeIteratorPtr edgeIt = _helper.GetAncestors( vertex, *_mesh, TopAbs_EDGE );
617 while ( const TopoDS_Shape* edge = edgeIt->next() )
618 if ( !edge->IsSame( wire->Edge( iE )) &&
619 neighbourIgnoreEdges.count( getMeshDS()->ShapeToIndex( *edge )))
620 _noShrinkVert.insert( getMeshDS()->ShapeToIndex( vertex ));
626 return ( nbMyEdgesIgnored < totalNbEdges );
629 //================================================================================
631 * \brief Create the inner front of the viscous layers and prepare data for infation
633 //================================================================================
635 bool _ViscousBuilder2D::makePolyLines()
637 // Create _PolyLines and _LayerEdge's
639 // count total nb of EDGEs to allocate _polyLineVec
641 for ( size_t iWire = 0; iWire < _faceSideVec.size(); ++iWire )
642 nbEdges += _faceSideVec[ iWire ]->NbEdges();
643 _polyLineVec.resize( nbEdges );
645 // Assign data to _PolyLine's
646 // ---------------------------
649 for ( size_t iWire = 0; iWire < _faceSideVec.size(); ++iWire )
651 StdMeshers_FaceSidePtr wire = _faceSideVec[ iWire ];
652 const vector<UVPtStruct>& points = wire->GetUVPtStruct();
653 if ( points.empty() && wire->NbPoints() > 0 )
654 return error("Invalid node parameters on some EDGE");
656 for ( int iE = 0; iE < wire->NbEdges(); ++iE )
658 _PolyLine& L = _polyLineVec[ iPoLine++ ];
659 L._wire = wire.get();
661 L._advancable = !_ignoreShapeIds.count( wire->EdgeID( iE ));
663 int iRight = iPoLine - (( iE+1 < wire->NbEdges() ) ? 0 : wire->NbEdges() );
664 L._rightLine = &_polyLineVec[ iRight ];
665 _polyLineVec[ iRight ]._leftLine = &L;
667 L._firstPntInd = iPnt;
668 double lastNormPar = wire->LastParameter( iE ) - 1e-10;
669 while ( points[ iPnt ].normParam < lastNormPar )
671 L._lastPntInd = iPnt;
672 L._lEdges.resize( L._lastPntInd - L._firstPntInd + 1 );
674 // TODO: add more _LayerEdge's to strongly curved EDGEs
675 // in order not to miss collisions
677 Handle(Geom2d_Curve) pcurve = L._wire->Curve2d( L._edgeInd );
678 gp_Pnt2d uv; gp_Vec2d tangent;
679 for ( int i = L._firstPntInd; i <= L._lastPntInd; ++i )
681 _LayerEdge& lEdge = L._lEdges[ i - L._firstPntInd ];
682 const double u = ( i == L._firstPntInd ? wire->FirstU(iE) : points[ i ].param );
683 pcurve->D1( u , uv, tangent );
685 if ( L._wire->Edge( iE ).Orientation() == TopAbs_REVERSED )
687 lEdge._uvOut = lEdge._uvIn = uv.XY();
688 lEdge._normal2D.SetCoord( -tangent.Y(), tangent.X() );
689 lEdge._ray.SetLocation( lEdge._uvOut );
690 lEdge._ray.SetDirection( lEdge._normal2D );
691 lEdge._isBlocked = false;
694 setLenRatio( lEdge, SMESH_TNodeXYZ( points[ i ].node ) );
699 // Fill _PolyLine's with _segments
700 // --------------------------------
702 double maxLen2dTo3dRatio = 0;
703 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
705 _PolyLine& L = _polyLineVec[ iPoLine ];
706 L._segments.resize( L._lEdges.size() - 1 );
707 for ( size_t i = 1; i < L._lEdges.size(); ++i )
709 _Segment & S = L._segments[i-1];
710 S._uv[0] = & L._lEdges[i-1]._uvIn;
711 S._uv[1] = & L._lEdges[i ]._uvIn;
712 S._indexInLine = i-1;
713 if ( maxLen2dTo3dRatio < L._lEdges[i]._len2dTo3dRatio )
714 maxLen2dTo3dRatio = L._lEdges[i]._len2dTo3dRatio;
716 // // connect _PolyLine's with segments, the 1st _LayerEdge of every _PolyLine
717 // // becomes not connected to any segment
718 // if ( L._leftLine->_advancable )
719 // L._segments[0]._uv[0] = & L._leftLine->_lEdges.back()._uvIn;
721 L._segTree.reset( new _SegmentTree( L._segments ));
724 // Evaluate max possible _thickness if required layers thickness seems too high
725 // ----------------------------------------------------------------------------
727 _thickness = _hyp->GetTotalThickness();
728 _SegmentTree::box_type faceBndBox2D;
729 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
730 faceBndBox2D.Add( *_polyLineVec[ iPoLine]._segTree->getBox() );
732 if ( _thickness * maxLen2dTo3dRatio > sqrt( faceBndBox2D.SquareExtent() ) / 10 )
734 vector< const _Segment* > foundSegs;
735 double maxPossibleThick = 0;
736 _SegmentIntersection intersection;
737 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
739 _PolyLine& L1 = _polyLineVec[ iL1 ];
740 const _SegmentTree::box_type* boxL1 = L1._segTree->getBox();
741 for ( size_t iL2 = iL1+1; iL2 < _polyLineVec.size(); ++iL2 )
743 _PolyLine& L2 = _polyLineVec[ iL2 ];
744 if ( boxL1->IsOut( *L2._segTree->getBox() ))
746 for ( size_t iLE = 1; iLE < L1._lEdges.size(); ++iLE )
749 L2._segTree->GetSegmentsNear( L1._lEdges[iLE]._ray, foundSegs );
750 for ( size_t i = 0; i < foundSegs.size(); ++i )
751 if ( intersection.Compute( *foundSegs[i], L1._lEdges[iLE]._ray ))
753 double distToL2 = intersection._param2 / L1._lEdges[iLE]._len2dTo3dRatio;
754 double psblThick = distToL2 / ( 1 + L1._advancable + L2._advancable );
755 if ( maxPossibleThick < psblThick )
756 maxPossibleThick = psblThick;
761 _thickness = Min( _hyp->GetTotalThickness(), maxPossibleThick );
764 // Adjust _LayerEdge's at _PolyLine's extremities
765 // -----------------------------------------------
767 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
769 _PolyLine& LL = _polyLineVec[ iPoLine ];
770 _PolyLine& LR = *LL._rightLine;
771 adjustCommonEdge( LL, LR );
773 // recreate _segments if some _LayerEdge's have been removed by adjustCommonEdge()
774 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
776 _PolyLine& L = _polyLineVec[ iPoLine ];
777 // if ( L._segments.size() == L._lEdges.size() - 1 )
779 L._segments.resize( L._lEdges.size() - 1 );
780 for ( size_t i = 1; i < L._lEdges.size(); ++i )
782 _Segment & S = L._segments[i-1];
783 S._uv[0] = & L._lEdges[i-1]._uvIn;
784 S._uv[1] = & L._lEdges[i ]._uvIn;
785 S._indexInLine = i-1;
787 L._segTree.reset( new _SegmentTree( L._segments ));
789 // connect _PolyLine's with segments, the 1st _LayerEdge of every _PolyLine
790 // becomes not connected to any segment
791 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
793 _PolyLine& L = _polyLineVec[ iPoLine ];
794 if ( L._leftLine->_advancable )
795 L._segments[0]._uv[0] = & L._leftLine->_lEdges.back()._uvIn;
798 // Fill _reachableLines.
799 // ----------------------
801 // compute bnd boxes taking into account the layers total thickness
802 vector< _SegmentTree::box_type > lineBoxes( _polyLineVec.size() );
803 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
805 lineBoxes[ iPoLine ] = *_polyLineVec[ iPoLine ]._segTree->getBox();
806 if ( _polyLineVec[ iPoLine ]._advancable )
807 lineBoxes[ iPoLine ].Enlarge( maxLen2dTo3dRatio * _thickness * 2 );
810 for ( iPoLine = 0; iPoLine < _polyLineVec.size(); ++iPoLine )
812 _PolyLine& L1 = _polyLineVec[ iPoLine ];
813 for ( size_t iL2 = 0; iL2 < _polyLineVec.size(); ++iL2 )
815 _PolyLine& L2 = _polyLineVec[ iL2 ];
816 if ( iPoLine == iL2 || lineBoxes[ iPoLine ].IsOut( lineBoxes[ iL2 ]))
818 if ( !L1._advancable && ( L1._leftLine == &L2 || L1._rightLine == &L2 ))
820 // check reachability by _LayerEdge's
821 int iDelta = 1; //Max( 1, L1._lEdges.size() / 100 );
822 for ( size_t iLE = 1; iLE < L1._lEdges.size(); iLE += iDelta )
824 _LayerEdge& LE = L1._lEdges[iLE];
825 if ( !lineBoxes[ iL2 ].IsOut ( LE._uvOut,
826 LE._uvOut + LE._normal2D *_thickness * LE._len2dTo3dRatio ))
828 L1._reachableLines.push_back( & L2 );
833 // add self to _reachableLines
834 Geom2dAdaptor_Curve pcurve( L1._wire->Curve2d( L1._edgeInd ));
835 if ( pcurve.GetType() != GeomAbs_Line )
837 // TODO: check carefully
838 L1._reachableLines.push_back( & L1 );
845 //================================================================================
847 * \brief adjust common _LayerEdge of two adjacent _PolyLine's
848 * \param LL - left _PolyLine
849 * \param LR - right _PolyLine
851 //================================================================================
853 void _ViscousBuilder2D::adjustCommonEdge( _PolyLine& LL, _PolyLine& LR )
855 int nbAdvancableL = LL._advancable + LR._advancable;
856 if ( nbAdvancableL == 0 )
859 _LayerEdge& EL = LL._lEdges.back();
860 _LayerEdge& ER = LR._lEdges.front();
861 gp_XY normL = EL._normal2D;
862 gp_XY normR = ER._normal2D;
863 gp_XY tangL ( normL.Y(), -normL.X() );
865 // set common direction to a VERTEX _LayerEdge shared by two _PolyLine's
866 gp_XY normCommon = ( normL * int( LL._advancable ) +
867 normR * int( LR._advancable )).Normalized();
868 EL._normal2D = normCommon;
869 EL._ray.SetLocation ( EL._uvOut );
870 EL._ray.SetDirection( EL._normal2D );
871 if ( nbAdvancableL == 1 ) {
872 EL._isBlocked = true;
875 // update _LayerEdge::_len2dTo3dRatio according to a new direction
876 const vector<UVPtStruct>& points = LL._wire->GetUVPtStruct();
877 setLenRatio( EL, SMESH_TNodeXYZ( points[ LL._lastPntInd ].node ));
881 const double dotNormTang = normR * tangL;
882 const bool largeAngle = Abs( dotNormTang ) > 0.2;
883 if ( largeAngle ) // not 180 degrees
885 // recompute _len2dTo3dRatio to take into account angle between EDGEs
886 gp_Vec2d oldNorm( LL._advancable ? normL : normR );
887 double angleFactor = 1. / Max( 0.3, Cos( oldNorm.Angle( normCommon )));
888 EL._len2dTo3dRatio *= angleFactor;
889 ER._len2dTo3dRatio = EL._len2dTo3dRatio;
891 gp_XY normAvg = ( normL + normR ).Normalized(); // average normal at VERTEX
893 if ( dotNormTang < 0. ) // ---------------------------- CONVEX ANGLE
895 // Remove _LayerEdge's intersecting the normAvg to avoid collisions
898 // find max length of the VERTEX based _LayerEdge whose direction is normAvg
899 double maxLen2D = _thickness * EL._len2dTo3dRatio;
900 const gp_XY& pCommOut = ER._uvOut;
901 gp_XY pCommIn = pCommOut + normAvg * maxLen2D;
902 _Segment segCommon( pCommOut, pCommIn );
903 _SegmentIntersection intersection;
904 vector< const _Segment* > foundSegs;
905 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
907 _PolyLine& L1 = _polyLineVec[ iL1 ];
908 const _SegmentTree::box_type* boxL1 = L1._segTree->getBox();
909 if ( boxL1->IsOut ( pCommOut, pCommIn ))
911 for ( size_t iLE = 1; iLE < L1._lEdges.size(); ++iLE )
914 L1._segTree->GetSegmentsNear( segCommon, foundSegs );
915 for ( size_t i = 0; i < foundSegs.size(); ++i )
916 if ( intersection.Compute( *foundSegs[i], segCommon ) &&
917 intersection._param2 > 1e-10 )
919 double len2D = intersection._param2 * maxLen2D / ( 2 + L1._advancable );
920 if ( len2D < maxLen2D ) {
922 pCommIn = pCommOut + normAvg * maxLen2D; // here length of segCommon changes
928 // remove _LayerEdge's intersecting segCommon
929 for ( int isR = 0; isR < 2; ++isR ) // loop on [ LL, LR ]
931 _PolyLine& L = isR ? LR : LL;
932 _PolyLine::TEdgeIterator eIt = isR ? L._lEdges.begin()+1 : L._lEdges.end()-2;
933 int dIt = isR ? +1 : -1;
934 if ( nbAdvancableL == 1 && L._advancable && normL * normR > -0.01 )
935 continue; // obtuse internal angle
936 // at least 3 _LayerEdge's should remain in a _PolyLine
937 if ( L._lEdges.size() < 4 ) continue;
939 _SegmentIntersection lastIntersection;
940 for ( ; iLE < L._lEdges.size(); ++iLE, eIt += dIt )
942 gp_XY uvIn = eIt->_uvOut + eIt->_normal2D * _thickness * eIt->_len2dTo3dRatio;
943 _Segment segOfEdge( eIt->_uvOut, uvIn );
944 if ( !intersection.Compute( segCommon, segOfEdge ))
946 lastIntersection._param1 = intersection._param1;
947 lastIntersection._param2 = intersection._param2;
949 if ( iLE >= L._lEdges.size () - 1 )
951 // all _LayerEdge's intersect the segCommon, limit inflation
952 // of remaining 2 _LayerEdge's
953 vector< _LayerEdge > newEdgeVec( Min( 3, L._lEdges.size() ));
954 newEdgeVec.front() = L._lEdges.front();
955 newEdgeVec.back() = L._lEdges.back();
956 if ( newEdgeVec.size() == 3 )
957 newEdgeVec[1] = L._lEdges[ L._lEdges.size() / 2 ];
958 L._lEdges.swap( newEdgeVec );
959 if ( !isR ) std::swap( lastIntersection._param1 , lastIntersection._param2 );
960 L._lEdges.front()._len2dTo3dRatio *= lastIntersection._param1; // ??
961 L._lEdges.back ()._len2dTo3dRatio *= lastIntersection._param2;
965 // eIt points to the _LayerEdge not intersecting with segCommon
967 LR._lEdges.erase( LR._lEdges.begin()+1, eIt );
969 LL._lEdges.erase( eIt, --LL._lEdges.end() );
973 else // ------------------------------------------ CONCAVE ANGLE
975 if ( nbAdvancableL == 1 )
977 // make that the _LayerEdge at VERTEX is not shared by LL and LR
978 _LayerEdge& notSharedEdge = LL._advancable ? LR._lEdges[0] : LL._lEdges.back();
979 _LayerEdge& sharedEdge = LR._advancable ? LR._lEdges[0] : LL._lEdges.back();
981 notSharedEdge._normal2D.SetCoord( 0.,0. );
982 sharedEdge._normal2D = normAvg;
983 sharedEdge._isBlocked = false;
989 //================================================================================
991 * \brief Compute and set _LayerEdge::_len2dTo3dRatio
993 //================================================================================
995 void _ViscousBuilder2D::setLenRatio( _LayerEdge& LE, const gp_Pnt& pOut )
997 const double probeLen2d = 1e-3;
999 gp_Pnt2d p2d = LE._uvOut + LE._normal2D * probeLen2d;
1000 gp_Pnt p3d = _surface->Value( p2d.X(), p2d.Y() );
1001 double len3d = p3d.Distance( pOut );
1002 if ( len3d < std::numeric_limits<double>::min() )
1003 LE._len2dTo3dRatio = std::numeric_limits<double>::min();
1005 LE._len2dTo3dRatio = probeLen2d / len3d;
1008 //================================================================================
1010 * \brief Increase length of _LayerEdge's to reach the required thickness of layers
1012 //================================================================================
1014 bool _ViscousBuilder2D::inflate()
1016 // Limit size of inflation step by geometry size found by
1017 // itersecting _LayerEdge's with _Segment's
1018 double minSize = _thickness, maxSize = 0;
1019 vector< const _Segment* > foundSegs;
1020 _SegmentIntersection intersection;
1021 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
1023 _PolyLine& L1 = _polyLineVec[ iL1 ];
1024 for ( size_t iL2 = 0; iL2 < L1._reachableLines.size(); ++iL2 )
1026 _PolyLine& L2 = * L1._reachableLines[ iL2 ];
1027 for ( size_t iLE = 1; iLE < L1._lEdges.size(); ++iLE )
1030 L2._segTree->GetSegmentsNear( L1._lEdges[iLE]._ray, foundSegs );
1031 for ( size_t i = 0; i < foundSegs.size(); ++i )
1032 if ( ! L1.IsAdjacent( *foundSegs[i], & L1._lEdges[iLE] ) &&
1033 intersection.Compute( *foundSegs[i], L1._lEdges[iLE]._ray ))
1035 double distToL2 = intersection._param2 / L1._lEdges[iLE]._len2dTo3dRatio;
1036 double size = distToL2 / ( 1 + L1._advancable + L2._advancable );
1037 if ( size < minSize )
1039 if ( size > maxSize )
1045 if ( minSize > maxSize ) // no collisions possible
1046 maxSize = _thickness;
1048 cout << "-- minSize = " << minSize << ", maxSize = " << maxSize << endl;
1051 double curThick = 0, stepSize = minSize;
1053 if ( maxSize > _thickness )
1054 maxSize = _thickness;
1055 while ( curThick < maxSize )
1057 curThick += stepSize * 1.25;
1058 if ( curThick > _thickness )
1059 curThick = _thickness;
1061 // Elongate _LayerEdge's
1062 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1064 _PolyLine& L = _polyLineVec[ iL ];
1065 if ( !L._advancable ) continue;
1066 bool lenChange = false;
1067 for ( size_t iLE = L.FirstLEdge(); iLE < L._lEdges.size(); ++iLE )
1068 lenChange |= L._lEdges[iLE].SetNewLength( curThick );
1069 // for ( int k=0; k<L._segments.size(); ++k)
1070 // cout << "( " << L._segments[k].p1().X() << ", " <<L._segments[k].p1().Y() << " ) "
1071 // << "( " << L._segments[k].p2().X() << ", " <<L._segments[k].p2().Y() << " ) "
1074 L._segTree.reset( new _SegmentTree( L._segments ));
1077 // Avoid intersection of _Segment's
1078 bool allBlocked = fixCollisions();
1081 break; // no more inflating possible
1083 stepSize = Max( stepSize , _thickness / 10. );
1087 // if (nbSteps == 0 )
1088 // return error("failed at the very first inflation step");
1093 //================================================================================
1095 * \brief Remove intersection of _PolyLine's
1097 //================================================================================
1099 bool _ViscousBuilder2D::fixCollisions()
1101 // look for intersections of _Segment's by intersecting _LayerEdge's with
1103 //double maxStep = 0, minStep = 1e+100;
1104 vector< const _Segment* > foundSegs;
1105 _SegmentIntersection intersection;
1107 list< pair< _LayerEdge*, double > > edgeLenLimitList;
1108 list< _LayerEdge* > blockedEdgesList;
1110 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
1112 _PolyLine& L1 = _polyLineVec[ iL1 ];
1113 //if ( !L1._advancable ) continue;
1114 for ( size_t iL2 = 0; iL2 < L1._reachableLines.size(); ++iL2 )
1116 _PolyLine& L2 = * L1._reachableLines[ iL2 ];
1117 for ( size_t iLE = L1.FirstLEdge(); iLE < L1._lEdges.size(); ++iLE )
1119 _LayerEdge& LE1 = L1._lEdges[iLE];
1120 //if ( LE1._isBlocked ) continue;
1122 L2._segTree->GetSegmentsNear( LE1._ray, foundSegs );
1123 for ( size_t i = 0; i < foundSegs.size(); ++i )
1125 if ( ! L1.IsAdjacent( *foundSegs[i], &LE1 ) &&
1126 intersection.Compute( *foundSegs[i], LE1._ray ))
1128 const double dist2DToL2 = intersection._param2;
1129 double newLen2D = dist2DToL2 / 2;
1130 if ( newLen2D < 1.1 * LE1._length2D ) // collision!
1132 if ( newLen2D < LE1._length2D )
1134 blockedEdgesList.push_back( &LE1 );
1135 if ( L1._advancable )
1137 edgeLenLimitList.push_back( make_pair( &LE1, newLen2D ));
1138 blockedEdgesList.push_back( &L2._lEdges[ foundSegs[i]->_indexInLine ]);
1139 blockedEdgesList.push_back( &L2._lEdges[ foundSegs[i]->_indexInLine + 1 ]);
1141 else // here dist2DToL2 < 0 and LE1._length2D == 0
1143 _LayerEdge LE2[2] = { L2._lEdges[ foundSegs[i]->_indexInLine ],
1144 L2._lEdges[ foundSegs[i]->_indexInLine + 1 ] };
1145 _Segment outSeg2( LE2[0]._uvOut, LE2[1]._uvOut );
1146 intersection.Compute( outSeg2, LE1._ray );
1147 newLen2D = intersection._param2 / 2;
1149 edgeLenLimitList.push_back( make_pair( &LE2[0], newLen2D ));
1150 edgeLenLimitList.push_back( make_pair( &LE2[1], newLen2D ));
1160 // set limited length to _LayerEdge's
1161 list< pair< _LayerEdge*, double > >::iterator edge2Len = edgeLenLimitList.begin();
1162 for ( ; edge2Len != edgeLenLimitList.end(); ++edge2Len )
1164 _LayerEdge* LE = edge2Len->first;
1165 LE->SetNewLength( edge2Len->second / LE->_len2dTo3dRatio );
1166 LE->_isBlocked = true;
1169 // block inflation of _LayerEdge's
1170 list< _LayerEdge* >::iterator edge = blockedEdgesList.begin();
1171 for ( ; edge != blockedEdgesList.end(); ++edge )
1172 (*edge)->_isBlocked = true;
1174 // find a not blocked _LayerEdge
1175 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1177 _PolyLine& L = _polyLineVec[ iL ];
1178 if ( !L._advancable ) continue;
1179 for ( size_t iLE = L.FirstLEdge(); iLE < L._lEdges.size(); ++iLE )
1180 if ( !L._lEdges[ iLE ]._isBlocked )
1187 //================================================================================
1189 * \brief Create new edges and shrink edges existing on a non-advancable _PolyLine
1190 * adjacent to an advancable one.
1192 //================================================================================
1194 bool _ViscousBuilder2D::shrink()
1196 gp_Pnt2d uv; gp_Vec2d tangent;
1197 _SegmentIntersection intersection;
1200 for ( size_t iL1 = 0; iL1 < _polyLineVec.size(); ++iL1 )
1202 _PolyLine& L = _polyLineVec[ iL1 ]; // line with no layers
1203 if ( L._advancable )
1205 const int nbAdvancable = ( L._rightLine->_advancable + L._leftLine->_advancable );
1206 if ( nbAdvancable == 0 )
1209 const TopoDS_Edge& E = L._wire->Edge ( L._edgeInd );
1210 const int edgeID = L._wire->EdgeID ( L._edgeInd );
1211 const double edgeLen = L._wire->EdgeLength( L._edgeInd );
1212 Handle(Geom2d_Curve) pcurve = L._wire->Curve2d ( L._edgeInd );
1213 const bool edgeReversed = ( E.Orientation() == TopAbs_REVERSED );
1215 SMESH_MesherHelper helper( *_mesh ); // to create nodes and edges on E
1216 helper.SetSubShape( E );
1217 helper.SetElementsOnShape( true );
1219 // Check a FACE adjacent to _face by E
1220 bool existingNodesFound = false;
1221 TopoDS_Face adjFace;
1222 PShapeIteratorPtr faceIt = _helper.GetAncestors( E, *_mesh, TopAbs_FACE );
1223 while ( const TopoDS_Shape* f = faceIt->next() )
1224 if ( !_face.IsSame( *f ))
1226 adjFace = TopoDS::Face( *f );
1227 SMESH_ProxyMesh::Ptr pm = _ProxyMeshHolder::FindProxyMeshOfFace( adjFace, *_mesh );
1228 if ( !pm || pm->NbProxySubMeshes() == 0 )
1230 // There are no viscous layers on an adjacent FACE, clear it's 2D mesh
1231 removeMeshFaces( adjFace );
1235 // There are viscous layers on the adjacent FACE; shrink must be already done;
1239 const vector<UVPtStruct>& points = L._wire->GetUVPtStruct();
1240 int iPFrom = L._firstPntInd, iPTo = L._lastPntInd;
1241 if ( L._leftLine->_advancable )
1243 vector<gp_XY>& uvVec = L._lEdges.front()._uvRefined;
1244 for ( int i = 0; i < _hyp->GetNumberLayers(); ++i ) {
1245 const UVPtStruct& uvPt = points[ iPFrom + i + 1 ];
1246 L._leftNodes.push_back( uvPt.node );
1247 uvVec.push_back ( pcurve->Value( uvPt.param ).XY() );
1250 if ( L._rightLine->_advancable )
1252 vector<gp_XY>& uvVec = L._lEdges.back()._uvRefined;
1253 for ( int i = 0; i < _hyp->GetNumberLayers(); ++i ) {
1254 const UVPtStruct& uvPt = points[ iPTo - i - 1 ];
1255 L._rightNodes.push_back( uvPt.node );
1256 uvVec.push_back ( pcurve->Value( uvPt.param ).XY() );
1259 // make proxy sub-mesh data of present nodes
1261 if ( L._leftLine->_advancable ) iPFrom += _hyp->GetNumberLayers();
1262 if ( L._rightLine->_advancable ) iPTo -= _hyp->GetNumberLayers();
1263 UVPtStructVec nodeDataVec( & points[ iPFrom ], & points[ iPTo + 1 ]);
1265 double normSize = nodeDataVec.back().normParam - nodeDataVec.front().normParam;
1266 for ( int iP = nodeDataVec.size()-1; iP >= 0 ; --iP )
1267 nodeDataVec[iP].normParam =
1268 ( nodeDataVec[iP].normParam - nodeDataVec[0].normParam ) / normSize;
1270 const SMDS_MeshNode* n = nodeDataVec.front().node;
1271 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
1272 nodeDataVec.front().param = L._wire->FirstU( L._edgeInd );
1273 n = nodeDataVec.back().node;
1274 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
1275 nodeDataVec.back().param = L._wire->LastU( L._edgeInd );
1277 _ProxyMeshOfFace::_EdgeSubMesh* myEdgeSM = getProxyMesh()->GetEdgeSubMesh( edgeID );
1278 myEdgeSM->SetUVPtStructVec( nodeDataVec );
1280 existingNodesFound = true;
1282 } // loop on FACEs sharing E
1284 if ( existingNodesFound )
1285 continue; // nothing more to do in this case
1287 double u1 = L._wire->FirstU( L._edgeInd ), uf = u1;
1288 double u2 = L._wire->LastU ( L._edgeInd ), ul = u2;
1290 // Get length of existing segments (from edge start to node) and their nodes
1291 const vector<UVPtStruct>& points = L._wire->GetUVPtStruct();
1292 UVPtStructVec nodeDataVec( & points[ L._firstPntInd ],
1293 & points[ L._lastPntInd + 1 ]);
1294 nodeDataVec.front().param = u1; // U on vertex is correct on only one of shared edges
1295 nodeDataVec.back ().param = u2;
1296 nodeDataVec.front().normParam = 0;
1297 nodeDataVec.back ().normParam = 1;
1298 vector< double > segLengths( nodeDataVec.size() - 1 );
1299 BRepAdaptor_Curve curve( E );
1300 for ( size_t iP = 1; iP < nodeDataVec.size(); ++iP )
1302 const double len = GCPnts_AbscissaPoint::Length( curve, uf, nodeDataVec[iP].param );
1303 segLengths[ iP-1 ] = len;
1308 // x-----x-----x-----x-----
1313 // x-x-x-x-----x-----x----
1316 // Move first and last parameters on EDGE (U of n1) according to layers' thickness
1317 // and create nodes of layers on EDGE ( -x-x-x )
1318 int isRShrinkedForAdjacent;
1319 UVPtStructVec nodeDataForAdjacent;
1320 for ( int isR = 0; isR < 2; ++isR )
1322 _PolyLine* L2 = isR ? L._rightLine : L._leftLine; // line with layers
1323 if ( !L2->_advancable &&
1324 !toShrinkForAdjacent( adjFace, E, L._wire->FirstVertex( L._edgeInd + isR )))
1327 double & u = isR ? u2 : u1; // param to move
1328 double u0 = isR ? ul : uf; // init value of the param to move
1329 int iPEnd = isR ? nodeDataVec.size() - 1 : 0;
1331 _LayerEdge& nearLE = isR ? L._lEdges.back() : L._lEdges.front();
1332 _LayerEdge& farLE = isR ? L._lEdges.front() : L._lEdges.back();
1334 // try to find length of advancement along L by intersecting L with
1335 // an adjacent _Segment of L2
1337 double & length2D = nearLE._length2D;
1338 sign = ( isR ^ edgeReversed ) ? -1. : 1.;
1339 pcurve->D1( u, uv, tangent );
1341 if ( L2->_advancable )
1343 int iFSeg2 = isR ? 0 : L2->_segments.size() - 1;
1344 int iLSeg2 = isR ? 1 : L2->_segments.size() - 2;
1345 gp_XY uvLSeg2In = L2->_lEdges[ iLSeg2 ]._uvIn;
1346 gp_XY uvLSeg2Out = L2->_lEdges[ iLSeg2 ]._uvOut;
1347 gp_XY uvFSeg2Out = L2->_lEdges[ iFSeg2 ]._uvOut;
1348 Handle(Geom2d_Line) seg2Line = new Geom2d_Line( uvLSeg2In, uvFSeg2Out - uvLSeg2Out );
1350 Geom2dAdaptor_Curve edgeCurve( pcurve, Min( uf, ul ), Max( uf, ul ));
1351 Geom2dAdaptor_Curve seg2Curve( seg2Line );
1352 Geom2dInt_GInter curveInt( edgeCurve, seg2Curve, 1e-7, 1e-7 );
1353 double maxDist2d = 2 * L2->_lEdges[ iLSeg2 ]._length2D;
1354 if ( curveInt.IsDone() &&
1355 !curveInt.IsEmpty() &&
1356 curveInt.Point( 1 ).Value().Distance( uvFSeg2Out ) <= maxDist2d )
1357 { /* convex VERTEX */
1358 u = curveInt.Point( 1 ).ParamOnFirst(); /* |L seg2
1364 else { /* concave VERTEX */ /* o-----o---
1370 length2D = sign * L2->_lEdges[ iFSeg2 ]._length2D;
1373 else // L2 is advancable but in the face adjacent by L
1375 length2D = farLE._length2D;
1376 if ( length2D == 0 )
1377 length2D = ( isR ? L._leftLine->_lEdges.back() : L._rightLine->_lEdges.front() )._length2D;
1379 if ( length2D > 0 ) {
1380 // move u to the internal boundary of layers
1381 double maxLen3D = Min( _thickness, edgeLen / ( 1 + nbAdvancable ));
1382 double maxLen2D = maxLen3D * nearLE._len2dTo3dRatio;
1383 if ( length2D > maxLen2D )
1384 length2D = maxLen2D;
1385 u += length2D * sign;
1387 nodeDataVec[ iPEnd ].param = u;
1389 gp_Pnt2d newUV = pcurve->Value( u );
1390 nodeDataVec[ iPEnd ].u = newUV.X();
1391 nodeDataVec[ iPEnd ].v = newUV.Y();
1393 // compute params of layers on L
1394 vector<double> heights;
1395 calcLayersHeight( u - u0, heights );
1397 vector< double > params( heights.size() );
1398 for ( size_t i = 0; i < params.size(); ++i )
1399 params[ i ] = u0 + heights[ i ];
1401 // create nodes of layers and edges between them
1402 vector< const SMDS_MeshNode* >& layersNode = isR ? L._rightNodes : L._leftNodes;
1403 vector<gp_XY>& nodeUV = ( isR ? L._lEdges.back() : L._lEdges[0] )._uvRefined;
1404 nodeUV.resize ( _hyp->GetNumberLayers() );
1405 layersNode.resize( _hyp->GetNumberLayers() );
1406 const SMDS_MeshNode* vertexNode = nodeDataVec[ iPEnd ].node;
1407 const SMDS_MeshNode * prevNode = vertexNode;
1408 for ( size_t i = 0; i < params.size(); ++i )
1410 gp_Pnt p = curve.Value( params[i] );
1411 layersNode[ i ] = helper.AddNode( p.X(), p.Y(), p.Z(), /*id=*/0, params[i] );
1412 nodeUV [ i ] = pcurve->Value( params[i] ).XY();
1413 helper.AddEdge( prevNode, layersNode[ i ] );
1414 prevNode = layersNode[ i ];
1417 // store data of layer nodes made for adjacent FACE
1418 if ( !L2->_advancable )
1420 isRShrinkedForAdjacent = isR;
1421 nodeDataForAdjacent.resize( _hyp->GetNumberLayers() );
1423 size_t iFrw = 0, iRev = nodeDataForAdjacent.size()-1, *i = isR ? &iRev : &iFrw;
1424 nodeDataForAdjacent[ *i ] = points[ isR ? L._lastPntInd : L._firstPntInd ];
1425 nodeDataForAdjacent[ *i ].param = u0;
1426 nodeDataForAdjacent[ *i ].normParam = isR;
1427 for ( ++iFrw, --iRev; iFrw < layersNode.size(); ++iFrw, --iRev )
1429 nodeDataForAdjacent[ *i ].node = layersNode[ iFrw - 1 ];
1430 nodeDataForAdjacent[ *i ].u = nodeUV [ iFrw - 1 ].X();
1431 nodeDataForAdjacent[ *i ].v = nodeUV [ iFrw - 1 ].Y();
1432 nodeDataForAdjacent[ *i ].param = params [ iFrw - 1 ];
1435 // replace a node on vertex by a node of last (most internal) layer
1436 // in a segment on E
1437 SMDS_ElemIteratorPtr segIt = vertexNode->GetInverseElementIterator( SMDSAbs_Edge );
1438 const SMDS_MeshNode* segNodes[3];
1439 while ( segIt->more() )
1441 const SMDS_MeshElement* segment = segIt->next();
1442 if ( segment->getshapeId() != edgeID ) continue;
1444 const int nbNodes = segment->NbNodes();
1445 for ( int i = 0; i < nbNodes; ++i )
1447 const SMDS_MeshNode* n = segment->GetNode( i );
1448 segNodes[ i ] = ( n == vertexNode ? layersNode.back() : n );
1450 getMeshDS()->ChangeElementNodes( segment, segNodes, nbNodes );
1453 nodeDataVec[ iPEnd ].node = layersNode.back();
1455 } // loop on the extremities of L
1457 // Shrink edges to fit in between the layers at EDGE ends
1459 const double newLength = GCPnts_AbscissaPoint::Length( curve, u1, u2 );
1460 const double lenRatio = newLength / edgeLen * ( edgeReversed ? -1. : 1. );
1461 for ( size_t iP = 1; iP < nodeDataVec.size()-1; ++iP )
1463 const SMDS_MeshNode* oldNode = nodeDataVec[iP].node;
1465 GCPnts_AbscissaPoint discret( curve, segLengths[iP-1] * lenRatio, u1 );
1466 if ( !discret.IsDone() )
1467 throw SALOME_Exception(LOCALIZED("GCPnts_AbscissaPoint failed"));
1469 nodeDataVec[iP].param = discret.Parameter();
1470 if ( oldNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_EDGE )
1471 throw SALOME_Exception(SMESH_Comment("ViscousBuilder2D: not SMDS_TOP_EDGE node position: ")
1472 << oldNode->GetPosition()->GetTypeOfPosition()
1473 << " of node " << oldNode->GetID());
1474 SMDS_EdgePosition* pos = static_cast<SMDS_EdgePosition*>( oldNode->GetPosition() );
1475 pos->SetUParameter( nodeDataVec[iP].param );
1477 gp_Pnt newP = curve.Value( nodeDataVec[iP].param );
1478 getMeshDS()->MoveNode( oldNode, newP.X(), newP.Y(), newP.Z() );
1480 gp_Pnt2d newUV = pcurve->Value( nodeDataVec[iP].param ).XY();
1481 nodeDataVec[iP].u = newUV.X();
1482 nodeDataVec[iP].v = newUV.Y();
1483 nodeDataVec[iP].normParam = segLengths[iP-1] / edgeLen;
1484 // nodeDataVec[iP].x = segLengths[iP-1] / edgeLen;
1485 // nodeDataVec[iP].y = segLengths[iP-1] / edgeLen;
1488 // add nodeDataForAdjacent to nodeDataVec
1489 if ( !nodeDataForAdjacent.empty() )
1491 const double par1 = isRShrinkedForAdjacent ? u2 : uf;
1492 const double par2 = isRShrinkedForAdjacent ? ul : u1;
1493 const double shrinkLen = GCPnts_AbscissaPoint::Length( curve, par1, par2 );
1495 // compute new normParam for nodeDataVec
1496 for ( size_t iP = 0; iP < nodeDataVec.size()-1; ++iP )
1497 nodeDataVec[iP+1].normParam = segLengths[iP] / ( edgeLen + shrinkLen );
1498 double normDelta = 1 - nodeDataVec.back().normParam;
1499 if ( !isRShrinkedForAdjacent )
1500 for ( size_t iP = 0; iP < nodeDataVec.size(); ++iP )
1501 nodeDataVec[iP].normParam += normDelta;
1503 // compute new normParam for nodeDataForAdjacent
1504 const double deltaR = isRShrinkedForAdjacent ? nodeDataVec.back().normParam : 0;
1505 for ( size_t iP = !isRShrinkedForAdjacent; iP < nodeDataForAdjacent.size(); ++iP )
1507 double lenFromPar1 =
1508 GCPnts_AbscissaPoint::Length( curve, par1, nodeDataForAdjacent[iP].param );
1509 nodeDataForAdjacent[iP].normParam = deltaR + normDelta * lenFromPar1 / shrinkLen;
1511 // concatenate nodeDataVec and nodeDataForAdjacent
1512 nodeDataVec.insert( isRShrinkedForAdjacent ? nodeDataVec.end() : nodeDataVec.begin(),
1513 nodeDataForAdjacent.begin(), nodeDataForAdjacent.end() );
1516 // create a proxy sub-mesh containing the moved nodes
1517 _ProxyMeshOfFace::_EdgeSubMesh* edgeSM = getProxyMesh()->GetEdgeSubMesh( edgeID );
1518 edgeSM->SetUVPtStructVec( nodeDataVec );
1520 // set a sub-mesh event listener to remove just created edges when
1521 // "ViscousLayers2D" hypothesis is modified
1522 VISCOUS_3D::ToClearSubWithMain( _mesh->GetSubMesh( E ), _face );
1524 } // loop on _polyLineVec
1529 //================================================================================
1531 * \brief Returns true if there will be a shrinked mesh on EDGE E of FACE adjFace
1534 //================================================================================
1536 bool _ViscousBuilder2D::toShrinkForAdjacent( const TopoDS_Face& adjFace,
1537 const TopoDS_Edge& E,
1538 const TopoDS_Vertex& V)
1540 if ( const StdMeshers_ViscousLayers2D* vlHyp = findHyp( *_mesh, adjFace ))
1542 VISCOUS_2D::_ViscousBuilder2D builder( *_mesh, adjFace, vlHyp );
1543 builder.findEdgesWithLayers();
1545 PShapeIteratorPtr edgeIt = _helper.GetAncestors( V, *_mesh, TopAbs_EDGE );
1546 while ( const TopoDS_Shape* edgeAtV = edgeIt->next() )
1548 if ( !edgeAtV->IsSame( E ) &&
1549 _helper.IsSubShape( *edgeAtV, adjFace ) &&
1550 !builder._ignoreShapeIds.count( getMeshDS()->ShapeToIndex( *edgeAtV )))
1559 //================================================================================
1563 //================================================================================
1565 bool _ViscousBuilder2D::refine()
1567 // remove elements and nodes from _face
1568 removeMeshFaces( _face );
1570 // store a proxyMesh in a sub-mesh
1571 // make faces on each _PolyLine
1572 vector< double > layersHeight;
1573 double prevLen2D = -1;
1574 for ( size_t iL = 0; iL < _polyLineVec.size(); ++iL )
1576 _PolyLine& L = _polyLineVec[ iL ];
1577 if ( !L._advancable ) continue;
1579 //if ( L._leftLine->_advancable ) L._lEdges[0] = L._leftLine->_lEdges.back();
1581 // replace an inactive _LayerEdge with an active one of a neighbour _PolyLine
1582 size_t iLE = 0, nbLE = L._lEdges.size();
1583 if ( /*!L._leftLine->_advancable &&*/ L.IsCommonEdgeShared( *L._leftLine ))
1585 L._lEdges[0] = L._leftLine->_lEdges.back();
1586 iLE += int( !L._leftLine->_advancable );
1588 if ( !L._rightLine->_advancable && L.IsCommonEdgeShared( *L._rightLine ))
1590 L._lEdges.back() = L._rightLine->_lEdges[0];
1594 // remove intersecting _LayerEdge's
1595 _SegmentIntersection intersection;
1596 for ( int isR = 0; ( isR < 2 && L._lEdges.size() > 2 ); ++isR )
1598 int nbRemove = 0, deltaIt = isR ? -1 : +1;
1599 _PolyLine::TEdgeIterator eIt = isR ? L._lEdges.end()-1 : L._lEdges.begin();
1600 // HEURISTICS !!! elongate the first _LayerEdge
1601 gp_XY newIn = eIt->_uvOut + eIt->_normal2D * eIt->_length2D/* * 2*/;
1602 _Segment seg1( eIt->_uvOut, newIn );
1603 for ( eIt += deltaIt; nbRemove < L._lEdges.size()-2; eIt += deltaIt )
1605 _Segment seg2( eIt->_uvOut, eIt->_uvIn );
1606 if ( !intersection.Compute( seg1, seg2 ))
1610 if ( nbRemove > 0 ) {
1612 L._lEdges.erase( L._lEdges.end()-nbRemove-1,
1613 L._lEdges.end()-nbRemove );
1615 L._lEdges.erase( L._lEdges.begin()+2,
1616 L._lEdges.begin()+2+nbRemove );
1620 // calculate intermediate UV on _LayerEdge's ( _LayerEdge::_uvRefined )
1621 for ( ; iLE < nbLE; ++iLE )
1623 _LayerEdge& LE = L._lEdges[iLE];
1624 if ( fabs( LE._length2D - prevLen2D ) > LE._length2D / 100. )
1626 calcLayersHeight( LE._length2D, layersHeight );
1627 prevLen2D = LE._length2D;
1629 for ( size_t i = 0; i < layersHeight.size(); ++i )
1630 LE._uvRefined.push_back( LE._uvOut + LE._normal2D * layersHeight[i] );
1633 // nodes to create 1 layer of faces
1634 vector< const SMDS_MeshNode* > outerNodes( L._lastPntInd - L._firstPntInd + 1 );
1635 vector< const SMDS_MeshNode* > innerNodes( L._lastPntInd - L._firstPntInd + 1 );
1637 // initialize outerNodes by node on the L._wire
1638 const vector<UVPtStruct>& points = L._wire->GetUVPtStruct();
1639 for ( int i = L._firstPntInd; i <= L._lastPntInd; ++i )
1640 outerNodes[ i-L._firstPntInd ] = points[i].node;
1642 // compute normalized [0;1] node parameters of outerNodes
1643 vector< double > normPar( L._lastPntInd - L._firstPntInd + 1 );
1645 normF = L._wire->FirstParameter( L._edgeInd ),
1646 normL = L._wire->LastParameter ( L._edgeInd ),
1647 normDist = normL - normF;
1648 for ( int i = L._firstPntInd; i <= L._lastPntInd; ++i )
1649 normPar[ i - L._firstPntInd ] = ( points[i].normParam - normF ) / normDist;
1651 // Create layers of faces
1653 int hasLeftNode = ( !L._leftLine->_rightNodes.empty() );
1654 int hasRightNode = ( !L._rightLine->_leftNodes.empty() );
1655 size_t iS, iN0 = hasLeftNode, nbN = innerNodes.size() - hasRightNode;
1656 L._leftNodes .resize( _hyp->GetNumberLayers() );
1657 L._rightNodes.resize( _hyp->GetNumberLayers() );
1658 vector< double > segLen( L._lEdges.size() );
1660 for ( int iF = 0; iF < _hyp->GetNumberLayers(); ++iF ) // loop on layers of faces
1662 // get accumulated length of intermediate segments
1663 for ( iS = 1; iS < segLen.size(); ++iS )
1665 double sLen = (L._lEdges[iS-1]._uvRefined[iF] - L._lEdges[iS]._uvRefined[iF] ).Modulus();
1666 segLen[iS] = segLen[iS-1] + sLen;
1668 // normalize the accumulated length
1669 for ( iS = 1; iS < segLen.size(); ++iS )
1670 segLen[iS] /= segLen.back();
1672 // create innerNodes
1674 for ( size_t i = iN0; i < nbN; ++i )
1676 while ( normPar[i] > segLen[iS+1] )
1678 double r = ( normPar[i] - segLen[iS] ) / ( segLen[iS+1] - segLen[iS] );
1679 gp_XY uv = r * L._lEdges[iS+1]._uvRefined[iF] + (1-r) * L._lEdges[iS]._uvRefined[iF];
1680 gp_Pnt p = _surface->Value( uv.X(), uv.Y() );
1681 innerNodes[i] = _helper.AddNode( p.X(), p.Y(), p.Z(), /*id=*/0, uv.X(), uv.Y() );
1683 if ( hasLeftNode ) innerNodes.front() = L._leftLine->_rightNodes[ iF ];
1684 if ( hasRightNode ) innerNodes.back() = L._rightLine->_leftNodes[ iF ];
1685 L._rightNodes[ iF ] = innerNodes.back();
1686 L._leftNodes [ iF ] = innerNodes.front();
1689 // TODO care of orientation
1690 for ( size_t i = 1; i < innerNodes.size(); ++i )
1691 _helper.AddFace( outerNodes[ i-1 ], outerNodes[ i ],
1692 innerNodes[ i ], innerNodes[ i-1 ]);
1694 outerNodes.swap( innerNodes );
1697 // Fill the _ProxyMeshOfFace
1699 UVPtStructVec nodeDataVec( outerNodes.size() ); // outerNodes swapped with innerNodes
1700 for ( size_t i = 0; i < outerNodes.size(); ++i )
1702 gp_XY uv = _helper.GetNodeUV( _face, outerNodes[i] );
1703 nodeDataVec[i].u = uv.X();
1704 nodeDataVec[i].v = uv.Y();
1705 nodeDataVec[i].node = outerNodes[i];
1706 nodeDataVec[i].param = points [i + L._firstPntInd].param;
1707 nodeDataVec[i].normParam = normPar[i];
1708 nodeDataVec[i].x = normPar[i];
1709 nodeDataVec[i].y = normPar[i];
1711 nodeDataVec.front().param = L._wire->FirstU( L._edgeInd );
1712 nodeDataVec.back() .param = L._wire->LastU ( L._edgeInd );
1714 _ProxyMeshOfFace::_EdgeSubMesh* edgeSM
1715 = getProxyMesh()->GetEdgeSubMesh( L._wire->EdgeID( L._edgeInd ));
1716 edgeSM->SetUVPtStructVec( nodeDataVec );
1718 } // loop on _PolyLine's
1723 //================================================================================
1725 * \brief Remove elements and nodes from a face
1727 //================================================================================
1729 bool _ViscousBuilder2D::removeMeshFaces(const TopoDS_Shape& face)
1731 // we don't use SMESH_subMesh::ComputeStateEngine() because of a listener
1732 // which clears EDGEs together with _face.
1733 bool thereWereElems = false;
1734 SMESH_subMesh* sm = _mesh->GetSubMesh( face );
1735 if ( SMESHDS_SubMesh* smDS = sm->GetSubMeshDS() )
1737 SMDS_ElemIteratorPtr eIt = smDS->GetElements();
1738 thereWereElems = eIt->more();
1739 while ( eIt->more() ) getMeshDS()->RemoveFreeElement( eIt->next(), smDS );
1740 SMDS_NodeIteratorPtr nIt = smDS->GetNodes();
1741 while ( nIt->more() ) getMeshDS()->RemoveFreeNode( nIt->next(), smDS );
1743 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1745 return thereWereElems;
1748 //================================================================================
1750 * \brief Creates a _ProxyMeshOfFace and store it in a sub-mesh of FACE
1752 //================================================================================
1754 _ProxyMeshOfFace* _ViscousBuilder2D::getProxyMesh()
1756 if ( _proxyMesh.get() )
1757 return (_ProxyMeshOfFace*) _proxyMesh.get();
1759 _ProxyMeshOfFace* proxyMeshOfFace = new _ProxyMeshOfFace( *_mesh );
1760 _proxyMesh.reset( proxyMeshOfFace );
1761 new _ProxyMeshHolder( _face, _proxyMesh );
1763 return proxyMeshOfFace;
1766 //================================================================================
1768 * \brief Calculate height of layers for the given thickness. Height is measured
1769 * from the outer boundary
1771 //================================================================================
1773 void _ViscousBuilder2D::calcLayersHeight(const double totalThick,
1774 vector<double>& heights)
1776 heights.resize( _hyp->GetNumberLayers() );
1778 if ( _fPowN - 1 <= numeric_limits<double>::min() )
1779 h0 = totalThick / _hyp->GetNumberLayers();
1781 h0 = totalThick * ( _hyp->GetStretchFactor() - 1 )/( _fPowN - 1 );
1783 double hSum = 0, hi = h0;
1784 for ( int i = 0; i < _hyp->GetNumberLayers(); ++i )
1787 heights[ i ] = hSum;
1788 hi *= _hyp->GetStretchFactor();
1792 //================================================================================
1794 * \brief Elongate this _LayerEdge
1796 //================================================================================
1798 bool _LayerEdge::SetNewLength( const double length3D )
1800 if ( _isBlocked ) return false;
1802 //_uvInPrev = _uvIn;
1803 _length2D = length3D * _len2dTo3dRatio;
1804 _uvIn = _uvOut + _normal2D * _length2D;
1808 //================================================================================
1810 * \brief Return true if _LayerEdge at a common VERTEX between EDGEs with
1811 * and w/o layer is common to the both _PolyLine's. If this is true, nodes
1812 * of this _LayerEdge are inflated along a _PolyLine w/o layer, else the nodes
1813 * are inflated along _normal2D of _LayerEdge of EDGE with layer
1815 //================================================================================
1817 bool _PolyLine::IsCommonEdgeShared( const _PolyLine& other )
1819 const double tol = 1e-30;
1821 if ( & other == _leftLine )
1822 return _lEdges[0]._normal2D.IsEqual( _leftLine->_lEdges.back()._normal2D, tol );
1824 if ( & other == _rightLine )
1825 return _lEdges.back()._normal2D.IsEqual( _rightLine->_lEdges[0]._normal2D, tol );
1830 //================================================================================
1832 * \brief Constructor of SegmentTree
1834 //================================================================================
1836 _SegmentTree::_SegmentTree( const vector< _Segment >& segments ):
1839 _segments.resize( segments.size() );
1840 for ( size_t i = 0; i < segments.size(); ++i )
1841 _segments[i].Set( segments[i] );
1846 //================================================================================
1848 * \brief Return the maximal bnd box
1850 //================================================================================
1852 _SegmentTree::box_type* _SegmentTree::buildRootBox()
1854 _SegmentTree::box_type* box = new _SegmentTree::box_type;
1855 for ( size_t i = 0; i < _segments.size(); ++i )
1857 box->Add( *_segments[i]._seg->_uv[0] );
1858 box->Add( *_segments[i]._seg->_uv[1] );
1863 //================================================================================
1865 * \brief Redistrubute _segments among children
1867 //================================================================================
1869 void _SegmentTree::buildChildrenData()
1871 for ( int i = 0; i < _segments.size(); ++i )
1872 for (int j = 0; j < nbChildren(); j++)
1873 if ( !myChildren[j]->getBox()->IsOut( *_segments[i]._seg->_uv[0],
1874 *_segments[i]._seg->_uv[1] ))
1875 ((_SegmentTree*)myChildren[j])->_segments.push_back( _segments[i]);
1877 SMESHUtils::FreeVector( _segments ); // = _elements.clear() + free memory
1879 for (int j = 0; j < nbChildren(); j++)
1881 _SegmentTree* child = static_cast<_SegmentTree*>( myChildren[j]);
1882 child->myIsLeaf = ( child->_segments.size() <= maxNbSegInLeaf() );
1886 //================================================================================
1888 * \brief Return elements which can include the point
1890 //================================================================================
1892 void _SegmentTree::GetSegmentsNear( const _Segment& seg,
1893 vector< const _Segment* >& found )
1895 if ( getBox()->IsOut( *seg._uv[0], *seg._uv[1] ))
1900 for ( int i = 0; i < _segments.size(); ++i )
1901 if ( !_segments[i].IsOut( seg ))
1902 found.push_back( _segments[i]._seg );
1906 for (int i = 0; i < nbChildren(); i++)
1907 ((_SegmentTree*) myChildren[i])->GetSegmentsNear( seg, found );
1912 //================================================================================
1914 * \brief Return segments intersecting a ray
1916 //================================================================================
1918 void _SegmentTree::GetSegmentsNear( const gp_Ax2d& ray,
1919 vector< const _Segment* >& found )
1921 if ( getBox()->IsOut( ray ))
1926 for ( int i = 0; i < _segments.size(); ++i )
1927 if ( !_segments[i].IsOut( ray ))
1928 found.push_back( _segments[i]._seg );
1932 for (int i = 0; i < nbChildren(); i++)
1933 ((_SegmentTree*) myChildren[i])->GetSegmentsNear( ray, found );
1937 //================================================================================
1939 * \brief Classify a _Segment
1941 //================================================================================
1943 bool _SegmentTree::_SegBox::IsOut( const _Segment& seg ) const
1945 const double eps = std::numeric_limits<double>::min();
1946 for ( int iC = 0; iC < 2; ++iC )
1948 if ( seg._uv[0]->Coord(iC+1) < _seg->_uv[ _iMin[iC]]->Coord(iC+1)+eps &&
1949 seg._uv[1]->Coord(iC+1) < _seg->_uv[ _iMin[iC]]->Coord(iC+1)+eps )
1951 if ( seg._uv[0]->Coord(iC+1) > _seg->_uv[ 1-_iMin[iC]]->Coord(iC+1)-eps &&
1952 seg._uv[1]->Coord(iC+1) > _seg->_uv[ 1-_iMin[iC]]->Coord(iC+1)-eps )
1958 //================================================================================
1960 * \brief Classify a ray
1962 //================================================================================
1964 bool _SegmentTree::_SegBox::IsOut( const gp_Ax2d& ray ) const
1966 double distBoxCenter2Ray =
1967 ray.Direction().XY() ^ ( ray.Location().XY() - 0.5 * (*_seg->_uv[0] + *_seg->_uv[1]));
1969 double boxSectionDiam =
1970 Abs( ray.Direction().X() ) * ( _seg->_uv[1-_iMin[1]]->Y() - _seg->_uv[_iMin[1]]->Y() ) +
1971 Abs( ray.Direction().Y() ) * ( _seg->_uv[1-_iMin[0]]->X() - _seg->_uv[_iMin[0]]->X() );
1973 return Abs( distBoxCenter2Ray ) > 0.5 * boxSectionDiam;