1 // Copyright (C) 2007-2011 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // File : StdMeshers_Cartesian_3D.cxx
25 #include "StdMeshers_Cartesian_3D.hxx"
27 #include "SMDS_MeshNode.hxx"
28 #include "SMESH_Block.hxx"
29 #include "SMESH_Comment.hxx"
30 #include "SMESH_Mesh.hxx"
31 #include "SMESH_MesherHelper.hxx"
32 #include "SMESH_subMesh.hxx"
33 #include "SMESH_subMeshEventListener.hxx"
34 #include "StdMeshers_CartesianParameters3D.hxx"
36 #include "utilities.h"
37 #include "Utils_ExceptHandlers.hxx"
39 #include <BRepAdaptor_Surface.hxx>
40 #include <BRepBndLib.hxx>
41 #include <BRepBuilderAPI_Copy.hxx>
42 #include <BRepTools.hxx>
43 #include <BRep_Tool.hxx>
44 #include <Bnd_Box.hxx>
46 #include <Geom2d_BSplineCurve.hxx>
47 #include <Geom2d_BezierCurve.hxx>
48 #include <Geom2d_TrimmedCurve.hxx>
49 #include <Geom_BSplineCurve.hxx>
50 #include <Geom_BSplineSurface.hxx>
51 #include <Geom_BezierCurve.hxx>
52 #include <Geom_BezierSurface.hxx>
53 #include <Geom_RectangularTrimmedSurface.hxx>
54 #include <Geom_TrimmedCurve.hxx>
55 #include <IntAna_IntConicQuad.hxx>
56 #include <IntAna_IntLinTorus.hxx>
57 #include <IntAna_Quadric.hxx>
58 #include <IntCurveSurface_TransitionOnCurve.hxx>
59 #include <IntCurvesFace_Intersector.hxx>
60 #include <Poly_Triangulation.hxx>
61 #include <Precision.hxx>
63 #include <TopExp_Explorer.hxx>
64 #include <TopLoc_Location.hxx>
65 #include <TopTools_MapIteratorOfMapOfShape.hxx>
66 #include <TopTools_MapOfShape.hxx>
68 #include <TopoDS_Face.hxx>
69 #include <TopoDS_TShape.hxx>
70 #include <gp_Cone.hxx>
71 #include <gp_Cylinder.hxx>
74 #include <gp_Pnt2d.hxx>
75 #include <gp_Sphere.hxx>
76 #include <gp_Torus.hxx>
80 #include <tbb/parallel_for.h>
81 //#include <tbb/enumerable_thread_specific.h>
88 //=============================================================================
92 //=============================================================================
94 StdMeshers_Cartesian_3D::StdMeshers_Cartesian_3D(int hypId, int studyId, SMESH_Gen * gen)
95 :SMESH_3D_Algo(hypId, studyId, gen)
97 _name = "Cartesian_3D";
98 _shapeType = (1 << TopAbs_SOLID); // 1 bit /shape type
99 _compatibleHypothesis.push_back("CartesianParameters3D");
101 _onlyUnaryInput = false; // to mesh all SOLIDs at once
102 _requireDiscreteBoundary = false; // 2D mesh not needed
103 _supportSubmeshes = false; // do not use any existing mesh
106 //=============================================================================
108 * Check presence of a hypothesis
110 //=============================================================================
112 bool StdMeshers_Cartesian_3D::CheckHypothesis (SMESH_Mesh& aMesh,
113 const TopoDS_Shape& aShape,
114 Hypothesis_Status& aStatus)
116 aStatus = SMESH_Hypothesis::HYP_MISSING;
118 const list<const SMESHDS_Hypothesis*>& hyps = GetUsedHypothesis(aMesh, aShape);
119 list <const SMESHDS_Hypothesis* >::const_iterator h = hyps.begin();
120 if ( h == hyps.end())
125 for ( ; h != hyps.end(); ++h )
127 if (( _hyp = dynamic_cast<const StdMeshers_CartesianParameters3D*>( *h )))
129 aStatus = _hyp->IsDefined() ? HYP_OK : HYP_BAD_PARAMETER;
134 return aStatus == HYP_OK;
139 //=============================================================================
140 // Definitions of internal utils
141 // --------------------------------------------------------------------------
143 Trans_TANGENT = IntCurveSurface_Tangent,
144 Trans_IN = IntCurveSurface_In,
145 Trans_OUT = IntCurveSurface_Out,
148 // --------------------------------------------------------------------------
150 * \brief Data of intersection between a GridLine and a TopoDS_Face
152 struct IntersectionPoint
155 mutable Transition _transition;
156 mutable const SMDS_MeshNode* _node;
157 mutable size_t _indexOnLine;
159 IntersectionPoint(): _node(0) {}
160 bool operator< ( const IntersectionPoint& o ) const { return _paramOnLine < o._paramOnLine; }
162 // --------------------------------------------------------------------------
164 * \brief A line of the grid and its intersections with 2D geometry
169 double _length; // line length
170 multiset< IntersectionPoint > _intPoints;
172 void RemoveExcessIntPoints( const double tol );
173 bool GetIsOutBefore( multiset< IntersectionPoint >::iterator ip, bool prevIsOut );
175 // --------------------------------------------------------------------------
177 * \brief Iterator on the parallel grid lines of one direction
183 size_t _iVar1, _iVar2, _iConst;
184 string _name1, _name2, _nameConst;
186 LineIndexer( size_t sz1, size_t sz2, size_t sz3,
187 size_t iv1, size_t iv2, size_t iConst,
188 const string& nv1, const string& nv2, const string& nConst )
190 _size[0] = sz1; _size[1] = sz2; _size[2] = sz3;
191 _curInd[0] = _curInd[1] = _curInd[2] = 0;
192 _iVar1 = iv1; _iVar2 = iv2; _iConst = iConst;
193 _name1 = nv1; _name2 = nv2; _nameConst = nConst;
196 size_t I() const { return _curInd[0]; }
197 size_t J() const { return _curInd[1]; }
198 size_t K() const { return _curInd[2]; }
199 void SetIJK( size_t i, size_t j, size_t k )
201 _curInd[0] = i; _curInd[1] = j; _curInd[2] = k;
205 if ( ++_curInd[_iVar1] == _size[_iVar1] )
206 _curInd[_iVar1] = 0, ++_curInd[_iVar2];
208 bool More() const { return _curInd[_iVar2] < _size[_iVar2]; }
209 size_t LineIndex () const { return _curInd[_iVar1] + _curInd[_iVar2]* _size[_iVar1]; }
210 size_t LineIndex10 () const { return (_curInd[_iVar1] + 1 ) + _curInd[_iVar2]* _size[_iVar1]; }
211 size_t LineIndex01 () const { return _curInd[_iVar1] + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
212 size_t LineIndex11 () const { return (_curInd[_iVar1] + 1 ) + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
213 void SetIndexOnLine (size_t i) { _curInd[ _iConst ] = i; }
214 size_t NbLines() const { return _size[_iVar1] * _size[_iVar2]; }
216 // --------------------------------------------------------------------------
218 * \brief Container of GridLine's
222 vector< double > _coords[3]; // coordinates of grid nodes
223 vector< GridLine > _lines [3]; // in 3 directions
224 double _tol, _minCellSize;
226 vector< const SMDS_MeshNode* > _nodes; // mesh nodes at grid nodes
227 vector< bool > _isBndNode; // is mesh node at intersection with geometry
229 size_t CellIndex( size_t i, size_t j, size_t k ) const
231 return i + j*(_coords[0].size()-1) + k*(_coords[0].size()-1)*(_coords[1].size()-1);
233 size_t NodeIndex( size_t i, size_t j, size_t k ) const
235 return i + j*_coords[0].size() + k*_coords[0].size()*_coords[1].size();
237 size_t NodeIndexDX() const { return 1; }
238 size_t NodeIndexDY() const { return _coords[0].size(); }
239 size_t NodeIndexDZ() const { return _coords[0].size() * _coords[1].size(); }
241 LineIndexer GetLineIndexer(size_t iDir) const;
243 void SetCoordinates(const vector<double>& xCoords,
244 const vector<double>& yCoords,
245 const vector<double>& zCoords,
246 const TopoDS_Shape& shape );
247 void ComputeNodes(SMESH_MesherHelper& helper);
249 // --------------------------------------------------------------------------
251 * \brief Intersector of TopoDS_Face with all GridLine's
253 struct FaceGridIntersector
258 IntCurvesFace_Intersector* _surfaceInt;
259 vector< std::pair< GridLine*, IntersectionPoint > > _intersections;
261 FaceGridIntersector(): _grid(0), _surfaceInt(0) {}
263 bool IsInGrid(const Bnd_Box& gridBox);
265 void StoreIntersections()
267 for ( size_t i = 0; i < _intersections.size(); ++i )
268 _intersections[i].first->_intPoints.insert( _intersections[i].second );
270 const Bnd_Box& GetFaceBndBox()
272 GetCurveFaceIntersector();
275 IntCurvesFace_Intersector* GetCurveFaceIntersector()
279 _surfaceInt = new IntCurvesFace_Intersector( _face, Precision::PConfusion() );
280 _bndBox = _surfaceInt->Bounding();
281 if ( _bndBox.IsVoid() )
282 BRepBndLib::Add (_face, _bndBox);
286 bool IsThreadSafe() const;
288 // --------------------------------------------------------------------------
290 * \brief Intersector of a surface with a GridLine
292 struct FaceLineIntersector
295 double _u, _v, _w; // params on the face and the line
296 Transition _transition; // transition of at intersection (see IntCurveSurface.cdl)
297 Transition _transIn, _transOut; // IN and OUT transitions depending of face orientation
300 gp_Cylinder _cylinder;
304 IntCurvesFace_Intersector* _surfaceInt;
306 vector< IntersectionPoint > _intPoints;
308 void IntersectWithPlane (const GridLine& gridLine);
309 void IntersectWithCylinder(const GridLine& gridLine);
310 void IntersectWithCone (const GridLine& gridLine);
311 void IntersectWithSphere (const GridLine& gridLine);
312 void IntersectWithTorus (const GridLine& gridLine);
313 void IntersectWithSurface (const GridLine& gridLine);
315 void addIntPoint(const bool toClassify=true);
316 bool isParamOnLineOK( const double linLength )
318 return -_tol < _w && _w < linLength + _tol;
320 FaceLineIntersector():_surfaceInt(0) {}
321 ~FaceLineIntersector() { if (_surfaceInt ) delete _surfaceInt; _surfaceInt = 0; }
323 // --------------------------------------------------------------------------
325 * \brief Class representing topology of the hexahedron and creating a mesh
326 * volume basing on analysis of hexahedron intersection with geometry
330 // --------------------------------------------------------------------------------
333 // --------------------------------------------------------------------------------
334 struct _Node //!< node either at a hexahedron corner or at GridLine intersection
336 const SMDS_MeshNode* _node; // mesh node at hexahedron corner
337 const IntersectionPoint* _intPoint;
339 _Node(const SMDS_MeshNode* n=0, const IntersectionPoint* ip=0):_node(n), _intPoint(ip) {}
340 const SMDS_MeshNode* Node() const { return _intPoint ? _intPoint->_node : _node; }
341 //bool IsCorner() const { return _node; }
343 // --------------------------------------------------------------------------------
344 struct _Link // link connecting two _Node's
347 vector< _Node> _intNodes; // _Node's at GridLine intersections
348 vector< _Link > _splits;
349 vector< _Face*> _faces;
351 // --------------------------------------------------------------------------------
356 _OrientedLink( _Link* link=0, bool reverse=false ): _link(link), _reverse(reverse) {}
357 void Reverse() { _reverse = !_reverse; }
358 int NbResultLinks() const { return _link->_splits.size(); }
359 _OrientedLink ResultLink(int i) const
361 return _OrientedLink(&_link->_splits[_reverse ? NbResultLinks()-i-1 : i],_reverse);
363 _Node* FirstNode() const { return _link->_nodes[ _reverse ]; }
364 _Node* LastNode() const { return _link->_nodes[ !_reverse ]; }
366 // --------------------------------------------------------------------------------
369 vector< _OrientedLink > _links;
370 vector< _Link > _polyLinks; // links added to close a polygonal face
372 // --------------------------------------------------------------------------------
373 struct _volumeDef // holder of nodes of a volume mesh element
375 vector< const SMDS_MeshNode* > _nodes;
376 vector< int > _quantities;
377 typedef boost::shared_ptr<_volumeDef> Ptr;
378 void set( const vector< const SMDS_MeshNode* >& nodes,
379 const vector< int > quant = vector< int >() )
380 { _nodes = nodes; _quantities = quant; }
381 // static Ptr New( const vector< const SMDS_MeshNode* >& nodes,
382 // const vector< int > quant = vector< int >() )
384 // _volumeDef* def = new _volumeDef;
385 // def->_nodes = nodes;
386 // def->_quantities = quant;
387 // return Ptr( def );
391 // topology of a hexahedron
397 // faces resulted from hexahedron intersection
398 vector< _Face > _polygons;
400 // computed volume elements
401 //vector< _volumeDef::Ptr > _volumeDefs;
402 _volumeDef _volumeDefs;
405 double _sizeThreshold, _sideLength[3];
406 int _nbCornerNodes, _nbIntNodes, _nbBndNodes;
407 int _origNodeInd; // index of _hexNodes[0] node within the _grid
411 Hexahedron(const double sizeThreshold, Grid* grid);
412 int MakeElements(SMESH_MesherHelper& helper);
413 void ComputeElements();
414 void Init() { init( _i, _j, _k ); }
417 Hexahedron(const Hexahedron& other );
418 void init( size_t i, size_t j, size_t k );
419 void init( size_t i );
420 int addElements(SMESH_MesherHelper& helper);
421 bool isInHole() const;
422 bool checkPolyhedronSize() const;
430 // --------------------------------------------------------------------------
432 * \brief Hexahedron computing volumes in one thread
434 struct ParallelHexahedron
436 vector< Hexahedron* >& _hexVec;
438 ParallelHexahedron( vector< Hexahedron* >& hv, vector<int>& ind): _hexVec(hv), _index(ind) {}
439 void operator() ( const tbb::blocked_range<size_t>& r ) const
441 for ( size_t i = r.begin(); i != r.end(); ++i )
442 if ( Hexahedron* hex = _hexVec[ _index[i]] )
443 hex->ComputeElements();
446 // --------------------------------------------------------------------------
448 * \brief Structure intersecting certain nb of faces with GridLine's in one thread
450 struct ParallelIntersector
452 vector< FaceGridIntersector >& _faceVec;
453 ParallelIntersector( vector< FaceGridIntersector >& faceVec): _faceVec(faceVec){}
454 void operator() ( const tbb::blocked_range<size_t>& r ) const
456 for ( size_t i = r.begin(); i != r.end(); ++i )
457 _faceVec[i].Intersect();
462 //=============================================================================
463 // Implementation of internal utils
464 //=============================================================================
466 * Remove coincident intersection points
468 void GridLine::RemoveExcessIntPoints( const double tol )
470 if ( _intPoints.size() < 2 ) return;
472 set< Transition > tranSet;
473 multiset< IntersectionPoint >::iterator ip1, ip2 = _intPoints.begin();
474 while ( ip2 != _intPoints.end() )
478 while ( ip2->_paramOnLine - ip1->_paramOnLine <= tol && ip2 != _intPoints.end())
480 tranSet.insert( ip1->_transition );
481 tranSet.insert( ip2->_transition );
482 _intPoints.erase( ip1 );
485 if ( tranSet.size() > 1 ) // points with different transition coincide
487 bool isIN = tranSet.count( Trans_IN );
488 bool isOUT = tranSet.count( Trans_OUT );
490 (*ip1)._transition = Trans_TANGENT;
492 (*ip1)._transition = isIN ? Trans_IN : Trans_OUT;
496 //================================================================================
498 * Return "is OUT" state for nodes before the given intersection point
500 bool GridLine::GetIsOutBefore( multiset< IntersectionPoint >::iterator ip, bool prevIsOut )
502 if ( ip->_transition == Trans_IN )
504 if ( ip->_transition == Trans_OUT )
506 if ( ip->_transition == Trans_APEX )
508 // singularity point (apex of a cone)
509 if ( _intPoints.size() == 1 || ip == _intPoints.begin() )
511 multiset< IntersectionPoint >::iterator ipBef = ip, ipAft = ++ip;
512 if ( ipAft == _intPoints.end() )
515 if ( ipBef->_transition != ipAft->_transition )
516 return ( ipBef->_transition == Trans_OUT );
517 return ( ipBef->_transition != Trans_OUT );
519 return prevIsOut; // _transition == Trans_TANGENT
521 //================================================================================
523 * Return an iterator on GridLine's in a given direction
525 LineIndexer Grid::GetLineIndexer(size_t iDir) const
527 const size_t indices[] = { 1,2,0, 0,2,1, 0,1,2 };
528 const string s[] = { "X", "Y", "Z" };
529 LineIndexer li( _coords[0].size(), _coords[1].size(), _coords[2].size(),
530 indices[iDir*3], indices[iDir*3+1], indices[iDir*3+2],
531 s[indices[iDir*3]], s[indices[iDir*3+1]], s[indices[iDir*3+2]]);
534 //=============================================================================
536 * Creates GridLine's of the grid
538 void Grid::SetCoordinates(const vector<double>& xCoords,
539 const vector<double>& yCoords,
540 const vector<double>& zCoords,
541 const TopoDS_Shape& shape)
543 _coords[0] = xCoords;
544 _coords[1] = yCoords;
545 _coords[2] = zCoords;
548 _minCellSize = Precision::Infinite();
549 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
551 for ( size_t i = 1; i < _coords[ iDir ].size(); ++i )
553 double cellLen = _coords[ iDir ][ i ] - _coords[ iDir ][ i-1 ];
554 if ( cellLen < _minCellSize )
555 _minCellSize = cellLen;
558 if ( _minCellSize < Precision::Confusion() )
559 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
560 SMESH_Comment("Too small cell size: ") << _tol );
561 _tol = _minCellSize / 1000.;
563 // attune grid extremities to shape bounding box computed by vertices
565 for ( TopExp_Explorer vExp( shape, TopAbs_VERTEX ); vExp.More(); vExp.Next() )
566 shapeBox.Add( BRep_Tool::Pnt( TopoDS::Vertex( vExp.Current() )));
568 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
569 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
570 double* cP[6] = { &_coords[0].front(), &_coords[1].front(), &_coords[2].front(),
571 &_coords[0].back(), &_coords[1].back(), &_coords[2].back() };
572 for ( int i = 0; i < 6; ++i )
573 if ( fabs( sP[i] - *cP[i] ) < _tol )
574 *cP[i] = sP[i] + _tol/1000. * ( i < 3 ? +1 : -1 );
577 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
579 LineIndexer li = GetLineIndexer( iDir );
580 _lines[iDir].resize( li.NbLines() );
581 double len = _coords[ iDir ].back() - _coords[iDir].front();
582 gp_Vec dir( iDir==0, iDir==1, iDir==2 );
583 for ( ; li.More(); ++li )
585 GridLine& gl = _lines[iDir][ li.LineIndex() ];
586 gl._line.SetLocation(gp_Pnt(_coords[0][li.I()], _coords[1][li.J()], _coords[2][li.K()]));
587 gl._line.SetDirection( dir );
592 //================================================================================
596 void Grid::ComputeNodes(SMESH_MesherHelper& helper)
598 // state of each node of the grid relative to the geomerty
599 const size_t nbGridNodes = _coords[0].size() * _coords[1].size() * _coords[2].size();
600 vector< bool > isNodeOut( nbGridNodes, false );
601 _nodes.resize( nbGridNodes, 0 );
602 _isBndNode.resize( nbGridNodes, false );
604 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
606 LineIndexer li = GetLineIndexer( iDir );
608 // find out a shift of node index while walking along a GridLine in this direction
609 li.SetIndexOnLine( 0 );
610 size_t nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
611 li.SetIndexOnLine( 1 );
612 const size_t nShift = NodeIndex( li.I(), li.J(), li.K() ) - nIndex0;
614 const vector<double> & coords = _coords[ iDir ];
615 for ( ; li.More(); ++li ) // loop on lines in iDir
617 li.SetIndexOnLine( 0 );
618 nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
620 GridLine& line = _lines[ iDir ][ li.LineIndex() ];
621 line.RemoveExcessIntPoints( _tol );
622 multiset< IntersectionPoint >& intPnts = _lines[ iDir ][ li.LineIndex() ]._intPoints;
623 multiset< IntersectionPoint >::iterator ip = intPnts.begin();
626 const double* nodeCoord = & coords[0], *coord0 = nodeCoord, *coordEnd = coord0 + coords.size();
627 double nodeParam = 0;
628 for ( ; ip != intPnts.end(); ++ip )
630 // set OUT state or just skip IN nodes before ip
631 if ( nodeParam < ip->_paramOnLine - _tol )
633 isOut = line.GetIsOutBefore( ip, isOut );
635 while ( nodeParam < ip->_paramOnLine - _tol )
638 isNodeOut[ nIndex0 + nShift * ( nodeCoord-coord0 ) ] = isOut;
639 if ( ++nodeCoord < coordEnd )
640 nodeParam = *nodeCoord - *coord0;
644 if ( nodeCoord == coordEnd ) break;
646 // create a mesh node on a GridLine at ip if it does not coincide with a grid node
647 if ( nodeParam > ip->_paramOnLine + _tol )
649 li.SetIndexOnLine( 0 );
650 double xyz[3] = { _coords[0][ li.I() ], _coords[1][ li.J() ], _coords[2][ li.K() ]};
651 xyz[ li._iConst ] += ip->_paramOnLine;
652 ip->_node = helper.AddNode( xyz[0], xyz[1], xyz[2] );
653 ip->_indexOnLine = nodeCoord-coord0-1;
655 // create a mesh node at ip concident with a grid node
658 int nodeIndex = nIndex0 + nShift * ( nodeCoord-coord0 );
659 if ( ! _nodes[ nodeIndex ] )
661 li.SetIndexOnLine( nodeCoord-coord0 );
662 double xyz[3] = { _coords[0][ li.I() ], _coords[1][ li.J() ], _coords[2][ li.K() ]};
663 _nodes[ nodeIndex ] = helper.AddNode( xyz[0], xyz[1], xyz[2] );
664 _isBndNode[ nodeIndex ] = true;
666 //ip->_node = _nodes[ nodeIndex ];
667 ip->_indexOnLine = nodeCoord-coord0;
668 if ( ++nodeCoord < coordEnd )
669 nodeParam = *nodeCoord - *coord0;
672 // set OUT state to nodes after the last ip
673 for ( ; nodeCoord < coordEnd; ++nodeCoord )
674 isNodeOut[ nIndex0 + nShift * ( nodeCoord-coord0 ) ] = true;
678 // Create mesh nodes at !OUT nodes of the grid
680 for ( size_t z = 0; z < _coords[2].size(); ++z )
681 for ( size_t y = 0; y < _coords[1].size(); ++y )
682 for ( size_t x = 0; x < _coords[0].size(); ++x )
684 size_t nodeIndex = NodeIndex( x, y, z );
685 if ( !isNodeOut[ nodeIndex ] && !_nodes[ nodeIndex] )
686 _nodes[ nodeIndex ] = helper.AddNode( _coords[0][x], _coords[1][y], _coords[2][z] );
690 // check validity of transitions
691 const char* trName[] = { "TANGENT", "IN", "OUT", "APEX" };
692 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
694 LineIndexer li = GetLineIndexer( iDir );
695 for ( ; li.More(); ++li )
697 multiset< IntersectionPoint >& intPnts = _lines[ iDir ][ li.LineIndex() ]._intPoints;
698 if ( intPnts.empty() ) continue;
699 if ( intPnts.size() == 1 )
701 if ( intPnts.begin()->_transition != Trans_TANGENT &&
702 intPnts.begin()->_transition != Trans_APEX )
703 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
704 SMESH_Comment("Wrong SOLE transition of GridLine (")
705 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
706 << ") along " << li._nameConst
707 << ": " << trName[ intPnts.begin()->_transition] );
711 if ( intPnts.begin()->_transition == Trans_OUT )
712 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
713 SMESH_Comment("Wrong START transition of GridLine (")
714 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
715 << ") along " << li._nameConst
716 << ": " << trName[ intPnts.begin()->_transition ]);
717 if ( intPnts.rbegin()->_transition == Trans_IN )
718 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
719 SMESH_Comment("Wrong END transition of GridLine (")
720 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
721 << ") along " << li._nameConst
722 << ": " << trName[ intPnts.rbegin()->_transition ]);
729 //=============================================================================
731 * Checks if the face is encosed by the grid
733 bool FaceGridIntersector::IsInGrid(const Bnd_Box& gridBox)
735 double x0,y0,z0, x1,y1,z1;
736 const Bnd_Box& faceBox = GetFaceBndBox();
737 faceBox.Get(x0,y0,z0, x1,y1,z1);
739 if ( !gridBox.IsOut( gp_Pnt( x0,y0,z0 )) &&
740 !gridBox.IsOut( gp_Pnt( x1,y1,z1 )))
743 double X0,Y0,Z0, X1,Y1,Z1;
744 gridBox.Get(X0,Y0,Z0, X1,Y1,Z1);
745 double faceP[6] = { x0,y0,z0, x1,y1,z1 };
746 double gridP[6] = { X0,Y0,Z0, X1,Y1,Z1 };
747 gp_Dir axes[3] = { gp::DX(), gp::DY(), gp::DZ() };
748 for ( int iDir = 0; iDir < 6; ++iDir )
750 if ( iDir < 3 && gridP[ iDir ] <= faceP[ iDir ] ) continue;
751 if ( iDir >= 3 && gridP[ iDir ] >= faceP[ iDir ] ) continue;
753 // check if the face intersects a side of a gridBox
755 gp_Pnt p = iDir < 3 ? gp_Pnt( X0,Y0,Z0 ) : gp_Pnt( X1,Y1,Z1 );
756 gp_Ax1 norm( p, axes[ iDir % 3 ] );
757 if ( iDir < 3 ) norm.Reverse();
759 gp_XYZ O = norm.Location().XYZ(), N = norm.Direction().XYZ();
761 TopLoc_Location loc = _face.Location();
762 Handle(Poly_Triangulation) aPoly = BRep_Tool::Triangulation(_face,loc);
763 if ( !aPoly.IsNull() )
765 if ( !loc.IsIdentity() )
767 norm.Transform( loc.Transformation().Inverted() );
768 O = norm.Location().XYZ(), N = norm.Direction().XYZ();
770 const double deflection = aPoly->Deflection();
772 const TColgp_Array1OfPnt& nodes = aPoly->Nodes();
773 for ( int i = nodes.Lower(); i <= nodes.Upper(); ++i )
774 if (( nodes( i ).XYZ() - O ) * N > _grid->_tol + deflection )
779 BRepAdaptor_Surface surf( _face );
780 double u0, u1, v0, v1, du, dv, u, v;
781 BRepTools::UVBounds( _face, u0, u1, v0, v1);
782 if ( surf.GetType() == GeomAbs_Plane ) {
783 du = u1 - u0, dv = v1 - v0;
786 du = surf.UResolution( _grid->_minCellSize / 10. );
787 dv = surf.VResolution( _grid->_minCellSize / 10. );
789 for ( u = u0, v = v0; u <= u1 && v <= v1; u += du, v += dv )
791 gp_Pnt p = surf.Value( u, v );
792 if (( p.XYZ() - O ) * N > _grid->_tol )
794 TopAbs_State state = GetCurveFaceIntersector()->ClassifyUVPoint(gp_Pnt2d( u, v ));
795 if ( state == TopAbs_IN || state == TopAbs_ON )
803 //=============================================================================
805 * Intersects TopoDS_Face with all GridLine's
807 void FaceGridIntersector::Intersect()
809 FaceLineIntersector intersector;
810 intersector._surfaceInt = GetCurveFaceIntersector();
811 intersector._tol = _grid->_tol;
812 intersector._transOut = _face.Orientation() == TopAbs_REVERSED ? Trans_IN : Trans_OUT;
813 intersector._transIn = _face.Orientation() == TopAbs_REVERSED ? Trans_OUT : Trans_IN;
815 typedef void (FaceLineIntersector::* PIntFun )(const GridLine& gridLine);
816 PIntFun interFunction;
818 BRepAdaptor_Surface surf( _face );
819 switch ( surf.GetType() ) {
821 intersector._plane = surf.Plane();
822 interFunction = &FaceLineIntersector::IntersectWithPlane;
824 case GeomAbs_Cylinder:
825 intersector._cylinder = surf.Cylinder();
826 interFunction = &FaceLineIntersector::IntersectWithCylinder;
829 intersector._cone = surf.Cone();
830 interFunction = &FaceLineIntersector::IntersectWithCone;
833 intersector._sphere = surf.Sphere();
834 interFunction = &FaceLineIntersector::IntersectWithSphere;
837 intersector._torus = surf.Torus();
838 interFunction = &FaceLineIntersector::IntersectWithTorus;
841 interFunction = &FaceLineIntersector::IntersectWithSurface;
844 _intersections.clear();
845 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
847 if ( surf.GetType() == GeomAbs_Plane )
849 // check if all lines in this direction are parallel to a plane
850 if ( intersector._plane.Axis().IsNormal( _grid->_lines[iDir][0]._line.Position(),
851 Precision::Angular()))
853 // find out a transition, that is the same for all lines of a direction
854 gp_Dir plnNorm = intersector._plane.Axis().Direction();
855 gp_Dir lineDir = _grid->_lines[iDir][0]._line.Direction();
856 intersector._transition =
857 ( plnNorm * lineDir < 0 ) ? intersector._transIn : intersector._transOut;
859 if ( surf.GetType() == GeomAbs_Cylinder )
861 // check if all lines in this direction are parallel to a cylinder
862 if ( intersector._cylinder.Axis().IsParallel( _grid->_lines[iDir][0]._line.Position(),
863 Precision::Angular()))
867 // intersect the grid lines with the face
868 for ( size_t iL = 0; iL < _grid->_lines[iDir].size(); ++iL )
870 GridLine& gridLine = _grid->_lines[iDir][iL];
871 if ( _bndBox.IsOut( gridLine._line )) continue;
873 intersector._intPoints.clear();
874 (intersector.*interFunction)( gridLine );
875 for ( size_t i = 0; i < intersector._intPoints.size(); ++i )
876 _intersections.push_back( make_pair( &gridLine, intersector._intPoints[i] ));
880 //================================================================================
882 * Store an intersection if it is In or ON the face
884 void FaceLineIntersector::addIntPoint(const bool toClassify)
886 TopAbs_State state = toClassify ? _surfaceInt->ClassifyUVPoint(gp_Pnt2d( _u, _v )) : TopAbs_IN;
887 if ( state == TopAbs_IN || state == TopAbs_ON )
891 p._transition = _transition;
892 _intPoints.push_back( p );
895 //================================================================================
897 * Intersect a line with a plane
899 void FaceLineIntersector::IntersectWithPlane (const GridLine& gridLine)
901 IntAna_IntConicQuad linPlane( gridLine._line, _plane, Precision::Angular());
902 _w = linPlane.ParamOnConic(1);
903 if ( isParamOnLineOK( gridLine._length ))
905 ElSLib::Parameters(_plane, linPlane.Point(1) ,_u,_v);
909 //================================================================================
911 * Intersect a line with a cylinder
913 void FaceLineIntersector::IntersectWithCylinder(const GridLine& gridLine)
915 IntAna_IntConicQuad linCylinder( gridLine._line,_cylinder);
916 if ( linCylinder.IsDone() && linCylinder.NbPoints() > 0 )
918 _w = linCylinder.ParamOnConic(1);
919 if ( linCylinder.NbPoints() == 1 )
920 _transition = Trans_TANGENT;
922 _transition = _w < linCylinder.ParamOnConic(2) ? _transIn : _transOut;
923 if ( isParamOnLineOK( gridLine._length ))
925 ElSLib::Parameters(_cylinder, linCylinder.Point(1) ,_u,_v);
928 if ( linCylinder.NbPoints() > 1 )
930 _w = linCylinder.ParamOnConic(2);
931 if ( isParamOnLineOK( gridLine._length ))
933 ElSLib::Parameters(_cylinder, linCylinder.Point(2) ,_u,_v);
934 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
940 //================================================================================
942 * Intersect a line with a cone
944 void FaceLineIntersector::IntersectWithCone (const GridLine& gridLine)
946 IntAna_IntConicQuad linCone(gridLine._line,_cone);
947 if ( !linCone.IsDone() ) return;
950 for ( int i = 1; i <= linCone.NbPoints(); ++i )
952 _w = linCone.ParamOnConic( i );
953 if ( !isParamOnLineOK( gridLine._length )) continue;
954 ElSLib::Parameters(_cone, linCone.Point(i) ,_u,_v);
955 TopAbs_State state = _surfaceInt->ClassifyUVPoint(gp_Pnt2d( _u, _v ));
956 if ( state == TopAbs_IN || state == TopAbs_ON )
958 ElSLib::D1( _u, _v, _cone, P, du, dv );
960 double normSize2 = norm.SquareMagnitude();
961 if ( normSize2 > Precision::Angular() * Precision::Angular() )
963 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
964 cos /= sqrt( normSize2 );
965 if ( cos < -Precision::Angular() )
966 _transition = _transIn;
967 else if ( cos > Precision::Angular() )
968 _transition = _transOut;
970 _transition = Trans_TANGENT;
974 _transition = Trans_APEX;
976 addIntPoint( /*toClassify=*/false);
980 //================================================================================
982 * Intersect a line with a sphere
984 void FaceLineIntersector::IntersectWithSphere (const GridLine& gridLine)
986 IntAna_IntConicQuad linSphere(gridLine._line,_sphere);
987 if ( linSphere.IsDone() && linSphere.NbPoints() > 0 )
989 _w = linSphere.ParamOnConic(1);
990 if ( linSphere.NbPoints() == 1 )
991 _transition = Trans_TANGENT;
993 _transition = _w < linSphere.ParamOnConic(2) ? _transIn : _transOut;
994 if ( isParamOnLineOK( gridLine._length ))
996 ElSLib::Parameters(_sphere, linSphere.Point(1) ,_u,_v);
999 if ( linSphere.NbPoints() > 1 )
1001 _w = linSphere.ParamOnConic(2);
1002 if ( isParamOnLineOK( gridLine._length ))
1004 ElSLib::Parameters(_sphere, linSphere.Point(2) ,_u,_v);
1005 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
1011 //================================================================================
1013 * Intersect a line with a torus
1015 void FaceLineIntersector::IntersectWithTorus (const GridLine& gridLine)
1017 IntAna_IntLinTorus linTorus(gridLine._line,_torus);
1018 if ( !linTorus.IsDone()) return;
1020 gp_Vec du, dv, norm;
1021 for ( int i = 1; i <= linTorus.NbPoints(); ++i )
1023 _w = linTorus.ParamOnLine( i );
1024 if ( !isParamOnLineOK( gridLine._length )) continue;
1025 linTorus.ParamOnTorus( i, _u,_v );
1026 TopAbs_State state = _surfaceInt->ClassifyUVPoint(gp_Pnt2d( _u, _v ));
1027 if ( state == TopAbs_IN || state == TopAbs_ON )
1029 ElSLib::D1( _u, _v, _torus, P, du, dv );
1031 double normSize = norm.Magnitude();
1032 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
1034 if ( cos < -Precision::Angular() )
1035 _transition = _transIn;
1036 else if ( cos > Precision::Angular() )
1037 _transition = _transOut;
1039 _transition = Trans_TANGENT;
1040 addIntPoint( /*toClassify=*/false);
1044 //================================================================================
1046 * Intersect a line with a non-analytical surface
1048 void FaceLineIntersector::IntersectWithSurface (const GridLine& gridLine)
1050 _surfaceInt->Perform( gridLine._line, 0.0, gridLine._length );
1051 if ( !_surfaceInt->IsDone() ) return;
1052 for ( int i = 1; i <= _surfaceInt->NbPnt(); ++i )
1054 _transition = Transition( _surfaceInt->Transition( i ) );
1055 _w = _surfaceInt->WParameter( i );
1056 addIntPoint(/*toClassify=*/false);
1059 //================================================================================
1061 * check if its face can be safely intersected in a thread
1063 bool FaceGridIntersector::IsThreadSafe() const
1066 TopLoc_Location loc;
1067 Handle(Geom_Surface) surf = BRep_Tool::Surface( _face, loc );
1068 Handle(Geom_RectangularTrimmedSurface) ts =
1069 Handle(Geom_RectangularTrimmedSurface)::DownCast( surf );
1070 while( !ts.IsNull() ) {
1071 surf = ts->BasisSurface();
1072 ts = Handle(Geom_RectangularTrimmedSurface)::DownCast(surf);
1074 if ( surf->IsKind( STANDARD_TYPE(Geom_BSplineSurface )) ||
1075 surf->IsKind( STANDARD_TYPE(Geom_BezierSurface )))
1079 TopExp_Explorer exp( _face, TopAbs_EDGE );
1080 for ( ; exp.More(); exp.Next() )
1082 const TopoDS_Edge& e = TopoDS::Edge( exp.Current() );
1085 Handle(Geom_Curve) c = BRep_Tool::Curve( e, loc, f, l);
1088 Handle(Geom_TrimmedCurve) tc = Handle(Geom_TrimmedCurve)::DownCast(c);
1089 while( !tc.IsNull() ) {
1090 c = tc->BasisCurve();
1091 tc = Handle(Geom_TrimmedCurve)::DownCast(c);
1093 if ( c->IsKind( STANDARD_TYPE(Geom_BSplineCurve )) ||
1094 c->IsKind( STANDARD_TYPE(Geom_BezierCurve )))
1100 Handle(Geom2d_Curve) c2 = BRep_Tool::CurveOnSurface( e, surf, loc, f, l);
1103 Handle(Geom2d_TrimmedCurve) tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
1104 while( !tc.IsNull() ) {
1105 c2 = tc->BasisCurve();
1106 tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
1108 if ( c2->IsKind( STANDARD_TYPE(Geom2d_BSplineCurve )) ||
1109 c2->IsKind( STANDARD_TYPE(Geom2d_BezierCurve )))
1116 //================================================================================
1118 * \brief Creates topology of the hexahedron
1120 Hexahedron::Hexahedron(const double sizeThreshold, Grid* grid)
1121 : _grid( grid ), _sizeThreshold( sizeThreshold ), _nbIntNodes(0)
1123 _polygons.reserve(100); // to avoid reallocation;
1125 //set nodes shift within grid->_nodes from the node 000
1126 size_t dx = _grid->NodeIndexDX();
1127 size_t dy = _grid->NodeIndexDY();
1128 size_t dz = _grid->NodeIndexDZ();
1130 size_t i100 = i000 + dx;
1131 size_t i010 = i000 + dy;
1132 size_t i110 = i010 + dx;
1133 size_t i001 = i000 + dz;
1134 size_t i101 = i100 + dz;
1135 size_t i011 = i010 + dz;
1136 size_t i111 = i110 + dz;
1137 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V000 )] = i000;
1138 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V100 )] = i100;
1139 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V010 )] = i010;
1140 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V110 )] = i110;
1141 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V001 )] = i001;
1142 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V101 )] = i101;
1143 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V011 )] = i011;
1144 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V111 )] = i111;
1146 vector< int > idVec;
1147 // set nodes to links
1148 for ( int linkID = SMESH_Block::ID_Ex00; linkID <= SMESH_Block::ID_E11z; ++linkID )
1150 SMESH_Block::GetEdgeVertexIDs( linkID, idVec );
1151 _Link& link = _hexLinks[ SMESH_Block::ShapeIndex( linkID )];
1152 link._nodes[0] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[0] )];
1153 link._nodes[1] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[1] )];
1154 link._intNodes.reserve( 10 ); // to avoid reallocation
1155 link._splits.reserve( 10 );
1158 // set links to faces
1159 int interlace[4] = { 0, 3, 1, 2 }; // to walk by links around a face: { u0, 1v, u1, 0v }
1160 for ( int faceID = SMESH_Block::ID_Fxy0; faceID <= SMESH_Block::ID_F1yz; ++faceID )
1162 SMESH_Block::GetFaceEdgesIDs( faceID, idVec );
1163 _Face& quad = _hexQuads[ SMESH_Block::ShapeIndex( faceID )];
1164 bool revFace = ( faceID == SMESH_Block::ID_Fxy0 ||
1165 faceID == SMESH_Block::ID_Fx1z ||
1166 faceID == SMESH_Block::ID_F0yz );
1167 quad._links.resize(4);
1168 vector<_OrientedLink>::iterator frwLinkIt = quad._links.begin();
1169 vector<_OrientedLink>::reverse_iterator revLinkIt = quad._links.rbegin();
1170 for ( int i = 0; i < 4; ++i )
1172 bool revLink = revFace;
1173 if ( i > 1 ) // reverse links u1 and v0
1175 _OrientedLink& link = revFace ? *revLinkIt++ : *frwLinkIt++;
1176 link = _OrientedLink( & _hexLinks[ SMESH_Block::ShapeIndex( idVec[interlace[i]] )],
1181 //================================================================================
1183 * \brief Copy constructor
1185 Hexahedron::Hexahedron( const Hexahedron& other )
1186 :_grid( other._grid ), _sizeThreshold( other._sizeThreshold ), _nbIntNodes(0)
1188 _polygons.reserve(100); // to avoid reallocation;
1190 for ( int i = 0; i < 8; ++i )
1191 _nodeShift[i] = other._nodeShift[i];
1193 for ( int i = 0; i < 12; ++i )
1195 const _Link& srcLink = other._hexLinks[ i ];
1196 _Link& tgtLink = this->_hexLinks[ i ];
1197 tgtLink._nodes[0] = _hexNodes + ( srcLink._nodes[0] - other._hexNodes );
1198 tgtLink._nodes[1] = _hexNodes + ( srcLink._nodes[1] - other._hexNodes );
1199 tgtLink._intNodes.reserve( 10 ); // to avoid reallocation
1200 tgtLink._splits.reserve( 10 );
1203 for ( int i = 0; i < 6; ++i )
1205 const _Face& srcQuad = other._hexQuads[ i ];
1206 _Face& tgtQuad = this->_hexQuads[ i ];
1207 tgtQuad._links.resize(4);
1208 for ( int j = 0; j < 4; ++j )
1210 const _OrientedLink& srcLink = srcQuad._links[ j ];
1211 _OrientedLink& tgtLink = tgtQuad._links[ j ];
1212 tgtLink._reverse = srcLink._reverse;
1213 tgtLink._link = _hexLinks + ( srcLink._link - other._hexLinks );
1218 //================================================================================
1220 * \brief Initializes its data by given grid cell
1222 void Hexahedron::init( size_t i, size_t j, size_t k )
1224 _i = i; _j = j; _k = k;
1225 // set nodes of grid to nodes of the hexahedron and
1226 // count nodes at hexahedron corners located IN and ON geometry
1227 _nbCornerNodes = _nbBndNodes = 0;
1228 _origNodeInd = _grid->NodeIndex( i,j,k );
1229 for ( int iN = 0; iN < 8; ++iN )
1231 _hexNodes[iN]._node = _grid->_nodes[ _origNodeInd + _nodeShift[iN] ];
1232 _nbCornerNodes += bool( _hexNodes[iN]._node );
1233 _nbBndNodes += _grid->_isBndNode[ _origNodeInd + _nodeShift[iN] ];
1236 _sideLength[0] = _grid->_coords[0][i+1] - _grid->_coords[0][i];
1237 _sideLength[1] = _grid->_coords[1][j+1] - _grid->_coords[1][j];
1238 _sideLength[2] = _grid->_coords[2][k+1] - _grid->_coords[2][k];
1240 if ( _nbCornerNodes < 8 && _nbIntNodes + _nbCornerNodes > 3)
1243 // create sub-links (_splits) by splitting links with _intNodes
1244 for ( int iLink = 0; iLink < 12; ++iLink )
1246 _Link& link = _hexLinks[ iLink ];
1247 link._splits.clear();
1248 split._nodes[ 0 ] = link._nodes[0];
1249 for ( size_t i = 0; i < link._intNodes.size(); ++ i )
1251 if ( split._nodes[ 0 ]->Node() )
1253 split._nodes[ 1 ] = &link._intNodes[i];
1254 link._splits.push_back( split );
1256 split._nodes[ 0 ] = &link._intNodes[i];
1258 if ( link._nodes[ 1 ]->Node() && split._nodes[ 0 ]->Node() )
1260 split._nodes[ 1 ] = link._nodes[1];
1261 link._splits.push_back( split );
1266 //================================================================================
1268 * \brief Initializes its data by given grid cell (countered from zero)
1270 void Hexahedron::init( size_t iCell )
1272 size_t iNbCell = _grid->_coords[0].size() - 1;
1273 size_t jNbCell = _grid->_coords[1].size() - 1;
1274 _i = iCell % iNbCell;
1275 _j = ( iCell % ( iNbCell * jNbCell )) / iNbCell;
1276 _k = iCell / iNbCell / jNbCell;
1280 //================================================================================
1282 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
1284 void Hexahedron::ComputeElements()
1288 if ( _nbCornerNodes + _nbIntNodes < 4 )
1291 if ( _nbBndNodes == _nbCornerNodes && isInHole() )
1296 vector<const SMDS_MeshNode* > polyhedraNodes;
1297 vector<int> quantities;
1299 // create polygons from quadrangles and get their nodes
1301 vector<_Node*> nodes;
1302 nodes.reserve( _nbCornerNodes + _nbIntNodes );
1305 polyLink._faces.reserve( 1 );
1307 for ( int iF = 0; iF < 6; ++iF ) // loop on 6 sides of a hexahedron
1309 const _Face& quad = _hexQuads[ iF ] ;
1311 _polygons.resize( _polygons.size() + 1 );
1312 _Face& polygon = _polygons.back();
1313 polygon._links.clear();
1314 polygon._polyLinks.clear(); polygon._polyLinks.reserve( 10 );
1316 // add splits of a link to a polygon and collect info on nodes
1317 //int nbIn = 0, nbOut = 0, nbCorners = 0;
1319 for ( int iE = 0; iE < 4; ++iE ) // loop on 4 sides of a quadrangle
1321 int nbSpits = quad._links[ iE ].NbResultLinks();
1322 for ( int iS = 0; iS < nbSpits; ++iS )
1324 _OrientedLink split = quad._links[ iE ].ResultLink( iS );
1325 _Node* n = split.FirstNode();
1326 if ( !polygon._links.empty() )
1328 _Node* nPrev = polygon._links.back().LastNode();
1331 polyLink._nodes[0] = nPrev;
1332 polyLink._nodes[1] = n;
1333 polygon._polyLinks.push_back( polyLink );
1334 polygon._links.push_back( _OrientedLink( &polygon._polyLinks.back() ));
1335 nodes.push_back( nPrev );
1338 polygon._links.push_back( split );
1339 nodes.push_back( n );
1342 if ( polygon._links.size() > 1 )
1344 _Node* n1 = polygon._links.back().LastNode();
1345 _Node* n2 = polygon._links.front().FirstNode();
1348 polyLink._nodes[0] = n1;
1349 polyLink._nodes[1] = n2;
1350 polygon._polyLinks.push_back( polyLink );
1351 polygon._links.push_back( _OrientedLink( &polygon._polyLinks.back() ));
1352 nodes.push_back( n1 );
1354 // add polygon to its links
1355 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
1356 polygon._links[ iL ]._link->_faces.push_back( &polygon );
1357 // store polygon nodes
1358 quantities.push_back( nodes.size() );
1359 for ( size_t i = 0; i < nodes.size(); ++i )
1360 polyhedraNodes.push_back( nodes[i]->Node() );
1364 _polygons.resize( _polygons.size() - 1 );
1368 // create polygons closing holes in a polyhedron
1371 vector< _OrientedLink* > freeLinks;
1372 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
1374 _Face& polygon = _polygons[ iP ];
1375 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
1376 if ( polygon._links[ iL ]._link->_faces.size() < 2 )
1377 freeLinks.push_back( & polygon._links[ iL ]);
1379 // make closed chains of free links
1380 int nbFreeLinks = freeLinks.size();
1381 if ( 0 < nbFreeLinks && nbFreeLinks < 3 ) return;
1382 while ( nbFreeLinks > 0 )
1385 _polygons.resize( _polygons.size() + 1 );
1386 _Face& polygon = _polygons.back();
1387 polygon._links.clear();
1389 // get a remaining link to start from
1390 _OrientedLink* curLink = 0;
1391 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
1392 if (( curLink = freeLinks[ iL ] ))
1393 freeLinks[ iL ] = 0;
1394 nodes.push_back( curLink->LastNode() );
1395 polygon._links.push_back( *curLink );
1397 // find all links connected to curLink
1401 curNode = curLink->FirstNode();
1403 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
1404 if ( freeLinks[ iL ] && freeLinks[ iL ]->LastNode() == curNode )
1406 curLink = freeLinks[ iL ];
1407 freeLinks[ iL ] = 0;
1408 nodes.push_back( curNode );
1409 polygon._links.push_back( *curLink );
1411 } while ( curLink );
1413 nbFreeLinks -= polygon._links.size();
1415 if ( curNode != nodes.front() || polygon._links.size() < 3 )
1416 return; // closed polygon not found -> invalid polyhedron
1418 quantities.push_back( nodes.size() );
1419 for ( size_t i = 0; i < nodes.size(); ++i )
1420 polyhedraNodes.push_back( nodes[i]->Node() );
1422 // add polygon to its links and reverse links
1423 for ( size_t i = 0; i < polygon._links.size(); ++i )
1425 polygon._links[i].Reverse();
1426 polygon._links[i]._link->_faces.push_back( &polygon );
1429 //const size_t firstPoly = _polygons.size();
1432 if ( ! checkPolyhedronSize() )
1437 // create a classic cell if possible
1438 const int nbNodes = _nbCornerNodes + _nbIntNodes;
1439 bool isClassicElem = false;
1440 if ( nbNodes == 8 && _polygons.size() == 6 ) isClassicElem = addHexa();
1441 else if ( nbNodes == 4 && _polygons.size() == 4 ) isClassicElem = addTetra();
1442 else if ( nbNodes == 6 && _polygons.size() == 5 ) isClassicElem = addPenta();
1443 else if ( nbNodes == 5 && _polygons.size() == 5 ) isClassicElem = addPyra ();
1444 if ( !isClassicElem )
1445 _volumeDefs.set( polyhedraNodes, quantities );
1447 //================================================================================
1449 * \brief Create elements in the mesh
1451 int Hexahedron::MakeElements(SMESH_MesherHelper& helper)
1453 SMESHDS_Mesh* mesh = helper.GetMeshDS();
1455 size_t nbCells[3] = { _grid->_coords[0].size() - 1,
1456 _grid->_coords[1].size() - 1,
1457 _grid->_coords[2].size() - 1 };
1458 const size_t nbGridCells = nbCells[0] *nbCells [1] * nbCells[2];
1459 vector< Hexahedron* > intersectedHex( nbGridCells, 0 );
1462 // set intersection nodes from GridLine's to links of intersectedHex
1463 int i,j,k, iDirOther[3][2] = {{ 1,2 },{ 0,2 },{ 0,1 }};
1464 for ( int iDir = 0; iDir < 3; ++iDir )
1466 int dInd[4][3] = { {0,0,0}, {0,0,0}, {0,0,0}, {0,0,0} };
1467 dInd[1][ iDirOther[iDir][0] ] = -1;
1468 dInd[2][ iDirOther[iDir][1] ] = -1;
1469 dInd[3][ iDirOther[iDir][0] ] = -1; dInd[3][ iDirOther[iDir][1] ] = -1;
1470 // loop on GridLine's parallel to iDir
1471 LineIndexer lineInd = _grid->GetLineIndexer( iDir );
1472 for ( ; lineInd.More(); ++lineInd )
1474 GridLine& line = _grid->_lines[ iDir ][ lineInd.LineIndex() ];
1475 multiset< IntersectionPoint >::const_iterator ip = line._intPoints.begin();
1476 for ( ; ip != line._intPoints.end(); ++ip )
1478 if ( !ip->_node ) continue;
1479 lineInd.SetIndexOnLine( ip->_indexOnLine );
1480 for ( int iL = 0; iL < 4; ++iL ) // loop on 4 cells sharing a link
1482 i = int(lineInd.I()) + dInd[iL][0];
1483 j = int(lineInd.J()) + dInd[iL][1];
1484 k = int(lineInd.K()) + dInd[iL][2];
1485 if ( i < 0 || i >= nbCells[0] ||
1486 j < 0 || j >= nbCells[1] ||
1487 k < 0 || k >= nbCells[2] ) continue;
1489 const size_t hexIndex = _grid->CellIndex( i,j,k );
1490 Hexahedron *& hex = intersectedHex[ hexIndex ];
1493 hex = new Hexahedron( *this );
1499 const int iLink = iL + iDir * 4;
1500 hex->_hexLinks[iLink]._intNodes.push_back( _Node( 0, &(*ip) ));
1507 // add not split hexadrons to the mesh
1509 vector<int> intHexInd( nbIntHex );
1511 for ( size_t i = 0; i < intersectedHex.size(); ++i )
1513 Hexahedron * hex = intersectedHex[ i ];
1516 intHexInd[ nbIntHex++ ] = i;
1517 if ( hex->_nbIntNodes > 0 ) continue;
1518 init( hex->_i, hex->_j, hex->_k );
1524 if ( _nbCornerNodes == 8 && ( _nbBndNodes < _nbCornerNodes || !isInHole() ))
1526 // order of _hexNodes is defined by enum SMESH_Block::TShapeID
1527 SMDS_MeshElement* el =
1528 mesh->AddVolume( _hexNodes[0].Node(), _hexNodes[2].Node(),
1529 _hexNodes[3].Node(), _hexNodes[1].Node(),
1530 _hexNodes[4].Node(), _hexNodes[6].Node(),
1531 _hexNodes[7].Node(), _hexNodes[5].Node() );
1532 mesh->SetMeshElementOnShape( el, helper.GetSubShapeID() );
1537 intersectedHex[ i ] = 0;
1543 // add elements resulted from hexadron intersection
1545 intHexInd.resize( nbIntHex );
1546 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, nbIntHex ),
1547 ParallelHexahedron( intersectedHex, intHexInd ),
1548 tbb::simple_partitioner());
1549 for ( size_t i = 0; i < intHexInd.size(); ++i )
1550 if ( Hexahedron * hex = intersectedHex[ intHexInd[ i ]] )
1551 nbAdded += hex->addElements( helper );
1553 for ( size_t i = 0; i < intHexInd.size(); ++i )
1554 if ( Hexahedron * hex = intersectedHex[ intHexInd[ i ]] )
1556 hex->ComputeElements();
1557 nbAdded += hex->addElements( helper );
1561 for ( size_t i = 0; i < intersectedHex.size(); ++i )
1562 if ( intersectedHex[ i ] )
1563 delete intersectedHex[ i ];
1568 //================================================================================
1570 * \brief Adds computed elements to the mesh
1572 int Hexahedron::addElements(SMESH_MesherHelper& helper)
1574 // add elements resulted from hexahedron intersection
1575 //for ( size_t i = 0; i < _volumeDefs.size(); ++i )
1577 vector< const SMDS_MeshNode* >& nodes = _volumeDefs._nodes;
1579 if ( !_volumeDefs._quantities.empty() )
1581 helper.AddPolyhedralVolume( nodes, _volumeDefs._quantities );
1585 switch ( nodes.size() )
1587 case 8: helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],
1588 nodes[4],nodes[5],nodes[6],nodes[7] );
1590 case 4: helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3] );
1592 case 6: helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3], nodes[4],nodes[5] );
1595 helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4] );
1601 return 1;//(int) _volumeDefs.size();
1603 //================================================================================
1605 * \brief Return true if the element is in a hole
1607 bool Hexahedron::isInHole() const
1609 const int ijk[3] = { _i, _j, _k };
1610 IntersectionPoint curIntPnt;
1612 // consider a cell to be in a hole if all links in any direction
1613 // comes OUT of geometry
1614 for ( int iDir = 0; iDir < 3; ++iDir )
1616 const vector<double>& coords = _grid->_coords[ iDir ];
1617 LineIndexer li = _grid->GetLineIndexer( iDir );
1618 li.SetIJK( _i,_j,_k );
1619 size_t lineIndex[4] = { li.LineIndex (),
1623 bool allLinksOut = true;
1624 for ( int iL = 0; iL < 4 && allLinksOut; ++iL ) // loop on 4 links parallel to iDir
1626 const _Link& link = _hexLinks[ iL + 4*iDir ];
1627 // check transition of the first node of a link
1628 const IntersectionPoint* firstIntPnt = 0;
1629 if ( link._nodes[0]->Node() ) // 1st node is a hexa corner
1631 curIntPnt._paramOnLine = coords[ ijk[ iDir ]] - coords[0];
1632 const GridLine& line = _grid->_lines[ iDir ][ lineIndex[ iL ]];
1633 multiset< IntersectionPoint >::const_iterator ip =
1634 line._intPoints.upper_bound( curIntPnt );
1636 firstIntPnt = &(*ip);
1638 else if ( !link._intNodes.empty() )
1640 firstIntPnt = link._intNodes[0]._intPoint;
1643 if ( firstIntPnt && firstIntPnt->_transition == Trans_IN )
1644 allLinksOut = false;
1652 //================================================================================
1654 * \brief Return true if a polyhedron passes _sizeThreshold criterion
1656 bool Hexahedron::checkPolyhedronSize() const
1659 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
1661 const _Face& polygon = _polygons[iP];
1662 gp_XYZ area (0,0,0);
1663 SMESH_TNodeXYZ p1 ( polygon._links[ 0 ].FirstNode()->Node() );
1664 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
1666 SMESH_TNodeXYZ p2 ( polygon._links[ iL ].LastNode()->Node() );
1670 volume += p1 * area;
1674 double initVolume = _sideLength[0] * _sideLength[1] * _sideLength[2];
1676 return volume > initVolume / _sizeThreshold;
1678 //================================================================================
1680 * \brief Tries to create a hexahedron
1682 bool Hexahedron::addHexa()
1684 if ( _polygons[0]._links.size() != 4 ||
1685 _polygons[1]._links.size() != 4 ||
1686 _polygons[2]._links.size() != 4 ||
1687 _polygons[3]._links.size() != 4 ||
1688 _polygons[4]._links.size() != 4 ||
1689 _polygons[5]._links.size() != 4 )
1691 const SMDS_MeshNode* nodes[8];
1693 for ( int iL = 0; iL < 4; ++iL )
1696 nodes[iL] = _polygons[0]._links[iL].FirstNode()->Node();
1699 // find a top node above the base node
1700 _Link* link = _polygons[0]._links[iL]._link;
1701 ASSERT( link->_faces.size() > 1 );
1702 // a quadrangle sharing <link> with _polygons[0]
1703 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[0] )];
1704 for ( int i = 0; i < 4; ++i )
1705 if ( quad->_links[i]._link == link )
1707 // 1st node of a link opposite to <link> in <quad>
1708 nodes[iL+4] = quad->_links[(i+2)%4].FirstNode()->Node();
1714 _volumeDefs.set( vector< const SMDS_MeshNode* >( nodes, nodes+8 ));
1718 //================================================================================
1720 * \brief Tries to create a tetrahedron
1722 bool Hexahedron::addTetra()
1724 const SMDS_MeshNode* nodes[4];
1725 nodes[0] = _polygons[0]._links[0].FirstNode()->Node();
1726 nodes[1] = _polygons[0]._links[1].FirstNode()->Node();
1727 nodes[2] = _polygons[0]._links[2].FirstNode()->Node();
1729 _Link* link = _polygons[0]._links[0]._link;
1730 ASSERT( link->_faces.size() > 1 );
1732 // a triangle sharing <link> with _polygons[0]
1733 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[0] )];
1734 for ( int i = 0; i < 3; ++i )
1735 if ( tria->_links[i]._link == link )
1737 nodes[3] = tria->_links[(i+1)%3].LastNode()->Node();
1738 _volumeDefs.set( vector< const SMDS_MeshNode* >( nodes, nodes+4 ));
1744 //================================================================================
1746 * \brief Tries to create a pentahedron
1748 bool Hexahedron::addPenta()
1750 // find a base triangular face
1752 for ( int iF = 0; iF < 5 && iTri < 0; ++iF )
1753 if ( _polygons[ iF ]._links.size() == 3 )
1755 if ( iTri < 0 ) return false;
1758 const SMDS_MeshNode* nodes[6];
1760 for ( int iL = 0; iL < 3; ++iL )
1763 nodes[iL] = _polygons[ iTri ]._links[iL].FirstNode()->Node();
1766 // find a top node above the base node
1767 _Link* link = _polygons[ iTri ]._links[iL]._link;
1768 ASSERT( link->_faces.size() > 1 );
1769 // a quadrangle sharing <link> with a base triangle
1770 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[ iTri ] )];
1771 if ( quad->_links.size() != 4 ) return false;
1772 for ( int i = 0; i < 4; ++i )
1773 if ( quad->_links[i]._link == link )
1775 // 1st node of a link opposite to <link> in <quad>
1776 nodes[iL+3] = quad->_links[(i+2)%4].FirstNode()->Node();
1782 _volumeDefs.set( vector< const SMDS_MeshNode* >( nodes, nodes+6 ));
1784 return ( nbN == 6 );
1786 //================================================================================
1788 * \brief Tries to create a pyramid
1790 bool Hexahedron::addPyra()
1792 // find a base quadrangle
1794 for ( int iF = 0; iF < 5 && iQuad < 0; ++iF )
1795 if ( _polygons[ iF ]._links.size() == 4 )
1797 if ( iQuad < 0 ) return false;
1800 const SMDS_MeshNode* nodes[5];
1801 nodes[0] = _polygons[iQuad]._links[0].FirstNode()->Node();
1802 nodes[1] = _polygons[iQuad]._links[1].FirstNode()->Node();
1803 nodes[2] = _polygons[iQuad]._links[2].FirstNode()->Node();
1804 nodes[3] = _polygons[iQuad]._links[3].FirstNode()->Node();
1806 _Link* link = _polygons[iQuad]._links[0]._link;
1807 ASSERT( link->_faces.size() > 1 );
1809 // a triangle sharing <link> with a base quadrangle
1810 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[ iQuad ] )];
1811 if ( tria->_links.size() != 3 ) return false;
1812 for ( int i = 0; i < 3; ++i )
1813 if ( tria->_links[i]._link == link )
1815 nodes[4] = tria->_links[(i+1)%3].LastNode()->Node();
1816 _volumeDefs.set( vector< const SMDS_MeshNode* >( nodes, nodes+5 ));
1825 //=============================================================================
1827 * \brief Generates 3D structured Cartesian mesh in the internal part of
1828 * solid shapes and polyhedral volumes near the shape boundary.
1829 * \param theMesh - mesh to fill in
1830 * \param theShape - a compound of all SOLIDs to mesh
1831 * \retval bool - true in case of success
1833 //=============================================================================
1835 bool StdMeshers_Cartesian_3D::Compute(SMESH_Mesh & theMesh,
1836 const TopoDS_Shape & theShape)
1838 // The algorithm generates the mesh in following steps:
1840 // 1) Intersection of grid lines with the geometry boundary.
1841 // This step allows to find out if a given node of the initial grid is
1842 // inside or outside the geometry.
1844 // 2) For each cell of the grid, check how many of it's nodes are outside
1845 // of the geometry boundary. Depending on a result of this check
1846 // - skip a cell, if all it's nodes are outside
1847 // - skip a cell, if it is too small according to the size threshold
1848 // - add a hexahedron in the mesh, if all nodes are inside
1849 // - add a polyhedron in the mesh, if some nodes are inside and some outside
1854 TopTools_MapOfShape faceMap;
1855 for ( TopExp_Explorer fExp( theShape, TopAbs_FACE ); fExp.More(); fExp.Next() )
1856 if ( !faceMap.Add( fExp.Current() ))
1857 faceMap.Remove( fExp.Current() ); // remove a face shared by two solids
1860 vector<FaceGridIntersector> facesItersectors( faceMap.Extent() );
1861 TopTools_MapIteratorOfMapOfShape faceMppIt( faceMap );
1862 for ( int i = 0; faceMppIt.More(); faceMppIt.Next(), ++i )
1864 facesItersectors[i]._face = TopoDS::Face( faceMppIt.Key() );
1865 facesItersectors[i]._grid = &grid;
1866 shapeBox.Add( facesItersectors[i].GetFaceBndBox() );
1869 vector<double> xCoords, yCoords, zCoords;
1870 _hyp->GetCoordinates( xCoords, yCoords, zCoords, shapeBox );
1872 grid.SetCoordinates( xCoords, yCoords, zCoords, theShape );
1874 // check if the grid encloses the shape
1875 if ( !_hyp->IsGridBySpacing(0) ||
1876 !_hyp->IsGridBySpacing(1) ||
1877 !_hyp->IsGridBySpacing(2) )
1880 gridBox.Add( gp_Pnt( xCoords[0], yCoords[0], zCoords[0] ));
1881 gridBox.Add( gp_Pnt( xCoords.back(), yCoords.back(), zCoords.back() ));
1882 double x0,y0,z0, x1,y1,z1;
1883 shapeBox.Get(x0,y0,z0, x1,y1,z1);
1884 if ( gridBox.IsOut( gp_Pnt( x0,y0,z0 )) ||
1885 gridBox.IsOut( gp_Pnt( x1,y1,z1 )))
1886 for ( size_t i = 0; i < facesItersectors.size(); ++i )
1887 if ( !facesItersectors[i].IsInGrid( gridBox ))
1888 return error("The grid doesn't enclose the geometry");
1892 { // copy partner faces and curves of not thread-safe types
1893 set< const Standard_Transient* > tshapes;
1894 BRepBuilderAPI_Copy copier;
1895 for ( size_t i = 0; i < facesItersectors.size(); ++i )
1897 if ( !facesItersectors[i].IsThreadSafe() &&
1898 !tshapes.insert((const Standard_Transient*) facesItersectors[i]._face.TShape() ).second )
1900 copier.Perform( facesItersectors[i]._face );
1901 facesItersectors[i]._face = TopoDS::Face( copier );
1905 // Intersection of grid lines with the geometry boundary.
1906 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, facesItersectors.size() ),
1907 ParallelIntersector( facesItersectors ),
1908 tbb::simple_partitioner());
1910 for ( size_t i = 0; i < facesItersectors.size(); ++i )
1911 facesItersectors[i].Intersect();
1914 // put interesection points onto the GridLine's; this is done after intersection
1915 // to avoid contention of facesItersectors for writing into the same GridLine
1916 // in case of parallel work of facesItersectors
1917 for ( size_t i = 0; i < facesItersectors.size(); ++i )
1918 facesItersectors[i].StoreIntersections();
1920 SMESH_MesherHelper helper( theMesh );
1921 TopExp_Explorer solidExp (theShape, TopAbs_SOLID);
1922 helper.SetSubShape( solidExp.Current() );
1923 helper.SetElementsOnShape( true );
1925 // create nodes on the geometry
1926 grid.ComputeNodes(helper);
1928 // create volume elements
1929 Hexahedron hex( _hyp->GetSizeThreshold(), &grid );
1930 int nbAdded = hex.MakeElements( helper );
1932 SMESHDS_Mesh* meshDS = theMesh.GetMeshDS();
1935 // make all SOLIDS computed
1936 if ( SMESHDS_SubMesh* sm1 = meshDS->MeshElements( solidExp.Current()) )
1938 SMDS_ElemIteratorPtr volIt = sm1->GetElements();
1939 for ( ; solidExp.More() && volIt->more(); solidExp.Next() )
1941 const SMDS_MeshElement* vol = volIt->next();
1942 sm1->RemoveElement( vol, /*isElemDeleted=*/false );
1943 meshDS->SetMeshElementOnShape( vol, solidExp.Current() );
1946 // make other sub-shapes computed
1947 setSubmeshesComputed( theMesh, theShape );
1950 // remove free nodes
1951 if ( SMESHDS_SubMesh * smDS = meshDS->MeshElements( helper.GetSubShapeID() ))
1953 // intersection nodes
1954 for ( int iDir = 0; iDir < 3; ++iDir )
1956 vector< GridLine >& lines = grid._lines[ iDir ];
1957 for ( size_t i = 0; i < lines.size(); ++i )
1959 multiset< IntersectionPoint >::iterator ip = lines[i]._intPoints.begin();
1960 for ( ; ip != lines[i]._intPoints.end(); ++ip )
1961 if ( ip->_node && ip->_node->NbInverseElements() == 0 )
1962 meshDS->RemoveFreeNode( ip->_node, smDS, /*fromGroups=*/false );
1966 for ( size_t i = 0; i < grid._nodes.size(); ++i )
1967 if ( !grid._isBndNode[i] ) // nodes on boundary are already removed
1968 if ( grid._nodes[i] && grid._nodes[i]->NbInverseElements() == 0 )
1969 meshDS->RemoveFreeNode( grid._nodes[i], smDS, /*fromGroups=*/false );
1975 // SMESH_ComputeError is not caught at SMESH_submesh level for an unknown reason
1976 catch ( SMESH_ComputeError& e)
1978 return error( SMESH_ComputeErrorPtr( new SMESH_ComputeError( e )));
1983 //=============================================================================
1987 //=============================================================================
1989 bool StdMeshers_Cartesian_3D::Evaluate(SMESH_Mesh & theMesh,
1990 const TopoDS_Shape & theShape,
1991 MapShapeNbElems& theResMap)
1994 // std::vector<int> aResVec(SMDSEntity_Last);
1995 // for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1996 // if(IsQuadratic) {
1997 // aResVec[SMDSEntity_Quad_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
1998 // int nb1d_face0_int = ( nb2d_face0*4 - nb1d ) / 2;
1999 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
2002 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
2003 // aResVec[SMDSEntity_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
2005 // SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
2006 // aResMap.insert(std::make_pair(sm,aResVec));
2011 //=============================================================================
2015 * \brief Event listener setting/unsetting _alwaysComputed flag to
2016 * submeshes of inferior levels to prevent their computing
2018 struct _EventListener : public SMESH_subMeshEventListener
2022 _EventListener(const string& algoName):
2023 SMESH_subMeshEventListener(/*isDeletable=*/true,"StdMeshers_Cartesian_3D::_EventListener"),
2026 // --------------------------------------------------------------------------------
2027 // setting/unsetting _alwaysComputed flag to submeshes of inferior levels
2029 static void setAlwaysComputed( const bool isComputed,
2030 SMESH_subMesh* subMeshOfSolid)
2032 SMESH_subMeshIteratorPtr smIt =
2033 subMeshOfSolid->getDependsOnIterator(/*includeSelf=*/false, /*complexShapeFirst=*/false);
2034 while ( smIt->more() )
2036 SMESH_subMesh* sm = smIt->next();
2037 sm->SetIsAlwaysComputed( isComputed );
2041 // --------------------------------------------------------------------------------
2042 // unsetting _alwaysComputed flag if "Cartesian_3D" was removed
2044 virtual void ProcessEvent(const int event,
2045 const int eventType,
2046 SMESH_subMesh* subMeshOfSolid,
2047 SMESH_subMeshEventListenerData* data,
2048 const SMESH_Hypothesis* hyp = 0)
2050 if ( eventType == SMESH_subMesh::COMPUTE_EVENT )
2052 setAlwaysComputed( subMeshOfSolid->GetComputeState() == SMESH_subMesh::COMPUTE_OK,
2057 SMESH_Algo* algo3D = subMeshOfSolid->GetAlgo();
2058 if ( !algo3D || _algoName != algo3D->GetName() )
2059 setAlwaysComputed( false, subMeshOfSolid );
2063 // --------------------------------------------------------------------------------
2064 // set the event listener
2066 static void SetOn( SMESH_subMesh* subMeshOfSolid, const string& algoName )
2068 subMeshOfSolid->SetEventListener( new _EventListener( algoName ),
2073 }; // struct _EventListener
2077 //================================================================================
2079 * \brief Sets event listener to submeshes if necessary
2080 * \param subMesh - submesh where algo is set
2081 * This method is called when a submesh gets HYP_OK algo_state.
2082 * After being set, event listener is notified on each event of a submesh.
2084 //================================================================================
2086 void StdMeshers_Cartesian_3D::SetEventListener(SMESH_subMesh* subMesh)
2088 _EventListener::SetOn( subMesh, GetName() );
2091 //================================================================================
2093 * \brief Set _alwaysComputed flag to submeshes of inferior levels to avoid their computing
2095 //================================================================================
2097 void StdMeshers_Cartesian_3D::setSubmeshesComputed(SMESH_Mesh& theMesh,
2098 const TopoDS_Shape& theShape)
2100 for ( TopExp_Explorer soExp( theShape, TopAbs_SOLID ); soExp.More(); soExp.Next() )
2101 _EventListener::setAlwaysComputed( true, theMesh.GetSubMesh( soExp.Current() ));