1 // Copyright (C) 2007-2020 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, or (at your option) any later version.
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"
26 #include "StdMeshers_CartesianParameters3D.hxx"
28 #include "ObjectPool.hxx"
29 #include "SMDS_MeshNode.hxx"
30 #include "SMDS_VolumeTool.hxx"
31 #include "SMESHDS_Mesh.hxx"
32 #include "SMESH_Block.hxx"
33 #include "SMESH_Comment.hxx"
34 #include "SMESH_ControlsDef.hxx"
35 #include "SMESH_Mesh.hxx"
36 #include "SMESH_MeshAlgos.hxx"
37 #include "SMESH_MeshEditor.hxx"
38 #include "SMESH_MesherHelper.hxx"
39 #include "SMESH_subMesh.hxx"
40 #include "SMESH_subMeshEventListener.hxx"
41 #include "StdMeshers_FaceSide.hxx"
43 #include <utilities.h>
44 #include <Utils_ExceptHandlers.hxx>
46 #include <GEOMUtils.hxx>
48 #include <BRepAdaptor_Curve.hxx>
49 #include <BRepAdaptor_Surface.hxx>
50 #include <BRepBndLib.hxx>
51 #include <BRepBuilderAPI_Copy.hxx>
52 #include <BRepBuilderAPI_MakeFace.hxx>
53 #include <BRepTools.hxx>
54 #include <BRepTopAdaptor_FClass2d.hxx>
55 #include <BRep_Builder.hxx>
56 #include <BRep_Tool.hxx>
57 #include <Bnd_B3d.hxx>
58 #include <Bnd_Box.hxx>
60 #include <GCPnts_UniformDeflection.hxx>
61 #include <Geom2d_BSplineCurve.hxx>
62 #include <Geom2d_BezierCurve.hxx>
63 #include <Geom2d_TrimmedCurve.hxx>
64 #include <GeomAPI_ProjectPointOnSurf.hxx>
65 #include <GeomLib.hxx>
66 #include <Geom_BSplineCurve.hxx>
67 #include <Geom_BSplineSurface.hxx>
68 #include <Geom_BezierCurve.hxx>
69 #include <Geom_BezierSurface.hxx>
70 #include <Geom_RectangularTrimmedSurface.hxx>
71 #include <Geom_TrimmedCurve.hxx>
72 #include <IntAna_IntConicQuad.hxx>
73 #include <IntAna_IntLinTorus.hxx>
74 #include <IntAna_Quadric.hxx>
75 #include <IntCurveSurface_TransitionOnCurve.hxx>
76 #include <IntCurvesFace_Intersector.hxx>
77 #include <Poly_Triangulation.hxx>
78 #include <Precision.hxx>
80 #include <TopExp_Explorer.hxx>
81 #include <TopLoc_Location.hxx>
82 #include <TopTools_IndexedMapOfShape.hxx>
83 #include <TopTools_MapOfShape.hxx>
85 #include <TopoDS_Compound.hxx>
86 #include <TopoDS_Face.hxx>
87 #include <TopoDS_TShape.hxx>
88 #include <gp_Cone.hxx>
89 #include <gp_Cylinder.hxx>
92 #include <gp_Pnt2d.hxx>
93 #include <gp_Sphere.hxx>
94 #include <gp_Torus.hxx>
98 #include <boost/container/flat_map.hpp>
104 // See https://docs.microsoft.com/en-gb/cpp/porting/modifying-winver-and-win32-winnt?view=vs-2019
105 // Windows 10 = 0x0A00
106 #define WINVER 0x0A00
107 #define _WIN32_WINNT 0x0A00
110 #include <tbb/parallel_for.h>
111 //#include <tbb/enumerable_thread_specific.h>
115 using namespace SMESH;
121 //=============================================================================
125 //=============================================================================
127 StdMeshers_Cartesian_3D::StdMeshers_Cartesian_3D(int hypId, SMESH_Gen * gen)
128 :SMESH_3D_Algo(hypId, gen)
130 _name = "Cartesian_3D";
131 _shapeType = (1 << TopAbs_SOLID); // 1 bit /shape type
132 _compatibleHypothesis.push_back("CartesianParameters3D");
134 _onlyUnaryInput = false; // to mesh all SOLIDs at once
135 _requireDiscreteBoundary = false; // 2D mesh not needed
136 _supportSubmeshes = false; // do not use any existing mesh
139 //=============================================================================
141 * Check presence of a hypothesis
143 //=============================================================================
145 bool StdMeshers_Cartesian_3D::CheckHypothesis (SMESH_Mesh& aMesh,
146 const TopoDS_Shape& aShape,
147 Hypothesis_Status& aStatus)
149 aStatus = SMESH_Hypothesis::HYP_MISSING;
151 const list<const SMESHDS_Hypothesis*>& hyps = GetUsedHypothesis(aMesh, aShape);
152 list <const SMESHDS_Hypothesis* >::const_iterator h = hyps.begin();
153 if ( h == hyps.end())
158 for ( ; h != hyps.end(); ++h )
160 if (( _hyp = dynamic_cast<const StdMeshers_CartesianParameters3D*>( *h )))
162 aStatus = _hyp->IsDefined() ? HYP_OK : HYP_BAD_PARAMETER;
167 return aStatus == HYP_OK;
172 typedef int TGeomID; // IDs of sub-shapes
174 //=============================================================================
175 // Definitions of internal utils
176 // --------------------------------------------------------------------------
178 Trans_TANGENT = IntCurveSurface_Tangent,
179 Trans_IN = IntCurveSurface_In,
180 Trans_OUT = IntCurveSurface_Out,
182 Trans_INTERNAL // for INTERNAL FACE
184 // --------------------------------------------------------------------------
186 * \brief Container of IDs of SOLID sub-shapes
188 class Solid // sole SOLID contains all sub-shapes
190 TGeomID _id; // SOLID id
191 bool _hasInternalFaces;
194 virtual bool Contains( TGeomID /*subID*/ ) const { return true; }
195 virtual bool ContainsAny( const vector< TGeomID>& /*subIDs*/ ) const { return true; }
196 virtual TopAbs_Orientation Orientation( const TopoDS_Shape& s ) const { return s.Orientation(); }
197 virtual bool IsOutsideOriented( TGeomID /*faceID*/ ) const { return true; }
198 void SetID( TGeomID id ) { _id = id; }
199 TGeomID ID() const { return _id; }
200 void SetHasInternalFaces( bool has ) { _hasInternalFaces = has; }
201 bool HasInternalFaces() const { return _hasInternalFaces; }
203 // --------------------------------------------------------------------------
204 class OneOfSolids : public Solid
206 TColStd_MapOfInteger _subIDs;
207 TopTools_MapOfShape _faces; // keep FACE orientation
208 TColStd_MapOfInteger _outFaceIDs; // FACEs of shape_to_mesh oriented outside the SOLID
210 void Init( const TopoDS_Shape& solid,
211 TopAbs_ShapeEnum subType,
212 const SMESHDS_Mesh* mesh );
213 virtual bool Contains( TGeomID i ) const { return i == ID() || _subIDs.Contains( i ); }
214 virtual bool ContainsAny( const vector< TGeomID>& subIDs ) const
216 for ( size_t i = 0; i < subIDs.size(); ++i ) if ( Contains( subIDs[ i ])) return true;
219 virtual TopAbs_Orientation Orientation( const TopoDS_Shape& face ) const
221 const TopoDS_Shape& sInMap = const_cast< OneOfSolids* >(this)->_faces.Added( face );
222 return sInMap.Orientation();
224 virtual bool IsOutsideOriented( TGeomID faceID ) const
226 return faceID == 0 || _outFaceIDs.Contains( faceID );
229 // --------------------------------------------------------------------------
235 TopoDS_Shape _mainShape;
236 vector< vector< TGeomID > > _solidIDsByShapeID;// V/E/F ID -> SOLID IDs
238 map< TGeomID, OneOfSolids > _solidByID;
239 TColStd_MapOfInteger _boundaryFaces; // FACEs on boundary of mesh->ShapeToMesh()
240 TColStd_MapOfInteger _strangeEdges; // EDGEs shared by strange FACEs
241 TGeomID _extIntFaceID; // pseudo FACE - extension of INTERNAL FACE
243 Controls::ElementsOnShape _edgeClassifier;
244 Controls::ElementsOnShape _vertexClassifier;
246 bool IsOneSolid() const { return _solidByID.size() < 2; }
248 // --------------------------------------------------------------------------
250 * \brief Common data of any intersection between a Grid and a shape
252 struct B_IntersectPoint
254 mutable const SMDS_MeshNode* _node;
255 mutable vector< TGeomID > _faceIDs;
257 B_IntersectPoint(): _node(NULL) {}
258 void Add( const vector< TGeomID >& fIDs, const SMDS_MeshNode* n=0 ) const;
259 int HasCommonFace( const B_IntersectPoint * other, int avoidFace=-1 ) const;
260 bool IsOnFace( int faceID ) const;
261 virtual ~B_IntersectPoint() {}
263 // --------------------------------------------------------------------------
265 * \brief Data of intersection between a GridLine and a TopoDS_Face
267 struct F_IntersectPoint : public B_IntersectPoint
271 mutable Transition _transition;
272 mutable size_t _indexOnLine;
274 bool operator< ( const F_IntersectPoint& o ) const { return _paramOnLine < o._paramOnLine; }
276 // --------------------------------------------------------------------------
278 * \brief Data of intersection between GridPlanes and a TopoDS_EDGE
280 struct E_IntersectPoint : public B_IntersectPoint
284 TGeomID _shapeID; // ID of EDGE or VERTEX
286 // --------------------------------------------------------------------------
288 * \brief A line of the grid and its intersections with 2D geometry
293 double _length; // line length
294 multiset< F_IntersectPoint > _intPoints;
296 void RemoveExcessIntPoints( const double tol );
297 TGeomID GetSolidIDBefore( multiset< F_IntersectPoint >::iterator ip,
298 const TGeomID prevID,
299 const Geometry& geom);
301 // --------------------------------------------------------------------------
303 * \brief Planes of the grid used to find intersections of an EDGE with a hexahedron
308 vector< gp_XYZ > _origins; // origin points of all planes in one direction
309 vector< double > _zProjs; // projections of origins to _zNorm
311 // --------------------------------------------------------------------------
313 * \brief Iterator on the parallel grid lines of one direction
319 size_t _iVar1, _iVar2, _iConst;
320 string _name1, _name2, _nameConst;
322 LineIndexer( size_t sz1, size_t sz2, size_t sz3,
323 size_t iv1, size_t iv2, size_t iConst,
324 const string& nv1, const string& nv2, const string& nConst )
326 _size[0] = sz1; _size[1] = sz2; _size[2] = sz3;
327 _curInd[0] = _curInd[1] = _curInd[2] = 0;
328 _iVar1 = iv1; _iVar2 = iv2; _iConst = iConst;
329 _name1 = nv1; _name2 = nv2; _nameConst = nConst;
332 size_t I() const { return _curInd[0]; }
333 size_t J() const { return _curInd[1]; }
334 size_t K() const { return _curInd[2]; }
335 void SetIJK( size_t i, size_t j, size_t k )
337 _curInd[0] = i; _curInd[1] = j; _curInd[2] = k;
341 if ( ++_curInd[_iVar1] == _size[_iVar1] )
342 _curInd[_iVar1] = 0, ++_curInd[_iVar2];
344 bool More() const { return _curInd[_iVar2] < _size[_iVar2]; }
345 size_t LineIndex () const { return _curInd[_iVar1] + _curInd[_iVar2]* _size[_iVar1]; }
346 size_t LineIndex10 () const { return (_curInd[_iVar1] + 1 ) + _curInd[_iVar2]* _size[_iVar1]; }
347 size_t LineIndex01 () const { return _curInd[_iVar1] + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
348 size_t LineIndex11 () const { return (_curInd[_iVar1] + 1 ) + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
349 void SetIndexOnLine (size_t i) { _curInd[ _iConst ] = i; }
350 size_t NbLines() const { return _size[_iVar1] * _size[_iVar2]; }
352 // --------------------------------------------------------------------------
354 * \brief Container of GridLine's
358 vector< double > _coords[3]; // coordinates of grid nodes
359 gp_XYZ _axes [3]; // axis directions
360 vector< GridLine > _lines [3]; // in 3 directions
361 double _tol, _minCellSize;
363 gp_Mat _invB; // inverted basis of _axes
365 // index shift within _nodes of nodes of a cell from the 1st node
368 vector< const SMDS_MeshNode* > _nodes; // mesh nodes at grid nodes
369 vector< const F_IntersectPoint* > _gridIntP; // grid node intersection with geometry
370 ObjectPool< E_IntersectPoint > _edgeIntPool; // intersections with EDGEs
371 ObjectPool< F_IntersectPoint > _extIntPool; // intersections with extended INTERNAL FACEs
372 //list< E_IntersectPoint > _edgeIntP; // intersections with EDGEs
377 bool _toConsiderInternalFaces;
378 bool _toUseThresholdForInternalFaces;
379 double _sizeThreshold;
381 SMESH_MesherHelper* _helper;
383 size_t CellIndex( size_t i, size_t j, size_t k ) const
385 return i + j*(_coords[0].size()-1) + k*(_coords[0].size()-1)*(_coords[1].size()-1);
387 size_t NodeIndex( size_t i, size_t j, size_t k ) const
389 return i + j*_coords[0].size() + k*_coords[0].size()*_coords[1].size();
391 size_t NodeIndexDX() const { return 1; }
392 size_t NodeIndexDY() const { return _coords[0].size(); }
393 size_t NodeIndexDZ() const { return _coords[0].size() * _coords[1].size(); }
395 LineIndexer GetLineIndexer(size_t iDir) const;
397 E_IntersectPoint* Add( const E_IntersectPoint& ip )
399 E_IntersectPoint* eip = _edgeIntPool.getNew();
403 void Remove( E_IntersectPoint* eip ) { _edgeIntPool.destroy( eip ); }
405 TGeomID ShapeID( const TopoDS_Shape& s ) const;
406 const TopoDS_Shape& Shape( TGeomID id ) const;
407 TopAbs_ShapeEnum ShapeType( TGeomID id ) const { return Shape(id).ShapeType(); }
408 void InitGeometry( const TopoDS_Shape& theShape );
409 void InitClassifier( const TopoDS_Shape& mainShape,
410 TopAbs_ShapeEnum shapeType,
411 Controls::ElementsOnShape& classifier );
412 void GetEdgesToImplement( map< TGeomID, vector< TGeomID > > & edge2faceMap,
413 const TopoDS_Shape& shape,
414 const vector< TopoDS_Shape >& faces );
415 void SetSolidFather( const TopoDS_Shape& s, const TopoDS_Shape& theShapeToMesh );
416 bool IsShared( TGeomID faceID ) const;
417 bool IsAnyShared( const std::vector< TGeomID >& faceIDs ) const;
418 bool IsInternal( TGeomID faceID ) const {
419 return ( faceID == PseudoIntExtFaceID() ||
420 Shape( faceID ).Orientation() == TopAbs_INTERNAL ); }
421 bool IsSolid( TGeomID shapeID ) const {
422 if ( _geometry.IsOneSolid() ) return _geometry._soleSolid.ID() == shapeID;
423 else return _geometry._solidByID.count( shapeID ); }
424 bool IsStrangeEdge( TGeomID id ) const { return _geometry._strangeEdges.Contains( id ); }
425 TGeomID PseudoIntExtFaceID() const { return _geometry._extIntFaceID; }
426 Solid* GetSolid( TGeomID solidID = 0 );
427 Solid* GetOneOfSolids( TGeomID solidID );
428 const vector< TGeomID > & GetSolidIDs( TGeomID subShapeID ) const;
429 bool IsCorrectTransition( TGeomID faceID, const Solid* solid );
430 bool IsBoundaryFace( TGeomID face ) const { return _geometry._boundaryFaces.Contains( face ); }
431 void SetOnShape( const SMDS_MeshNode* n, const F_IntersectPoint& ip, bool unset=false );
432 bool IsToCheckNodePos() const { return !_toAddEdges && _toCreateFaces; }
433 bool IsToRemoveExcessEntities() const { return !_toAddEdges; }
435 void SetCoordinates(const vector<double>& xCoords,
436 const vector<double>& yCoords,
437 const vector<double>& zCoords,
438 const double* axesDirs,
439 const Bnd_Box& bndBox );
440 void ComputeUVW(const gp_XYZ& p, double uvw[3]);
441 void ComputeNodes(SMESH_MesherHelper& helper);
443 // --------------------------------------------------------------------------
445 * \brief Return cells sharing a link
447 struct CellsAroundLink
455 CellsAroundLink( Grid* grid, int iDir ):
457 _dInd{ {0,0,0}, {0,0,0}, {0,0,0}, {0,0,0} },
458 _nbCells{ grid->_coords[0].size() - 1,
459 grid->_coords[1].size() - 1,
460 grid->_coords[2].size() - 1 },
463 const int iDirOther[3][2] = {{ 1,2 },{ 0,2 },{ 0,1 }};
464 _dInd[1][ iDirOther[iDir][0] ] = -1;
465 _dInd[2][ iDirOther[iDir][1] ] = -1;
466 _dInd[3][ iDirOther[iDir][0] ] = -1; _dInd[3][ iDirOther[iDir][1] ] = -1;
468 void Init( int i, int j, int k, int link12 = 0 )
471 _i = i - _dInd[iL][0];
472 _j = j - _dInd[iL][1];
473 _k = k - _dInd[iL][2];
475 bool GetCell( int iL, int& i, int& j, int& k, int& cellIndex, int& linkIndex )
477 i = _i + _dInd[iL][0];
478 j = _j + _dInd[iL][1];
479 k = _k + _dInd[iL][2];
480 if ( i < 0 || i >= (int)_nbCells[0] ||
481 j < 0 || j >= (int)_nbCells[1] ||
482 k < 0 || k >= (int)_nbCells[2] )
484 cellIndex = _grid->CellIndex( i,j,k );
485 linkIndex = iL + _iDir * 4;
489 // --------------------------------------------------------------------------
491 * \brief Intersector of TopoDS_Face with all GridLine's
493 struct FaceGridIntersector
499 IntCurvesFace_Intersector* _surfaceInt;
500 vector< std::pair< GridLine*, F_IntersectPoint > > _intersections;
502 FaceGridIntersector(): _grid(0), _surfaceInt(0) {}
505 void StoreIntersections()
507 for ( size_t i = 0; i < _intersections.size(); ++i )
509 multiset< F_IntersectPoint >::iterator ip =
510 _intersections[i].first->_intPoints.insert( _intersections[i].second );
511 ip->_faceIDs.reserve( 1 );
512 ip->_faceIDs.push_back( _faceID );
515 const Bnd_Box& GetFaceBndBox()
517 GetCurveFaceIntersector();
520 IntCurvesFace_Intersector* GetCurveFaceIntersector()
524 _surfaceInt = new IntCurvesFace_Intersector( _face, Precision::PConfusion() );
525 _bndBox = _surfaceInt->Bounding();
526 if ( _bndBox.IsVoid() )
527 BRepBndLib::Add (_face, _bndBox);
531 bool IsThreadSafe(set< const Standard_Transient* >& noSafeTShapes) const;
533 // --------------------------------------------------------------------------
535 * \brief Intersector of a surface with a GridLine
537 struct FaceLineIntersector
540 double _u, _v, _w; // params on the face and the line
541 Transition _transition; // transition at intersection (see IntCurveSurface.cdl)
542 Transition _transIn, _transOut; // IN and OUT transitions depending of face orientation
545 gp_Cylinder _cylinder;
549 IntCurvesFace_Intersector* _surfaceInt;
551 vector< F_IntersectPoint > _intPoints;
553 void IntersectWithPlane (const GridLine& gridLine);
554 void IntersectWithCylinder(const GridLine& gridLine);
555 void IntersectWithCone (const GridLine& gridLine);
556 void IntersectWithSphere (const GridLine& gridLine);
557 void IntersectWithTorus (const GridLine& gridLine);
558 void IntersectWithSurface (const GridLine& gridLine);
560 bool UVIsOnFace() const;
561 void addIntPoint(const bool toClassify=true);
562 bool isParamOnLineOK( const double linLength )
564 return -_tol < _w && _w < linLength + _tol;
566 FaceLineIntersector():_surfaceInt(0) {}
567 ~FaceLineIntersector() { if (_surfaceInt ) delete _surfaceInt; _surfaceInt = 0; }
569 // --------------------------------------------------------------------------
571 * \brief Class representing topology of the hexahedron and creating a mesh
572 * volume basing on analysis of hexahedron intersection with geometry
576 // --------------------------------------------------------------------------------
579 enum IsInternalFlag { IS_NOT_INTERNAL, IS_INTERNAL, IS_CUT_BY_INTERNAL_FACE };
580 // --------------------------------------------------------------------------------
581 struct _Node //!< node either at a hexahedron corner or at intersection
583 const SMDS_MeshNode* _node; // mesh node at hexahedron corner
584 const B_IntersectPoint* _intPoint;
585 const _Face* _usedInFace;
586 char _isInternalFlags;
588 _Node(const SMDS_MeshNode* n=0, const B_IntersectPoint* ip=0)
589 :_node(n), _intPoint(ip), _usedInFace(0), _isInternalFlags(0) {}
590 const SMDS_MeshNode* Node() const
591 { return ( _intPoint && _intPoint->_node ) ? _intPoint->_node : _node; }
592 const E_IntersectPoint* EdgeIntPnt() const
593 { return static_cast< const E_IntersectPoint* >( _intPoint ); }
594 const F_IntersectPoint* FaceIntPnt() const
595 { return static_cast< const F_IntersectPoint* >( _intPoint ); }
596 const vector< TGeomID >& faces() const { return _intPoint->_faceIDs; }
597 TGeomID face(size_t i) const { return _intPoint->_faceIDs[ i ]; }
598 void SetInternal( IsInternalFlag intFlag ) { _isInternalFlags |= intFlag; }
599 bool IsCutByInternal() const { return _isInternalFlags & IS_CUT_BY_INTERNAL_FACE; }
600 bool IsUsedInFace( const _Face* polygon = 0 )
602 return polygon ? ( _usedInFace == polygon ) : bool( _usedInFace );
604 TGeomID IsLinked( const B_IntersectPoint* other,
605 TGeomID avoidFace=-1 ) const // returns id of a common face
607 return _intPoint ? _intPoint->HasCommonFace( other, avoidFace ) : 0;
609 bool IsOnFace( TGeomID faceID ) const // returns true if faceID is found
611 return _intPoint ? _intPoint->IsOnFace( faceID ) : false;
615 if ( const SMDS_MeshNode* n = Node() )
616 return SMESH_NodeXYZ( n );
617 if ( const E_IntersectPoint* eip =
618 dynamic_cast< const E_IntersectPoint* >( _intPoint ))
620 return gp_Pnt( 1e100, 0, 0 );
622 TGeomID ShapeID() const
624 if ( const E_IntersectPoint* eip = dynamic_cast< const E_IntersectPoint* >( _intPoint ))
625 return eip->_shapeID;
628 void Add( const E_IntersectPoint* ip )
630 // Possible cases before Add(ip):
631 /// 1) _node != 0 --> _Node at hex corner ( _intPoint == 0 || _intPoint._node == 0 )
632 /// 2) _node == 0 && _intPoint._node != 0 --> link intersected by FACE
633 /// 3) _node == 0 && _intPoint._node == 0 --> _Node at EDGE intersection
635 // If ip is added in cases 1) and 2) _node position must be changed to ip._shapeID
636 // at creation of elements
637 // To recognize this case, set _intPoint._node = Node()
638 const SMDS_MeshNode* node = Node();
643 ip->Add( _intPoint->_faceIDs );
647 _node = _intPoint->_node = node;
650 // --------------------------------------------------------------------------------
651 struct _Link // link connecting two _Node's
654 _Face* _faces[2]; // polygons sharing a link
655 vector< const F_IntersectPoint* > _fIntPoints; // GridLine intersections with FACEs
656 vector< _Node* > _fIntNodes; // _Node's at _fIntPoints
657 vector< _Link > _splits;
658 _Link(): _faces{ 0, 0 } {}
660 // --------------------------------------------------------------------------------
665 _OrientedLink( _Link* link=0, bool reverse=false ): _link(link), _reverse(reverse) {}
666 void Reverse() { _reverse = !_reverse; }
667 int NbResultLinks() const { return _link->_splits.size(); }
668 _OrientedLink ResultLink(int i) const
670 return _OrientedLink(&_link->_splits[_reverse ? NbResultLinks()-i-1 : i],_reverse);
672 _Node* FirstNode() const { return _link->_nodes[ _reverse ]; }
673 _Node* LastNode() const { return _link->_nodes[ !_reverse ]; }
674 operator bool() const { return _link; }
675 vector< TGeomID > GetNotUsedFace(const set<TGeomID>& usedIDs ) const // returns supporting FACEs
677 vector< TGeomID > faces;
678 const B_IntersectPoint *ip0, *ip1;
679 if (( ip0 = _link->_nodes[0]->_intPoint ) &&
680 ( ip1 = _link->_nodes[1]->_intPoint ))
682 for ( size_t i = 0; i < ip0->_faceIDs.size(); ++i )
683 if ( ip1->IsOnFace ( ip0->_faceIDs[i] ) &&
684 !usedIDs.count( ip0->_faceIDs[i] ) )
685 faces.push_back( ip0->_faceIDs[i] );
689 bool HasEdgeNodes() const
691 return ( dynamic_cast< const E_IntersectPoint* >( _link->_nodes[0]->_intPoint ) ||
692 dynamic_cast< const E_IntersectPoint* >( _link->_nodes[1]->_intPoint ));
696 return !_link->_faces[0] ? 0 : 1 + bool( _link->_faces[1] );
698 void AddFace( _Face* f )
700 if ( _link->_faces[0] )
702 _link->_faces[1] = f;
706 _link->_faces[0] = f;
707 _link->_faces[1] = 0;
710 void RemoveFace( _Face* f )
712 if ( !_link->_faces[0] ) return;
714 if ( _link->_faces[1] == f )
716 _link->_faces[1] = 0;
718 else if ( _link->_faces[0] == f )
720 _link->_faces[0] = 0;
721 if ( _link->_faces[1] )
723 _link->_faces[0] = _link->_faces[1];
724 _link->_faces[1] = 0;
729 // --------------------------------------------------------------------------------
730 struct _SplitIterator //! set to _hexLinks splits on one side of INTERNAL FACEs
732 struct _Split // data of a link split
734 int _linkID; // hex link ID
736 int _iCheckIteration; // iteration where split is tried as Hexahedron split
737 _Link* _checkedSplit; // split set to hex links
738 bool _isUsed; // used in a volume
740 _Split( _Link & split, int iLink ):
741 _linkID( iLink ), _nodes{ split._nodes[0], split._nodes[1] },
742 _iCheckIteration( 0 ), _isUsed( false )
744 bool IsCheckedOrUsed( bool used ) const { return used ? _isUsed : _iCheckIteration > 0; }
747 std::vector< _Split > _splits;
751 std::vector< _Node* > _freeNodes; // nodes reached while composing a split set
753 _SplitIterator( _Link* hexLinks ):
754 _hexLinks( hexLinks ), _iterationNb(0), _nbChecked(0), _nbUsed(0)
756 _freeNodes.reserve( 12 );
757 _splits.reserve( 24 );
758 for ( int iL = 0; iL < 12; ++iL )
759 for ( size_t iS = 0; iS < _hexLinks[ iL ]._splits.size(); ++iS )
760 _splits.emplace_back( _hexLinks[ iL ]._splits[ iS ], iL );
763 bool More() const { return _nbUsed < _splits.size(); }
766 // --------------------------------------------------------------------------------
769 SMESH_Block::TShapeID _name;
770 vector< _OrientedLink > _links; // links on GridLine's
771 vector< _Link > _polyLinks; // links added to close a polygonal face
772 vector< _Node* > _eIntNodes; // nodes at intersection with EDGEs
774 _Face():_name( SMESH_Block::ID_NONE )
776 bool IsPolyLink( const _OrientedLink& ol )
778 return _polyLinks.empty() ? false :
779 ( &_polyLinks[0] <= ol._link && ol._link <= &_polyLinks.back() );
781 void AddPolyLink(_Node* n0, _Node* n1, _Face* faceToFindEqual=0)
783 if ( faceToFindEqual && faceToFindEqual != this ) {
784 for ( size_t iL = 0; iL < faceToFindEqual->_polyLinks.size(); ++iL )
785 if ( faceToFindEqual->_polyLinks[iL]._nodes[0] == n1 &&
786 faceToFindEqual->_polyLinks[iL]._nodes[1] == n0 )
789 ( _OrientedLink( & faceToFindEqual->_polyLinks[iL], /*reverse=*/true ));
796 _polyLinks.push_back( l );
797 _links.push_back( _OrientedLink( &_polyLinks.back() ));
800 // --------------------------------------------------------------------------------
801 struct _volumeDef // holder of nodes of a volume mesh element
807 const SMDS_MeshNode* _node; // mesh node at hexahedron corner
808 const B_IntersectPoint* _intPoint;
810 _nodeDef(): _node(0), _intPoint(0) {}
811 _nodeDef( _Node* n ): _node( n->_node), _intPoint( n->_intPoint ) {}
812 const SMDS_MeshNode* Node() const
813 { return ( _intPoint && _intPoint->_node ) ? _intPoint->_node : _node; }
814 const E_IntersectPoint* EdgeIntPnt() const
815 { return static_cast< const E_IntersectPoint* >( _intPoint ); }
816 _ptr Ptr() const { return Node() ? (_ptr) Node() : (_ptr) EdgeIntPnt(); }
817 bool operator==(const _nodeDef& other ) const { return Ptr() == other.Ptr(); }
820 vector< _nodeDef > _nodes;
821 vector< int > _quantities;
822 _volumeDef* _next; // to store several _volumeDefs in a chain
824 const SMDS_MeshElement* _volume; // new volume
826 vector< SMESH_Block::TShapeID > _names; // name of side a polygon originates from
828 _volumeDef(): _next(0), _solidID(0), _volume(0) {}
829 ~_volumeDef() { delete _next; }
830 _volumeDef( _volumeDef& other ):
831 _next(0), _solidID( other._solidID ), _volume( other._volume )
832 { _nodes.swap( other._nodes ); _quantities.swap( other._quantities ); other._volume = 0;
833 _names.swap( other._names ); }
835 size_t size() const { return 1 + ( _next ? _next->size() : 0 ); }
836 _volumeDef* at(int index)
837 { return index == 0 ? this : ( _next ? _next->at(index-1) : _next ); }
839 void Set( _Node** nodes, int nb )
840 { _nodes.assign( nodes, nodes + nb ); }
842 void SetNext( _volumeDef* vd )
843 { if ( _next ) { _next->SetNext( vd ); } else { _next = vd; }}
845 bool IsEmpty() const { return (( _nodes.empty() ) &&
846 ( !_next || _next->IsEmpty() )); }
847 bool IsPolyhedron() const { return ( !_quantities.empty() ||
848 ( _next && !_next->_quantities.empty() )); }
851 struct _linkDef: public std::pair<_ptr,_ptr> // to join polygons in removeExcessSideDivision()
853 _nodeDef _node1;//, _node2;
854 mutable /*const */_linkDef *_prev, *_next;
857 _linkDef():_prev(0), _next(0) {}
859 void init( const _nodeDef& n1, const _nodeDef& n2, size_t iLoop )
861 _node1 = n1; //_node2 = n2;
865 if ( first > second ) std::swap( first, second );
867 void setNext( _linkDef* next )
875 // topology of a hexahedron
877 _Link _hexLinks [12];
880 // faces resulted from hexahedron intersection
881 vector< _Face > _polygons;
883 // intresections with EDGEs
884 vector< const E_IntersectPoint* > _eIntPoints;
886 // additional nodes created at intersection points
887 vector< _Node > _intNodes;
889 // nodes inside the hexahedron (at VERTEXes) refer to _intNodes
890 vector< _Node* > _vIntNodes;
892 // computed volume elements
893 _volumeDef _volumeDefs;
896 double _sideLength[3];
897 int _nbCornerNodes, _nbFaceIntNodes, _nbBndNodes;
898 int _origNodeInd; // index of _hexNodes[0] node within the _grid
907 Hexahedron(Grid* grid);
908 int MakeElements(SMESH_MesherHelper& helper,
909 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap);
910 void computeElements( const Solid* solid = 0, int solidIndex = -1 );
913 Hexahedron(const Hexahedron& other, size_t i, size_t j, size_t k, int cellID );
914 void init( size_t i, size_t j, size_t k, const Solid* solid=0 );
915 void init( size_t i );
916 void setIJK( size_t i );
917 bool compute( const Solid* solid, const IsInternalFlag intFlag );
918 size_t getSolids( TGeomID ids[] );
919 bool isCutByInternalFace( IsInternalFlag & maxFlag );
920 void addEdges(SMESH_MesherHelper& helper,
921 vector< Hexahedron* >& intersectedHex,
922 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap);
923 gp_Pnt findIntPoint( double u1, double proj1, double u2, double proj2,
924 double proj, BRepAdaptor_Curve& curve,
925 const gp_XYZ& axis, const gp_XYZ& origin );
926 int getEntity( const E_IntersectPoint* ip, int* facets, int& sub );
927 bool addIntersection( const E_IntersectPoint* ip,
928 vector< Hexahedron* >& hexes,
929 int ijk[], int dIJK[] );
930 bool findChain( _Node* n1, _Node* n2, _Face& quad, vector<_Node*>& chainNodes );
931 bool closePolygon( _Face* polygon, vector<_Node*>& chainNodes ) const;
932 bool findChainOnEdge( const vector< _OrientedLink >& splits,
933 const _OrientedLink& prevSplit,
934 const _OrientedLink& avoidSplit,
937 vector<_Node*>& chn);
938 int addVolumes(SMESH_MesherHelper& helper );
939 void addFaces( SMESH_MesherHelper& helper,
940 const vector< const SMDS_MeshElement* > & boundaryVolumes );
941 void addSegments( SMESH_MesherHelper& helper,
942 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap );
943 void getVolumes( vector< const SMDS_MeshElement* > & volumes );
944 void getBoundaryElems( vector< const SMDS_MeshElement* > & boundaryVolumes );
945 void removeExcessSideDivision(const vector< Hexahedron* >& allHexa);
946 void removeExcessNodes(vector< Hexahedron* >& allHexa);
947 TGeomID getAnyFace() const;
948 void cutByExtendedInternal( std::vector< Hexahedron* >& hexes,
949 const TColStd_MapOfInteger& intEdgeIDs );
950 gp_Pnt mostDistantInternalPnt( int hexIndex, const gp_Pnt& p1, const gp_Pnt& p2 );
951 bool isOutPoint( _Link& link, int iP, SMESH_MesherHelper& helper, const Solid* solid ) const;
952 void sortVertexNodes(vector<_Node*>& nodes, _Node* curNode, TGeomID face);
953 bool isInHole() const;
954 bool hasStrangeEdge() const;
955 bool checkPolyhedronSize( bool isCutByInternalFace ) const;
960 bool debugDumpLink( _Link* link );
961 _Node* findEqualNode( vector< _Node* >& nodes,
962 const E_IntersectPoint* ip,
965 for ( size_t i = 0; i < nodes.size(); ++i )
966 if ( nodes[i]->EdgeIntPnt() == ip ||
967 nodes[i]->Point().SquareDistance( ip->_point ) <= tol2 )
971 bool isImplementEdges() const { return _grid->_edgeIntPool.nbElements(); }
972 bool isOutParam(const double uvw[3]) const;
974 typedef boost::container::flat_map< TGeomID, size_t > TID2Nb;
975 static void insertAndIncrement( TGeomID id, TID2Nb& id2nbMap )
977 TID2Nb::value_type s0( id, 0 );
978 TID2Nb::iterator id2nb = id2nbMap.insert( s0 ).first;
981 }; // class Hexahedron
984 // --------------------------------------------------------------------------
986 * \brief Hexahedron computing volumes in one thread
988 struct ParallelHexahedron
990 vector< Hexahedron* >& _hexVec;
991 ParallelHexahedron( vector< Hexahedron* >& hv ): _hexVec(hv) {}
992 void operator() ( const tbb::blocked_range<size_t>& r ) const
994 for ( size_t i = r.begin(); i != r.end(); ++i )
995 if ( Hexahedron* hex = _hexVec[ i ] )
996 hex->computeElements();
999 // --------------------------------------------------------------------------
1001 * \brief Structure intersecting certain nb of faces with GridLine's in one thread
1003 struct ParallelIntersector
1005 vector< FaceGridIntersector >& _faceVec;
1006 ParallelIntersector( vector< FaceGridIntersector >& faceVec): _faceVec(faceVec){}
1007 void operator() ( const tbb::blocked_range<size_t>& r ) const
1009 for ( size_t i = r.begin(); i != r.end(); ++i )
1010 _faceVec[i].Intersect();
1015 //=============================================================================
1016 // Implementation of internal utils
1017 //=============================================================================
1019 * \brief adjust \a i to have \a val between values[i] and values[i+1]
1021 inline void locateValue( int & i, double val, const vector<double>& values,
1022 int& di, double tol )
1024 //val += values[0]; // input \a val is measured from 0.
1025 if ( i > (int) values.size()-2 )
1026 i = values.size()-2;
1028 while ( i+2 < (int) values.size() && val > values[ i+1 ])
1030 while ( i > 0 && val < values[ i ])
1033 if ( i > 0 && val - values[ i ] < tol )
1035 else if ( i+2 < (int) values.size() && values[ i+1 ] - val < tol )
1040 //=============================================================================
1042 * Remove coincident intersection points
1044 void GridLine::RemoveExcessIntPoints( const double tol )
1046 if ( _intPoints.size() < 2 ) return;
1048 set< Transition > tranSet;
1049 multiset< F_IntersectPoint >::iterator ip1, ip2 = _intPoints.begin();
1050 while ( ip2 != _intPoints.end() )
1054 while ( ip2 != _intPoints.end() && ip2->_paramOnLine - ip1->_paramOnLine <= tol )
1056 tranSet.insert( ip1->_transition );
1057 tranSet.insert( ip2->_transition );
1058 ip2->Add( ip1->_faceIDs );
1059 _intPoints.erase( ip1 );
1062 if ( tranSet.size() > 1 ) // points with different transition coincide
1064 bool isIN = tranSet.count( Trans_IN );
1065 bool isOUT = tranSet.count( Trans_OUT );
1066 if ( isIN && isOUT )
1067 (*ip1)._transition = Trans_TANGENT;
1069 (*ip1)._transition = isIN ? Trans_IN : Trans_OUT;
1073 //================================================================================
1075 * Return ID of SOLID for nodes before the given intersection point
1077 TGeomID GridLine::GetSolidIDBefore( multiset< F_IntersectPoint >::iterator ip,
1078 const TGeomID prevID,
1079 const Geometry& geom )
1081 if ( ip == _intPoints.begin() )
1084 if ( geom.IsOneSolid() )
1087 switch ( ip->_transition ) {
1088 case Trans_IN: isOut = true; break;
1089 case Trans_OUT: isOut = false; break;
1090 case Trans_TANGENT: isOut = ( prevID != 0 ); break;
1093 // singularity point (apex of a cone)
1094 multiset< F_IntersectPoint >::iterator ipBef = ip, ipAft = ++ip;
1095 if ( ipAft == _intPoints.end() )
1100 if ( ipBef->_transition != ipAft->_transition )
1101 isOut = ( ipBef->_transition == Trans_OUT );
1103 isOut = ( ipBef->_transition != Trans_OUT );
1107 case Trans_INTERNAL: isOut = false;
1110 return isOut ? 0 : geom._soleSolid.ID();
1113 const vector< TGeomID >& solids = geom._solidIDsByShapeID[ ip->_faceIDs[ 0 ]];
1116 if ( ip->_transition == Trans_INTERNAL )
1119 const vector< TGeomID >& solidsBef = geom._solidIDsByShapeID[ ip->_faceIDs[ 0 ]];
1121 if ( ip->_transition == Trans_IN ||
1122 ip->_transition == Trans_OUT )
1124 if ( solidsBef.size() == 1 )
1125 return ( solidsBef[0] == prevID ) ? 0 : solidsBef[0];
1127 return solidsBef[ solidsBef[0] == prevID ];
1130 if ( solidsBef.size() == 1 )
1131 return solidsBef[0];
1133 for ( size_t i = 0; i < solids.size(); ++i )
1135 vector< TGeomID >::const_iterator it =
1136 std::find( solidsBef.begin(), solidsBef.end(), solids[i] );
1137 if ( it != solidsBef.end() )
1142 //================================================================================
1146 void B_IntersectPoint::Add( const vector< TGeomID >& fIDs,
1147 const SMDS_MeshNode* n) const
1149 if ( _faceIDs.empty() )
1152 for ( size_t i = 0; i < fIDs.size(); ++i )
1154 vector< TGeomID >::iterator it =
1155 std::find( _faceIDs.begin(), _faceIDs.end(), fIDs[i] );
1156 if ( it == _faceIDs.end() )
1157 _faceIDs.push_back( fIDs[i] );
1162 //================================================================================
1164 * Returns index of a common face if any, else zero
1166 int B_IntersectPoint::HasCommonFace( const B_IntersectPoint * other, int avoidFace ) const
1169 for ( size_t i = 0; i < other->_faceIDs.size(); ++i )
1170 if ( avoidFace != other->_faceIDs[i] &&
1171 IsOnFace ( other->_faceIDs[i] ))
1172 return other->_faceIDs[i];
1175 //================================================================================
1177 * Returns \c true if \a faceID in in this->_faceIDs
1179 bool B_IntersectPoint::IsOnFace( int faceID ) const // returns true if faceID is found
1181 vector< TGeomID >::const_iterator it =
1182 std::find( _faceIDs.begin(), _faceIDs.end(), faceID );
1183 return ( it != _faceIDs.end() );
1185 //================================================================================
1187 * OneOfSolids initialization
1189 void OneOfSolids::Init( const TopoDS_Shape& solid,
1190 TopAbs_ShapeEnum subType,
1191 const SMESHDS_Mesh* mesh )
1193 SetID( mesh->ShapeToIndex( solid ));
1195 if ( subType == TopAbs_FACE )
1196 SetHasInternalFaces( false );
1198 for ( TopExp_Explorer sub( solid, subType ); sub.More(); sub.Next() )
1200 _subIDs.Add( mesh->ShapeToIndex( sub.Current() ));
1201 if ( subType == TopAbs_FACE )
1203 _faces.Add( sub.Current() );
1204 if ( sub.Current().Orientation() == TopAbs_INTERNAL )
1205 SetHasInternalFaces( true );
1207 TGeomID faceID = mesh->ShapeToIndex( sub.Current() );
1208 if ( sub.Current().Orientation() == TopAbs_INTERNAL ||
1209 sub.Current().Orientation() == mesh->IndexToShape( faceID ).Orientation() )
1210 _outFaceIDs.Add( faceID );
1214 //================================================================================
1216 * Return an iterator on GridLine's in a given direction
1218 LineIndexer Grid::GetLineIndexer(size_t iDir) const
1220 const size_t indices[] = { 1,2,0, 0,2,1, 0,1,2 };
1221 const string s [] = { "X", "Y", "Z" };
1222 LineIndexer li( _coords[0].size(), _coords[1].size(), _coords[2].size(),
1223 indices[iDir*3], indices[iDir*3+1], indices[iDir*3+2],
1224 s[indices[iDir*3]], s[indices[iDir*3+1]], s[indices[iDir*3+2]]);
1227 //=============================================================================
1229 * Creates GridLine's of the grid
1231 void Grid::SetCoordinates(const vector<double>& xCoords,
1232 const vector<double>& yCoords,
1233 const vector<double>& zCoords,
1234 const double* axesDirs,
1235 const Bnd_Box& shapeBox)
1237 _coords[0] = xCoords;
1238 _coords[1] = yCoords;
1239 _coords[2] = zCoords;
1241 _axes[0].SetCoord( axesDirs[0],
1244 _axes[1].SetCoord( axesDirs[3],
1247 _axes[2].SetCoord( axesDirs[6],
1250 _axes[0].Normalize();
1251 _axes[1].Normalize();
1252 _axes[2].Normalize();
1254 _invB.SetCols( _axes[0], _axes[1], _axes[2] );
1257 // compute tolerance
1258 _minCellSize = Precision::Infinite();
1259 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1261 for ( size_t i = 1; i < _coords[ iDir ].size(); ++i )
1263 double cellLen = _coords[ iDir ][ i ] - _coords[ iDir ][ i-1 ];
1264 if ( cellLen < _minCellSize )
1265 _minCellSize = cellLen;
1268 if ( _minCellSize < Precision::Confusion() )
1269 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1270 SMESH_Comment("Too small cell size: ") << _minCellSize );
1271 _tol = _minCellSize / 1000.;
1273 // attune grid extremities to shape bounding box
1275 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
1276 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
1277 double* cP[6] = { &_coords[0].front(), &_coords[1].front(), &_coords[2].front(),
1278 &_coords[0].back(), &_coords[1].back(), &_coords[2].back() };
1279 for ( int i = 0; i < 6; ++i )
1280 if ( fabs( sP[i] - *cP[i] ) < _tol )
1281 *cP[i] = sP[i];// + _tol/1000. * ( i < 3 ? +1 : -1 );
1283 for ( int iDir = 0; iDir < 3; ++iDir )
1285 if ( _coords[iDir][0] - sP[iDir] > _tol )
1287 _minCellSize = Min( _minCellSize, _coords[iDir][0] - sP[iDir] );
1288 _coords[iDir].insert( _coords[iDir].begin(), sP[iDir] + _tol/1000.);
1290 if ( sP[iDir+3] - _coords[iDir].back() > _tol )
1292 _minCellSize = Min( _minCellSize, sP[iDir+3] - _coords[iDir].back() );
1293 _coords[iDir].push_back( sP[iDir+3] - _tol/1000.);
1296 _tol = _minCellSize / 1000.;
1298 _origin = ( _coords[0][0] * _axes[0] +
1299 _coords[1][0] * _axes[1] +
1300 _coords[2][0] * _axes[2] );
1303 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1305 LineIndexer li = GetLineIndexer( iDir );
1306 _lines[iDir].resize( li.NbLines() );
1307 double len = _coords[ iDir ].back() - _coords[iDir].front();
1308 for ( ; li.More(); ++li )
1310 GridLine& gl = _lines[iDir][ li.LineIndex() ];
1311 gl._line.SetLocation( _coords[0][li.I()] * _axes[0] +
1312 _coords[1][li.J()] * _axes[1] +
1313 _coords[2][li.K()] * _axes[2] );
1314 gl._line.SetDirection( _axes[ iDir ]);
1319 //================================================================================
1321 * Return local ID of shape
1323 TGeomID Grid::ShapeID( const TopoDS_Shape& s ) const
1325 return _helper->GetMeshDS()->ShapeToIndex( s );
1327 //================================================================================
1329 * Return a shape by its local ID
1331 const TopoDS_Shape& Grid::Shape( TGeomID id ) const
1333 return _helper->GetMeshDS()->IndexToShape( id );
1335 //================================================================================
1337 * Initialize _geometry
1339 void Grid::InitGeometry( const TopoDS_Shape& theShapeToMesh )
1341 SMESH_Mesh* mesh = _helper->GetMesh();
1343 _geometry._mainShape = theShapeToMesh;
1344 _geometry._extIntFaceID = mesh->GetMeshDS()->MaxShapeIndex() * 100;
1345 _geometry._soleSolid.SetID( 0 );
1346 _geometry._soleSolid.SetHasInternalFaces( false );
1348 InitClassifier( theShapeToMesh, TopAbs_VERTEX, _geometry._vertexClassifier );
1349 InitClassifier( theShapeToMesh, TopAbs_EDGE , _geometry._edgeClassifier );
1351 TopExp_Explorer solidExp( theShapeToMesh, TopAbs_SOLID );
1353 bool isSeveralSolids = false;
1354 if ( _toConsiderInternalFaces ) // check nb SOLIDs
1357 isSeveralSolids = solidExp.More();
1358 _toConsiderInternalFaces = isSeveralSolids;
1361 if ( !isSeveralSolids ) // look for an internal FACE
1363 TopExp_Explorer fExp( theShapeToMesh, TopAbs_FACE );
1364 for ( ; fExp.More() && !_toConsiderInternalFaces; fExp.Next() )
1365 _toConsiderInternalFaces = ( fExp.Current().Orientation() == TopAbs_INTERNAL );
1367 _geometry._soleSolid.SetHasInternalFaces( _toConsiderInternalFaces );
1368 _geometry._soleSolid.SetID( ShapeID( solidExp.Current() ));
1370 else // fill Geometry::_solidByID
1372 for ( ; solidExp.More(); solidExp.Next() )
1374 OneOfSolids & solid = _geometry._solidByID[ ShapeID( solidExp.Current() )];
1375 solid.Init( solidExp.Current(), TopAbs_FACE, mesh->GetMeshDS() );
1376 solid.Init( solidExp.Current(), TopAbs_EDGE, mesh->GetMeshDS() );
1377 solid.Init( solidExp.Current(), TopAbs_VERTEX, mesh->GetMeshDS() );
1383 _geometry._soleSolid.SetID( ShapeID( solidExp.Current() ));
1386 if ( !_toCreateFaces )
1388 int nbSolidsGlobal = _helper->Count( mesh->GetShapeToMesh(), TopAbs_SOLID, false );
1389 int nbSolidsLocal = _helper->Count( theShapeToMesh, TopAbs_SOLID, false );
1390 _toCreateFaces = ( nbSolidsLocal < nbSolidsGlobal );
1393 TopTools_IndexedMapOfShape faces;
1394 if ( _toCreateFaces || isSeveralSolids )
1395 TopExp::MapShapes( theShapeToMesh, TopAbs_FACE, faces );
1397 // find boundary FACEs on boundary of mesh->ShapeToMesh()
1398 if ( _toCreateFaces )
1399 for ( int i = 1; i <= faces.Size(); ++i )
1400 if ( faces(i).Orientation() != TopAbs_INTERNAL &&
1401 _helper->NbAncestors( faces(i), *mesh, TopAbs_SOLID ) == 1 )
1403 _geometry._boundaryFaces.Add( ShapeID( faces(i) ));
1406 if ( isSeveralSolids )
1407 for ( int i = 1; i <= faces.Size(); ++i )
1409 SetSolidFather( faces(i), theShapeToMesh );
1410 for ( TopExp_Explorer eExp( faces(i), TopAbs_EDGE ); eExp.More(); eExp.Next() )
1412 const TopoDS_Edge& edge = TopoDS::Edge( eExp.Current() );
1413 SetSolidFather( edge, theShapeToMesh );
1414 SetSolidFather( _helper->IthVertex( 0, edge ), theShapeToMesh );
1415 SetSolidFather( _helper->IthVertex( 1, edge ), theShapeToMesh );
1420 //================================================================================
1422 * Store ID of SOLID as father of its child shape ID
1424 void Grid::SetSolidFather( const TopoDS_Shape& s, const TopoDS_Shape& theShapeToMesh )
1426 if ( _geometry._solidIDsByShapeID.empty() )
1427 _geometry._solidIDsByShapeID.resize( _helper->GetMeshDS()->MaxShapeIndex() + 1 );
1429 vector< TGeomID > & solidIDs = _geometry._solidIDsByShapeID[ ShapeID( s )];
1430 if ( !solidIDs.empty() )
1432 solidIDs.reserve(2);
1433 PShapeIteratorPtr solidIt = _helper->GetAncestors( s,
1434 *_helper->GetMesh(),
1437 while ( const TopoDS_Shape* solid = solidIt->next() )
1438 solidIDs.push_back( ShapeID( *solid ));
1440 //================================================================================
1442 * Return IDs of solids given sub-shape belongs to
1444 const vector< TGeomID > & Grid::GetSolidIDs( TGeomID subShapeID ) const
1446 return _geometry._solidIDsByShapeID[ subShapeID ];
1448 //================================================================================
1450 * Check if a sub-shape belongs to several SOLIDs
1452 bool Grid::IsShared( TGeomID shapeID ) const
1454 return !_geometry.IsOneSolid() && ( _geometry._solidIDsByShapeID[ shapeID ].size() > 1 );
1456 //================================================================================
1458 * Check if any of FACEs belongs to several SOLIDs
1460 bool Grid::IsAnyShared( const std::vector< TGeomID >& faceIDs ) const
1462 for ( size_t i = 0; i < faceIDs.size(); ++i )
1463 if ( IsShared( faceIDs[ i ]))
1467 //================================================================================
1469 * Return Solid by ID
1471 Solid* Grid::GetSolid( TGeomID solidID )
1473 if ( !solidID || _geometry.IsOneSolid() || _geometry._solidByID.empty() )
1474 return & _geometry._soleSolid;
1476 return & _geometry._solidByID[ solidID ];
1478 //================================================================================
1480 * Return OneOfSolids by ID
1482 Solid* Grid::GetOneOfSolids( TGeomID solidID )
1484 map< TGeomID, OneOfSolids >::iterator is2s = _geometry._solidByID.find( solidID );
1485 if ( is2s != _geometry._solidByID.end() )
1486 return & is2s->second;
1488 return & _geometry._soleSolid;
1490 //================================================================================
1492 * Check if transition on given FACE is correct for a given SOLID
1494 bool Grid::IsCorrectTransition( TGeomID faceID, const Solid* solid )
1496 if ( _geometry.IsOneSolid() )
1499 const vector< TGeomID >& solidIDs = _geometry._solidIDsByShapeID[ faceID ];
1500 return solidIDs[0] == solid->ID();
1503 //================================================================================
1505 * Assign to geometry a node at FACE intersection
1507 void Grid::SetOnShape( const SMDS_MeshNode* n, const F_IntersectPoint& ip, bool unset )
1510 SMESHDS_Mesh* mesh = _helper->GetMeshDS();
1511 if ( ip._faceIDs.size() == 1 )
1513 mesh->SetNodeOnFace( n, ip._faceIDs[0], ip._u, ip._v );
1515 else if ( _geometry._vertexClassifier.IsSatisfy( n, &s ))
1517 if ( unset ) mesh->UnSetNodeOnShape( n );
1518 mesh->SetNodeOnVertex( n, TopoDS::Vertex( s ));
1520 else if ( _geometry._edgeClassifier.IsSatisfy( n, &s ))
1522 if ( unset ) mesh->UnSetNodeOnShape( n );
1523 mesh->SetNodeOnEdge( n, TopoDS::Edge( s ));
1525 else if ( ip._faceIDs.size() > 0 )
1527 mesh->SetNodeOnFace( n, ip._faceIDs[0], ip._u, ip._v );
1529 else if ( !unset && _geometry.IsOneSolid() )
1531 mesh->SetNodeInVolume( n, _geometry._soleSolid.ID() );
1534 //================================================================================
1536 * Initialize a classifier
1538 void Grid::InitClassifier( const TopoDS_Shape& mainShape,
1539 TopAbs_ShapeEnum shapeType,
1540 Controls::ElementsOnShape& classifier )
1542 TopTools_IndexedMapOfShape shapes;
1543 TopExp::MapShapes( mainShape, shapeType, shapes );
1545 TopoDS_Compound compound; BRep_Builder builder;
1546 builder.MakeCompound( compound );
1547 for ( int i = 1; i <= shapes.Size(); ++i )
1548 builder.Add( compound, shapes(i) );
1550 classifier.SetMesh( _helper->GetMeshDS() );
1551 //classifier.SetTolerance( _tol ); // _tol is not initialised
1552 classifier.SetShape( compound, SMDSAbs_Node );
1555 //================================================================================
1557 * Return EDGEs with FACEs to implement into the mesh
1559 void Grid::GetEdgesToImplement( map< TGeomID, vector< TGeomID > > & edge2faceIDsMap,
1560 const TopoDS_Shape& shape,
1561 const vector< TopoDS_Shape >& faces )
1563 // check if there are strange EDGEs
1564 TopTools_IndexedMapOfShape faceMap;
1565 TopExp::MapShapes( _helper->GetMesh()->GetShapeToMesh(), TopAbs_FACE, faceMap );
1566 int nbFacesGlobal = faceMap.Size();
1567 faceMap.Clear( false );
1568 TopExp::MapShapes( shape, TopAbs_FACE, faceMap );
1569 int nbFacesLocal = faceMap.Size();
1570 bool hasStrangeEdges = ( nbFacesGlobal > nbFacesLocal );
1571 if ( !_toAddEdges && !hasStrangeEdges )
1572 return; // no FACEs in contact with those meshed by other algo
1574 for ( size_t i = 0; i < faces.size(); ++i )
1576 _helper->SetSubShape( faces[i] );
1577 for ( TopExp_Explorer eExp( faces[i], TopAbs_EDGE ); eExp.More(); eExp.Next() )
1579 const TopoDS_Edge& edge = TopoDS::Edge( eExp.Current() );
1580 if ( hasStrangeEdges )
1582 bool hasStrangeFace = false;
1583 PShapeIteratorPtr faceIt = _helper->GetAncestors( edge, *_helper->GetMesh(), TopAbs_FACE);
1584 while ( const TopoDS_Shape* face = faceIt->next() )
1585 if (( hasStrangeFace = !faceMap.Contains( *face )))
1587 if ( !hasStrangeFace && !_toAddEdges )
1589 _geometry._strangeEdges.Add( ShapeID( edge ));
1590 _geometry._strangeEdges.Add( ShapeID( _helper->IthVertex( 0, edge )));
1591 _geometry._strangeEdges.Add( ShapeID( _helper->IthVertex( 1, edge )));
1593 if ( !SMESH_Algo::isDegenerated( edge ) &&
1594 !_helper->IsRealSeam( edge ))
1596 edge2faceIDsMap[ ShapeID( edge )].push_back( ShapeID( faces[i] ));
1603 //================================================================================
1605 * Computes coordinates of a point in the grid CS
1607 void Grid::ComputeUVW(const gp_XYZ& P, double UVW[3])
1609 gp_XYZ p = P * _invB;
1610 p.Coord( UVW[0], UVW[1], UVW[2] );
1612 //================================================================================
1616 void Grid::ComputeNodes(SMESH_MesherHelper& helper)
1618 // state of each node of the grid relative to the geometry
1619 const size_t nbGridNodes = _coords[0].size() * _coords[1].size() * _coords[2].size();
1620 const TGeomID undefID = 1e+9;
1621 vector< TGeomID > shapeIDVec( nbGridNodes, undefID );
1622 _nodes.resize( nbGridNodes, 0 );
1623 _gridIntP.resize( nbGridNodes, NULL );
1625 SMESHDS_Mesh* mesh = helper.GetMeshDS();
1627 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1629 LineIndexer li = GetLineIndexer( iDir );
1631 // find out a shift of node index while walking along a GridLine in this direction
1632 li.SetIndexOnLine( 0 );
1633 size_t nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
1634 li.SetIndexOnLine( 1 );
1635 const size_t nShift = NodeIndex( li.I(), li.J(), li.K() ) - nIndex0;
1637 const vector<double> & coords = _coords[ iDir ];
1638 for ( ; li.More(); ++li ) // loop on lines in iDir
1640 li.SetIndexOnLine( 0 );
1641 nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
1643 GridLine& line = _lines[ iDir ][ li.LineIndex() ];
1644 const gp_XYZ lineLoc = line._line.Location().XYZ();
1645 const gp_XYZ lineDir = line._line.Direction().XYZ();
1647 line.RemoveExcessIntPoints( _tol );
1648 multiset< F_IntersectPoint >& intPnts = line._intPoints;
1649 multiset< F_IntersectPoint >::iterator ip = intPnts.begin();
1651 // Create mesh nodes at intersections with geometry
1652 // and set OUT state of nodes between intersections
1654 TGeomID solidID = 0;
1655 const double* nodeCoord = & coords[0];
1656 const double* coord0 = nodeCoord;
1657 const double* coordEnd = coord0 + coords.size();
1658 double nodeParam = 0;
1659 for ( ; ip != intPnts.end(); ++ip )
1661 solidID = line.GetSolidIDBefore( ip, solidID, _geometry );
1663 // set OUT state or just skip IN nodes before ip
1664 if ( nodeParam < ip->_paramOnLine - _tol )
1666 while ( nodeParam < ip->_paramOnLine - _tol )
1668 TGeomID & nodeShapeID = shapeIDVec[ nIndex0 + nShift * ( nodeCoord-coord0 ) ];
1669 nodeShapeID = Min( solidID, nodeShapeID );
1670 if ( ++nodeCoord < coordEnd )
1671 nodeParam = *nodeCoord - *coord0;
1675 if ( nodeCoord == coordEnd ) break;
1677 // create a mesh node on a GridLine at ip if it does not coincide with a grid node
1678 if ( nodeParam > ip->_paramOnLine + _tol )
1680 gp_XYZ xyz = lineLoc + ip->_paramOnLine * lineDir;
1681 ip->_node = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1682 ip->_indexOnLine = nodeCoord-coord0-1;
1683 SetOnShape( ip->_node, *ip );
1685 // create a mesh node at ip coincident with a grid node
1688 int nodeIndex = nIndex0 + nShift * ( nodeCoord-coord0 );
1689 if ( !_nodes[ nodeIndex ] )
1691 gp_XYZ xyz = lineLoc + nodeParam * lineDir;
1692 _nodes [ nodeIndex ] = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1693 //_gridIntP[ nodeIndex ] = & * ip;
1694 //SetOnShape( _nodes[ nodeIndex ], *ip );
1696 if ( _gridIntP[ nodeIndex ] )
1697 _gridIntP[ nodeIndex ]->Add( ip->_faceIDs );
1699 _gridIntP[ nodeIndex ] = & * ip;
1700 // ip->_node = _nodes[ nodeIndex ]; -- to differ from ip on links
1701 ip->_indexOnLine = nodeCoord-coord0;
1702 if ( ++nodeCoord < coordEnd )
1703 nodeParam = *nodeCoord - *coord0;
1706 // set OUT state to nodes after the last ip
1707 for ( ; nodeCoord < coordEnd; ++nodeCoord )
1708 shapeIDVec[ nIndex0 + nShift * ( nodeCoord-coord0 ) ] = 0;
1712 // Create mesh nodes at !OUT nodes of the grid
1714 for ( size_t z = 0; z < _coords[2].size(); ++z )
1715 for ( size_t y = 0; y < _coords[1].size(); ++y )
1716 for ( size_t x = 0; x < _coords[0].size(); ++x )
1718 size_t nodeIndex = NodeIndex( x, y, z );
1719 if ( !_nodes[ nodeIndex ] &&
1720 0 < shapeIDVec[ nodeIndex ] && shapeIDVec[ nodeIndex ] < undefID )
1722 gp_XYZ xyz = ( _coords[0][x] * _axes[0] +
1723 _coords[1][y] * _axes[1] +
1724 _coords[2][z] * _axes[2] );
1725 _nodes[ nodeIndex ] = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1726 mesh->SetNodeInVolume( _nodes[ nodeIndex ], shapeIDVec[ nodeIndex ]);
1728 else if ( _nodes[ nodeIndex ] && _gridIntP[ nodeIndex ] /*&&
1729 !_nodes[ nodeIndex]->GetShapeID()*/ )
1731 SetOnShape( _nodes[ nodeIndex ], *_gridIntP[ nodeIndex ]);
1736 // check validity of transitions
1737 const char* trName[] = { "TANGENT", "IN", "OUT", "APEX" };
1738 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1740 LineIndexer li = GetLineIndexer( iDir );
1741 for ( ; li.More(); ++li )
1743 multiset< F_IntersectPoint >& intPnts = _lines[ iDir ][ li.LineIndex() ]._intPoints;
1744 if ( intPnts.empty() ) continue;
1745 if ( intPnts.size() == 1 )
1747 if ( intPnts.begin()->_transition != Trans_TANGENT &&
1748 intPnts.begin()->_transition != Trans_APEX )
1749 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1750 SMESH_Comment("Wrong SOLE transition of GridLine (")
1751 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1752 << ") along " << li._nameConst
1753 << ": " << trName[ intPnts.begin()->_transition] );
1757 if ( intPnts.begin()->_transition == Trans_OUT )
1758 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1759 SMESH_Comment("Wrong START transition of GridLine (")
1760 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1761 << ") along " << li._nameConst
1762 << ": " << trName[ intPnts.begin()->_transition ]);
1763 if ( intPnts.rbegin()->_transition == Trans_IN )
1764 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1765 SMESH_Comment("Wrong END transition of GridLine (")
1766 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1767 << ") along " << li._nameConst
1768 << ": " << trName[ intPnts.rbegin()->_transition ]);
1775 //=============================================================================
1777 * Intersects TopoDS_Face with all GridLine's
1779 void FaceGridIntersector::Intersect()
1781 FaceLineIntersector intersector;
1782 intersector._surfaceInt = GetCurveFaceIntersector();
1783 intersector._tol = _grid->_tol;
1784 intersector._transOut = _face.Orientation() == TopAbs_REVERSED ? Trans_IN : Trans_OUT;
1785 intersector._transIn = _face.Orientation() == TopAbs_REVERSED ? Trans_OUT : Trans_IN;
1787 typedef void (FaceLineIntersector::* PIntFun )(const GridLine& gridLine);
1788 PIntFun interFunction;
1790 bool isDirect = true;
1791 BRepAdaptor_Surface surf( _face );
1792 switch ( surf.GetType() ) {
1794 intersector._plane = surf.Plane();
1795 interFunction = &FaceLineIntersector::IntersectWithPlane;
1796 isDirect = intersector._plane.Direct();
1798 case GeomAbs_Cylinder:
1799 intersector._cylinder = surf.Cylinder();
1800 interFunction = &FaceLineIntersector::IntersectWithCylinder;
1801 isDirect = intersector._cylinder.Direct();
1804 intersector._cone = surf.Cone();
1805 interFunction = &FaceLineIntersector::IntersectWithCone;
1806 //isDirect = intersector._cone.Direct();
1808 case GeomAbs_Sphere:
1809 intersector._sphere = surf.Sphere();
1810 interFunction = &FaceLineIntersector::IntersectWithSphere;
1811 isDirect = intersector._sphere.Direct();
1814 intersector._torus = surf.Torus();
1815 interFunction = &FaceLineIntersector::IntersectWithTorus;
1816 //isDirect = intersector._torus.Direct();
1819 interFunction = &FaceLineIntersector::IntersectWithSurface;
1822 std::swap( intersector._transOut, intersector._transIn );
1824 _intersections.clear();
1825 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1827 if ( surf.GetType() == GeomAbs_Plane )
1829 // check if all lines in this direction are parallel to a plane
1830 if ( intersector._plane.Axis().IsNormal( _grid->_lines[iDir][0]._line.Position(),
1831 Precision::Angular()))
1833 // find out a transition, that is the same for all lines of a direction
1834 gp_Dir plnNorm = intersector._plane.Axis().Direction();
1835 gp_Dir lineDir = _grid->_lines[iDir][0]._line.Direction();
1836 intersector._transition =
1837 ( plnNorm * lineDir < 0 ) ? intersector._transIn : intersector._transOut;
1839 if ( surf.GetType() == GeomAbs_Cylinder )
1841 // check if all lines in this direction are parallel to a cylinder
1842 if ( intersector._cylinder.Axis().IsParallel( _grid->_lines[iDir][0]._line.Position(),
1843 Precision::Angular()))
1847 // intersect the grid lines with the face
1848 for ( size_t iL = 0; iL < _grid->_lines[iDir].size(); ++iL )
1850 GridLine& gridLine = _grid->_lines[iDir][iL];
1851 if ( _bndBox.IsOut( gridLine._line )) continue;
1853 intersector._intPoints.clear();
1854 (intersector.*interFunction)( gridLine ); // <- intersection with gridLine
1855 for ( size_t i = 0; i < intersector._intPoints.size(); ++i )
1856 _intersections.push_back( make_pair( &gridLine, intersector._intPoints[i] ));
1860 if ( _face.Orientation() == TopAbs_INTERNAL )
1862 for ( size_t i = 0; i < _intersections.size(); ++i )
1863 if ( _intersections[i].second._transition == Trans_IN ||
1864 _intersections[i].second._transition == Trans_OUT )
1866 _intersections[i].second._transition = Trans_INTERNAL;
1871 //================================================================================
1873 * Return true if (_u,_v) is on the face
1875 bool FaceLineIntersector::UVIsOnFace() const
1877 TopAbs_State state = _surfaceInt->ClassifyUVPoint(gp_Pnt2d( _u,_v ));
1878 return ( state == TopAbs_IN || state == TopAbs_ON );
1880 //================================================================================
1882 * Store an intersection if it is IN or ON the face
1884 void FaceLineIntersector::addIntPoint(const bool toClassify)
1886 if ( !toClassify || UVIsOnFace() )
1889 p._paramOnLine = _w;
1892 p._transition = _transition;
1893 _intPoints.push_back( p );
1896 //================================================================================
1898 * Intersect a line with a plane
1900 void FaceLineIntersector::IntersectWithPlane(const GridLine& gridLine)
1902 IntAna_IntConicQuad linPlane( gridLine._line, _plane, Precision::Angular());
1903 _w = linPlane.ParamOnConic(1);
1904 if ( isParamOnLineOK( gridLine._length ))
1906 ElSLib::Parameters(_plane, linPlane.Point(1) ,_u,_v);
1910 //================================================================================
1912 * Intersect a line with a cylinder
1914 void FaceLineIntersector::IntersectWithCylinder(const GridLine& gridLine)
1916 IntAna_IntConicQuad linCylinder( gridLine._line, _cylinder );
1917 if ( linCylinder.IsDone() && linCylinder.NbPoints() > 0 )
1919 _w = linCylinder.ParamOnConic(1);
1920 if ( linCylinder.NbPoints() == 1 )
1921 _transition = Trans_TANGENT;
1923 _transition = _w < linCylinder.ParamOnConic(2) ? _transIn : _transOut;
1924 if ( isParamOnLineOK( gridLine._length ))
1926 ElSLib::Parameters(_cylinder, linCylinder.Point(1) ,_u,_v);
1929 if ( linCylinder.NbPoints() > 1 )
1931 _w = linCylinder.ParamOnConic(2);
1932 if ( isParamOnLineOK( gridLine._length ))
1934 ElSLib::Parameters(_cylinder, linCylinder.Point(2) ,_u,_v);
1935 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
1941 //================================================================================
1943 * Intersect a line with a cone
1945 void FaceLineIntersector::IntersectWithCone (const GridLine& gridLine)
1947 IntAna_IntConicQuad linCone(gridLine._line,_cone);
1948 if ( !linCone.IsDone() ) return;
1950 gp_Vec du, dv, norm;
1951 for ( int i = 1; i <= linCone.NbPoints(); ++i )
1953 _w = linCone.ParamOnConic( i );
1954 if ( !isParamOnLineOK( gridLine._length )) continue;
1955 ElSLib::Parameters(_cone, linCone.Point(i) ,_u,_v);
1958 ElSLib::D1( _u, _v, _cone, P, du, dv );
1960 double normSize2 = norm.SquareMagnitude();
1961 if ( normSize2 > Precision::Angular() * Precision::Angular() )
1963 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
1964 cos /= sqrt( normSize2 );
1965 if ( cos < -Precision::Angular() )
1966 _transition = _transIn;
1967 else if ( cos > Precision::Angular() )
1968 _transition = _transOut;
1970 _transition = Trans_TANGENT;
1974 _transition = Trans_APEX;
1976 addIntPoint( /*toClassify=*/false);
1980 //================================================================================
1982 * Intersect a line with a sphere
1984 void FaceLineIntersector::IntersectWithSphere (const GridLine& gridLine)
1986 IntAna_IntConicQuad linSphere(gridLine._line,_sphere);
1987 if ( linSphere.IsDone() && linSphere.NbPoints() > 0 )
1989 _w = linSphere.ParamOnConic(1);
1990 if ( linSphere.NbPoints() == 1 )
1991 _transition = Trans_TANGENT;
1993 _transition = _w < linSphere.ParamOnConic(2) ? _transIn : _transOut;
1994 if ( isParamOnLineOK( gridLine._length ))
1996 ElSLib::Parameters(_sphere, linSphere.Point(1) ,_u,_v);
1999 if ( linSphere.NbPoints() > 1 )
2001 _w = linSphere.ParamOnConic(2);
2002 if ( isParamOnLineOK( gridLine._length ))
2004 ElSLib::Parameters(_sphere, linSphere.Point(2) ,_u,_v);
2005 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
2011 //================================================================================
2013 * Intersect a line with a torus
2015 void FaceLineIntersector::IntersectWithTorus (const GridLine& gridLine)
2017 IntAna_IntLinTorus linTorus(gridLine._line,_torus);
2018 if ( !linTorus.IsDone()) return;
2020 gp_Vec du, dv, norm;
2021 for ( int i = 1; i <= linTorus.NbPoints(); ++i )
2023 _w = linTorus.ParamOnLine( i );
2024 if ( !isParamOnLineOK( gridLine._length )) continue;
2025 linTorus.ParamOnTorus( i, _u,_v );
2028 ElSLib::D1( _u, _v, _torus, P, du, dv );
2030 double normSize = norm.Magnitude();
2031 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
2033 if ( cos < -Precision::Angular() )
2034 _transition = _transIn;
2035 else if ( cos > Precision::Angular() )
2036 _transition = _transOut;
2038 _transition = Trans_TANGENT;
2039 addIntPoint( /*toClassify=*/false);
2043 //================================================================================
2045 * Intersect a line with a non-analytical surface
2047 void FaceLineIntersector::IntersectWithSurface (const GridLine& gridLine)
2049 _surfaceInt->Perform( gridLine._line, 0.0, gridLine._length );
2050 if ( !_surfaceInt->IsDone() ) return;
2051 for ( int i = 1; i <= _surfaceInt->NbPnt(); ++i )
2053 _transition = Transition( _surfaceInt->Transition( i ) );
2054 _w = _surfaceInt->WParameter( i );
2055 addIntPoint(/*toClassify=*/false);
2058 //================================================================================
2060 * check if its face can be safely intersected in a thread
2062 bool FaceGridIntersector::IsThreadSafe(set< const Standard_Transient* >& noSafeTShapes) const
2067 TopLoc_Location loc;
2068 Handle(Geom_Surface) surf = BRep_Tool::Surface( _face, loc );
2069 Handle(Geom_RectangularTrimmedSurface) ts =
2070 Handle(Geom_RectangularTrimmedSurface)::DownCast( surf );
2071 while( !ts.IsNull() ) {
2072 surf = ts->BasisSurface();
2073 ts = Handle(Geom_RectangularTrimmedSurface)::DownCast(surf);
2075 if ( surf->IsKind( STANDARD_TYPE(Geom_BSplineSurface )) ||
2076 surf->IsKind( STANDARD_TYPE(Geom_BezierSurface )))
2077 if ( !noSafeTShapes.insert( _face.TShape().get() ).second )
2081 TopExp_Explorer exp( _face, TopAbs_EDGE );
2082 for ( ; exp.More(); exp.Next() )
2084 bool edgeIsSafe = true;
2085 const TopoDS_Edge& e = TopoDS::Edge( exp.Current() );
2088 Handle(Geom_Curve) c = BRep_Tool::Curve( e, loc, f, l);
2091 Handle(Geom_TrimmedCurve) tc = Handle(Geom_TrimmedCurve)::DownCast(c);
2092 while( !tc.IsNull() ) {
2093 c = tc->BasisCurve();
2094 tc = Handle(Geom_TrimmedCurve)::DownCast(c);
2096 if ( c->IsKind( STANDARD_TYPE(Geom_BSplineCurve )) ||
2097 c->IsKind( STANDARD_TYPE(Geom_BezierCurve )))
2104 Handle(Geom2d_Curve) c2 = BRep_Tool::CurveOnSurface( e, surf, loc, f, l);
2107 Handle(Geom2d_TrimmedCurve) tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
2108 while( !tc.IsNull() ) {
2109 c2 = tc->BasisCurve();
2110 tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
2112 if ( c2->IsKind( STANDARD_TYPE(Geom2d_BSplineCurve )) ||
2113 c2->IsKind( STANDARD_TYPE(Geom2d_BezierCurve )))
2117 if ( !edgeIsSafe && !noSafeTShapes.insert( e.TShape().get() ).second )
2122 //================================================================================
2124 * \brief Creates topology of the hexahedron
2126 Hexahedron::Hexahedron(Grid* grid)
2127 : _grid( grid ), _nbFaceIntNodes(0), _hasTooSmall( false )
2129 _polygons.reserve(100); // to avoid reallocation;
2131 //set nodes shift within grid->_nodes from the node 000
2132 size_t dx = _grid->NodeIndexDX();
2133 size_t dy = _grid->NodeIndexDY();
2134 size_t dz = _grid->NodeIndexDZ();
2136 size_t i100 = i000 + dx;
2137 size_t i010 = i000 + dy;
2138 size_t i110 = i010 + dx;
2139 size_t i001 = i000 + dz;
2140 size_t i101 = i100 + dz;
2141 size_t i011 = i010 + dz;
2142 size_t i111 = i110 + dz;
2143 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V000 )] = i000;
2144 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V100 )] = i100;
2145 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V010 )] = i010;
2146 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V110 )] = i110;
2147 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V001 )] = i001;
2148 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V101 )] = i101;
2149 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V011 )] = i011;
2150 grid->_nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V111 )] = i111;
2152 vector< int > idVec;
2153 // set nodes to links
2154 for ( int linkID = SMESH_Block::ID_Ex00; linkID <= SMESH_Block::ID_E11z; ++linkID )
2156 SMESH_Block::GetEdgeVertexIDs( linkID, idVec );
2157 _Link& link = _hexLinks[ SMESH_Block::ShapeIndex( linkID )];
2158 link._nodes[0] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[0] )];
2159 link._nodes[1] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[1] )];
2162 // set links to faces
2163 int interlace[4] = { 0, 3, 1, 2 }; // to walk by links around a face: { u0, 1v, u1, 0v }
2164 for ( int faceID = SMESH_Block::ID_Fxy0; faceID <= SMESH_Block::ID_F1yz; ++faceID )
2166 _Face& quad = _hexQuads[ SMESH_Block::ShapeIndex( faceID )];
2167 quad._name = (SMESH_Block::TShapeID) faceID;
2169 SMESH_Block::GetFaceEdgesIDs( faceID, idVec );
2170 bool revFace = ( faceID == SMESH_Block::ID_Fxy0 ||
2171 faceID == SMESH_Block::ID_Fx1z ||
2172 faceID == SMESH_Block::ID_F0yz );
2173 quad._links.resize(4);
2174 vector<_OrientedLink>::iterator frwLinkIt = quad._links.begin();
2175 vector<_OrientedLink>::reverse_iterator revLinkIt = quad._links.rbegin();
2176 for ( int i = 0; i < 4; ++i )
2178 bool revLink = revFace;
2179 if ( i > 1 ) // reverse links u1 and v0
2181 _OrientedLink& link = revFace ? *revLinkIt++ : *frwLinkIt++;
2182 link = _OrientedLink( & _hexLinks[ SMESH_Block::ShapeIndex( idVec[interlace[i]] )],
2187 //================================================================================
2189 * \brief Copy constructor
2191 Hexahedron::Hexahedron( const Hexahedron& other, size_t i, size_t j, size_t k, int cellID )
2192 :_grid( other._grid ), _nbFaceIntNodes(0), _i( i ), _j( j ), _k( k ), _hasTooSmall( false )
2194 _polygons.reserve(100); // to avoid reallocation;
2197 for ( int i = 0; i < 12; ++i )
2199 const _Link& srcLink = other._hexLinks[ i ];
2200 _Link& tgtLink = this->_hexLinks[ i ];
2201 tgtLink._nodes[0] = _hexNodes + ( srcLink._nodes[0] - other._hexNodes );
2202 tgtLink._nodes[1] = _hexNodes + ( srcLink._nodes[1] - other._hexNodes );
2205 for ( int i = 0; i < 6; ++i )
2207 const _Face& srcQuad = other._hexQuads[ i ];
2208 _Face& tgtQuad = this->_hexQuads[ i ];
2209 tgtQuad._name = srcQuad._name;
2210 tgtQuad._links.resize(4);
2211 for ( int j = 0; j < 4; ++j )
2213 const _OrientedLink& srcLink = srcQuad._links[ j ];
2214 _OrientedLink& tgtLink = tgtQuad._links[ j ];
2215 tgtLink._reverse = srcLink._reverse;
2216 tgtLink._link = _hexLinks + ( srcLink._link - other._hexLinks );
2222 (void)cellID; // unused in release mode
2226 //================================================================================
2228 * \brief Return IDs of SOLIDs interfering with this Hexahedron
2230 size_t Hexahedron::getSolids( TGeomID ids[] )
2232 if ( _grid->_geometry.IsOneSolid() )
2234 ids[0] = _grid->GetSolid()->ID();
2237 // count intersection points belonging to each SOLID
2239 id2NbPoints.reserve( 3 );
2241 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
2242 for ( int iN = 0; iN < 8; ++iN )
2244 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _grid->_nodeShift[iN] ];
2245 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _grid->_nodeShift[iN] ];
2247 if ( _hexNodes[iN]._intPoint ) // intersection with a FACE
2249 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2251 const vector< TGeomID > & solidIDs =
2252 _grid->GetSolidIDs( _hexNodes[iN]._intPoint->_faceIDs[iF] );
2253 for ( size_t i = 0; i < solidIDs.size(); ++i )
2254 insertAndIncrement( solidIDs[i], id2NbPoints );
2257 else if ( _hexNodes[iN]._node ) // node inside a SOLID
2259 insertAndIncrement( _hexNodes[iN]._node->GetShapeID(), id2NbPoints );
2263 for ( int iL = 0; iL < 12; ++iL )
2265 const _Link& link = _hexLinks[ iL ];
2266 for ( size_t iP = 0; iP < link._fIntPoints.size(); ++iP )
2268 for ( size_t iF = 0; iF < link._fIntPoints[iP]->_faceIDs.size(); ++iF )
2270 const vector< TGeomID > & solidIDs =
2271 _grid->GetSolidIDs( link._fIntPoints[iP]->_faceIDs[iF] );
2272 for ( size_t i = 0; i < solidIDs.size(); ++i )
2273 insertAndIncrement( solidIDs[i], id2NbPoints );
2278 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2280 const vector< TGeomID > & solidIDs = _grid->GetSolidIDs( _eIntPoints[iP]->_shapeID );
2281 for ( size_t i = 0; i < solidIDs.size(); ++i )
2282 insertAndIncrement( solidIDs[i], id2NbPoints );
2285 size_t nbSolids = 0;
2286 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2287 if ( id2nb->second >= 3 )
2288 ids[ nbSolids++ ] = id2nb->first;
2293 //================================================================================
2295 * \brief Count cuts by INTERNAL FACEs and set _Node::_isInternalFlags
2297 bool Hexahedron::isCutByInternalFace( IsInternalFlag & maxFlag )
2300 id2NbPoints.reserve( 3 );
2302 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2303 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2305 if ( _grid->IsInternal( _intNodes[iN]._intPoint->_faceIDs[iF]))
2306 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2308 for ( size_t iN = 0; iN < 8; ++iN )
2309 if ( _hexNodes[iN]._intPoint )
2310 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2312 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
2313 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2316 maxFlag = IS_NOT_INTERNAL;
2317 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2319 TGeomID intFace = id2nb->first;
2320 IsInternalFlag intFlag = ( id2nb->second >= 3 ? IS_CUT_BY_INTERNAL_FACE : IS_INTERNAL );
2321 if ( intFlag > maxFlag )
2324 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2325 if ( _intNodes[iN].IsOnFace( intFace ))
2326 _intNodes[iN].SetInternal( intFlag );
2328 for ( size_t iN = 0; iN < 8; ++iN )
2329 if ( _hexNodes[iN].IsOnFace( intFace ))
2330 _hexNodes[iN].SetInternal( intFlag );
2336 //================================================================================
2338 * \brief Return any FACE interfering with this Hexahedron
2340 TGeomID Hexahedron::getAnyFace() const
2343 id2NbPoints.reserve( 3 );
2345 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2346 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2347 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2349 for ( size_t iN = 0; iN < 8; ++iN )
2350 if ( _hexNodes[iN]._intPoint )
2351 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2352 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2354 for ( unsigned int minNb = 3; minNb > 0; --minNb )
2355 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2356 if ( id2nb->second >= minNb )
2357 return id2nb->first;
2362 //================================================================================
2364 * \brief Initializes IJK by Hexahedron index
2366 void Hexahedron::setIJK( size_t iCell )
2368 size_t iNbCell = _grid->_coords[0].size() - 1;
2369 size_t jNbCell = _grid->_coords[1].size() - 1;
2370 _i = iCell % iNbCell;
2371 _j = ( iCell % ( iNbCell * jNbCell )) / iNbCell;
2372 _k = iCell / iNbCell / jNbCell;
2375 //================================================================================
2377 * \brief Initializes its data by given grid cell (countered from zero)
2379 void Hexahedron::init( size_t iCell )
2385 //================================================================================
2387 * \brief Initializes its data by given grid cell nodes and intersections
2389 void Hexahedron::init( size_t i, size_t j, size_t k, const Solid* solid )
2391 _i = i; _j = j; _k = k;
2394 solid = _grid->GetSolid();
2396 // set nodes of grid to nodes of the hexahedron and
2397 // count nodes at hexahedron corners located IN and ON geometry
2398 _nbCornerNodes = _nbBndNodes = 0;
2399 _origNodeInd = _grid->NodeIndex( i,j,k );
2400 for ( int iN = 0; iN < 8; ++iN )
2402 _hexNodes[iN]._isInternalFlags = 0;
2404 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _grid->_nodeShift[iN] ];
2405 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _grid->_nodeShift[iN] ];
2407 if ( _hexNodes[iN]._node && !solid->Contains( _hexNodes[iN]._node->GetShapeID() ))
2408 _hexNodes[iN]._node = 0;
2409 if ( _hexNodes[iN]._intPoint && !solid->ContainsAny( _hexNodes[iN]._intPoint->_faceIDs ))
2410 _hexNodes[iN]._intPoint = 0;
2412 _nbCornerNodes += bool( _hexNodes[iN]._node );
2413 _nbBndNodes += bool( _hexNodes[iN]._intPoint );
2415 _sideLength[0] = _grid->_coords[0][i+1] - _grid->_coords[0][i];
2416 _sideLength[1] = _grid->_coords[1][j+1] - _grid->_coords[1][j];
2417 _sideLength[2] = _grid->_coords[2][k+1] - _grid->_coords[2][k];
2422 if ( _nbFaceIntNodes + _eIntPoints.size() > 0 &&
2423 _nbFaceIntNodes + _eIntPoints.size() + _nbCornerNodes > 3)
2425 _intNodes.reserve( 3 * _nbBndNodes + _nbFaceIntNodes + _eIntPoints.size() );
2427 // this method can be called in parallel, so use own helper
2428 SMESH_MesherHelper helper( *_grid->_helper->GetMesh() );
2430 // Create sub-links (_Link::_splits) by splitting links with _Link::_fIntPoints
2431 // ---------------------------------------------------------------
2433 for ( int iLink = 0; iLink < 12; ++iLink )
2435 _Link& link = _hexLinks[ iLink ];
2436 link._fIntNodes.clear();
2437 link._fIntNodes.reserve( link._fIntPoints.size() );
2438 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
2439 if ( solid->ContainsAny( link._fIntPoints[i]->_faceIDs ))
2441 _intNodes.push_back( _Node( 0, link._fIntPoints[i] ));
2442 link._fIntNodes.push_back( & _intNodes.back() );
2445 link._splits.clear();
2446 split._nodes[ 0 ] = link._nodes[0];
2447 bool isOut = ( ! link._nodes[0]->Node() );
2448 bool checkTransition;
2449 for ( size_t i = 0; i < link._fIntNodes.size(); ++i )
2451 const bool isGridNode = ( ! link._fIntNodes[i]->Node() );
2452 if ( !isGridNode ) // intersection non-coincident with a grid node
2454 if ( split._nodes[ 0 ]->Node() && !isOut )
2456 split._nodes[ 1 ] = link._fIntNodes[i];
2457 link._splits.push_back( split );
2459 split._nodes[ 0 ] = link._fIntNodes[i];
2460 checkTransition = true;
2462 else // FACE intersection coincident with a grid node (at link ends)
2464 checkTransition = ( i == 0 && link._nodes[0]->Node() );
2466 if ( checkTransition )
2468 const vector< TGeomID >& faceIDs = link._fIntNodes[i]->_intPoint->_faceIDs;
2469 if ( _grid->IsInternal( faceIDs.back() ))
2471 else if ( faceIDs.size() > 1 || _eIntPoints.size() > 0 )
2472 isOut = isOutPoint( link, i, helper, solid );
2475 bool okTransi = _grid->IsCorrectTransition( faceIDs[0], solid );
2476 switch ( link._fIntNodes[i]->FaceIntPnt()->_transition ) {
2477 case Trans_OUT: isOut = okTransi; break;
2478 case Trans_IN : isOut = !okTransi; break;
2480 isOut = isOutPoint( link, i, helper, solid );
2485 if ( link._nodes[ 1 ]->Node() && split._nodes[ 0 ]->Node() && !isOut )
2487 split._nodes[ 1 ] = link._nodes[1];
2488 link._splits.push_back( split );
2492 // Create _Node's at intersections with EDGEs.
2493 // --------------------------------------------
2494 // 1) add this->_eIntPoints to _Face::_eIntNodes
2495 // 2) fill _intNodes and _vIntNodes
2497 const double tol2 = _grid->_tol * _grid->_tol;
2498 int facets[3], nbFacets, subEntity;
2500 for ( int iF = 0; iF < 6; ++iF )
2501 _hexQuads[ iF ]._eIntNodes.clear();
2503 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2505 if ( !solid->ContainsAny( _eIntPoints[iP]->_faceIDs ))
2507 nbFacets = getEntity( _eIntPoints[iP], facets, subEntity );
2508 _Node* equalNode = 0;
2509 switch( nbFacets ) {
2510 case 1: // in a _Face
2512 _Face& quad = _hexQuads[ facets[0] - SMESH_Block::ID_FirstF ];
2513 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2515 equalNode->Add( _eIntPoints[ iP ] );
2518 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2519 quad._eIntNodes.push_back( & _intNodes.back() );
2523 case 2: // on a _Link
2525 _Link& link = _hexLinks[ subEntity - SMESH_Block::ID_FirstE ];
2526 if ( link._splits.size() > 0 )
2528 equalNode = findEqualNode( link._fIntNodes, _eIntPoints[ iP ], tol2 );
2530 equalNode->Add( _eIntPoints[ iP ] );
2531 else if ( link._splits.size() == 1 &&
2532 link._splits[0]._nodes[0] &&
2533 link._splits[0]._nodes[1] )
2534 link._splits.clear(); // hex edge is divided by _eIntPoints[iP]
2539 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2540 bool newNodeUsed = false;
2541 for ( int iF = 0; iF < 2; ++iF )
2543 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2544 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2546 equalNode->Add( _eIntPoints[ iP ] );
2549 quad._eIntNodes.push_back( & _intNodes.back() );
2554 _intNodes.pop_back();
2558 case 3: // at a corner
2560 _Node& node = _hexNodes[ subEntity - SMESH_Block::ID_FirstV ];
2561 if ( node.Node() != 0 )
2563 if ( node._intPoint )
2564 node._intPoint->Add( _eIntPoints[ iP ]->_faceIDs, _eIntPoints[ iP ]->_node );
2568 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2569 for ( int iF = 0; iF < 3; ++iF )
2571 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2572 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2574 equalNode->Add( _eIntPoints[ iP ] );
2577 quad._eIntNodes.push_back( & _intNodes.back() );
2583 } // switch( nbFacets )
2585 if ( nbFacets == 0 ||
2586 _grid->ShapeType( _eIntPoints[ iP ]->_shapeID ) == TopAbs_VERTEX )
2588 equalNode = findEqualNode( _vIntNodes, _eIntPoints[ iP ], tol2 );
2590 equalNode->Add( _eIntPoints[ iP ] );
2592 else if ( nbFacets == 0 ) {
2593 if ( _intNodes.empty() || _intNodes.back().EdgeIntPnt() != _eIntPoints[ iP ])
2594 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2595 _vIntNodes.push_back( & _intNodes.back() );
2598 } // loop on _eIntPoints
2601 else if ( 3 < _nbCornerNodes && _nbCornerNodes < 8 ) // _nbFaceIntNodes == 0
2604 // create sub-links (_splits) of whole links
2605 for ( int iLink = 0; iLink < 12; ++iLink )
2607 _Link& link = _hexLinks[ iLink ];
2608 link._splits.clear();
2609 if ( link._nodes[ 0 ]->Node() && link._nodes[ 1 ]->Node() )
2611 split._nodes[ 0 ] = link._nodes[0];
2612 split._nodes[ 1 ] = link._nodes[1];
2613 link._splits.push_back( split );
2619 } // init( _i, _j, _k )
2621 //================================================================================
2623 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2625 void Hexahedron::computeElements( const Solid* solid, int solidIndex )
2629 solid = _grid->GetSolid();
2630 if ( !_grid->_geometry.IsOneSolid() )
2632 TGeomID solidIDs[20];
2633 size_t nbSolids = getSolids( solidIDs );
2636 for ( size_t i = 0; i < nbSolids; ++i )
2638 solid = _grid->GetSolid( solidIDs[i] );
2639 computeElements( solid, i );
2640 if ( !_volumeDefs._nodes.empty() && i < nbSolids - 1 )
2641 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2645 solid = _grid->GetSolid( solidIDs[0] );
2649 init( _i, _j, _k, solid ); // get nodes and intersections from grid nodes and split links
2651 int nbIntersections = _nbFaceIntNodes + _eIntPoints.size();
2652 if ( _nbCornerNodes + nbIntersections < 4 )
2655 if ( _nbBndNodes == _nbCornerNodes && nbIntersections == 0 && isInHole() )
2656 return; // cell is in a hole
2658 IsInternalFlag intFlag = IS_NOT_INTERNAL;
2659 if ( solid->HasInternalFaces() && this->isCutByInternalFace( intFlag ))
2661 for ( _SplitIterator it( _hexLinks ); it.More(); it.Next() )
2663 if ( compute( solid, intFlag ))
2664 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2669 if ( solidIndex >= 0 )
2670 intFlag = IS_CUT_BY_INTERNAL_FACE;
2672 compute( solid, intFlag );
2676 //================================================================================
2678 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2680 bool Hexahedron::compute( const Solid* solid, const IsInternalFlag intFlag )
2683 _polygons.reserve( 20 );
2685 for ( int iN = 0; iN < 8; ++iN )
2686 _hexNodes[iN]._usedInFace = 0;
2688 // Create polygons from quadrangles
2689 // --------------------------------
2691 vector< _OrientedLink > splits;
2692 vector<_Node*> chainNodes;
2693 _Face* coplanarPolyg;
2695 bool hasEdgeIntersections = !_eIntPoints.empty();
2697 for ( int iF = 0; iF < 6; ++iF ) // loop on 6 sides of a hexahedron
2699 _Face& quad = _hexQuads[ iF ] ;
2701 _polygons.resize( _polygons.size() + 1 );
2702 _Face* polygon = &_polygons.back();
2703 polygon->_polyLinks.reserve( 20 );
2704 polygon->_name = quad._name;
2707 for ( int iE = 0; iE < 4; ++iE ) // loop on 4 sides of a quadrangle
2708 for ( int iS = 0; iS < quad._links[ iE ].NbResultLinks(); ++iS )
2709 splits.push_back( quad._links[ iE ].ResultLink( iS ));
2711 // add splits of links to a polygon and add _polyLinks to make
2712 // polygon's boundary closed
2714 int nbSplits = splits.size();
2715 if (( nbSplits == 1 ) &&
2716 ( quad._eIntNodes.empty() ||
2717 splits[0].FirstNode()->IsLinked( splits[0].LastNode()->_intPoint )))
2718 //( quad._eIntNodes.empty() || _nbCornerNodes + nbIntersections > 6 ))
2721 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
2722 if ( quad._eIntNodes[ iP ]->IsUsedInFace( polygon ))
2723 quad._eIntNodes[ iP ]->_usedInFace = 0;
2725 size_t nbUsedEdgeNodes = 0;
2726 _Face* prevPolyg = 0; // polygon previously created from this quad
2728 while ( nbSplits > 0 )
2731 while ( !splits[ iS ] )
2734 if ( !polygon->_links.empty() )
2736 _polygons.resize( _polygons.size() + 1 );
2737 polygon = &_polygons.back();
2738 polygon->_polyLinks.reserve( 20 );
2739 polygon->_name = quad._name;
2741 polygon->_links.push_back( splits[ iS ] );
2742 splits[ iS++ ]._link = 0;
2745 _Node* nFirst = polygon->_links.back().FirstNode();
2746 _Node *n1,*n2 = polygon->_links.back().LastNode();
2747 for ( ; nFirst != n2 && iS < splits.size(); ++iS )
2749 _OrientedLink& split = splits[ iS ];
2750 if ( !split ) continue;
2752 n1 = split.FirstNode();
2755 (( n1->_intPoint->_faceIDs.size() > 1 && isImplementEdges() ) ||
2756 ( n1->_isInternalFlags )))
2758 // n1 is at intersection with EDGE
2759 if ( findChainOnEdge( splits, polygon->_links.back(), split, iS, quad, chainNodes ))
2761 for ( size_t i = 1; i < chainNodes.size(); ++i )
2762 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2763 if ( chainNodes.back() != n1 ) // not a partial cut by INTERNAL FACE
2765 prevPolyg = polygon;
2766 n2 = chainNodes.back();
2771 else if ( n1 != n2 )
2773 // try to connect to intersections with EDGEs
2774 if ( quad._eIntNodes.size() > nbUsedEdgeNodes &&
2775 findChain( n2, n1, quad, chainNodes ))
2777 for ( size_t i = 1; i < chainNodes.size(); ++i )
2779 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i] );
2780 nbUsedEdgeNodes += ( chainNodes[i]->IsUsedInFace( polygon ));
2782 if ( chainNodes.back() != n1 )
2784 n2 = chainNodes.back();
2789 // try to connect to a split ending on the same FACE
2792 _OrientedLink foundSplit;
2793 for ( size_t i = iS; i < splits.size() && !foundSplit; ++i )
2794 if (( foundSplit = splits[ i ]) &&
2795 ( n2->IsLinked( foundSplit.FirstNode()->_intPoint )))
2801 foundSplit._link = 0;
2805 if ( n2 != foundSplit.FirstNode() )
2807 polygon->AddPolyLink( n2, foundSplit.FirstNode() );
2808 n2 = foundSplit.FirstNode();
2814 if ( n2->IsLinked( nFirst->_intPoint ))
2816 polygon->AddPolyLink( n2, n1, prevPolyg );
2819 } // if ( n1 != n2 )
2821 polygon->_links.push_back( split );
2824 n2 = polygon->_links.back().LastNode();
2828 if ( nFirst != n2 ) // close a polygon
2830 if ( !findChain( n2, nFirst, quad, chainNodes ))
2832 if ( !closePolygon( polygon, chainNodes ))
2833 if ( !isImplementEdges() )
2834 chainNodes.push_back( nFirst );
2836 for ( size_t i = 1; i < chainNodes.size(); ++i )
2838 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2839 nbUsedEdgeNodes += bool( chainNodes[i]->IsUsedInFace( polygon ));
2843 if ( polygon->_links.size() < 3 && nbSplits > 0 )
2845 polygon->_polyLinks.clear();
2846 polygon->_links.clear();
2848 } // while ( nbSplits > 0 )
2850 if ( polygon->_links.size() < 3 )
2852 _polygons.pop_back();
2854 } // loop on 6 hexahedron sides
2856 // Create polygons closing holes in a polyhedron
2857 // ----------------------------------------------
2859 // clear _usedInFace
2860 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2861 _intNodes[ iN ]._usedInFace = 0;
2863 // add polygons to their links and mark used nodes
2864 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2866 _Face& polygon = _polygons[ iP ];
2867 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2869 polygon._links[ iL ].AddFace( &polygon );
2870 polygon._links[ iL ].FirstNode()->_usedInFace = &polygon;
2874 vector< _OrientedLink* > freeLinks;
2875 freeLinks.reserve(20);
2876 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2878 _Face& polygon = _polygons[ iP ];
2879 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2880 if ( polygon._links[ iL ].NbFaces() < 2 )
2881 freeLinks.push_back( & polygon._links[ iL ]);
2883 int nbFreeLinks = freeLinks.size();
2884 if ( nbFreeLinks == 1 ) return false;
2886 // put not used intersection nodes to _vIntNodes
2887 int nbVertexNodes = 0; // nb not used vertex nodes
2889 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
2890 nbVertexNodes += ( !_vIntNodes[ iN ]->IsUsedInFace() );
2892 const double tol = 1e-3 * Min( Min( _sideLength[0], _sideLength[1] ), _sideLength[0] );
2893 for ( size_t iN = _nbFaceIntNodes; iN < _intNodes.size(); ++iN )
2895 if ( _intNodes[ iN ].IsUsedInFace() ) continue;
2896 if ( dynamic_cast< const F_IntersectPoint* >( _intNodes[ iN ]._intPoint )) continue;
2898 findEqualNode( _vIntNodes, _intNodes[ iN ].EdgeIntPnt(), tol*tol );
2901 _vIntNodes.push_back( &_intNodes[ iN ]);
2907 set<TGeomID> usedFaceIDs;
2908 vector< TGeomID > faces;
2909 TGeomID curFace = 0;
2910 const size_t nbQuadPolygons = _polygons.size();
2911 E_IntersectPoint ipTmp;
2913 // create polygons by making closed chains of free links
2914 size_t iPolygon = _polygons.size();
2915 while ( nbFreeLinks > 0 )
2917 if ( iPolygon == _polygons.size() )
2919 _polygons.resize( _polygons.size() + 1 );
2920 _polygons[ iPolygon ]._polyLinks.reserve( 20 );
2921 _polygons[ iPolygon ]._links.reserve( 20 );
2923 _Face& polygon = _polygons[ iPolygon ];
2925 _OrientedLink* curLink = 0;
2927 if (( !hasEdgeIntersections ) ||
2928 ( nbFreeLinks < 4 && nbVertexNodes == 0 ))
2930 // get a remaining link to start from
2931 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2932 if (( curLink = freeLinks[ iL ] ))
2933 freeLinks[ iL ] = 0;
2934 polygon._links.push_back( *curLink );
2938 // find all links connected to curLink
2939 curNode = curLink->FirstNode();
2941 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2942 if ( freeLinks[ iL ] && freeLinks[ iL ]->LastNode() == curNode )
2944 curLink = freeLinks[ iL ];
2945 freeLinks[ iL ] = 0;
2947 polygon._links.push_back( *curLink );
2949 } while ( curLink );
2951 else // there are intersections with EDGEs
2953 // get a remaining link to start from, one lying on minimal nb of FACEs
2955 typedef pair< TGeomID, int > TFaceOfLink;
2956 TFaceOfLink faceOfLink( -1, -1 );
2957 TFaceOfLink facesOfLink[3] = { faceOfLink, faceOfLink, faceOfLink };
2958 for ( size_t iL = 0; iL < freeLinks.size(); ++iL )
2959 if ( freeLinks[ iL ] )
2961 faces = freeLinks[ iL ]->GetNotUsedFace( usedFaceIDs );
2962 if ( faces.size() == 1 )
2964 faceOfLink = TFaceOfLink( faces[0], iL );
2965 if ( !freeLinks[ iL ]->HasEdgeNodes() )
2967 facesOfLink[0] = faceOfLink;
2969 else if ( facesOfLink[0].first < 0 )
2971 faceOfLink = TFaceOfLink(( faces.empty() ? -1 : faces[0]), iL );
2972 facesOfLink[ 1 + faces.empty() ] = faceOfLink;
2975 for ( int i = 0; faceOfLink.first < 0 && i < 3; ++i )
2976 faceOfLink = facesOfLink[i];
2978 if ( faceOfLink.first < 0 ) // all faces used
2980 for ( size_t iL = 0; iL < freeLinks.size() && faceOfLink.first < 1; ++iL )
2981 if (( curLink = freeLinks[ iL ]))
2984 curLink->FirstNode()->IsLinked( curLink->LastNode()->_intPoint );
2985 faceOfLink.second = iL;
2987 usedFaceIDs.clear();
2989 curFace = faceOfLink.first;
2990 curLink = freeLinks[ faceOfLink.second ];
2991 freeLinks[ faceOfLink.second ] = 0;
2993 usedFaceIDs.insert( curFace );
2994 polygon._links.push_back( *curLink );
2997 // find all links lying on a curFace
3000 // go forward from curLink
3001 curNode = curLink->LastNode();
3003 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
3004 if ( freeLinks[ iL ] &&
3005 freeLinks[ iL ]->FirstNode() == curNode &&
3006 freeLinks[ iL ]->LastNode()->IsOnFace( curFace ))
3008 curLink = freeLinks[ iL ];
3009 freeLinks[ iL ] = 0;
3010 polygon._links.push_back( *curLink );
3013 } while ( curLink );
3015 std::reverse( polygon._links.begin(), polygon._links.end() );
3017 curLink = & polygon._links.back();
3020 // go backward from curLink
3021 curNode = curLink->FirstNode();
3023 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
3024 if ( freeLinks[ iL ] &&
3025 freeLinks[ iL ]->LastNode() == curNode &&
3026 freeLinks[ iL ]->FirstNode()->IsOnFace( curFace ))
3028 curLink = freeLinks[ iL ];
3029 freeLinks[ iL ] = 0;
3030 polygon._links.push_back( *curLink );
3033 } while ( curLink );
3035 curNode = polygon._links.back().FirstNode();
3037 if ( polygon._links[0].LastNode() != curNode )
3039 if ( nbVertexNodes > 0 )
3041 // add links with _vIntNodes if not already used
3043 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
3044 if ( !_vIntNodes[ iN ]->IsUsedInFace() &&
3045 _vIntNodes[ iN ]->IsOnFace( curFace ))
3047 _vIntNodes[ iN ]->_usedInFace = &polygon;
3048 chainNodes.push_back( _vIntNodes[ iN ] );
3050 if ( chainNodes.size() > 1 &&
3051 curFace != _grid->PseudoIntExtFaceID() ) /////// TODO
3053 sortVertexNodes( chainNodes, curNode, curFace );
3055 for ( size_t i = 0; i < chainNodes.size(); ++i )
3057 polygon.AddPolyLink( chainNodes[ i ], curNode );
3058 curNode = chainNodes[ i ];
3059 freeLinks.push_back( &polygon._links.back() );
3062 nbVertexNodes -= chainNodes.size();
3064 // if ( polygon._links.size() > 1 )
3066 polygon.AddPolyLink( polygon._links[0].LastNode(), curNode );
3067 freeLinks.push_back( &polygon._links.back() );
3071 } // if there are intersections with EDGEs
3073 if ( polygon._links.size() < 2 ||
3074 polygon._links[0].LastNode() != polygon._links.back().FirstNode() )
3075 return false; // closed polygon not found -> invalid polyhedron
3077 if ( polygon._links.size() == 2 )
3079 if ( freeLinks.back() == &polygon._links.back() )
3081 freeLinks.pop_back();
3084 if ( polygon._links.front().NbFaces() > 0 )
3085 polygon._links.back().AddFace( polygon._links.front()._link->_faces[0] );
3086 if ( polygon._links.back().NbFaces() > 0 )
3087 polygon._links.front().AddFace( polygon._links.back()._link->_faces[0] );
3089 if ( iPolygon == _polygons.size()-1 )
3090 _polygons.pop_back();
3092 else // polygon._links.size() >= 2
3094 // add polygon to its links
3095 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3097 polygon._links[ iL ].AddFace( &polygon );
3098 polygon._links[ iL ].Reverse();
3100 if ( /*hasEdgeIntersections &&*/ iPolygon == _polygons.size() - 1 )
3102 // check that a polygon does not lie on a hexa side
3104 for ( size_t iL = 0; iL < polygon._links.size() && !coplanarPolyg; ++iL )
3106 if ( polygon._links[ iL ].NbFaces() < 2 )
3107 continue; // it's a just added free link
3108 // look for a polygon made on a hexa side and sharing
3109 // two or more haxa links
3111 coplanarPolyg = polygon._links[ iL ]._link->_faces[0];
3112 for ( iL2 = iL + 1; iL2 < polygon._links.size(); ++iL2 )
3113 if ( polygon._links[ iL2 ]._link->_faces[0] == coplanarPolyg &&
3114 !coplanarPolyg->IsPolyLink( polygon._links[ iL ]) &&
3115 !coplanarPolyg->IsPolyLink( polygon._links[ iL2 ]) &&
3116 coplanarPolyg < & _polygons[ nbQuadPolygons ])
3118 if ( iL2 == polygon._links.size() )
3121 if ( coplanarPolyg ) // coplanar polygon found
3123 freeLinks.resize( freeLinks.size() - polygon._polyLinks.size() );
3124 nbFreeLinks -= polygon._polyLinks.size();
3126 // an E_IntersectPoint used to mark nodes of coplanarPolyg
3127 // as lying on curFace while they are not at intersection with geometry
3128 ipTmp._faceIDs.resize(1);
3129 ipTmp._faceIDs[0] = curFace;
3131 // fill freeLinks with links not shared by coplanarPolyg and polygon
3132 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3133 if ( polygon._links[ iL ]._link->_faces[1] &&
3134 polygon._links[ iL ]._link->_faces[0] != coplanarPolyg )
3136 _Face* p = polygon._links[ iL ]._link->_faces[0];
3137 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3138 if ( p->_links[ iL2 ]._link == polygon._links[ iL ]._link )
3140 freeLinks.push_back( & p->_links[ iL2 ] );
3142 freeLinks.back()->RemoveFace( &polygon );
3146 for ( size_t iL = 0; iL < coplanarPolyg->_links.size(); ++iL )
3147 if ( coplanarPolyg->_links[ iL ]._link->_faces[1] &&
3148 coplanarPolyg->_links[ iL ]._link->_faces[1] != &polygon )
3150 _Face* p = coplanarPolyg->_links[ iL ]._link->_faces[0];
3151 if ( p == coplanarPolyg )
3152 p = coplanarPolyg->_links[ iL ]._link->_faces[1];
3153 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3154 if ( p->_links[ iL2 ]._link == coplanarPolyg->_links[ iL ]._link )
3156 // set links of coplanarPolyg in place of used freeLinks
3157 // to re-create coplanarPolyg next
3159 for ( ; iL3 < freeLinks.size() && freeLinks[ iL3 ]; ++iL3 );
3160 if ( iL3 < freeLinks.size() )
3161 freeLinks[ iL3 ] = ( & p->_links[ iL2 ] );
3163 freeLinks.push_back( & p->_links[ iL2 ] );
3165 freeLinks[ iL3 ]->RemoveFace( coplanarPolyg );
3166 // mark nodes of coplanarPolyg as lying on curFace
3167 for ( int iN = 0; iN < 2; ++iN )
3169 _Node* n = freeLinks[ iL3 ]->_link->_nodes[ iN ];
3170 if ( n->_intPoint ) n->_intPoint->Add( ipTmp._faceIDs );
3171 else n->_intPoint = &ipTmp;
3176 // set coplanarPolyg to be re-created next
3177 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
3178 if ( coplanarPolyg == & _polygons[ iP ] )
3181 _polygons[ iPolygon ]._links.clear();
3182 _polygons[ iPolygon ]._polyLinks.clear();
3185 _polygons.pop_back();
3186 usedFaceIDs.erase( curFace );
3188 } // if ( coplanarPolyg )
3189 } // if ( hasEdgeIntersections ) - search for coplanarPolyg
3191 iPolygon = _polygons.size();
3193 } // end of case ( polygon._links.size() > 2 )
3194 } // while ( nbFreeLinks > 0 )
3196 // check volume size
3197 _hasTooSmall = ! checkPolyhedronSize( intFlag & IS_CUT_BY_INTERNAL_FACE );
3199 for ( size_t i = 0; i < 8; ++i )
3200 if ( _hexNodes[ i ]._intPoint == &ipTmp )
3201 _hexNodes[ i ]._intPoint = 0;
3204 return false; // too small volume
3207 // Try to find out names of no-name polygons (issue # 19887)
3208 if ( _grid->IsToRemoveExcessEntities() && _polygons.back()._name == SMESH_Block::ID_NONE )
3211 0.5 * ( _grid->_coords[0][_i] + _grid->_coords[0][_i+1] ) * _grid->_axes[0] +
3212 0.5 * ( _grid->_coords[1][_j] + _grid->_coords[1][_j+1] ) * _grid->_axes[1] +
3213 0.5 * ( _grid->_coords[2][_k] + _grid->_coords[2][_k+1] ) * _grid->_axes[2];
3214 for ( size_t i = _polygons.size() - 1; _polygons[i]._name == SMESH_Block::ID_NONE; --i )
3216 _Face& face = _polygons[ i ];
3219 for ( size_t iL = 0; iL < face._links.size(); ++iL )
3221 _Node* n = face._links[ iL ].FirstNode();
3222 gp_XYZ p = SMESH_NodeXYZ( n->Node() );
3223 _grid->ComputeUVW( p, uvw.ChangeCoord().ChangeData() );
3226 gp_Pnt pMin = bb.CornerMin();
3227 if ( bb.IsXThin( _grid->_tol ))
3228 face._name = pMin.X() < uvwCenter.X() ? SMESH_Block::ID_F0yz : SMESH_Block::ID_F1yz;
3229 else if ( bb.IsYThin( _grid->_tol ))
3230 face._name = pMin.Y() < uvwCenter.Y() ? SMESH_Block::ID_Fx0z : SMESH_Block::ID_Fx1z;
3231 else if ( bb.IsZThin( _grid->_tol ))
3232 face._name = pMin.Z() < uvwCenter.Z() ? SMESH_Block::ID_Fxy0 : SMESH_Block::ID_Fxy1;
3236 _volumeDefs._nodes.clear();
3237 _volumeDefs._quantities.clear();
3238 _volumeDefs._names.clear();
3240 // create a classic cell if possible
3243 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3244 nbPolygons += (_polygons[ iF ]._links.size() > 0 );
3246 //const int nbNodes = _nbCornerNodes + nbIntersections;
3248 for ( size_t i = 0; i < 8; ++i )
3249 nbNodes += _hexNodes[ i ].IsUsedInFace();
3250 for ( size_t i = 0; i < _intNodes.size(); ++i )
3251 nbNodes += _intNodes[ i ].IsUsedInFace();
3253 bool isClassicElem = false;
3254 if ( nbNodes == 8 && nbPolygons == 6 ) isClassicElem = addHexa();
3255 else if ( nbNodes == 4 && nbPolygons == 4 ) isClassicElem = addTetra();
3256 else if ( nbNodes == 6 && nbPolygons == 5 ) isClassicElem = addPenta();
3257 else if ( nbNodes == 5 && nbPolygons == 5 ) isClassicElem = addPyra ();
3258 if ( !isClassicElem )
3260 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3262 const size_t nbLinks = _polygons[ iF ]._links.size();
3263 if ( nbLinks == 0 ) continue;
3264 _volumeDefs._quantities.push_back( nbLinks );
3265 _volumeDefs._names.push_back( _polygons[ iF ]._name );
3266 for ( size_t iL = 0; iL < nbLinks; ++iL )
3267 _volumeDefs._nodes.push_back( _polygons[ iF ]._links[ iL ].FirstNode() );
3270 _volumeDefs._solidID = solid->ID();
3272 return !_volumeDefs._nodes.empty();
3274 //================================================================================
3276 * \brief Create elements in the mesh
3278 int Hexahedron::MakeElements(SMESH_MesherHelper& helper,
3279 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3281 SMESHDS_Mesh* mesh = helper.GetMeshDS();
3283 CellsAroundLink c( _grid, 0 );
3284 const size_t nbGridCells = c._nbCells[0] * c._nbCells[1] * c._nbCells[2];
3285 vector< Hexahedron* > allHexa( nbGridCells, 0 );
3288 // set intersection nodes from GridLine's to links of allHexa
3289 int i,j,k, cellIndex, iLink;
3290 for ( int iDir = 0; iDir < 3; ++iDir )
3292 // loop on GridLine's parallel to iDir
3293 LineIndexer lineInd = _grid->GetLineIndexer( iDir );
3294 CellsAroundLink fourCells( _grid, iDir );
3295 for ( ; lineInd.More(); ++lineInd )
3297 GridLine& line = _grid->_lines[ iDir ][ lineInd.LineIndex() ];
3298 multiset< F_IntersectPoint >::const_iterator ip = line._intPoints.begin();
3299 for ( ; ip != line._intPoints.end(); ++ip )
3301 // if ( !ip->_node ) continue; // intersection at a grid node
3302 lineInd.SetIndexOnLine( ip->_indexOnLine );
3303 fourCells.Init( lineInd.I(), lineInd.J(), lineInd.K() );
3304 for ( int iL = 0; iL < 4; ++iL ) // loop on 4 cells sharing a link
3306 if ( !fourCells.GetCell( iL, i,j,k, cellIndex, iLink ))
3308 Hexahedron *& hex = allHexa[ cellIndex ];
3311 hex = new Hexahedron( *this, i, j, k, cellIndex );
3314 hex->_hexLinks[iLink]._fIntPoints.push_back( &(*ip) );
3315 hex->_nbFaceIntNodes += bool( ip->_node );
3321 // implement geom edges into the mesh
3322 addEdges( helper, allHexa, edge2faceIDsMap );
3324 // add not split hexahedra to the mesh
3326 TGeomID solidIDs[20];
3327 vector< Hexahedron* > intHexa; intHexa.reserve( nbIntHex );
3328 vector< const SMDS_MeshElement* > boundaryVolumes; boundaryVolumes.reserve( nbIntHex * 1.1 );
3329 for ( size_t i = 0; i < allHexa.size(); ++i )
3331 // initialize this by not cut allHexa[ i ]
3332 Hexahedron * & hex = allHexa[ i ];
3333 if ( hex ) // split hexahedron
3335 intHexa.push_back( hex );
3336 if ( hex->_nbFaceIntNodes > 0 || hex->_eIntPoints.size() > 0 )
3337 continue; // treat intersected hex later in parallel
3338 this->init( hex->_i, hex->_j, hex->_k );
3342 this->init( i ); // == init(i,j,k)
3344 if (( _nbCornerNodes == 8 ) &&
3345 ( _nbBndNodes < _nbCornerNodes || !isInHole() ))
3347 // order of _hexNodes is defined by enum SMESH_Block::TShapeID
3348 SMDS_MeshElement* el =
3349 mesh->AddVolume( _hexNodes[0].Node(), _hexNodes[2].Node(),
3350 _hexNodes[3].Node(), _hexNodes[1].Node(),
3351 _hexNodes[4].Node(), _hexNodes[6].Node(),
3352 _hexNodes[7].Node(), _hexNodes[5].Node() );
3353 TGeomID solidID = 0;
3354 if ( _nbBndNodes < _nbCornerNodes )
3356 for ( int iN = 0; iN < 8 && !solidID; ++iN )
3357 if ( !_hexNodes[iN]._intPoint ) // no intersection
3358 solidID = _hexNodes[iN].Node()->GetShapeID();
3362 getSolids( solidIDs );
3363 solidID = solidIDs[0];
3365 mesh->SetMeshElementOnShape( el, solidID );
3369 if ( _grid->_toCreateFaces && _nbBndNodes >= 3 )
3371 boundaryVolumes.push_back( el );
3372 el->setIsMarked( true );
3375 else if ( _nbCornerNodes > 3 && !hex )
3377 // all intersection of hex with geometry are at grid nodes
3378 hex = new Hexahedron( *this, _i, _j, _k, i );
3379 intHexa.push_back( hex );
3383 // compute definitions of volumes resulted from hexadron intersection
3385 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, intHexa.size() ),
3386 ParallelHexahedron( intHexa ),
3387 tbb::simple_partitioner()); // computeElements() is called here
3389 for ( size_t i = 0; i < intHexa.size(); ++i )
3390 if ( Hexahedron * hex = intHexa[ i ] )
3391 hex->computeElements();
3394 // simplify polyhedrons
3395 if ( _grid->IsToRemoveExcessEntities() )
3397 for ( size_t i = 0; i < intHexa.size(); ++i )
3398 if ( Hexahedron * hex = intHexa[ i ] )
3399 hex->removeExcessSideDivision( allHexa );
3401 for ( size_t i = 0; i < intHexa.size(); ++i )
3402 if ( Hexahedron * hex = intHexa[ i ] )
3403 hex->removeExcessNodes( allHexa );
3407 for ( size_t i = 0; i < intHexa.size(); ++i )
3408 if ( Hexahedron * hex = intHexa[ i ] )
3409 nbAdded += hex->addVolumes( helper );
3411 // fill boundaryVolumes with volumes neighboring too small skipped volumes
3412 if ( _grid->_toCreateFaces )
3414 for ( size_t i = 0; i < intHexa.size(); ++i )
3415 if ( Hexahedron * hex = intHexa[ i ] )
3416 hex->getBoundaryElems( boundaryVolumes );
3419 // create boundary mesh faces
3420 addFaces( helper, boundaryVolumes );
3422 // create mesh edges
3423 addSegments( helper, edge2faceIDsMap );
3425 for ( size_t i = 0; i < allHexa.size(); ++i )
3427 delete allHexa[ i ];
3432 //================================================================================
3434 * \brief Implements geom edges into the mesh
3436 void Hexahedron::addEdges(SMESH_MesherHelper& helper,
3437 vector< Hexahedron* >& hexes,
3438 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3440 if ( edge2faceIDsMap.empty() ) return;
3442 // Prepare planes for intersecting with EDGEs
3445 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ ) // iDirZ gives normal direction to planes
3447 GridPlanes& planes = pln[ iDirZ ];
3448 int iDirX = ( iDirZ + 1 ) % 3;
3449 int iDirY = ( iDirZ + 2 ) % 3;
3450 planes._zNorm = ( _grid->_axes[ iDirX ] ^ _grid->_axes[ iDirY ] ).Normalized();
3451 planes._zProjs.resize ( _grid->_coords[ iDirZ ].size() );
3452 planes._zProjs [0] = 0;
3453 const double zFactor = _grid->_axes[ iDirZ ] * planes._zNorm;
3454 const vector< double > & u = _grid->_coords[ iDirZ ];
3455 for ( size_t i = 1; i < planes._zProjs.size(); ++i )
3457 planes._zProjs [i] = zFactor * ( u[i] - u[0] );
3461 const double deflection = _grid->_minCellSize / 20.;
3462 const double tol = _grid->_tol;
3463 E_IntersectPoint ip;
3465 TColStd_MapOfInteger intEdgeIDs; // IDs of not shared INTERNAL EDGES
3467 // Intersect EDGEs with the planes
3468 map< TGeomID, vector< TGeomID > >::const_iterator e2fIt = edge2faceIDsMap.begin();
3469 for ( ; e2fIt != edge2faceIDsMap.end(); ++e2fIt )
3471 const TGeomID edgeID = e2fIt->first;
3472 const TopoDS_Edge & E = TopoDS::Edge( _grid->Shape( edgeID ));
3473 BRepAdaptor_Curve curve( E );
3474 TopoDS_Vertex v1 = helper.IthVertex( 0, E, false );
3475 TopoDS_Vertex v2 = helper.IthVertex( 1, E, false );
3477 ip._faceIDs = e2fIt->second;
3478 ip._shapeID = edgeID;
3480 bool isInternal = ( ip._faceIDs.size() == 1 && _grid->IsInternal( edgeID ));
3483 intEdgeIDs.Add( edgeID );
3484 intEdgeIDs.Add( _grid->ShapeID( v1 ));
3485 intEdgeIDs.Add( _grid->ShapeID( v2 ));
3488 // discretize the EDGE
3489 GCPnts_UniformDeflection discret( curve, deflection, true );
3490 if ( !discret.IsDone() || discret.NbPoints() < 2 )
3493 // perform intersection
3494 E_IntersectPoint* eip, *vip = 0; // todo: vip must be explicitly initialized to avoid warning (see below)
3495 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ )
3497 GridPlanes& planes = pln[ iDirZ ];
3498 int iDirX = ( iDirZ + 1 ) % 3;
3499 int iDirY = ( iDirZ + 2 ) % 3;
3500 double xLen = _grid->_coords[ iDirX ].back() - _grid->_coords[ iDirX ][0];
3501 double yLen = _grid->_coords[ iDirY ].back() - _grid->_coords[ iDirY ][0];
3502 double zLen = _grid->_coords[ iDirZ ].back() - _grid->_coords[ iDirZ ][0];
3503 int dIJK[3], d000[3] = { 0,0,0 };
3504 double o[3] = { _grid->_coords[0][0],
3505 _grid->_coords[1][0],
3506 _grid->_coords[2][0] };
3508 // locate the 1st point of a segment within the grid
3509 gp_XYZ p1 = discret.Value( 1 ).XYZ();
3510 double u1 = discret.Parameter( 1 );
3511 double zProj1 = planes._zNorm * ( p1 - _grid->_origin );
3513 _grid->ComputeUVW( p1, ip._uvw );
3514 int iX1 = int(( ip._uvw[iDirX] - o[iDirX]) / xLen * (_grid->_coords[ iDirX ].size() - 1));
3515 int iY1 = int(( ip._uvw[iDirY] - o[iDirY]) / yLen * (_grid->_coords[ iDirY ].size() - 1));
3516 int iZ1 = int(( ip._uvw[iDirZ] - o[iDirZ]) / zLen * (_grid->_coords[ iDirZ ].size() - 1));
3517 locateValue( iX1, ip._uvw[iDirX], _grid->_coords[ iDirX ], dIJK[ iDirX ], tol );
3518 locateValue( iY1, ip._uvw[iDirY], _grid->_coords[ iDirY ], dIJK[ iDirY ], tol );
3519 locateValue( iZ1, ip._uvw[iDirZ], _grid->_coords[ iDirZ ], dIJK[ iDirZ ], tol );
3521 int ijk[3]; // grid index where a segment intersects a plane
3526 // add the 1st vertex point to a hexahedron
3530 ip._shapeID = _grid->ShapeID( v1 );
3531 vip = _grid->Add( ip );
3533 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3534 if ( !addIntersection( vip, hexes, ijk, d000 ))
3535 _grid->Remove( vip );
3536 ip._shapeID = edgeID;
3538 for ( int iP = 2; iP <= discret.NbPoints(); ++iP )
3540 // locate the 2nd point of a segment within the grid
3541 gp_XYZ p2 = discret.Value( iP ).XYZ();
3542 double u2 = discret.Parameter( iP );
3543 double zProj2 = planes._zNorm * ( p2 - _grid->_origin );
3545 if ( Abs( zProj2 - zProj1 ) > std::numeric_limits<double>::min() )
3547 locateValue( iZ2, zProj2, planes._zProjs, dIJK[ iDirZ ], tol );
3549 // treat intersections with planes between 2 end points of a segment
3550 int dZ = ( iZ1 <= iZ2 ) ? +1 : -1;
3551 int iZ = iZ1 + ( iZ1 < iZ2 );
3552 for ( int i = 0, nb = Abs( iZ1 - iZ2 ); i < nb; ++i, iZ += dZ )
3554 ip._point = findIntPoint( u1, zProj1, u2, zProj2,
3555 planes._zProjs[ iZ ],
3556 curve, planes._zNorm, _grid->_origin );
3557 _grid->ComputeUVW( ip._point.XYZ(), ip._uvw );
3558 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3559 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3562 // add ip to hex "above" the plane
3563 eip = _grid->Add( ip );
3565 eip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3567 bool added = addIntersection( eip, hexes, ijk, dIJK);
3569 // add ip to hex "below" the plane
3570 ijk[ iDirZ ] = iZ-1;
3571 if ( !addIntersection( eip, hexes, ijk, dIJK ) &&
3573 _grid->Remove( eip );
3581 // add the 2nd vertex point to a hexahedron
3585 ip._shapeID = _grid->ShapeID( v2 );
3586 _grid->ComputeUVW( p1, ip._uvw );
3587 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3588 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3590 bool sameV = ( v1.IsSame( v2 ));
3592 vip = _grid->Add( ip );
3593 if ( isInternal && !sameV )
3594 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3595 if ( !addIntersection( vip, hexes, ijk, d000 ) && !sameV ) // todo: vip must be explicitly initialized to avoid warning (see above)
3596 _grid->Remove( vip );
3597 ip._shapeID = edgeID;
3599 } // loop on 3 grid directions
3603 if ( intEdgeIDs.Size() > 0 )
3604 cutByExtendedInternal( hexes, intEdgeIDs );
3609 //================================================================================
3611 * \brief Fully cut hexes that are partially cut by INTERNAL FACE.
3612 * Cut them by extended INTERNAL FACE.
3614 void Hexahedron::cutByExtendedInternal( std::vector< Hexahedron* >& hexes,
3615 const TColStd_MapOfInteger& intEdgeIDs )
3617 IntAna_IntConicQuad intersection;
3618 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
3619 const double tol2 = _grid->_tol * _grid->_tol;
3621 for ( size_t iH = 0; iH < hexes.size(); ++iH )
3623 Hexahedron* hex = hexes[ iH ];
3624 if ( !hex || hex->_eIntPoints.size() < 2 )
3626 if ( !intEdgeIDs.Contains( hex->_eIntPoints.back()->_shapeID ))
3629 // get 3 points on INTERNAL FACE to construct a cutting plane
3630 gp_Pnt p1 = hex->_eIntPoints[0]->_point;
3631 gp_Pnt p2 = hex->_eIntPoints[1]->_point;
3632 gp_Pnt p3 = hex->mostDistantInternalPnt( iH, p1, p2 );
3634 gp_Vec norm = gp_Vec( p1, p2 ) ^ gp_Vec( p1, p3 );
3637 pln = gp_Pln( p1, norm );
3644 TGeomID intFaceID = hex->_eIntPoints.back()->_faceIDs.front(); // FACE being "extended"
3645 TGeomID solidID = _grid->GetSolid( intFaceID )->ID();
3647 // cut links by the plane
3648 //bool isCut = false;
3649 for ( int iLink = 0; iLink < 12; ++iLink )
3651 _Link& link = hex->_hexLinks[ iLink ];
3652 if ( !link._fIntPoints.empty() )
3654 // if ( link._fIntPoints[0]->_faceIDs.back() == _grid->PseudoIntExtFaceID() )
3656 continue; // already cut link
3658 if ( !link._nodes[0]->Node() ||
3659 !link._nodes[1]->Node() )
3660 continue; // outside link
3662 if ( link._nodes[0]->IsOnFace( intFaceID ))
3664 if ( link._nodes[0]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3665 if ( p1.SquareDistance( link._nodes[0]->Point() ) < tol2 ||
3666 p2.SquareDistance( link._nodes[0]->Point() ) < tol2 )
3667 link._nodes[0]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3668 continue; // link is cut by FACE being "extended"
3670 if ( link._nodes[1]->IsOnFace( intFaceID ))
3672 if ( link._nodes[1]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3673 if ( p1.SquareDistance( link._nodes[1]->Point() ) < tol2 ||
3674 p2.SquareDistance( link._nodes[1]->Point() ) < tol2 )
3675 link._nodes[1]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3676 continue; // link is cut by FACE being "extended"
3678 gp_Pnt p4 = link._nodes[0]->Point();
3679 gp_Pnt p5 = link._nodes[1]->Point();
3680 gp_Lin line( p4, gp_Vec( p4, p5 ));
3682 intersection.Perform( line, pln );
3683 if ( !intersection.IsDone() ||
3684 intersection.IsInQuadric() ||
3685 intersection.IsParallel() ||
3686 intersection.NbPoints() < 1 )
3689 double u = intersection.ParamOnConic(1);
3690 if ( u + _grid->_tol < 0 )
3692 int iDir = iLink / 4;
3693 int index = (&hex->_i)[iDir];
3694 double linkLen = _grid->_coords[iDir][index+1] - _grid->_coords[iDir][index];
3695 if ( u - _grid->_tol > linkLen )
3698 if ( u < _grid->_tol ||
3699 u > linkLen - _grid->_tol ) // intersection at grid node
3701 int i = ! ( u < _grid->_tol ); // [0,1]
3702 int iN = link._nodes[ i ] - hex->_hexNodes; // [0-7]
3704 const F_IntersectPoint * & ip = _grid->_gridIntP[ hex->_origNodeInd +
3705 _grid->_nodeShift[iN] ];
3708 ip = _grid->_extIntPool.getNew();
3709 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3710 //ip->_transition = Trans_INTERNAL;
3712 else if ( ip->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3714 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3716 hex->_nbFaceIntNodes++;
3721 const gp_Pnt& p = intersection.Point( 1 );
3722 F_IntersectPoint* ip = _grid->_extIntPool.getNew();
3723 ip->_node = meshDS->AddNode( p.X(), p.Y(), p.Z() );
3724 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3725 ip->_transition = Trans_INTERNAL;
3726 meshDS->SetNodeInVolume( ip->_node, solidID );
3728 CellsAroundLink fourCells( _grid, iDir );
3729 fourCells.Init( hex->_i, hex->_j, hex->_k, iLink );
3730 int i,j,k, cellIndex;
3731 for ( int iC = 0; iC < 4; ++iC ) // loop on 4 cells sharing the link
3733 if ( !fourCells.GetCell( iC, i,j,k, cellIndex, iLink ))
3735 Hexahedron * h = hexes[ cellIndex ];
3737 h = hexes[ cellIndex ] = new Hexahedron( *this, i, j, k, cellIndex );
3738 h->_hexLinks[iLink]._fIntPoints.push_back( ip );
3739 h->_nbFaceIntNodes++;
3746 // for ( size_t i = 0; i < hex->_eIntPoints.size(); ++i )
3748 // if ( _grid->IsInternal( hex->_eIntPoints[i]->_shapeID ) &&
3749 // ! hex->_eIntPoints[i]->IsOnFace( _grid->PseudoIntExtFaceID() ))
3750 // hex->_eIntPoints[i]->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3754 } // loop on all hexes
3758 //================================================================================
3760 * \brief Return intersection point on INTERNAL FACE most distant from given ones
3762 gp_Pnt Hexahedron::mostDistantInternalPnt( int hexIndex, const gp_Pnt& p1, const gp_Pnt& p2 )
3764 gp_Pnt resultPnt = p1;
3766 double maxDist2 = 0;
3767 for ( int iLink = 0; iLink < 12; ++iLink ) // check links
3769 _Link& link = _hexLinks[ iLink ];
3770 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
3771 if ( _grid->PseudoIntExtFaceID() != link._fIntPoints[i]->_faceIDs[0] &&
3772 _grid->IsInternal( link._fIntPoints[i]->_faceIDs[0] ) &&
3773 link._fIntPoints[i]->_node )
3775 gp_Pnt p = SMESH_NodeXYZ( link._fIntPoints[i]->_node );
3776 double d = p1.SquareDistance( p );
3784 d = p2.SquareDistance( p );
3794 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
3796 for ( size_t iN = 0; iN < 8; ++iN ) // check corners
3798 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _grid->_nodeShift[iN] ];
3799 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _grid->_nodeShift[iN] ];
3800 if ( _hexNodes[iN]._intPoint )
3801 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
3803 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
3805 gp_Pnt p = SMESH_NodeXYZ( _hexNodes[iN]._node );
3806 double d = p1.SquareDistance( p );
3814 d = p2.SquareDistance( p );
3824 if ( maxDist2 < _grid->_tol * _grid->_tol )
3830 //================================================================================
3832 * \brief Finds intersection of a curve with a plane
3833 * \param [in] u1 - parameter of one curve point
3834 * \param [in] proj1 - projection of the curve point to the plane normal
3835 * \param [in] u2 - parameter of another curve point
3836 * \param [in] proj2 - projection of the other curve point to the plane normal
3837 * \param [in] proj - projection of a point where the curve intersects the plane
3838 * \param [in] curve - the curve
3839 * \param [in] axis - the plane normal
3840 * \param [in] origin - the plane origin
3841 * \return gp_Pnt - the found intersection point
3843 gp_Pnt Hexahedron::findIntPoint( double u1, double proj1,
3844 double u2, double proj2,
3846 BRepAdaptor_Curve& curve,
3848 const gp_XYZ& origin)
3850 double r = (( proj - proj1 ) / ( proj2 - proj1 ));
3851 double u = u1 * ( 1 - r ) + u2 * r;
3852 gp_Pnt p = curve.Value( u );
3853 double newProj = axis * ( p.XYZ() - origin );
3854 if ( Abs( proj - newProj ) > _grid->_tol / 10. )
3857 return findIntPoint( u2, proj2, u, newProj, proj, curve, axis, origin );
3859 return findIntPoint( u1, proj2, u, newProj, proj, curve, axis, origin );
3864 //================================================================================
3866 * \brief Returns indices of a hexahedron sub-entities holding a point
3867 * \param [in] ip - intersection point
3868 * \param [out] facets - 0-3 facets holding a point
3869 * \param [out] sub - index of a vertex or an edge holding a point
3870 * \return int - number of facets holding a point
3872 int Hexahedron::getEntity( const E_IntersectPoint* ip, int* facets, int& sub )
3874 enum { X = 1, Y = 2, Z = 4 }; // == 001, 010, 100
3876 int vertex = 0, edgeMask = 0;
3878 if ( Abs( _grid->_coords[0][ _i ] - ip->_uvw[0] ) < _grid->_tol ) {
3879 facets[ nbFacets++ ] = SMESH_Block::ID_F0yz;
3882 else if ( Abs( _grid->_coords[0][ _i+1 ] - ip->_uvw[0] ) < _grid->_tol ) {
3883 facets[ nbFacets++ ] = SMESH_Block::ID_F1yz;
3887 if ( Abs( _grid->_coords[1][ _j ] - ip->_uvw[1] ) < _grid->_tol ) {
3888 facets[ nbFacets++ ] = SMESH_Block::ID_Fx0z;
3891 else if ( Abs( _grid->_coords[1][ _j+1 ] - ip->_uvw[1] ) < _grid->_tol ) {
3892 facets[ nbFacets++ ] = SMESH_Block::ID_Fx1z;
3896 if ( Abs( _grid->_coords[2][ _k ] - ip->_uvw[2] ) < _grid->_tol ) {
3897 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy0;
3900 else if ( Abs( _grid->_coords[2][ _k+1 ] - ip->_uvw[2] ) < _grid->_tol ) {
3901 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy1;
3908 case 0: sub = 0; break;
3909 case 1: sub = facets[0]; break;
3911 const int edge [3][8] = {
3912 { SMESH_Block::ID_E00z, SMESH_Block::ID_E10z,
3913 SMESH_Block::ID_E01z, SMESH_Block::ID_E11z },
3914 { SMESH_Block::ID_E0y0, SMESH_Block::ID_E1y0, 0, 0,
3915 SMESH_Block::ID_E0y1, SMESH_Block::ID_E1y1 },
3916 { SMESH_Block::ID_Ex00, 0, SMESH_Block::ID_Ex10, 0,
3917 SMESH_Block::ID_Ex01, 0, SMESH_Block::ID_Ex11 }
3919 switch ( edgeMask ) {
3920 case X | Y: sub = edge[ 0 ][ vertex ]; break;
3921 case X | Z: sub = edge[ 1 ][ vertex ]; break;
3922 default: sub = edge[ 2 ][ vertex ];
3928 sub = vertex + SMESH_Block::ID_FirstV;
3933 //================================================================================
3935 * \brief Adds intersection with an EDGE
3937 bool Hexahedron::addIntersection( const E_IntersectPoint* ip,
3938 vector< Hexahedron* >& hexes,
3939 int ijk[], int dIJK[] )
3943 size_t hexIndex[4] = {
3944 _grid->CellIndex( ijk[0], ijk[1], ijk[2] ),
3945 dIJK[0] ? _grid->CellIndex( ijk[0]+dIJK[0], ijk[1], ijk[2] ) : -1,
3946 dIJK[1] ? _grid->CellIndex( ijk[0], ijk[1]+dIJK[1], ijk[2] ) : -1,
3947 dIJK[2] ? _grid->CellIndex( ijk[0], ijk[1], ijk[2]+dIJK[2] ) : -1
3949 for ( int i = 0; i < 4; ++i )
3951 if ( hexIndex[i] < hexes.size() && hexes[ hexIndex[i] ] )
3953 Hexahedron* h = hexes[ hexIndex[i] ];
3954 h->_eIntPoints.reserve(2);
3955 h->_eIntPoints.push_back( ip );
3958 // check if ip is really inside the hex
3959 if ( h->isOutParam( ip->_uvw ))
3960 throw SALOME_Exception("ip outside a hex");
3966 //================================================================================
3968 * \brief Finds nodes at a path from one node to another via intersections with EDGEs
3970 bool Hexahedron::findChain( _Node* n1,
3973 vector<_Node*>& chn )
3976 chn.push_back( n1 );
3977 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3978 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3979 n1->IsLinked( quad._eIntNodes[ iP ]->_intPoint ) &&
3980 n2->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3982 chn.push_back( quad._eIntNodes[ iP ]);
3983 chn.push_back( n2 );
3984 quad._eIntNodes[ iP ]->_usedInFace = &quad;
3991 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3992 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3993 chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3995 chn.push_back( quad._eIntNodes[ iP ]);
3996 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
3999 } while ( found && ! chn.back()->IsLinked( n2->_intPoint ) );
4001 if ( chn.back() != n2 && chn.back()->IsLinked( n2->_intPoint ))
4002 chn.push_back( n2 );
4004 return chn.size() > 1;
4006 //================================================================================
4008 * \brief Try to heal a polygon whose ends are not connected
4010 bool Hexahedron::closePolygon( _Face* polygon, vector<_Node*>& chainNodes ) const
4012 int i = -1, nbLinks = polygon->_links.size();
4015 vector< _OrientedLink > newLinks;
4016 // find a node lying on the same FACE as the last one
4017 _Node* node = polygon->_links.back().LastNode();
4018 int avoidFace = node->IsLinked( polygon->_links.back().FirstNode()->_intPoint );
4019 for ( i = nbLinks - 2; i >= 0; --i )
4020 if ( node->IsLinked( polygon->_links[i].FirstNode()->_intPoint, avoidFace ))
4024 for ( ; i < nbLinks; ++i )
4025 newLinks.push_back( polygon->_links[i] );
4029 // find a node lying on the same FACE as the first one
4030 node = polygon->_links[0].FirstNode();
4031 avoidFace = node->IsLinked( polygon->_links[0].LastNode()->_intPoint );
4032 for ( i = 1; i < nbLinks; ++i )
4033 if ( node->IsLinked( polygon->_links[i].LastNode()->_intPoint, avoidFace ))
4036 for ( nbLinks = i + 1, i = 0; i < nbLinks; ++i )
4037 newLinks.push_back( polygon->_links[i] );
4039 if ( newLinks.size() > 1 )
4041 polygon->_links.swap( newLinks );
4043 chainNodes.push_back( polygon->_links.back().LastNode() );
4044 chainNodes.push_back( polygon->_links[0].FirstNode() );
4049 //================================================================================
4051 * \brief Finds nodes on the same EDGE as the first node of avoidSplit.
4053 * This function is for
4054 * 1) a case where an EDGE lies on a quad which lies on a FACE
4055 * so that a part of quad in ON and another part is IN
4056 * 2) INTERNAL FACE passes through the 1st node of avoidSplit
4058 bool Hexahedron::findChainOnEdge( const vector< _OrientedLink >& splits,
4059 const _OrientedLink& prevSplit,
4060 const _OrientedLink& avoidSplit,
4063 vector<_Node*>& chn )
4065 _Node* pn1 = prevSplit.FirstNode();
4066 _Node* pn2 = prevSplit.LastNode();
4067 int avoidFace = pn1->IsLinked( pn2->_intPoint ); // FACE under the quad
4068 if ( avoidFace < 1 && pn1->_intPoint )
4071 _Node* n = 0, *stopNode = avoidSplit.LastNode();
4074 if ( !quad._eIntNodes.empty() ) // connect pn2 with EDGE intersections
4076 chn.push_back( pn2 );
4081 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
4082 if (( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad )) &&
4083 ( chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint, avoidFace )) &&
4084 ( !avoidFace || quad._eIntNodes[ iP ]->IsOnFace( avoidFace )))
4086 chn.push_back( quad._eIntNodes[ iP ]);
4087 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
4095 for ( i = splits.size()-1; i >= 0; --i ) // connect new pn2 (at _eIntNodes) with a split
4100 n = splits[i].LastNode();
4101 if ( n == stopNode )
4104 ( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4105 ( !avoidFace || n->IsOnFace( avoidFace )))
4108 n = splits[i].FirstNode();
4109 if ( n == stopNode )
4111 if (( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4112 ( !avoidFace || n->IsOnFace( avoidFace )))
4116 if ( n && n != stopNode )
4119 chn.push_back( pn2 );
4124 else if ( !chn.empty() && chn.back()->_isInternalFlags )
4126 // INTERNAL FACE partially cuts the quad
4127 for ( int i = chn.size() - 2; i >= 0; --i )
4128 chn.push_back( chn[ i ]);
4133 //================================================================================
4135 * \brief Checks transition at the ginen intersection node of a link
4137 bool Hexahedron::isOutPoint( _Link& link, int iP,
4138 SMESH_MesherHelper& helper, const Solid* solid ) const
4142 if ( link._fIntNodes[iP]->faces().size() == 1 &&
4143 _grid->IsInternal( link._fIntNodes[iP]->face(0) ))
4146 const bool moreIntPoints = ( iP+1 < (int) link._fIntNodes.size() );
4149 _Node* n1 = link._fIntNodes[ iP ];
4151 n1 = link._nodes[0];
4152 _Node* n2 = moreIntPoints ? link._fIntNodes[ iP+1 ] : 0;
4153 if ( !n2 || !n2->Node() )
4154 n2 = link._nodes[1];
4158 // get all FACEs under n1 and n2
4159 set< TGeomID > faceIDs;
4160 if ( moreIntPoints ) faceIDs.insert( link._fIntNodes[iP+1]->faces().begin(),
4161 link._fIntNodes[iP+1]->faces().end() );
4162 if ( n2->_intPoint ) faceIDs.insert( n2->_intPoint->_faceIDs.begin(),
4163 n2->_intPoint->_faceIDs.end() );
4164 if ( faceIDs.empty() )
4165 return false; // n2 is inside
4166 if ( n1->_intPoint ) faceIDs.insert( n1->_intPoint->_faceIDs.begin(),
4167 n1->_intPoint->_faceIDs.end() );
4168 faceIDs.insert( link._fIntNodes[iP]->faces().begin(),
4169 link._fIntNodes[iP]->faces().end() );
4171 // get a point between 2 nodes
4172 gp_Pnt p1 = n1->Point();
4173 gp_Pnt p2 = n2->Point();
4174 gp_Pnt pOnLink = 0.8 * p1.XYZ() + 0.2 * p2.XYZ();
4176 TopLoc_Location loc;
4178 set< TGeomID >::iterator faceID = faceIDs.begin();
4179 for ( ; faceID != faceIDs.end(); ++faceID )
4181 // project pOnLink on a FACE
4182 if ( *faceID < 1 || !solid->Contains( *faceID )) continue;
4183 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( *faceID ));
4184 GeomAPI_ProjectPointOnSurf& proj = helper.GetProjector( face, loc, 0.1*_grid->_tol );
4185 gp_Pnt testPnt = pOnLink.Transformed( loc.Transformation().Inverted() );
4186 proj.Perform( testPnt );
4187 if ( proj.IsDone() && proj.NbPoints() > 0 )
4190 proj.LowerDistanceParameters( u,v );
4192 if ( proj.LowerDistance() <= 0.1 * _grid->_tol )
4198 // find isOut by normals
4200 if ( GeomLib::NormEstim( BRep_Tool::Surface( face, loc ),
4205 if ( solid->Orientation( face ) == TopAbs_REVERSED )
4207 gp_Vec v( proj.NearestPoint(), testPnt );
4208 isOut = ( v * normal > 0 );
4213 // classify a projection
4214 if ( !n1->IsOnFace( *faceID ) || !n2->IsOnFace( *faceID ))
4216 BRepTopAdaptor_FClass2d cls( face, Precision::Confusion() );
4217 TopAbs_State state = cls.Perform( gp_Pnt2d( u,v ));
4218 if ( state == TopAbs_OUT )
4230 //================================================================================
4232 * \brief Sort nodes on a FACE
4234 void Hexahedron::sortVertexNodes(vector<_Node*>& nodes, _Node* curNode, TGeomID faceID)
4236 if ( nodes.size() > 20 ) return;
4238 // get shapes under nodes
4239 TGeomID nShapeIds[20], *nShapeIdsEnd = &nShapeIds[0] + nodes.size();
4240 for ( size_t i = 0; i < nodes.size(); ++i )
4241 if ( !( nShapeIds[i] = nodes[i]->ShapeID() ))
4244 // get shapes of the FACE
4245 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( faceID ));
4246 list< TopoDS_Edge > edges;
4247 list< int > nbEdges;
4248 int nbW = SMESH_Block::GetOrderedEdges (face, edges, nbEdges);
4250 // select a WIRE - remove EDGEs of irrelevant WIREs from edges
4251 list< TopoDS_Edge >::iterator e = edges.begin(), eEnd = e;
4252 list< int >::iterator nE = nbEdges.begin();
4253 for ( ; nbW > 0; ++nE, --nbW )
4255 std::advance( eEnd, *nE );
4256 for ( ; e != eEnd; ++e )
4257 for ( int i = 0; i < 2; ++i )
4260 _grid->ShapeID( *e ) :
4261 _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ));
4263 ( std::find( &nShapeIds[0], nShapeIdsEnd, id ) != nShapeIdsEnd ))
4265 edges.erase( eEnd, edges.end() ); // remove rest wires
4266 e = eEnd = edges.end();
4273 edges.erase( edges.begin(), eEnd ); // remove a current irrelevant wire
4276 // rotate edges to have the first one at least partially out of the hexa
4277 list< TopoDS_Edge >::iterator e = edges.begin(), eMidOut = edges.end();
4278 for ( ; e != edges.end(); ++e )
4280 if ( !_grid->ShapeID( *e ))
4285 for ( int i = 0; i < 2 && !isOut; ++i )
4289 TopoDS_Vertex v = SMESH_MesherHelper::IthVertex( 0, *e );
4290 p = BRep_Tool::Pnt( v );
4292 else if ( eMidOut == edges.end() )
4294 TopLoc_Location loc;
4295 Handle(Geom_Curve) c = BRep_Tool::Curve( *e, loc, f, l);
4296 if ( c.IsNull() ) break;
4297 p = c->Value( 0.5 * ( f + l )).Transformed( loc );
4304 _grid->ComputeUVW( p.XYZ(), uvw );
4305 if ( isOutParam( uvw ))
4316 if ( e != edges.end() )
4317 edges.splice( edges.end(), edges, edges.begin(), e );
4318 else if ( eMidOut != edges.end() )
4319 edges.splice( edges.end(), edges, edges.begin(), eMidOut );
4321 // sort nodes according to the order of edges
4322 _Node* orderNodes [20];
4323 //TGeomID orderShapeIDs[20];
4325 TGeomID id, *pID = 0;
4326 for ( e = edges.begin(); e != edges.end(); ++e )
4328 if (( id = _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ))) &&
4329 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4331 //orderShapeIDs[ nbN ] = id;
4332 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4335 if (( id = _grid->ShapeID( *e )) &&
4336 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4338 //orderShapeIDs[ nbN ] = id;
4339 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4343 if ( nbN != nodes.size() )
4346 bool reverse = ( orderNodes[0 ]->Point().SquareDistance( curNode->Point() ) >
4347 orderNodes[nbN-1]->Point().SquareDistance( curNode->Point() ));
4349 for ( size_t i = 0; i < nodes.size(); ++i )
4350 nodes[ i ] = orderNodes[ reverse ? nbN-1-i : i ];
4353 //================================================================================
4355 * \brief Adds computed elements to the mesh
4357 int Hexahedron::addVolumes( SMESH_MesherHelper& helper )
4359 F_IntersectPoint noIntPnt;
4360 const bool toCheckNodePos = _grid->IsToCheckNodePos();
4363 // add elements resulted from hexahedron intersection
4364 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
4366 vector< const SMDS_MeshNode* > nodes( volDef->_nodes.size() );
4367 for ( size_t iN = 0; iN < nodes.size(); ++iN )
4369 if ( !( nodes[iN] = volDef->_nodes[iN].Node() ))
4371 if ( const E_IntersectPoint* eip = volDef->_nodes[iN].EdgeIntPnt() )
4373 nodes[iN] = volDef->_nodes[iN]._intPoint->_node =
4374 helper.AddNode( eip->_point.X(),
4377 if ( _grid->ShapeType( eip->_shapeID ) == TopAbs_VERTEX )
4378 helper.GetMeshDS()->SetNodeOnVertex( nodes[iN], eip->_shapeID );
4380 helper.GetMeshDS()->SetNodeOnEdge( nodes[iN], eip->_shapeID );
4383 throw SALOME_Exception("Bug: no node at intersection point");
4385 else if ( volDef->_nodes[iN]._intPoint &&
4386 volDef->_nodes[iN]._intPoint->_node == volDef->_nodes[iN]._node )
4388 // Update position of node at EDGE intersection;
4389 // see comment to _Node::Add( E_IntersectPoint )
4390 SMESHDS_Mesh* mesh = helper.GetMeshDS();
4391 TGeomID shapeID = volDef->_nodes[iN].EdgeIntPnt()->_shapeID;
4392 mesh->UnSetNodeOnShape( nodes[iN] );
4393 if ( _grid->ShapeType( shapeID ) == TopAbs_VERTEX )
4394 mesh->SetNodeOnVertex( nodes[iN], shapeID );
4396 mesh->SetNodeOnEdge( nodes[iN], shapeID );
4398 else if ( toCheckNodePos &&
4399 !nodes[iN]->isMarked() &&
4400 _grid->ShapeType( nodes[iN]->GetShapeID() ) == TopAbs_FACE )
4402 _grid->SetOnShape( nodes[iN], noIntPnt, /*unset=*/true );
4403 nodes[iN]->setIsMarked( true );
4407 const SMDS_MeshElement* v = 0;
4408 if ( !volDef->_quantities.empty() )
4410 v = helper.AddPolyhedralVolume( nodes, volDef->_quantities );
4414 switch ( nodes.size() )
4416 case 8: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],
4417 nodes[4],nodes[5],nodes[6],nodes[7] );
4419 case 4: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3] );
4421 case 6: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4],nodes[5] );
4423 case 5: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4] );
4427 if (( volDef->_volume = v ))
4429 helper.GetMeshDS()->SetMeshElementOnShape( v, volDef->_solidID );
4436 //================================================================================
4438 * \brief Return true if the element is in a hole
4440 bool Hexahedron::isInHole() const
4442 if ( !_vIntNodes.empty() )
4445 const size_t ijk[3] = { _i, _j, _k };
4446 F_IntersectPoint curIntPnt;
4448 // consider a cell to be in a hole if all links in any direction
4449 // comes OUT of geometry
4450 for ( int iDir = 0; iDir < 3; ++iDir )
4452 const vector<double>& coords = _grid->_coords[ iDir ];
4453 LineIndexer li = _grid->GetLineIndexer( iDir );
4454 li.SetIJK( _i,_j,_k );
4455 size_t lineIndex[4] = { li.LineIndex (),
4459 bool allLinksOut = true, hasLinks = false;
4460 for ( int iL = 0; iL < 4 && allLinksOut; ++iL ) // loop on 4 links parallel to iDir
4462 const _Link& link = _hexLinks[ iL + 4*iDir ];
4463 // check transition of the first node of a link
4464 const F_IntersectPoint* firstIntPnt = 0;
4465 if ( link._nodes[0]->Node() ) // 1st node is a hexa corner
4467 curIntPnt._paramOnLine = coords[ ijk[ iDir ]] - coords[0] + _grid->_tol;
4468 const GridLine& line = _grid->_lines[ iDir ][ lineIndex[ iL ]];
4469 multiset< F_IntersectPoint >::const_iterator ip =
4470 line._intPoints.upper_bound( curIntPnt );
4472 firstIntPnt = &(*ip);
4474 else if ( !link._fIntPoints.empty() )
4476 firstIntPnt = link._fIntPoints[0];
4482 allLinksOut = ( firstIntPnt->_transition == Trans_OUT &&
4483 !_grid->IsShared( firstIntPnt->_faceIDs[0] ));
4486 if ( hasLinks && allLinksOut )
4492 //================================================================================
4494 * \brief Check if a polyherdon has an edge lying on EDGE shared by strange FACE
4495 * that will be meshed by other algo
4497 bool Hexahedron::hasStrangeEdge() const
4499 if ( _eIntPoints.size() < 2 )
4502 TopTools_MapOfShape edges;
4503 for ( size_t i = 0; i < _eIntPoints.size(); ++i )
4505 if ( !_grid->IsStrangeEdge( _eIntPoints[i]->_shapeID ))
4507 const TopoDS_Shape& s = _grid->Shape( _eIntPoints[i]->_shapeID );
4508 if ( s.ShapeType() == TopAbs_EDGE )
4510 if ( ! edges.Add( s ))
4511 return true; // an EDGE encounters twice
4515 PShapeIteratorPtr edgeIt = _grid->_helper->GetAncestors( s,
4516 *_grid->_helper->GetMesh(),
4518 while ( const TopoDS_Shape* edge = edgeIt->next() )
4519 if ( ! edges.Add( *edge ))
4520 return true; // an EDGE encounters twice
4526 //================================================================================
4528 * \brief Return true if a polyhedron passes _sizeThreshold criterion
4530 bool Hexahedron::checkPolyhedronSize( bool cutByInternalFace ) const
4532 if ( cutByInternalFace && !_grid->_toUseThresholdForInternalFaces )
4534 // check if any polygon fully lies on shared/internal FACEs
4535 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4537 const _Face& polygon = _polygons[iP];
4538 if ( polygon._links.empty() )
4540 bool allNodesInternal = true;
4541 for ( size_t iL = 0; iL < polygon._links.size() && allNodesInternal; ++iL )
4543 _Node* n = polygon._links[ iL ].FirstNode();
4544 allNodesInternal = (( n->IsCutByInternal() ) ||
4545 ( n->_intPoint && _grid->IsAnyShared( n->_intPoint->_faceIDs )));
4547 if ( allNodesInternal )
4551 if ( this->hasStrangeEdge() )
4555 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4557 const _Face& polygon = _polygons[iP];
4558 if ( polygon._links.empty() )
4560 gp_XYZ area (0,0,0);
4561 gp_XYZ p1 = polygon._links[ 0 ].FirstNode()->Point().XYZ();
4562 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
4564 gp_XYZ p2 = polygon._links[ iL ].LastNode()->Point().XYZ();
4568 volume += p1 * area;
4572 double initVolume = _sideLength[0] * _sideLength[1] * _sideLength[2];
4574 return volume > initVolume / _grid->_sizeThreshold;
4576 //================================================================================
4578 * \brief Tries to create a hexahedron
4580 bool Hexahedron::addHexa()
4582 int nbQuad = 0, iQuad = -1;
4583 for ( size_t i = 0; i < _polygons.size(); ++i )
4585 if ( _polygons[i]._links.empty() )
4587 if ( _polygons[i]._links.size() != 4 )
4598 for ( int iL = 0; iL < 4; ++iL )
4601 nodes[iL] = _polygons[iQuad]._links[iL].FirstNode();
4604 // find a top node above the base node
4605 _Link* link = _polygons[iQuad]._links[iL]._link;
4606 if ( !link->_faces[0] || !link->_faces[1] )
4607 return debugDumpLink( link );
4608 // a quadrangle sharing <link> with _polygons[iQuad]
4609 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[iQuad] )];
4610 for ( int i = 0; i < 4; ++i )
4611 if ( quad->_links[i]._link == link )
4613 // 1st node of a link opposite to <link> in <quad>
4614 nodes[iL+4] = quad->_links[(i+2)%4].FirstNode();
4620 _volumeDefs.Set( &nodes[0], 8 );
4624 //================================================================================
4626 * \brief Tries to create a tetrahedron
4628 bool Hexahedron::addTetra()
4631 for ( size_t i = 0; i < _polygons.size() && iTria < 0; ++i )
4632 if ( _polygons[i]._links.size() == 3 )
4638 nodes[0] = _polygons[iTria]._links[0].FirstNode();
4639 nodes[1] = _polygons[iTria]._links[1].FirstNode();
4640 nodes[2] = _polygons[iTria]._links[2].FirstNode();
4642 _Link* link = _polygons[iTria]._links[0]._link;
4643 if ( !link->_faces[0] || !link->_faces[1] )
4644 return debugDumpLink( link );
4646 // a triangle sharing <link> with _polygons[0]
4647 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[iTria] )];
4648 for ( int i = 0; i < 3; ++i )
4649 if ( tria->_links[i]._link == link )
4651 nodes[3] = tria->_links[(i+1)%3].LastNode();
4652 _volumeDefs.Set( &nodes[0], 4 );
4658 //================================================================================
4660 * \brief Tries to create a pentahedron
4662 bool Hexahedron::addPenta()
4664 // find a base triangular face
4666 for ( int iF = 0; iF < 5 && iTri < 0; ++iF )
4667 if ( _polygons[ iF ]._links.size() == 3 )
4669 if ( iTri < 0 ) return false;
4674 for ( int iL = 0; iL < 3; ++iL )
4677 nodes[iL] = _polygons[ iTri ]._links[iL].FirstNode();
4680 // find a top node above the base node
4681 _Link* link = _polygons[ iTri ]._links[iL]._link;
4682 if ( !link->_faces[0] || !link->_faces[1] )
4683 return debugDumpLink( link );
4684 // a quadrangle sharing <link> with a base triangle
4685 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[ iTri ] )];
4686 if ( quad->_links.size() != 4 ) return false;
4687 for ( int i = 0; i < 4; ++i )
4688 if ( quad->_links[i]._link == link )
4690 // 1st node of a link opposite to <link> in <quad>
4691 nodes[iL+3] = quad->_links[(i+2)%4].FirstNode();
4697 _volumeDefs.Set( &nodes[0], 6 );
4699 return ( nbN == 6 );
4701 //================================================================================
4703 * \brief Tries to create a pyramid
4705 bool Hexahedron::addPyra()
4707 // find a base quadrangle
4709 for ( int iF = 0; iF < 5 && iQuad < 0; ++iF )
4710 if ( _polygons[ iF ]._links.size() == 4 )
4712 if ( iQuad < 0 ) return false;
4716 nodes[0] = _polygons[iQuad]._links[0].FirstNode();
4717 nodes[1] = _polygons[iQuad]._links[1].FirstNode();
4718 nodes[2] = _polygons[iQuad]._links[2].FirstNode();
4719 nodes[3] = _polygons[iQuad]._links[3].FirstNode();
4721 _Link* link = _polygons[iQuad]._links[0]._link;
4722 if ( !link->_faces[0] || !link->_faces[1] )
4723 return debugDumpLink( link );
4725 // a triangle sharing <link> with a base quadrangle
4726 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[ iQuad ] )];
4727 if ( tria->_links.size() != 3 ) return false;
4728 for ( int i = 0; i < 3; ++i )
4729 if ( tria->_links[i]._link == link )
4731 nodes[4] = tria->_links[(i+1)%3].LastNode();
4732 _volumeDefs.Set( &nodes[0], 5 );
4738 //================================================================================
4740 * \brief Dump a link and return \c false
4742 bool Hexahedron::debugDumpLink( Hexahedron::_Link* link )
4745 gp_Pnt p1 = link->_nodes[0]->Point(), p2 = link->_nodes[1]->Point();
4746 cout << "BUG: not shared link. IKJ = ( "<< _i << " " << _j << " " << _k << " )" << endl
4747 << "n1 (" << p1.X() << ", "<< p1.Y() << ", "<< p1.Z() << " )" << endl
4748 << "n2 (" << p2.X() << ", "<< p2.Y() << ", "<< p2.Z() << " )" << endl;
4750 (void)link; // unused in release mode
4754 //================================================================================
4756 * \brief Classify a point by grid parameters
4758 bool Hexahedron::isOutParam(const double uvw[3]) const
4760 return (( _grid->_coords[0][ _i ] - _grid->_tol > uvw[0] ) ||
4761 ( _grid->_coords[0][ _i+1 ] + _grid->_tol < uvw[0] ) ||
4762 ( _grid->_coords[1][ _j ] - _grid->_tol > uvw[1] ) ||
4763 ( _grid->_coords[1][ _j+1 ] + _grid->_tol < uvw[1] ) ||
4764 ( _grid->_coords[2][ _k ] - _grid->_tol > uvw[2] ) ||
4765 ( _grid->_coords[2][ _k+1 ] + _grid->_tol < uvw[2] ));
4767 //================================================================================
4769 * \brief Divide a polygon into triangles and modify accordingly an adjacent polyhedron
4771 void splitPolygon( const SMDS_MeshElement* polygon,
4772 SMDS_VolumeTool & volume,
4773 const int facetIndex,
4774 const TGeomID faceID,
4775 const TGeomID solidID,
4776 SMESH_MeshEditor::ElemFeatures& face,
4777 SMESH_MeshEditor& editor,
4778 const bool reinitVolume)
4780 SMESH_MeshAlgos::Triangulate divider(/*optimize=*/false);
4781 int nbTrias = divider.GetTriangles( polygon, face.myNodes );
4782 face.myNodes.resize( nbTrias * 3 );
4784 SMESH_MeshEditor::ElemFeatures newVolumeDef;
4785 newVolumeDef.Init( volume.Element() );
4786 newVolumeDef.SetID( volume.Element()->GetID() );
4788 newVolumeDef.myPolyhedQuantities.reserve( volume.NbFaces() + nbTrias );
4789 newVolumeDef.myNodes.reserve( volume.NbNodes() + nbTrias * 3 );
4791 SMESHDS_Mesh* meshDS = editor.GetMeshDS();
4792 SMDS_MeshElement* newTriangle;
4793 for ( int iF = 0, nF = volume.NbFaces(); iF < nF; iF++ )
4795 if ( iF == facetIndex )
4797 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4798 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4799 face.myNodes.begin(),
4800 face.myNodes.begin() + 3 );
4801 meshDS->RemoveFreeElement( polygon, 0, false );
4802 newTriangle = meshDS->AddFace( face.myNodes[0], face.myNodes[1], face.myNodes[2] );
4803 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4807 const SMDS_MeshNode** nn = volume.GetFaceNodes( iF );
4808 const size_t nbFaceNodes = volume.NbFaceNodes ( iF );
4809 newVolumeDef.myPolyhedQuantities.push_back( nbFaceNodes );
4810 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(), nn, nn + nbFaceNodes );
4814 for ( size_t iN = 3; iN < face.myNodes.size(); iN += 3 )
4816 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4817 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4818 face.myNodes.begin() + iN,
4819 face.myNodes.begin() + iN + 3 );
4820 newTriangle = meshDS->AddFace( face.myNodes[iN], face.myNodes[iN+1], face.myNodes[iN+2] );
4821 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4824 meshDS->RemoveFreeElement( volume.Element(), 0, false );
4825 SMDS_MeshElement* newVolume = editor.AddElement( newVolumeDef.myNodes, newVolumeDef );
4826 meshDS->SetMeshElementOnShape( newVolume, solidID );
4831 volume.Set( newVolume );
4835 //================================================================================
4837 * \brief Create mesh faces at free facets
4839 void Hexahedron::addFaces( SMESH_MesherHelper& helper,
4840 const vector< const SMDS_MeshElement* > & boundaryVolumes )
4842 if ( !_grid->_toCreateFaces )
4845 SMDS_VolumeTool vTool;
4846 vector<int> bndFacets;
4847 SMESH_MeshEditor editor( helper.GetMesh() );
4848 SMESH_MeshEditor::ElemFeatures face( SMDSAbs_Face );
4849 SMESHDS_Mesh* meshDS = helper.GetMeshDS();
4851 // check if there are internal or shared FACEs
4852 bool hasInternal = ( !_grid->_geometry.IsOneSolid() ||
4853 _grid->_geometry._soleSolid.HasInternalFaces() );
4855 for ( size_t iV = 0; iV < boundaryVolumes.size(); ++iV )
4857 if ( !vTool.Set( boundaryVolumes[ iV ]))
4860 TGeomID solidID = vTool.Element()->GetShapeID();
4861 Solid * solid = _grid->GetOneOfSolids( solidID );
4863 // find boundary facets
4866 for ( int iF = 0, n = vTool.NbFaces(); iF < n; iF++ )
4868 bool isBoundary = vTool.IsFreeFace( iF );
4871 bndFacets.push_back( iF );
4873 else if ( hasInternal )
4875 // check if all nodes are on internal/shared FACEs
4877 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iF );
4878 const size_t nbFaceNodes = vTool.NbFaceNodes ( iF );
4879 for ( size_t iN = 0; iN < nbFaceNodes && isBoundary; ++iN )
4880 isBoundary = ( nn[ iN ]->GetShapeID() != solidID );
4882 bndFacets.push_back( -( iF+1 )); // !!! minus ==> to check the FACE
4885 if ( bndFacets.empty() )
4890 if ( !vTool.IsPoly() )
4891 vTool.SetExternalNormal();
4892 for ( size_t i = 0; i < bndFacets.size(); ++i ) // loop on boundary facets
4894 const bool isBoundary = ( bndFacets[i] >= 0 );
4895 const int iFacet = isBoundary ? bndFacets[i] : -bndFacets[i]-1;
4896 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iFacet );
4897 const size_t nbFaceNodes = vTool.NbFaceNodes ( iFacet );
4898 face.myNodes.assign( nn, nn + nbFaceNodes );
4901 const SMDS_MeshElement* existFace = 0, *newFace = 0;
4903 if (( existFace = meshDS->FindElement( face.myNodes, SMDSAbs_Face )))
4905 if ( existFace->isMarked() )
4906 continue; // created by this method
4907 faceID = existFace->GetShapeID();
4911 // look for a supporting FACE
4912 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN ) // look for a node on FACE
4914 if ( nn[ iN ]->GetPosition()->GetDim() == 2 )
4915 faceID = nn[ iN ]->GetShapeID();
4917 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN )
4919 // look for a father FACE of EDGEs and VERTEXes
4920 const TopoDS_Shape& s1 = _grid->Shape( nn[ iN ]->GetShapeID() );
4921 const TopoDS_Shape& s2 = _grid->Shape( nn[ iN+1 ]->GetShapeID() );
4922 if ( s1 != s2 && s1.ShapeType() == TopAbs_EDGE && s2.ShapeType() == TopAbs_EDGE )
4924 TopoDS_Shape f = helper.GetCommonAncestor( s1, s2, *helper.GetMesh(), TopAbs_FACE );
4926 faceID = _grid->ShapeID( f );
4930 bool toCheckFace = faceID && (( !isBoundary ) ||
4931 ( hasInternal && _grid->_toUseThresholdForInternalFaces ));
4932 if ( toCheckFace ) // check if all nodes are on the found FACE
4934 SMESH_subMesh* faceSM = helper.GetMesh()->GetSubMeshContaining( faceID );
4935 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4937 TGeomID subID = nn[ iN ]->GetShapeID();
4938 if ( subID != faceID && !faceSM->DependsOn( subID ))
4941 if ( !faceID && !isBoundary )
4945 // orient a new face according to supporting FACE orientation in shape_to_mesh
4946 if ( !solid->IsOutsideOriented( faceID ))
4949 editor.Reorient( existFace );
4951 std::reverse( face.myNodes.begin(), face.myNodes.end() );
4954 if ( ! ( newFace = existFace ))
4956 face.SetPoly( nbFaceNodes > 4 );
4957 newFace = editor.AddElement( face.myNodes, face );
4960 newFace->setIsMarked( true ); // to distinguish from face created in getBoundaryElems()
4963 if ( faceID && _grid->IsBoundaryFace( faceID )) // face is not shared
4965 // set newFace to the found FACE provided that it fully lies on the FACE
4966 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4967 if ( nn[iN]->GetShapeID() == solidID )
4970 meshDS->UnSetMeshElementOnShape( existFace, _grid->Shape( faceID ));
4975 // split a polygon that will be used by other 3D algorithm
4976 if ( faceID && nbFaceNodes > 4 &&
4977 !_grid->IsInternal( faceID ) &&
4978 !_grid->IsShared( faceID ) &&
4979 !_grid->IsBoundaryFace( faceID ))
4981 splitPolygon( newFace, vTool, iFacet, faceID, solidID,
4982 face, editor, i+1 < bndFacets.size() );
4987 meshDS->SetMeshElementOnShape( newFace, faceID );
4989 meshDS->SetMeshElementOnShape( newFace, solidID );
4991 } // loop on bndFacets
4992 } // loop on boundaryVolumes
4995 // Orient coherently mesh faces on INTERNAL FACEs
4999 TopExp_Explorer faceExp( _grid->_geometry._mainShape, TopAbs_FACE );
5000 for ( ; faceExp.More(); faceExp.Next() )
5002 if ( faceExp.Current().Orientation() != TopAbs_INTERNAL )
5005 SMESHDS_SubMesh* sm = meshDS->MeshElements( faceExp.Current() );
5006 if ( !sm ) continue;
5008 TIDSortedElemSet facesToOrient;
5009 for ( SMDS_ElemIteratorPtr fIt = sm->GetElements(); fIt->more(); )
5010 facesToOrient.insert( facesToOrient.end(), fIt->next() );
5011 if ( facesToOrient.size() < 2 )
5014 gp_Dir direction(1,0,0);
5015 const SMDS_MeshElement* anyFace = *facesToOrient.begin();
5016 editor.Reorient2D( facesToOrient, direction, anyFace );
5022 //================================================================================
5024 * \brief Create mesh segments.
5026 void Hexahedron::addSegments( SMESH_MesherHelper& helper,
5027 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap )
5029 SMESHDS_Mesh* mesh = helper.GetMeshDS();
5031 std::vector<const SMDS_MeshNode*> nodes;
5032 std::vector<const SMDS_MeshElement *> elems;
5033 map< TGeomID, vector< TGeomID > >::const_iterator e2ff = edge2faceIDsMap.begin();
5034 for ( ; e2ff != edge2faceIDsMap.end(); ++e2ff )
5036 const TopoDS_Edge& edge = TopoDS::Edge( _grid->Shape( e2ff->first ));
5037 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( e2ff->second[0] ));
5038 StdMeshers_FaceSide side( face, edge, helper.GetMesh(), /*isFwd=*/true, /*skipMed=*/true );
5039 nodes = side.GetOrderedNodes();
5042 if ( nodes.size() == 2 )
5043 // check that there is an element connecting two nodes
5044 if ( !mesh->GetElementsByNodes( nodes, elems ))
5047 for ( size_t i = 1; i < nodes.size(); i++ )
5049 SMDS_MeshElement* segment = mesh->AddEdge( nodes[i-1], nodes[i] );
5050 mesh->SetMeshElementOnShape( segment, e2ff->first );
5056 //================================================================================
5058 * \brief Return created volumes and volumes that can have free facet because of
5059 * skipped small volume. Also create mesh faces on free facets
5060 * of adjacent not-cut volumes if the result volume is too small.
5062 void Hexahedron::getBoundaryElems( vector< const SMDS_MeshElement* > & boundaryElems )
5064 if ( _hasTooSmall /*|| _volumeDefs.IsEmpty()*/ )
5066 // create faces around a missing small volume
5068 SMESH_MeshEditor editor( _grid->_helper->GetMesh() );
5069 SMESH_MeshEditor::ElemFeatures polygon( SMDSAbs_Face );
5070 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
5071 std::vector<const SMDS_MeshElement *> adjVolumes(2);
5072 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
5074 const size_t nbLinks = _polygons[ iF ]._links.size();
5075 if ( nbLinks != 4 ) continue;
5076 polygon.myNodes.resize( nbLinks );
5077 polygon.myNodes.back() = 0;
5078 for ( size_t iL = 0, iN = nbLinks - 1; iL < nbLinks; ++iL, --iN )
5079 if ( ! ( polygon.myNodes[iN] = _polygons[ iF ]._links[ iL ].FirstNode()->Node() ))
5081 if ( !polygon.myNodes.back() )
5084 meshDS->GetElementsByNodes( polygon.myNodes, adjVolumes, SMDSAbs_Volume );
5085 if ( adjVolumes.size() != 1 )
5087 if ( !adjVolumes[0]->isMarked() )
5089 boundaryElems.push_back( adjVolumes[0] );
5090 adjVolumes[0]->setIsMarked( true );
5093 bool sameShape = true;
5094 TGeomID shapeID = polygon.myNodes[0]->GetShapeID();
5095 for ( size_t i = 1; i < polygon.myNodes.size() && sameShape; ++i )
5096 sameShape = ( shapeID == polygon.myNodes[i]->GetShapeID() );
5098 if ( !sameShape || !_grid->IsSolid( shapeID ))
5099 continue; // some of shapes must be FACE
5103 faceID = getAnyFace();
5106 if ( _grid->IsInternal( faceID ) ||
5107 _grid->IsShared( faceID ) //||
5108 //_grid->IsBoundaryFace( faceID ) -- commented for #19887
5110 break; // create only if a new face will be used by other 3D algo
5113 Solid * solid = _grid->GetOneOfSolids( adjVolumes[0]->GetShapeID() );
5114 if ( !solid->IsOutsideOriented( faceID ))
5115 std::reverse( polygon.myNodes.begin(), polygon.myNodes.end() );
5117 //polygon.SetPoly( polygon.myNodes.size() > 4 );
5118 const SMDS_MeshElement* newFace = editor.AddElement( polygon.myNodes, polygon );
5119 meshDS->SetMeshElementOnShape( newFace, faceID );
5123 // return created volumes
5124 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
5126 if ( volDef->_volume && !volDef->_volume->isMarked() )
5128 volDef->_volume->setIsMarked( true );
5129 boundaryElems.push_back( volDef->_volume );
5131 if ( _grid->IsToCheckNodePos() ) // un-mark nodes marked in addVolumes()
5132 for ( size_t iN = 0; iN < volDef->_nodes.size(); ++iN )
5133 volDef->_nodes[iN].Node()->setIsMarked( false );
5138 //================================================================================
5140 * \brief Remove edges and nodes dividing a hexa side in the case if an adjacent
5141 * volume also sharing the dividing edge is missing due to its small side.
5144 //================================================================================
5146 void Hexahedron::removeExcessSideDivision(const vector< Hexahedron* >& allHexa)
5148 if ( ! _volumeDefs.IsPolyhedron() )
5149 return; // not a polyhedron
5151 // look for a divided side adjacent to a small hexahedron
5153 int di[6] = { 0, 0, 0, 0,-1, 1 };
5154 int dj[6] = { 0, 0,-1, 1, 0, 0 };
5155 int dk[6] = {-1, 1, 0, 0, 0, 0 };
5157 for ( int iF = 0; iF < 6; ++iF ) // loop on 6 sides of a hexahedron
5159 size_t neighborIndex = _grid->CellIndex( _i + di[iF],
5162 if ( neighborIndex >= allHexa.size() ||
5163 !allHexa[ neighborIndex ] ||
5164 !allHexa[ neighborIndex ]->_hasTooSmall )
5167 // check if a side is divided into several polygons
5168 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
5170 int nbPolygons = 0, nbNodes = 0;
5171 for ( size_t i = 0; i < volDef->_names.size(); ++i )
5172 if ( volDef->_names[ i ] == _hexQuads[ iF ]._name )
5175 nbNodes += volDef->_quantities[ i ];
5177 if ( nbPolygons < 2 )
5180 // construct loops from polygons
5181 typedef _volumeDef::_linkDef TLinkDef;
5182 std::vector< TLinkDef* > loops;
5183 std::vector< TLinkDef > links( nbNodes );
5184 for ( size_t i = 0, iN = 0, iLoop = 0; iLoop < volDef->_quantities.size(); ++iLoop )
5186 size_t nbLinks = volDef->_quantities[ iLoop ];
5187 if ( volDef->_names[ iLoop ] != _hexQuads[ iF ]._name )
5192 loops.push_back( & links[i] );
5193 for ( size_t n = 0; n < nbLinks-1; ++n, ++i, ++iN )
5195 links[i].init( volDef->_nodes[iN], volDef->_nodes[iN+1], iLoop );
5196 links[i].setNext( &links[i+1] );
5198 links[i].init( volDef->_nodes[iN], volDef->_nodes[iN-nbLinks+1], iLoop );
5199 links[i].setNext( &links[i-nbLinks+1] );
5203 // look for equal links in different loops and join such loops
5204 bool loopsJoined = false;
5205 std::set< TLinkDef > linkSet;
5206 for ( size_t iLoop = 0; iLoop < loops.size(); ++iLoop )
5209 for ( TLinkDef* l = loops[ iLoop ]; l != beg; l = l->_next ) // walk around the iLoop
5211 std::pair< std::set< TLinkDef >::iterator, bool > it2new = linkSet.insert( *l );
5212 if ( !it2new.second ) // equal found, join loops
5214 const TLinkDef* equal = &(*it2new.first);
5215 if ( equal->_loopIndex == l->_loopIndex )
5220 for ( size_t i = iLoop - 1; i < loops.size(); --i )
5221 if ( loops[ i ] && loops[ i ]->_loopIndex == equal->_loopIndex )
5224 // exclude l and equal and join two loops
5225 if ( l->_prev != equal )
5226 l->_prev->setNext( equal->_next );
5227 if ( equal->_prev != l )
5228 equal->_prev->setNext( l->_next );
5230 if ( volDef->_quantities[ l->_loopIndex ] > 0 )
5231 volDef->_quantities[ l->_loopIndex ] *= -1;
5232 if ( volDef->_quantities[ equal->_loopIndex ] > 0 )
5233 volDef->_quantities[ equal->_loopIndex ] *= -1;
5235 if ( loops[ iLoop ] == l )
5236 loops[ iLoop ] = l->_prev->_next;
5238 beg = loops[ iLoop ];
5244 // set unchanged polygons
5245 std::vector< int > newQuantities;
5246 std::vector< _volumeDef::_nodeDef > newNodes;
5247 vector< SMESH_Block::TShapeID > newNames;
5248 newQuantities.reserve( volDef->_quantities.size() );
5249 newNodes.reserve ( volDef->_nodes.size() );
5250 newNames.reserve ( volDef->_names.size() );
5251 for ( size_t i = 0, iLoop = 0; iLoop < volDef->_quantities.size(); ++iLoop )
5253 if ( volDef->_quantities[ iLoop ] < 0 )
5255 i -= volDef->_quantities[ iLoop ];
5258 newQuantities.push_back( volDef->_quantities[ iLoop ]);
5259 newNodes.insert( newNodes.end(),
5260 volDef->_nodes.begin() + i,
5261 volDef->_nodes.begin() + i + newQuantities.back() );
5262 newNames.push_back( volDef->_names[ iLoop ]);
5263 i += volDef->_quantities[ iLoop ];
5267 for ( size_t iLoop = 0; iLoop < loops.size(); ++iLoop )
5269 if ( !loops[ iLoop ] )
5271 newQuantities.push_back( 0 );
5273 for ( TLinkDef* l = loops[ iLoop ]; l != beg; l = l->_next, ++newQuantities.back() )
5275 newNodes.push_back( l->_node1 );
5276 beg = loops[ iLoop ];
5278 newNames.push_back( _hexQuads[ iF ]._name );
5280 volDef->_quantities.swap( newQuantities );
5281 volDef->_nodes.swap( newNodes );
5282 volDef->_names.swap( newNames );
5284 } // loop on volDef's
5285 } // loop on hex sides
5288 } // removeExcessSideDivision()
5291 //================================================================================
5293 * \brief Remove nodes splitting Cartesian cell edges in the case if a node
5294 * is used in every cells only by two polygons sharing the edge
5297 //================================================================================
5299 void Hexahedron::removeExcessNodes(vector< Hexahedron* >& allHexa)
5301 if ( ! _volumeDefs.IsPolyhedron() )
5302 return; // not a polyhedron
5304 typedef vector< _volumeDef::_nodeDef >::iterator TNodeIt;
5305 vector< int > nodesInPoly[ 4 ]; // node index in _volumeDefs._nodes
5306 vector< int > volDefInd [ 4 ]; // index of a _volumeDefs
5307 Hexahedron* hexa [ 4 ];
5308 int i,j,k, cellIndex, iLink = 0, iCellLink;
5309 for ( int iDir = 0; iDir < 3; ++iDir )
5311 CellsAroundLink fourCells( _grid, iDir );
5312 for ( int iL = 0; iL < 4; ++iL, ++iLink ) // 4 links in a direction
5314 _Link& link = _hexLinks[ iLink ];
5315 fourCells.Init( _i, _j, _k, iLink );
5317 for ( size_t iP = 0; iP < link._fIntPoints.size(); ++iP ) // loop on nodes on the link
5319 bool nodeRemoved = true;
5320 _volumeDef::_nodeDef node; node._intPoint = link._fIntPoints[iP];
5322 for ( size_t i = 0, nb = _volumeDefs.size(); i < nb && nodeRemoved; ++i )
5323 if ( _volumeDef* vol = _volumeDefs.at( i ))
5325 ( std::find( vol->_nodes.begin(), vol->_nodes.end(), node ) == vol->_nodes.end() );
5327 continue; // node already removed
5329 // check if a node encounters zero or two times in 4 cells sharing iLink
5330 // if so, the node can be removed from the cells
5331 bool nodeIsOnEdge = true;
5332 int nbPolyhedraWithNode = 0;
5333 for ( int iC = 0; iC < 4; ++iC ) // loop on 4 cells sharing a link
5335 nodesInPoly[ iC ].clear();
5336 volDefInd [ iC ].clear();
5338 if ( !fourCells.GetCell( iC, i,j,k, cellIndex, iCellLink ))
5340 hexa[ iC ] = allHexa[ cellIndex ];
5343 for ( size_t i = 0, nb = hexa[ iC ]->_volumeDefs.size(); i < nb; ++i )
5344 if ( _volumeDef* vol = hexa[ iC ]->_volumeDefs.at( i ))
5346 for ( TNodeIt nIt = vol->_nodes.begin(); nIt != vol->_nodes.end(); ++nIt )
5348 nIt = std::find( nIt, vol->_nodes.end(), node );
5349 if ( nIt != vol->_nodes.end() )
5351 nodesInPoly[ iC ].push_back( std::distance( vol->_nodes.begin(), nIt ));
5352 volDefInd [ iC ].push_back( i );
5357 nbPolyhedraWithNode += ( !nodesInPoly[ iC ].empty() );
5359 if ( nodesInPoly[ iC ].size() != 0 &&
5360 nodesInPoly[ iC ].size() != 2 )
5362 nodeIsOnEdge = false;
5365 } // loop on 4 cells
5367 // remove nodes from polyhedra
5368 if ( nbPolyhedraWithNode > 0 && nodeIsOnEdge )
5370 for ( int iC = 0; iC < 4; ++iC ) // loop on 4 cells sharing the link
5372 if ( nodesInPoly[ iC ].empty() )
5374 for ( int i = volDefInd[ iC ].size() - 1; i >= 0; --i )
5376 _volumeDef* vol = hexa[ iC ]->_volumeDefs.at( volDefInd[ iC ][ i ]);
5377 int nIndex = nodesInPoly[ iC ][ i ];
5378 // decrement _quantities
5379 for ( size_t iQ = 0; iQ < vol->_quantities.size(); ++iQ )
5380 if ( nIndex < vol->_quantities[ iQ ])
5382 vol->_quantities[ iQ ]--;
5387 nIndex -= vol->_quantities[ iQ ];
5389 vol->_nodes.erase( vol->_nodes.begin() + nodesInPoly[ iC ][ i ]);
5392 vol->_nodes.size() == 6 * 4 &&
5393 vol->_quantities.size() == 6 ) // polyhedron becomes hexahedron?
5395 bool allQuads = true;
5396 for ( size_t iQ = 0; iQ < vol->_quantities.size() && allQuads; ++iQ )
5397 allQuads = ( vol->_quantities[ iQ ] == 4 );
5400 // set side nodes as this: bottom, top, top, ...
5401 int iTop = 0, iBot = 0; // side indices
5402 for ( int iS = 0; iS < 6; ++iS )
5404 if ( vol->_names[ iS ] == SMESH_Block::ID_Fxy0 )
5406 if ( vol->_names[ iS ] == SMESH_Block::ID_Fxy1 )
5413 std::copy( vol->_nodes.begin(),
5414 vol->_nodes.begin() + 4,
5415 vol->_nodes.begin() + 4 );
5418 std::copy( vol->_nodes.begin() + 4 * iBot,
5419 vol->_nodes.begin() + 4 * ( iBot + 1),
5420 vol->_nodes.begin() );
5423 std::copy( vol->_nodes.begin() + 4 * iTop,
5424 vol->_nodes.begin() + 4 * ( iTop + 1),
5425 vol->_nodes.begin() + 4 );
5427 std::copy( vol->_nodes.begin() + 4,
5428 vol->_nodes.begin() + 8,
5429 vol->_nodes.begin() + 8 );
5430 // set up top facet nodes by comparing their uvw with bottom nodes
5431 E_IntersectPoint ip[8];
5432 for ( int iN = 0; iN < 8; ++iN )
5434 SMESH_NodeXYZ p = vol->_nodes[ iN ].Node();
5435 _grid->ComputeUVW( p, ip[ iN ]._uvw );
5437 const double tol2 = _grid->_tol * _grid->_tol;
5438 for ( int iN = 0; iN < 4; ++iN )
5440 gp_Pnt2d pBot( ip[ iN ]._uvw[0], ip[ iN ]._uvw[1] );
5441 for ( int iT = 4; iT < 8; ++iT )
5443 gp_Pnt2d pTop( ip[ iT ]._uvw[0], ip[ iT ]._uvw[1] );
5444 if ( pBot.SquareDistance( pTop ) < tol2 )
5446 // vol->_nodes[ iN + 4 ]._node = ip[ iT ]._node;
5447 // vol->_nodes[ iN + 4 ]._intPoint = 0;
5448 vol->_nodes[ iN + 4 ] = vol->_nodes[ iT + 4 ];
5453 vol->_nodes.resize( 8 );
5454 vol->_quantities.clear();
5455 //vol->_names.clear();
5458 } // loop on _volumeDefs
5459 } // loop on 4 cell abound a link
5460 } // if ( nodeIsOnEdge )
5461 } // loop on intersection points of a link
5462 } // loop on 4 links of a direction
5463 } // loop on 3 directions
5467 } // removeExcessNodes()
5469 //================================================================================
5471 * \brief Set to _hexLinks a next portion of splits located on one side of INTERNAL FACEs
5473 bool Hexahedron::_SplitIterator::Next()
5475 if ( _iterationNb > 0 )
5476 // count used splits
5477 for ( size_t i = 0; i < _splits.size(); ++i )
5479 if ( _splits[i]._iCheckIteration == _iterationNb )
5481 _splits[i]._isUsed = _splits[i]._checkedSplit->_faces[1];
5482 _nbUsed += _splits[i]._isUsed;
5490 bool toTestUsed = ( _nbChecked >= _splits.size() );
5493 // all splits are checked; find all not used splits
5494 for ( size_t i = 0; i < _splits.size(); ++i )
5495 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5496 _splits[i]._iCheckIteration = _iterationNb;
5498 _nbUsed = _splits.size(); // to stop iteration
5502 // get any not used/checked split to start from
5504 for ( size_t i = 0; i < _splits.size(); ++i )
5506 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5508 _freeNodes.push_back( _splits[i]._nodes[0] );
5509 _freeNodes.push_back( _splits[i]._nodes[1] );
5510 _splits[i]._iCheckIteration = _iterationNb;
5514 // find splits connected to the start one via _freeNodes
5515 for ( size_t iN = 0; iN < _freeNodes.size(); ++iN )
5517 for ( size_t iS = 0; iS < _splits.size(); ++iS )
5519 if ( _splits[iS].IsCheckedOrUsed( toTestUsed ))
5522 if ( _freeNodes[iN] == _splits[iS]._nodes[0] )
5524 else if ( _freeNodes[iN] == _splits[iS]._nodes[1] )
5528 if ( _freeNodes[iN]->_isInternalFlags > 0 )
5530 if ( _splits[iS]._nodes[ iN2 ]->_isInternalFlags == 0 )
5532 if ( !_splits[iS]._nodes[ iN2 ]->IsLinked( _freeNodes[iN]->_intPoint ))
5535 _splits[iS]._iCheckIteration = _iterationNb;
5536 _freeNodes.push_back( _splits[iS]._nodes[ iN2 ]);
5540 // set splits to hex links
5542 for ( int iL = 0; iL < 12; ++iL )
5543 _hexLinks[ iL ]._splits.clear();
5546 for ( size_t i = 0; i < _splits.size(); ++i )
5548 if ( _splits[i]._iCheckIteration == _iterationNb )
5550 split._nodes[0] = _splits[i]._nodes[0];
5551 split._nodes[1] = _splits[i]._nodes[1];
5552 _Link & hexLink = _hexLinks[ _splits[i]._linkID ];
5553 hexLink._splits.push_back( split );
5554 _splits[i]._checkedSplit = & hexLink._splits.back();
5561 //================================================================================
5563 * \brief computes exact bounding box with axes parallel to given ones
5565 //================================================================================
5567 void getExactBndBox( const vector< TopoDS_Shape >& faceVec,
5568 const double* axesDirs,
5572 TopoDS_Compound allFacesComp;
5573 b.MakeCompound( allFacesComp );
5574 for ( size_t iF = 0; iF < faceVec.size(); ++iF )
5575 b.Add( allFacesComp, faceVec[ iF ] );
5577 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
5578 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
5580 for ( int i = 0; i < 6; ++i )
5581 farDist = Max( farDist, 10 * sP[i] );
5583 gp_XYZ axis[3] = { gp_XYZ( axesDirs[0], axesDirs[1], axesDirs[2] ),
5584 gp_XYZ( axesDirs[3], axesDirs[4], axesDirs[5] ),
5585 gp_XYZ( axesDirs[6], axesDirs[7], axesDirs[8] ) };
5586 axis[0].Normalize();
5587 axis[1].Normalize();
5588 axis[2].Normalize();
5590 gp_Mat basis( axis[0], axis[1], axis[2] );
5591 gp_Mat bi = basis.Inverted();
5594 for ( int iDir = 0; iDir < 3; ++iDir )
5596 gp_XYZ axis0 = axis[ iDir ];
5597 gp_XYZ axis1 = axis[ ( iDir + 1 ) % 3 ];
5598 gp_XYZ axis2 = axis[ ( iDir + 2 ) % 3 ];
5599 for ( int isMax = 0; isMax < 2; ++isMax )
5601 double shift = isMax ? farDist : -farDist;
5602 gp_XYZ orig = shift * axis0;
5603 gp_XYZ norm = axis1 ^ axis2;
5604 gp_Pln pln( orig, norm );
5605 norm = pln.Axis().Direction().XYZ();
5606 BRepBuilderAPI_MakeFace plane( pln, -farDist, farDist, -farDist, farDist );
5608 gp_Pnt& pAxis = isMax ? pMax : pMin;
5609 gp_Pnt pPlane, pFaces;
5610 double dist = GEOMUtils::GetMinDistance( plane, allFacesComp, pPlane, pFaces );
5615 for ( int i = 0; i < 2; ++i ) {
5616 corner.SetCoord( 1, sP[ i*3 ]);
5617 for ( int j = 0; j < 2; ++j ) {
5618 corner.SetCoord( 2, sP[ i*3 + 1 ]);
5619 for ( int k = 0; k < 2; ++k )
5621 corner.SetCoord( 3, sP[ i*3 + 2 ]);
5627 corner = isMax ? bb.CornerMax() : bb.CornerMin();
5628 pAxis.SetCoord( iDir+1, corner.Coord( iDir+1 ));
5632 gp_XYZ pf = pFaces.XYZ() * bi;
5633 pAxis.SetCoord( iDir+1, pf.Coord( iDir+1 ) );
5639 shapeBox.Add( pMin );
5640 shapeBox.Add( pMax );
5647 //=============================================================================
5649 * \brief Generates 3D structured Cartesian mesh in the internal part of
5650 * solid shapes and polyhedral volumes near the shape boundary.
5651 * \param theMesh - mesh to fill in
5652 * \param theShape - a compound of all SOLIDs to mesh
5653 * \retval bool - true in case of success
5655 //=============================================================================
5657 bool StdMeshers_Cartesian_3D::Compute(SMESH_Mesh & theMesh,
5658 const TopoDS_Shape & theShape)
5660 // The algorithm generates the mesh in following steps:
5662 // 1) Intersection of grid lines with the geometry boundary.
5663 // This step allows to find out if a given node of the initial grid is
5664 // inside or outside the geometry.
5666 // 2) For each cell of the grid, check how many of it's nodes are outside
5667 // of the geometry boundary. Depending on a result of this check
5668 // - skip a cell, if all it's nodes are outside
5669 // - skip a cell, if it is too small according to the size threshold
5670 // - add a hexahedron in the mesh, if all nodes are inside
5671 // - add a polyhedron in the mesh, if some nodes are inside and some outside
5673 _computeCanceled = false;
5675 SMESH_MesherHelper helper( theMesh );
5676 SMESHDS_Mesh* meshDS = theMesh.GetMeshDS();
5681 grid._helper = &helper;
5682 grid._toAddEdges = _hyp->GetToAddEdges();
5683 grid._toCreateFaces = _hyp->GetToCreateFaces();
5684 grid._toConsiderInternalFaces = _hyp->GetToConsiderInternalFaces();
5685 grid._toUseThresholdForInternalFaces = _hyp->GetToUseThresholdForInternalFaces();
5686 grid._sizeThreshold = _hyp->GetSizeThreshold();
5687 grid.InitGeometry( theShape );
5689 vector< TopoDS_Shape > faceVec;
5691 TopTools_MapOfShape faceMap;
5692 TopExp_Explorer fExp;
5693 for ( fExp.Init( theShape, TopAbs_FACE ); fExp.More(); fExp.Next() )
5695 bool isNewFace = faceMap.Add( fExp.Current() );
5696 if ( !grid._toConsiderInternalFaces )
5697 if ( !isNewFace || fExp.Current().Orientation() == TopAbs_INTERNAL )
5698 // remove an internal face
5699 faceMap.Remove( fExp.Current() );
5701 faceVec.reserve( faceMap.Extent() );
5702 faceVec.assign( faceMap.cbegin(), faceMap.cend() );
5704 vector<FaceGridIntersector> facesItersectors( faceVec.size() );
5706 for ( size_t i = 0; i < faceVec.size(); ++i )
5708 facesItersectors[i]._face = TopoDS::Face( faceVec[i] );
5709 facesItersectors[i]._faceID = grid.ShapeID( faceVec[i] );
5710 facesItersectors[i]._grid = &grid;
5711 shapeBox.Add( facesItersectors[i].GetFaceBndBox() );
5713 getExactBndBox( faceVec, _hyp->GetAxisDirs(), shapeBox );
5716 vector<double> xCoords, yCoords, zCoords;
5717 _hyp->GetCoordinates( xCoords, yCoords, zCoords, shapeBox );
5719 grid.SetCoordinates( xCoords, yCoords, zCoords, _hyp->GetAxisDirs(), shapeBox );
5721 if ( _computeCanceled ) return false;
5724 { // copy partner faces and curves of not thread-safe types
5725 set< const Standard_Transient* > tshapes;
5726 BRepBuilderAPI_Copy copier;
5727 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5729 if ( !facesItersectors[i].IsThreadSafe( tshapes ))
5731 copier.Perform( facesItersectors[i]._face );
5732 facesItersectors[i]._face = TopoDS::Face( copier );
5736 // Intersection of grid lines with the geometry boundary.
5737 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, facesItersectors.size() ),
5738 ParallelIntersector( facesItersectors ),
5739 tbb::simple_partitioner());
5741 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5742 facesItersectors[i].Intersect();
5745 // put intersection points onto the GridLine's; this is done after intersection
5746 // to avoid contention of facesItersectors for writing into the same GridLine
5747 // in case of parallel work of facesItersectors
5748 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5749 facesItersectors[i].StoreIntersections();
5751 if ( _computeCanceled ) return false;
5753 // create nodes on the geometry
5754 grid.ComputeNodes( helper );
5756 if ( _computeCanceled ) return false;
5758 // get EDGEs to take into account
5759 map< TGeomID, vector< TGeomID > > edge2faceIDsMap;
5760 grid.GetEdgesToImplement( edge2faceIDsMap, theShape, faceVec );
5762 // create volume elements
5763 Hexahedron hex( &grid );
5764 int nbAdded = hex.MakeElements( helper, edge2faceIDsMap );
5768 if ( !grid._toConsiderInternalFaces )
5770 // make all SOLIDs computed
5771 TopExp_Explorer solidExp( theShape, TopAbs_SOLID );
5772 if ( SMESHDS_SubMesh* sm1 = meshDS->MeshElements( solidExp.Current()) )
5774 SMDS_ElemIteratorPtr volIt = sm1->GetElements();
5775 for ( ; solidExp.More() && volIt->more(); solidExp.Next() )
5777 const SMDS_MeshElement* vol = volIt->next();
5778 sm1->RemoveElement( vol );
5779 meshDS->SetMeshElementOnShape( vol, solidExp.Current() );
5783 // make other sub-shapes computed
5784 setSubmeshesComputed( theMesh, theShape );
5787 // remove free nodes
5788 //if ( SMESHDS_SubMesh * smDS = meshDS->MeshElements( helper.GetSubShapeID() ))
5790 std::vector< const SMDS_MeshNode* > nodesToRemove;
5791 // get intersection nodes
5792 for ( int iDir = 0; iDir < 3; ++iDir )
5794 vector< GridLine >& lines = grid._lines[ iDir ];
5795 for ( size_t i = 0; i < lines.size(); ++i )
5797 multiset< F_IntersectPoint >::iterator ip = lines[i]._intPoints.begin();
5798 for ( ; ip != lines[i]._intPoints.end(); ++ip )
5799 if ( ip->_node && ip->_node->NbInverseElements() == 0 && !ip->_node->isMarked() )
5801 nodesToRemove.push_back( ip->_node );
5802 ip->_node->setIsMarked( true );
5807 for ( size_t i = 0; i < grid._nodes.size(); ++i )
5808 if ( grid._nodes[i] && grid._nodes[i]->NbInverseElements() == 0 &&
5809 !grid._nodes[i]->isMarked() )
5811 nodesToRemove.push_back( grid._nodes[i] );
5812 grid._nodes[i]->setIsMarked( true );
5816 for ( size_t i = 0; i < nodesToRemove.size(); ++i )
5817 meshDS->RemoveFreeNode( nodesToRemove[i], /*smD=*/0, /*fromGroups=*/false );
5823 // SMESH_ComputeError is not caught at SMESH_submesh level for an unknown reason
5824 catch ( SMESH_ComputeError& e)
5826 return error( SMESH_ComputeErrorPtr( new SMESH_ComputeError( e )));
5831 //=============================================================================
5835 //=============================================================================
5837 bool StdMeshers_Cartesian_3D::Evaluate(SMESH_Mesh & /*theMesh*/,
5838 const TopoDS_Shape & /*theShape*/,
5839 MapShapeNbElems& /*theResMap*/)
5842 // std::vector<int> aResVec(SMDSEntity_Last);
5843 // for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
5844 // if(IsQuadratic) {
5845 // aResVec[SMDSEntity_Quad_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5846 // int nb1d_face0_int = ( nb2d_face0*4 - nb1d ) / 2;
5847 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
5850 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
5851 // aResVec[SMDSEntity_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5853 // SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
5854 // aResMap.insert(std::make_pair(sm,aResVec));
5859 //=============================================================================
5863 * \brief Event listener setting/unsetting _alwaysComputed flag to
5864 * submeshes of inferior levels to prevent their computing
5866 struct _EventListener : public SMESH_subMeshEventListener
5870 _EventListener(const string& algoName):
5871 SMESH_subMeshEventListener(/*isDeletable=*/true,"StdMeshers_Cartesian_3D::_EventListener"),
5874 // --------------------------------------------------------------------------------
5875 // setting/unsetting _alwaysComputed flag to submeshes of inferior levels
5877 static void setAlwaysComputed( const bool isComputed,
5878 SMESH_subMesh* subMeshOfSolid)
5880 SMESH_subMeshIteratorPtr smIt =
5881 subMeshOfSolid->getDependsOnIterator(/*includeSelf=*/false, /*complexShapeFirst=*/false);
5882 while ( smIt->more() )
5884 SMESH_subMesh* sm = smIt->next();
5885 sm->SetIsAlwaysComputed( isComputed );
5887 subMeshOfSolid->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
5890 // --------------------------------------------------------------------------------
5891 // unsetting _alwaysComputed flag if "Cartesian_3D" was removed
5893 virtual void ProcessEvent(const int /*event*/,
5894 const int eventType,
5895 SMESH_subMesh* subMeshOfSolid,
5896 SMESH_subMeshEventListenerData* /*data*/,
5897 const SMESH_Hypothesis* /*hyp*/ = 0)
5899 if ( eventType == SMESH_subMesh::COMPUTE_EVENT )
5901 setAlwaysComputed( subMeshOfSolid->GetComputeState() == SMESH_subMesh::COMPUTE_OK,
5906 SMESH_Algo* algo3D = subMeshOfSolid->GetAlgo();
5907 if ( !algo3D || _algoName != algo3D->GetName() )
5908 setAlwaysComputed( false, subMeshOfSolid );
5912 // --------------------------------------------------------------------------------
5913 // set the event listener
5915 static void SetOn( SMESH_subMesh* subMeshOfSolid, const string& algoName )
5917 subMeshOfSolid->SetEventListener( new _EventListener( algoName ),
5922 }; // struct _EventListener
5926 //================================================================================
5928 * \brief Sets event listener to submeshes if necessary
5929 * \param subMesh - submesh where algo is set
5930 * This method is called when a submesh gets HYP_OK algo_state.
5931 * After being set, event listener is notified on each event of a submesh.
5933 //================================================================================
5935 void StdMeshers_Cartesian_3D::SetEventListener(SMESH_subMesh* subMesh)
5937 _EventListener::SetOn( subMesh, GetName() );
5940 //================================================================================
5942 * \brief Set _alwaysComputed flag to submeshes of inferior levels to avoid their computing
5944 //================================================================================
5946 void StdMeshers_Cartesian_3D::setSubmeshesComputed(SMESH_Mesh& theMesh,
5947 const TopoDS_Shape& theShape)
5949 for ( TopExp_Explorer soExp( theShape, TopAbs_SOLID ); soExp.More(); soExp.Next() )
5950 _EventListener::setAlwaysComputed( true, theMesh.GetSubMesh( soExp.Current() ));