1 // Copyright (C) 2007-2019 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 vector< const SMDS_MeshNode* > _nodes; // mesh nodes at grid nodes
366 vector< const F_IntersectPoint* > _gridIntP; // grid node intersection with geometry
367 ObjectPool< E_IntersectPoint > _edgeIntPool; // intersections with EDGEs
368 ObjectPool< F_IntersectPoint > _extIntPool; // intersections with extended INTERNAL FACEs
369 //list< E_IntersectPoint > _edgeIntP; // intersections with EDGEs
374 bool _toConsiderInternalFaces;
375 bool _toUseThresholdForInternalFaces;
376 double _sizeThreshold;
378 SMESH_MesherHelper* _helper;
380 size_t CellIndex( size_t i, size_t j, size_t k ) const
382 return i + j*(_coords[0].size()-1) + k*(_coords[0].size()-1)*(_coords[1].size()-1);
384 size_t NodeIndex( size_t i, size_t j, size_t k ) const
386 return i + j*_coords[0].size() + k*_coords[0].size()*_coords[1].size();
388 size_t NodeIndexDX() const { return 1; }
389 size_t NodeIndexDY() const { return _coords[0].size(); }
390 size_t NodeIndexDZ() const { return _coords[0].size() * _coords[1].size(); }
392 LineIndexer GetLineIndexer(size_t iDir) const;
394 E_IntersectPoint* Add( const E_IntersectPoint& ip )
396 E_IntersectPoint* eip = _edgeIntPool.getNew();
400 void Remove( E_IntersectPoint* eip ) { _edgeIntPool.destroy( eip ); }
402 TGeomID ShapeID( const TopoDS_Shape& s ) const;
403 const TopoDS_Shape& Shape( TGeomID id ) const;
404 TopAbs_ShapeEnum ShapeType( TGeomID id ) const { return Shape(id).ShapeType(); }
405 void InitGeometry( const TopoDS_Shape& theShape );
406 void InitClassifier( const TopoDS_Shape& mainShape,
407 TopAbs_ShapeEnum shapeType,
408 Controls::ElementsOnShape& classifier );
409 void GetEdgesToImplement( map< TGeomID, vector< TGeomID > > & edge2faceMap,
410 const TopoDS_Shape& shape,
411 const vector< TopoDS_Shape >& faces );
412 void SetSolidFather( const TopoDS_Shape& s, const TopoDS_Shape& theShapeToMesh );
413 bool IsShared( TGeomID faceID ) const;
414 bool IsAnyShared( const std::vector< TGeomID >& faceIDs ) const;
415 bool IsInternal( TGeomID faceID ) const {
416 return ( faceID == PseudoIntExtFaceID() ||
417 Shape( faceID ).Orientation() == TopAbs_INTERNAL ); }
418 bool IsSolid( TGeomID shapeID ) const {
419 if ( _geometry.IsOneSolid() ) return _geometry._soleSolid.ID() == shapeID;
420 else return _geometry._solidByID.count( shapeID ); }
421 bool IsStrangeEdge( TGeomID id ) const { return _geometry._strangeEdges.Contains( id ); }
422 TGeomID PseudoIntExtFaceID() const { return _geometry._extIntFaceID; }
423 Solid* GetSolid( TGeomID solidID = 0 );
424 Solid* GetOneOfSolids( TGeomID solidID );
425 const vector< TGeomID > & GetSolidIDs( TGeomID subShapeID ) const;
426 bool IsCorrectTransition( TGeomID faceID, const Solid* solid );
427 bool IsBoundaryFace( TGeomID face ) const { return _geometry._boundaryFaces.Contains( face ); }
428 void SetOnShape( const SMDS_MeshNode* n, const F_IntersectPoint& ip, bool unset=false );
429 bool IsToCheckNodePos() const { return !_toAddEdges && _toCreateFaces; }
431 void SetCoordinates(const vector<double>& xCoords,
432 const vector<double>& yCoords,
433 const vector<double>& zCoords,
434 const double* axesDirs,
435 const Bnd_Box& bndBox );
436 void ComputeUVW(const gp_XYZ& p, double uvw[3]);
437 void ComputeNodes(SMESH_MesherHelper& helper);
439 // --------------------------------------------------------------------------
441 * \brief Return cells sharing a link
443 struct CellsAroundLink
450 CellsAroundLink( Grid* grid, int iDir ):
451 _dInd{ {0,0,0}, {0,0,0}, {0,0,0}, {0,0,0} },
452 _nbCells{ grid->_coords[0].size() - 1,
453 grid->_coords[1].size() - 1,
454 grid->_coords[2].size() - 1 },
457 const int iDirOther[3][2] = {{ 1,2 },{ 0,2 },{ 0,1 }};
458 _dInd[1][ iDirOther[iDir][0] ] = -1;
459 _dInd[2][ iDirOther[iDir][1] ] = -1;
460 _dInd[3][ iDirOther[iDir][0] ] = -1; _dInd[3][ iDirOther[iDir][1] ] = -1;
462 void Init( int i, int j, int k, int link12 = 0 )
465 _i = i - _dInd[iL][0];
466 _j = j - _dInd[iL][1];
467 _k = k - _dInd[iL][2];
469 bool GetCell( int iL, int& i, int& j, int& k, int& cellIndex )
471 i = _i + _dInd[iL][0];
472 j = _j + _dInd[iL][1];
473 k = _k + _dInd[iL][2];
474 if ( i < 0 || i >= (int)_nbCells[0] ||
475 j < 0 || j >= (int)_nbCells[1] ||
476 k < 0 || k >= (int)_nbCells[2] )
478 cellIndex = _grid->CellIndex( i,j,k );
482 // --------------------------------------------------------------------------
484 * \brief Intersector of TopoDS_Face with all GridLine's
486 struct FaceGridIntersector
492 IntCurvesFace_Intersector* _surfaceInt;
493 vector< std::pair< GridLine*, F_IntersectPoint > > _intersections;
495 FaceGridIntersector(): _grid(0), _surfaceInt(0) {}
498 void StoreIntersections()
500 for ( size_t i = 0; i < _intersections.size(); ++i )
502 multiset< F_IntersectPoint >::iterator ip =
503 _intersections[i].first->_intPoints.insert( _intersections[i].second );
504 ip->_faceIDs.reserve( 1 );
505 ip->_faceIDs.push_back( _faceID );
508 const Bnd_Box& GetFaceBndBox()
510 GetCurveFaceIntersector();
513 IntCurvesFace_Intersector* GetCurveFaceIntersector()
517 _surfaceInt = new IntCurvesFace_Intersector( _face, Precision::PConfusion() );
518 _bndBox = _surfaceInt->Bounding();
519 if ( _bndBox.IsVoid() )
520 BRepBndLib::Add (_face, _bndBox);
524 bool IsThreadSafe(set< const Standard_Transient* >& noSafeTShapes) const;
526 // --------------------------------------------------------------------------
528 * \brief Intersector of a surface with a GridLine
530 struct FaceLineIntersector
533 double _u, _v, _w; // params on the face and the line
534 Transition _transition; // transition at intersection (see IntCurveSurface.cdl)
535 Transition _transIn, _transOut; // IN and OUT transitions depending of face orientation
538 gp_Cylinder _cylinder;
542 IntCurvesFace_Intersector* _surfaceInt;
544 vector< F_IntersectPoint > _intPoints;
546 void IntersectWithPlane (const GridLine& gridLine);
547 void IntersectWithCylinder(const GridLine& gridLine);
548 void IntersectWithCone (const GridLine& gridLine);
549 void IntersectWithSphere (const GridLine& gridLine);
550 void IntersectWithTorus (const GridLine& gridLine);
551 void IntersectWithSurface (const GridLine& gridLine);
553 bool UVIsOnFace() const;
554 void addIntPoint(const bool toClassify=true);
555 bool isParamOnLineOK( const double linLength )
557 return -_tol < _w && _w < linLength + _tol;
559 FaceLineIntersector():_surfaceInt(0) {}
560 ~FaceLineIntersector() { if (_surfaceInt ) delete _surfaceInt; _surfaceInt = 0; }
562 // --------------------------------------------------------------------------
564 * \brief Class representing topology of the hexahedron and creating a mesh
565 * volume basing on analysis of hexahedron intersection with geometry
569 // --------------------------------------------------------------------------------
572 enum IsInternalFlag { IS_NOT_INTERNAL, IS_INTERNAL, IS_CUT_BY_INTERNAL_FACE };
573 // --------------------------------------------------------------------------------
574 struct _Node //!< node either at a hexahedron corner or at intersection
576 const SMDS_MeshNode* _node; // mesh node at hexahedron corner
577 const B_IntersectPoint* _intPoint;
578 const _Face* _usedInFace;
579 char _isInternalFlags;
581 _Node(const SMDS_MeshNode* n=0, const B_IntersectPoint* ip=0)
582 :_node(n), _intPoint(ip), _usedInFace(0), _isInternalFlags(0) {}
583 const SMDS_MeshNode* Node() const
584 { return ( _intPoint && _intPoint->_node ) ? _intPoint->_node : _node; }
585 const E_IntersectPoint* EdgeIntPnt() const
586 { return static_cast< const E_IntersectPoint* >( _intPoint ); }
587 const F_IntersectPoint* FaceIntPnt() const
588 { return static_cast< const F_IntersectPoint* >( _intPoint ); }
589 const vector< TGeomID >& faces() const { return _intPoint->_faceIDs; }
590 TGeomID face(size_t i) const { return _intPoint->_faceIDs[ i ]; }
591 void SetInternal( IsInternalFlag intFlag ) { _isInternalFlags |= intFlag; }
592 bool IsCutByInternal() const { return _isInternalFlags & IS_CUT_BY_INTERNAL_FACE; }
593 bool IsUsedInFace( const _Face* polygon = 0 )
595 return polygon ? ( _usedInFace == polygon ) : bool( _usedInFace );
597 TGeomID IsLinked( const B_IntersectPoint* other,
598 TGeomID avoidFace=-1 ) const // returns id of a common face
600 return _intPoint ? _intPoint->HasCommonFace( other, avoidFace ) : 0;
602 bool IsOnFace( TGeomID faceID ) const // returns true if faceID is found
604 return _intPoint ? _intPoint->IsOnFace( faceID ) : false;
608 if ( const SMDS_MeshNode* n = Node() )
609 return SMESH_NodeXYZ( n );
610 if ( const E_IntersectPoint* eip =
611 dynamic_cast< const E_IntersectPoint* >( _intPoint ))
613 return gp_Pnt( 1e100, 0, 0 );
615 TGeomID ShapeID() const
617 if ( const E_IntersectPoint* eip = dynamic_cast< const E_IntersectPoint* >( _intPoint ))
618 return eip->_shapeID;
621 void Add( const E_IntersectPoint* ip )
623 // Possible cases before Add(ip):
624 /// 1) _node != 0 --> _Node at hex corner ( _intPoint == 0 || _intPoint._node == 0 )
625 /// 2) _node == 0 && _intPoint._node != 0 --> link intersected by FACE
626 /// 3) _node == 0 && _intPoint._node == 0 --> _Node at EDGE intersection
628 // If ip is added in cases 1) and 2) _node position must be changed to ip._shapeID
629 // at creation of elements
630 // To recognize this case, set _intPoint._node = Node()
631 const SMDS_MeshNode* node = Node();
636 ip->Add( _intPoint->_faceIDs );
640 _node = _intPoint->_node = node;
643 // --------------------------------------------------------------------------------
644 struct _Link // link connecting two _Node's
647 _Face* _faces[2]; // polygons sharing a link
648 vector< const F_IntersectPoint* > _fIntPoints; // GridLine intersections with FACEs
649 vector< _Node* > _fIntNodes; // _Node's at _fIntPoints
650 vector< _Link > _splits;
651 _Link(): _faces{ 0, 0 } {}
653 // --------------------------------------------------------------------------------
658 _OrientedLink( _Link* link=0, bool reverse=false ): _link(link), _reverse(reverse) {}
659 void Reverse() { _reverse = !_reverse; }
660 int NbResultLinks() const { return _link->_splits.size(); }
661 _OrientedLink ResultLink(int i) const
663 return _OrientedLink(&_link->_splits[_reverse ? NbResultLinks()-i-1 : i],_reverse);
665 _Node* FirstNode() const { return _link->_nodes[ _reverse ]; }
666 _Node* LastNode() const { return _link->_nodes[ !_reverse ]; }
667 operator bool() const { return _link; }
668 vector< TGeomID > GetNotUsedFace(const set<TGeomID>& usedIDs ) const // returns supporting FACEs
670 vector< TGeomID > faces;
671 const B_IntersectPoint *ip0, *ip1;
672 if (( ip0 = _link->_nodes[0]->_intPoint ) &&
673 ( ip1 = _link->_nodes[1]->_intPoint ))
675 for ( size_t i = 0; i < ip0->_faceIDs.size(); ++i )
676 if ( ip1->IsOnFace ( ip0->_faceIDs[i] ) &&
677 !usedIDs.count( ip0->_faceIDs[i] ) )
678 faces.push_back( ip0->_faceIDs[i] );
682 bool HasEdgeNodes() const
684 return ( dynamic_cast< const E_IntersectPoint* >( _link->_nodes[0]->_intPoint ) ||
685 dynamic_cast< const E_IntersectPoint* >( _link->_nodes[1]->_intPoint ));
689 return !_link->_faces[0] ? 0 : 1 + bool( _link->_faces[1] );
691 void AddFace( _Face* f )
693 if ( _link->_faces[0] )
695 _link->_faces[1] = f;
699 _link->_faces[0] = f;
700 _link->_faces[1] = 0;
703 void RemoveFace( _Face* f )
705 if ( !_link->_faces[0] ) return;
707 if ( _link->_faces[1] == f )
709 _link->_faces[1] = 0;
711 else if ( _link->_faces[0] == f )
713 _link->_faces[0] = 0;
714 if ( _link->_faces[1] )
716 _link->_faces[0] = _link->_faces[1];
717 _link->_faces[1] = 0;
722 // --------------------------------------------------------------------------------
723 struct _SplitIterator //! set to _hexLinks splits on one side of INTERNAL FACEs
725 struct _Split // data of a link split
727 int _linkID; // hex link ID
729 int _iCheckIteration; // iteration where split is tried as Hexahedron split
730 _Link* _checkedSplit; // split set to hex links
731 bool _isUsed; // used in a volume
733 _Split( _Link & split, int iLink ):
734 _linkID( iLink ), _nodes{ split._nodes[0], split._nodes[1] },
735 _iCheckIteration( 0 ), _isUsed( false )
737 bool IsCheckedOrUsed( bool used ) const { return used ? _isUsed : _iCheckIteration > 0; }
740 std::vector< _Split > _splits;
744 std::vector< _Node* > _freeNodes; // nodes reached while composing a split set
746 _SplitIterator( _Link* hexLinks ):
747 _hexLinks( hexLinks ), _iterationNb(0), _nbChecked(0), _nbUsed(0)
749 _freeNodes.reserve( 12 );
750 _splits.reserve( 24 );
751 for ( int iL = 0; iL < 12; ++iL )
752 for ( size_t iS = 0; iS < _hexLinks[ iL ]._splits.size(); ++iS )
753 _splits.emplace_back( _hexLinks[ iL ]._splits[ iS ], iL );
756 bool More() const { return _nbUsed < _splits.size(); }
759 // --------------------------------------------------------------------------------
762 vector< _OrientedLink > _links; // links on GridLine's
763 vector< _Link > _polyLinks; // links added to close a polygonal face
764 vector< _Node* > _eIntNodes; // nodes at intersection with EDGEs
765 bool IsPolyLink( const _OrientedLink& ol )
767 return _polyLinks.empty() ? false :
768 ( &_polyLinks[0] <= ol._link && ol._link <= &_polyLinks.back() );
770 void AddPolyLink(_Node* n0, _Node* n1, _Face* faceToFindEqual=0)
772 if ( faceToFindEqual && faceToFindEqual != this ) {
773 for ( size_t iL = 0; iL < faceToFindEqual->_polyLinks.size(); ++iL )
774 if ( faceToFindEqual->_polyLinks[iL]._nodes[0] == n1 &&
775 faceToFindEqual->_polyLinks[iL]._nodes[1] == n0 )
778 ( _OrientedLink( & faceToFindEqual->_polyLinks[iL], /*reverse=*/true ));
785 _polyLinks.push_back( l );
786 _links.push_back( _OrientedLink( &_polyLinks.back() ));
789 // --------------------------------------------------------------------------------
790 struct _volumeDef // holder of nodes of a volume mesh element
794 const SMDS_MeshNode* _node; // mesh node at hexahedron corner
795 const B_IntersectPoint* _intPoint;
797 _nodeDef( _Node* n ): _node( n->_node), _intPoint( n->_intPoint ) {}
798 const SMDS_MeshNode* Node() const
799 { return ( _intPoint && _intPoint->_node ) ? _intPoint->_node : _node; }
800 const E_IntersectPoint* EdgeIntPnt() const
801 { return static_cast< const E_IntersectPoint* >( _intPoint ); }
803 vector< _nodeDef > _nodes;
804 vector< int > _quantities;
805 _volumeDef* _next; // to store several _volumeDefs in a chain
807 const SMDS_MeshElement* _volume; // new volume
809 _volumeDef(): _next(0), _solidID(0), _volume(0) {}
810 ~_volumeDef() { delete _next; }
811 _volumeDef( _volumeDef& other ):
812 _next(0), _solidID( other._solidID ), _volume( other._volume )
813 { _nodes.swap( other._nodes ); _quantities.swap( other._quantities ); other._volume = 0; }
815 void Set( const vector< _Node* >& nodes, const vector< int >& quant = vector< int >() )
816 { _nodes.assign( nodes.begin(), nodes.end() ); _quantities = quant; }
818 void Set( _Node** nodes, int nb )
819 { _nodes.assign( nodes, nodes + nb ); }
821 void SetNext( _volumeDef* vd )
822 { if ( _next ) { _next->SetNext( vd ); } else { _next = vd; }}
825 // topology of a hexahedron
828 _Link _hexLinks [12];
831 // faces resulted from hexahedron intersection
832 vector< _Face > _polygons;
834 // intresections with EDGEs
835 vector< const E_IntersectPoint* > _eIntPoints;
837 // additional nodes created at intersection points
838 vector< _Node > _intNodes;
840 // nodes inside the hexahedron (at VERTEXes)
841 vector< _Node* > _vIntNodes;
843 // computed volume elements
844 _volumeDef _volumeDefs;
847 double _sideLength[3];
848 int _nbCornerNodes, _nbFaceIntNodes, _nbBndNodes;
849 int _origNodeInd; // index of _hexNodes[0] node within the _grid
858 Hexahedron(Grid* grid);
859 int MakeElements(SMESH_MesherHelper& helper,
860 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap);
861 void ComputeElements( const Solid* solid = 0, int solidIndex = -1 );
864 Hexahedron(const Hexahedron& other, size_t i, size_t j, size_t k, int cellID );
865 void init( size_t i, size_t j, size_t k, const Solid* solid=0 );
866 void init( size_t i );
867 void setIJK( size_t i );
868 bool compute( const Solid* solid, const IsInternalFlag intFlag );
869 vector< TGeomID > getSolids();
870 bool isCutByInternalFace( IsInternalFlag & maxFlag );
871 void addEdges(SMESH_MesherHelper& helper,
872 vector< Hexahedron* >& intersectedHex,
873 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap);
874 gp_Pnt findIntPoint( double u1, double proj1, double u2, double proj2,
875 double proj, BRepAdaptor_Curve& curve,
876 const gp_XYZ& axis, const gp_XYZ& origin );
877 int getEntity( const E_IntersectPoint* ip, int* facets, int& sub );
878 bool addIntersection( const E_IntersectPoint* ip,
879 vector< Hexahedron* >& hexes,
880 int ijk[], int dIJK[] );
881 bool findChain( _Node* n1, _Node* n2, _Face& quad, vector<_Node*>& chainNodes );
882 bool closePolygon( _Face* polygon, vector<_Node*>& chainNodes ) const;
883 bool findChainOnEdge( const vector< _OrientedLink >& splits,
884 const _OrientedLink& prevSplit,
885 const _OrientedLink& avoidSplit,
888 vector<_Node*>& chn);
889 int addVolumes(SMESH_MesherHelper& helper );
890 void addFaces( SMESH_MesherHelper& helper,
891 const vector< const SMDS_MeshElement* > & boundaryVolumes );
892 void addSegments( SMESH_MesherHelper& helper,
893 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap );
894 void getVolumes( vector< const SMDS_MeshElement* > & volumes );
895 void getBoundaryElems( vector< const SMDS_MeshElement* > & boundaryVolumes );
896 TGeomID getAnyFace() const;
897 void cutByExtendedInternal( std::vector< Hexahedron* >& hexes,
898 const TColStd_MapOfInteger& intEdgeIDs );
899 gp_Pnt mostDistantInternalPnt( int hexIndex, const gp_Pnt& p1, const gp_Pnt& p2 );
900 bool isOutPoint( _Link& link, int iP, SMESH_MesherHelper& helper, const Solid* solid ) const;
901 void sortVertexNodes(vector<_Node*>& nodes, _Node* curNode, TGeomID face);
902 bool isInHole() const;
903 bool hasStrangeEdge() const;
904 bool checkPolyhedronSize( bool isCutByInternalFace ) const;
909 bool debugDumpLink( _Link* link );
910 _Node* findEqualNode( vector< _Node* >& nodes,
911 const E_IntersectPoint* ip,
914 for ( size_t i = 0; i < nodes.size(); ++i )
915 if ( nodes[i]->EdgeIntPnt() == ip ||
916 nodes[i]->Point().SquareDistance( ip->_point ) <= tol2 )
920 bool isImplementEdges() const { return _grid->_edgeIntPool.nbElements(); }
921 bool isOutParam(const double uvw[3]) const;
923 typedef boost::container::flat_map< TGeomID, size_t > TID2Nb;
924 static void insertAndIncrement( TGeomID id, TID2Nb& id2nbMap )
926 TID2Nb::value_type s0( id, 0 );
927 TID2Nb::iterator id2nb = id2nbMap.insert( s0 ).first;
933 // --------------------------------------------------------------------------
935 * \brief Hexahedron computing volumes in one thread
937 struct ParallelHexahedron
939 vector< Hexahedron* >& _hexVec;
940 ParallelHexahedron( vector< Hexahedron* >& hv ): _hexVec(hv) {}
941 void operator() ( const tbb::blocked_range<size_t>& r ) const
943 for ( size_t i = r.begin(); i != r.end(); ++i )
944 if ( Hexahedron* hex = _hexVec[ i ] )
945 hex->ComputeElements();
948 // --------------------------------------------------------------------------
950 * \brief Structure intersecting certain nb of faces with GridLine's in one thread
952 struct ParallelIntersector
954 vector< FaceGridIntersector >& _faceVec;
955 ParallelIntersector( vector< FaceGridIntersector >& faceVec): _faceVec(faceVec){}
956 void operator() ( const tbb::blocked_range<size_t>& r ) const
958 for ( size_t i = r.begin(); i != r.end(); ++i )
959 _faceVec[i].Intersect();
964 //=============================================================================
965 // Implementation of internal utils
966 //=============================================================================
968 * \brief adjust \a i to have \a val between values[i] and values[i+1]
970 inline void locateValue( int & i, double val, const vector<double>& values,
971 int& di, double tol )
973 //val += values[0]; // input \a val is measured from 0.
974 if ( i > (int) values.size()-2 )
977 while ( i+2 < (int) values.size() && val > values[ i+1 ])
979 while ( i > 0 && val < values[ i ])
982 if ( i > 0 && val - values[ i ] < tol )
984 else if ( i+2 < (int) values.size() && values[ i+1 ] - val < tol )
989 //=============================================================================
991 * Remove coincident intersection points
993 void GridLine::RemoveExcessIntPoints( const double tol )
995 if ( _intPoints.size() < 2 ) return;
997 set< Transition > tranSet;
998 multiset< F_IntersectPoint >::iterator ip1, ip2 = _intPoints.begin();
999 while ( ip2 != _intPoints.end() )
1003 while ( ip2 != _intPoints.end() && ip2->_paramOnLine - ip1->_paramOnLine <= tol )
1005 tranSet.insert( ip1->_transition );
1006 tranSet.insert( ip2->_transition );
1007 ip2->Add( ip1->_faceIDs );
1008 _intPoints.erase( ip1 );
1011 if ( tranSet.size() > 1 ) // points with different transition coincide
1013 bool isIN = tranSet.count( Trans_IN );
1014 bool isOUT = tranSet.count( Trans_OUT );
1015 if ( isIN && isOUT )
1016 (*ip1)._transition = Trans_TANGENT;
1018 (*ip1)._transition = isIN ? Trans_IN : Trans_OUT;
1022 //================================================================================
1024 * Return ID of SOLID for nodes before the given intersection point
1026 TGeomID GridLine::GetSolidIDBefore( multiset< F_IntersectPoint >::iterator ip,
1027 const TGeomID prevID,
1028 const Geometry& geom )
1030 if ( ip == _intPoints.begin() )
1033 if ( geom.IsOneSolid() )
1036 switch ( ip->_transition ) {
1037 case Trans_IN: isOut = true; break;
1038 case Trans_OUT: isOut = false; break;
1039 case Trans_TANGENT: isOut = ( prevID == 0 ); break;
1042 // singularity point (apex of a cone)
1043 multiset< F_IntersectPoint >::iterator ipBef = ip, ipAft = ++ip;
1044 if ( ipAft == _intPoints.end() )
1049 if ( ipBef->_transition != ipAft->_transition )
1050 isOut = ( ipBef->_transition == Trans_OUT );
1052 isOut = ( ipBef->_transition != Trans_OUT );
1056 case Trans_INTERNAL: isOut = false;
1059 return isOut ? 0 : geom._soleSolid.ID();
1062 const vector< TGeomID >& solids = geom._solidIDsByShapeID[ ip->_faceIDs[ 0 ]];
1065 if ( ip->_transition == Trans_INTERNAL )
1068 const vector< TGeomID >& solidsBef = geom._solidIDsByShapeID[ ip->_faceIDs[ 0 ]];
1070 if ( ip->_transition == Trans_IN ||
1071 ip->_transition == Trans_OUT )
1073 if ( solidsBef.size() == 1 )
1074 return ( solidsBef[0] == prevID ) ? 0 : solidsBef[0];
1076 return solidsBef[ solidsBef[0] == prevID ];
1079 if ( solidsBef.size() == 1 )
1080 return solidsBef[0];
1082 for ( size_t i = 0; i < solids.size(); ++i )
1084 vector< TGeomID >::const_iterator it =
1085 std::find( solidsBef.begin(), solidsBef.end(), solids[i] );
1086 if ( it != solidsBef.end() )
1091 //================================================================================
1095 void B_IntersectPoint::Add( const vector< TGeomID >& fIDs,
1096 const SMDS_MeshNode* n) const
1098 if ( _faceIDs.empty() )
1101 for ( size_t i = 0; i < fIDs.size(); ++i )
1103 vector< TGeomID >::iterator it =
1104 std::find( _faceIDs.begin(), _faceIDs.end(), fIDs[i] );
1105 if ( it == _faceIDs.end() )
1106 _faceIDs.push_back( fIDs[i] );
1111 //================================================================================
1113 * Returns index of a common face if any, else zero
1115 int B_IntersectPoint::HasCommonFace( const B_IntersectPoint * other, int avoidFace ) const
1118 for ( size_t i = 0; i < other->_faceIDs.size(); ++i )
1119 if ( avoidFace != other->_faceIDs[i] &&
1120 IsOnFace ( other->_faceIDs[i] ))
1121 return other->_faceIDs[i];
1124 //================================================================================
1126 * Returns \c true if \a faceID in in this->_faceIDs
1128 bool B_IntersectPoint::IsOnFace( int faceID ) const // returns true if faceID is found
1130 vector< TGeomID >::const_iterator it =
1131 std::find( _faceIDs.begin(), _faceIDs.end(), faceID );
1132 return ( it != _faceIDs.end() );
1134 //================================================================================
1136 * OneOfSolids initialization
1138 void OneOfSolids::Init( const TopoDS_Shape& solid,
1139 TopAbs_ShapeEnum subType,
1140 const SMESHDS_Mesh* mesh )
1142 SetID( mesh->ShapeToIndex( solid ));
1144 if ( subType == TopAbs_FACE )
1145 SetHasInternalFaces( false );
1147 for ( TopExp_Explorer sub( solid, subType ); sub.More(); sub.Next() )
1149 _subIDs.Add( mesh->ShapeToIndex( sub.Current() ));
1150 if ( subType == TopAbs_FACE )
1152 _faces.Add( sub.Current() );
1153 if ( sub.Current().Orientation() == TopAbs_INTERNAL )
1154 SetHasInternalFaces( true );
1156 TGeomID faceID = mesh->ShapeToIndex( sub.Current() );
1157 if ( sub.Current().Orientation() == TopAbs_INTERNAL ||
1158 sub.Current().Orientation() == mesh->IndexToShape( faceID ).Orientation() )
1159 _outFaceIDs.Add( faceID );
1163 //================================================================================
1165 * Return an iterator on GridLine's in a given direction
1167 LineIndexer Grid::GetLineIndexer(size_t iDir) const
1169 const size_t indices[] = { 1,2,0, 0,2,1, 0,1,2 };
1170 const string s [] = { "X", "Y", "Z" };
1171 LineIndexer li( _coords[0].size(), _coords[1].size(), _coords[2].size(),
1172 indices[iDir*3], indices[iDir*3+1], indices[iDir*3+2],
1173 s[indices[iDir*3]], s[indices[iDir*3+1]], s[indices[iDir*3+2]]);
1176 //=============================================================================
1178 * Creates GridLine's of the grid
1180 void Grid::SetCoordinates(const vector<double>& xCoords,
1181 const vector<double>& yCoords,
1182 const vector<double>& zCoords,
1183 const double* axesDirs,
1184 const Bnd_Box& shapeBox)
1186 _coords[0] = xCoords;
1187 _coords[1] = yCoords;
1188 _coords[2] = zCoords;
1190 _axes[0].SetCoord( axesDirs[0],
1193 _axes[1].SetCoord( axesDirs[3],
1196 _axes[2].SetCoord( axesDirs[6],
1199 _axes[0].Normalize();
1200 _axes[1].Normalize();
1201 _axes[2].Normalize();
1203 _invB.SetCols( _axes[0], _axes[1], _axes[2] );
1206 // compute tolerance
1207 _minCellSize = Precision::Infinite();
1208 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1210 for ( size_t i = 1; i < _coords[ iDir ].size(); ++i )
1212 double cellLen = _coords[ iDir ][ i ] - _coords[ iDir ][ i-1 ];
1213 if ( cellLen < _minCellSize )
1214 _minCellSize = cellLen;
1217 if ( _minCellSize < Precision::Confusion() )
1218 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1219 SMESH_Comment("Too small cell size: ") << _minCellSize );
1220 _tol = _minCellSize / 1000.;
1222 // attune grid extremities to shape bounding box
1224 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
1225 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
1226 double* cP[6] = { &_coords[0].front(), &_coords[1].front(), &_coords[2].front(),
1227 &_coords[0].back(), &_coords[1].back(), &_coords[2].back() };
1228 for ( int i = 0; i < 6; ++i )
1229 if ( fabs( sP[i] - *cP[i] ) < _tol )
1230 *cP[i] = sP[i];// + _tol/1000. * ( i < 3 ? +1 : -1 );
1232 for ( int iDir = 0; iDir < 3; ++iDir )
1234 if ( _coords[iDir][0] - sP[iDir] > _tol )
1236 _minCellSize = Min( _minCellSize, _coords[iDir][0] - sP[iDir] );
1237 _coords[iDir].insert( _coords[iDir].begin(), sP[iDir] + _tol/1000.);
1239 if ( sP[iDir+3] - _coords[iDir].back() > _tol )
1241 _minCellSize = Min( _minCellSize, sP[iDir+3] - _coords[iDir].back() );
1242 _coords[iDir].push_back( sP[iDir+3] - _tol/1000.);
1245 _tol = _minCellSize / 1000.;
1247 _origin = ( _coords[0][0] * _axes[0] +
1248 _coords[1][0] * _axes[1] +
1249 _coords[2][0] * _axes[2] );
1252 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1254 LineIndexer li = GetLineIndexer( iDir );
1255 _lines[iDir].resize( li.NbLines() );
1256 double len = _coords[ iDir ].back() - _coords[iDir].front();
1257 for ( ; li.More(); ++li )
1259 GridLine& gl = _lines[iDir][ li.LineIndex() ];
1260 gl._line.SetLocation( _coords[0][li.I()] * _axes[0] +
1261 _coords[1][li.J()] * _axes[1] +
1262 _coords[2][li.K()] * _axes[2] );
1263 gl._line.SetDirection( _axes[ iDir ]);
1268 //================================================================================
1270 * Return local ID of shape
1272 TGeomID Grid::ShapeID( const TopoDS_Shape& s ) const
1274 return _helper->GetMeshDS()->ShapeToIndex( s );
1276 //================================================================================
1278 * Return a shape by its local ID
1280 const TopoDS_Shape& Grid::Shape( TGeomID id ) const
1282 return _helper->GetMeshDS()->IndexToShape( id );
1284 //================================================================================
1286 * Initialize _geometry
1288 void Grid::InitGeometry( const TopoDS_Shape& theShapeToMesh )
1290 SMESH_Mesh* mesh = _helper->GetMesh();
1292 _geometry._mainShape = theShapeToMesh;
1293 _geometry._extIntFaceID = mesh->GetMeshDS()->MaxShapeIndex() * 100;
1294 _geometry._soleSolid.SetID( 0 );
1295 _geometry._soleSolid.SetHasInternalFaces( false );
1297 InitClassifier( theShapeToMesh, TopAbs_VERTEX, _geometry._vertexClassifier );
1298 InitClassifier( theShapeToMesh, TopAbs_EDGE , _geometry._edgeClassifier );
1300 TopExp_Explorer solidExp( theShapeToMesh, TopAbs_SOLID );
1302 bool isSeveralSolids = false;
1303 if ( _toConsiderInternalFaces ) // check nb SOLIDs
1306 isSeveralSolids = solidExp.More();
1307 _toConsiderInternalFaces = isSeveralSolids;
1310 if ( !isSeveralSolids ) // look for an internal FACE
1312 TopExp_Explorer fExp( theShapeToMesh, TopAbs_FACE );
1313 for ( ; fExp.More() && !_toConsiderInternalFaces; fExp.Next() )
1314 _toConsiderInternalFaces = ( fExp.Current().Orientation() == TopAbs_INTERNAL );
1316 _geometry._soleSolid.SetHasInternalFaces( _toConsiderInternalFaces );
1317 _geometry._soleSolid.SetID( ShapeID( solidExp.Current() ));
1319 else // fill Geometry::_solidByID
1321 for ( ; solidExp.More(); solidExp.Next() )
1323 OneOfSolids & solid = _geometry._solidByID[ ShapeID( solidExp.Current() )];
1324 solid.Init( solidExp.Current(), TopAbs_FACE, mesh->GetMeshDS() );
1325 solid.Init( solidExp.Current(), TopAbs_EDGE, mesh->GetMeshDS() );
1326 solid.Init( solidExp.Current(), TopAbs_VERTEX, mesh->GetMeshDS() );
1332 _geometry._soleSolid.SetID( ShapeID( solidExp.Current() ));
1335 if ( !_toCreateFaces )
1337 int nbSolidsGlobal = _helper->Count( mesh->GetShapeToMesh(), TopAbs_SOLID, false );
1338 int nbSolidsLocal = _helper->Count( theShapeToMesh, TopAbs_SOLID, false );
1339 _toCreateFaces = ( nbSolidsLocal < nbSolidsGlobal );
1342 TopTools_IndexedMapOfShape faces;
1343 if ( _toCreateFaces || isSeveralSolids )
1344 TopExp::MapShapes( theShapeToMesh, TopAbs_FACE, faces );
1346 // find boundary FACEs on boundary of mesh->ShapeToMesh()
1347 if ( _toCreateFaces )
1348 for ( int i = 1; i <= faces.Size(); ++i )
1349 if ( faces(i).Orientation() != TopAbs_INTERNAL &&
1350 _helper->NbAncestors( faces(i), *mesh, TopAbs_SOLID ) == 1 )
1352 _geometry._boundaryFaces.Add( ShapeID( faces(i) ));
1355 if ( isSeveralSolids )
1356 for ( int i = 1; i <= faces.Size(); ++i )
1358 SetSolidFather( faces(i), theShapeToMesh );
1359 for ( TopExp_Explorer eExp( faces(i), TopAbs_EDGE ); eExp.More(); eExp.Next() )
1361 const TopoDS_Edge& edge = TopoDS::Edge( eExp.Current() );
1362 SetSolidFather( edge, theShapeToMesh );
1363 SetSolidFather( _helper->IthVertex( 0, edge ), theShapeToMesh );
1364 SetSolidFather( _helper->IthVertex( 1, edge ), theShapeToMesh );
1369 //================================================================================
1371 * Store ID of SOLID as father of its child shape ID
1373 void Grid::SetSolidFather( const TopoDS_Shape& s, const TopoDS_Shape& theShapeToMesh )
1375 if ( _geometry._solidIDsByShapeID.empty() )
1376 _geometry._solidIDsByShapeID.resize( _helper->GetMeshDS()->MaxShapeIndex() + 1 );
1378 vector< TGeomID > & solidIDs = _geometry._solidIDsByShapeID[ ShapeID( s )];
1379 if ( !solidIDs.empty() )
1381 solidIDs.reserve(2);
1382 PShapeIteratorPtr solidIt = _helper->GetAncestors( s,
1383 *_helper->GetMesh(),
1386 while ( const TopoDS_Shape* solid = solidIt->next() )
1387 solidIDs.push_back( ShapeID( *solid ));
1389 //================================================================================
1391 * Return IDs of solids given sub-shape belongs to
1393 const vector< TGeomID > & Grid::GetSolidIDs( TGeomID subShapeID ) const
1395 return _geometry._solidIDsByShapeID[ subShapeID ];
1397 //================================================================================
1399 * Check if a sub-shape belongs to several SOLIDs
1401 bool Grid::IsShared( TGeomID shapeID ) const
1403 return !_geometry.IsOneSolid() && ( _geometry._solidIDsByShapeID[ shapeID ].size() > 1 );
1405 //================================================================================
1407 * Check if any of FACEs belongs to several SOLIDs
1409 bool Grid::IsAnyShared( const std::vector< TGeomID >& faceIDs ) const
1411 for ( size_t i = 0; i < faceIDs.size(); ++i )
1412 if ( IsShared( faceIDs[ i ]))
1416 //================================================================================
1418 * Return Solid by ID
1420 Solid* Grid::GetSolid( TGeomID solidID )
1422 if ( !solidID || _geometry.IsOneSolid() || _geometry._solidByID.empty() )
1423 return & _geometry._soleSolid;
1425 return & _geometry._solidByID[ solidID ];
1427 //================================================================================
1429 * Return OneOfSolids by ID
1431 Solid* Grid::GetOneOfSolids( TGeomID solidID )
1433 map< TGeomID, OneOfSolids >::iterator is2s = _geometry._solidByID.find( solidID );
1434 if ( is2s != _geometry._solidByID.end() )
1435 return & is2s->second;
1437 return & _geometry._soleSolid;
1439 //================================================================================
1441 * Check if transition on given FACE is correct for a given SOLID
1443 bool Grid::IsCorrectTransition( TGeomID faceID, const Solid* solid )
1445 if ( _geometry.IsOneSolid() )
1448 const vector< TGeomID >& solidIDs = _geometry._solidIDsByShapeID[ faceID ];
1449 return solidIDs[0] == solid->ID();
1452 //================================================================================
1454 * Assign to geometry a node at FACE intersection
1456 void Grid::SetOnShape( const SMDS_MeshNode* n, const F_IntersectPoint& ip, bool unset )
1459 SMESHDS_Mesh* mesh = _helper->GetMeshDS();
1460 if ( ip._faceIDs.size() == 1 )
1462 mesh->SetNodeOnFace( n, ip._faceIDs[0], ip._u, ip._v );
1464 else if ( _geometry._vertexClassifier.IsSatisfy( n, &s ))
1466 if ( unset ) mesh->UnSetNodeOnShape( n );
1467 mesh->SetNodeOnVertex( n, TopoDS::Vertex( s ));
1469 else if ( _geometry._edgeClassifier.IsSatisfy( n, &s ))
1471 if ( unset ) mesh->UnSetNodeOnShape( n );
1472 mesh->SetNodeOnEdge( n, TopoDS::Edge( s ));
1474 else if ( ip._faceIDs.size() > 0 )
1476 mesh->SetNodeOnFace( n, ip._faceIDs[0], ip._u, ip._v );
1478 else if ( !unset && _geometry.IsOneSolid() )
1480 mesh->SetNodeInVolume( n, _geometry._soleSolid.ID() );
1483 //================================================================================
1485 * Initialize a classifier
1487 void Grid::InitClassifier( const TopoDS_Shape& mainShape,
1488 TopAbs_ShapeEnum shapeType,
1489 Controls::ElementsOnShape& classifier )
1491 TopTools_IndexedMapOfShape shapes;
1492 TopExp::MapShapes( mainShape, shapeType, shapes );
1494 TopoDS_Compound compound; BRep_Builder builder;
1495 builder.MakeCompound( compound );
1496 for ( int i = 1; i <= shapes.Size(); ++i )
1497 builder.Add( compound, shapes(i) );
1499 classifier.SetMesh( _helper->GetMeshDS() );
1500 //classifier.SetTolerance( _tol ); // _tol is not initialised
1501 classifier.SetShape( compound, SMDSAbs_Node );
1504 //================================================================================
1506 * Return EDGEs with FACEs to implement into the mesh
1508 void Grid::GetEdgesToImplement( map< TGeomID, vector< TGeomID > > & edge2faceIDsMap,
1509 const TopoDS_Shape& shape,
1510 const vector< TopoDS_Shape >& faces )
1512 // check if there are strange EDGEs
1513 TopTools_IndexedMapOfShape faceMap;
1514 TopExp::MapShapes( _helper->GetMesh()->GetShapeToMesh(), TopAbs_FACE, faceMap );
1515 int nbFacesGlobal = faceMap.Size();
1516 faceMap.Clear( false );
1517 TopExp::MapShapes( shape, TopAbs_FACE, faceMap );
1518 int nbFacesLocal = faceMap.Size();
1519 bool hasStrangeEdges = ( nbFacesGlobal > nbFacesLocal );
1520 if ( !_toAddEdges && !hasStrangeEdges )
1521 return; // no FACEs in contact with those meshed by other algo
1523 for ( size_t i = 0; i < faces.size(); ++i )
1525 _helper->SetSubShape( faces[i] );
1526 for ( TopExp_Explorer eExp( faces[i], TopAbs_EDGE ); eExp.More(); eExp.Next() )
1528 const TopoDS_Edge& edge = TopoDS::Edge( eExp.Current() );
1529 if ( hasStrangeEdges )
1531 bool hasStrangeFace = false;
1532 PShapeIteratorPtr faceIt = _helper->GetAncestors( edge, *_helper->GetMesh(), TopAbs_FACE);
1533 while ( const TopoDS_Shape* face = faceIt->next() )
1534 if (( hasStrangeFace = !faceMap.Contains( *face )))
1536 if ( !hasStrangeFace && !_toAddEdges )
1538 _geometry._strangeEdges.Add( ShapeID( edge ));
1539 _geometry._strangeEdges.Add( ShapeID( _helper->IthVertex( 0, edge )));
1540 _geometry._strangeEdges.Add( ShapeID( _helper->IthVertex( 1, edge )));
1542 if ( !SMESH_Algo::isDegenerated( edge ) &&
1543 !_helper->IsRealSeam( edge ))
1545 edge2faceIDsMap[ ShapeID( edge )].push_back( ShapeID( faces[i] ));
1552 //================================================================================
1554 * Computes coordinates of a point in the grid CS
1556 void Grid::ComputeUVW(const gp_XYZ& P, double UVW[3])
1558 gp_XYZ p = P * _invB;
1559 p.Coord( UVW[0], UVW[1], UVW[2] );
1561 //================================================================================
1565 void Grid::ComputeNodes(SMESH_MesherHelper& helper)
1567 // state of each node of the grid relative to the geometry
1568 const size_t nbGridNodes = _coords[0].size() * _coords[1].size() * _coords[2].size();
1569 const TGeomID undefID = 1e+9;
1570 vector< TGeomID > shapeIDVec( nbGridNodes, undefID );
1571 _nodes.resize( nbGridNodes, 0 );
1572 _gridIntP.resize( nbGridNodes, NULL );
1574 SMESHDS_Mesh* mesh = helper.GetMeshDS();
1576 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1578 LineIndexer li = GetLineIndexer( iDir );
1580 // find out a shift of node index while walking along a GridLine in this direction
1581 li.SetIndexOnLine( 0 );
1582 size_t nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
1583 li.SetIndexOnLine( 1 );
1584 const size_t nShift = NodeIndex( li.I(), li.J(), li.K() ) - nIndex0;
1586 const vector<double> & coords = _coords[ iDir ];
1587 for ( ; li.More(); ++li ) // loop on lines in iDir
1589 li.SetIndexOnLine( 0 );
1590 nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
1592 GridLine& line = _lines[ iDir ][ li.LineIndex() ];
1593 const gp_XYZ lineLoc = line._line.Location().XYZ();
1594 const gp_XYZ lineDir = line._line.Direction().XYZ();
1596 line.RemoveExcessIntPoints( _tol );
1597 multiset< F_IntersectPoint >& intPnts = line._intPoints;
1598 multiset< F_IntersectPoint >::iterator ip = intPnts.begin();
1600 // Create mesh nodes at intersections with geometry
1601 // and set OUT state of nodes between intersections
1603 TGeomID solidID = 0;
1604 const double* nodeCoord = & coords[0];
1605 const double* coord0 = nodeCoord;
1606 const double* coordEnd = coord0 + coords.size();
1607 double nodeParam = 0;
1608 for ( ; ip != intPnts.end(); ++ip )
1610 solidID = line.GetSolidIDBefore( ip, solidID, _geometry );
1612 // set OUT state or just skip IN nodes before ip
1613 if ( nodeParam < ip->_paramOnLine - _tol )
1615 while ( nodeParam < ip->_paramOnLine - _tol )
1617 TGeomID & nodeShapeID = shapeIDVec[ nIndex0 + nShift * ( nodeCoord-coord0 ) ];
1618 nodeShapeID = Min( solidID, nodeShapeID );
1619 if ( ++nodeCoord < coordEnd )
1620 nodeParam = *nodeCoord - *coord0;
1624 if ( nodeCoord == coordEnd ) break;
1626 // create a mesh node on a GridLine at ip if it does not coincide with a grid node
1627 if ( nodeParam > ip->_paramOnLine + _tol )
1629 gp_XYZ xyz = lineLoc + ip->_paramOnLine * lineDir;
1630 ip->_node = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1631 ip->_indexOnLine = nodeCoord-coord0-1;
1632 SetOnShape( ip->_node, *ip );
1634 // create a mesh node at ip coincident with a grid node
1637 int nodeIndex = nIndex0 + nShift * ( nodeCoord-coord0 );
1638 if ( !_nodes[ nodeIndex ] )
1640 gp_XYZ xyz = lineLoc + nodeParam * lineDir;
1641 _nodes [ nodeIndex ] = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1642 //_gridIntP[ nodeIndex ] = & * ip;
1643 //SetOnShape( _nodes[ nodeIndex ], *ip );
1645 if ( _gridIntP[ nodeIndex ] )
1646 _gridIntP[ nodeIndex ]->Add( ip->_faceIDs );
1648 _gridIntP[ nodeIndex ] = & * ip;
1649 // ip->_node = _nodes[ nodeIndex ]; -- to differ from ip on links
1650 ip->_indexOnLine = nodeCoord-coord0;
1651 if ( ++nodeCoord < coordEnd )
1652 nodeParam = *nodeCoord - *coord0;
1655 // set OUT state to nodes after the last ip
1656 for ( ; nodeCoord < coordEnd; ++nodeCoord )
1657 shapeIDVec[ nIndex0 + nShift * ( nodeCoord-coord0 ) ] = 0;
1661 // Create mesh nodes at !OUT nodes of the grid
1663 for ( size_t z = 0; z < _coords[2].size(); ++z )
1664 for ( size_t y = 0; y < _coords[1].size(); ++y )
1665 for ( size_t x = 0; x < _coords[0].size(); ++x )
1667 size_t nodeIndex = NodeIndex( x, y, z );
1668 if ( !_nodes[ nodeIndex ] &&
1669 0 < shapeIDVec[ nodeIndex ] && shapeIDVec[ nodeIndex ] < undefID )
1671 gp_XYZ xyz = ( _coords[0][x] * _axes[0] +
1672 _coords[1][y] * _axes[1] +
1673 _coords[2][z] * _axes[2] );
1674 _nodes[ nodeIndex ] = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1675 mesh->SetNodeInVolume( _nodes[ nodeIndex ], shapeIDVec[ nodeIndex ]);
1677 else if ( _nodes[ nodeIndex ] && _gridIntP[ nodeIndex ] /*&&
1678 !_nodes[ nodeIndex]->GetShapeID()*/ )
1680 SetOnShape( _nodes[ nodeIndex ], *_gridIntP[ nodeIndex ]);
1685 // check validity of transitions
1686 const char* trName[] = { "TANGENT", "IN", "OUT", "APEX" };
1687 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1689 LineIndexer li = GetLineIndexer( iDir );
1690 for ( ; li.More(); ++li )
1692 multiset< F_IntersectPoint >& intPnts = _lines[ iDir ][ li.LineIndex() ]._intPoints;
1693 if ( intPnts.empty() ) continue;
1694 if ( intPnts.size() == 1 )
1696 if ( intPnts.begin()->_transition != Trans_TANGENT &&
1697 intPnts.begin()->_transition != Trans_APEX )
1698 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1699 SMESH_Comment("Wrong SOLE transition of GridLine (")
1700 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1701 << ") along " << li._nameConst
1702 << ": " << trName[ intPnts.begin()->_transition] );
1706 if ( intPnts.begin()->_transition == Trans_OUT )
1707 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1708 SMESH_Comment("Wrong START transition of GridLine (")
1709 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1710 << ") along " << li._nameConst
1711 << ": " << trName[ intPnts.begin()->_transition ]);
1712 if ( intPnts.rbegin()->_transition == Trans_IN )
1713 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1714 SMESH_Comment("Wrong END transition of GridLine (")
1715 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1716 << ") along " << li._nameConst
1717 << ": " << trName[ intPnts.rbegin()->_transition ]);
1724 //=============================================================================
1726 * Intersects TopoDS_Face with all GridLine's
1728 void FaceGridIntersector::Intersect()
1730 FaceLineIntersector intersector;
1731 intersector._surfaceInt = GetCurveFaceIntersector();
1732 intersector._tol = _grid->_tol;
1733 intersector._transOut = _face.Orientation() == TopAbs_REVERSED ? Trans_IN : Trans_OUT;
1734 intersector._transIn = _face.Orientation() == TopAbs_REVERSED ? Trans_OUT : Trans_IN;
1736 typedef void (FaceLineIntersector::* PIntFun )(const GridLine& gridLine);
1737 PIntFun interFunction;
1739 bool isDirect = true;
1740 BRepAdaptor_Surface surf( _face );
1741 switch ( surf.GetType() ) {
1743 intersector._plane = surf.Plane();
1744 interFunction = &FaceLineIntersector::IntersectWithPlane;
1745 isDirect = intersector._plane.Direct();
1747 case GeomAbs_Cylinder:
1748 intersector._cylinder = surf.Cylinder();
1749 interFunction = &FaceLineIntersector::IntersectWithCylinder;
1750 isDirect = intersector._cylinder.Direct();
1753 intersector._cone = surf.Cone();
1754 interFunction = &FaceLineIntersector::IntersectWithCone;
1755 //isDirect = intersector._cone.Direct();
1757 case GeomAbs_Sphere:
1758 intersector._sphere = surf.Sphere();
1759 interFunction = &FaceLineIntersector::IntersectWithSphere;
1760 isDirect = intersector._sphere.Direct();
1763 intersector._torus = surf.Torus();
1764 interFunction = &FaceLineIntersector::IntersectWithTorus;
1765 //isDirect = intersector._torus.Direct();
1768 interFunction = &FaceLineIntersector::IntersectWithSurface;
1771 std::swap( intersector._transOut, intersector._transIn );
1773 _intersections.clear();
1774 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1776 if ( surf.GetType() == GeomAbs_Plane )
1778 // check if all lines in this direction are parallel to a plane
1779 if ( intersector._plane.Axis().IsNormal( _grid->_lines[iDir][0]._line.Position(),
1780 Precision::Angular()))
1782 // find out a transition, that is the same for all lines of a direction
1783 gp_Dir plnNorm = intersector._plane.Axis().Direction();
1784 gp_Dir lineDir = _grid->_lines[iDir][0]._line.Direction();
1785 intersector._transition =
1786 ( plnNorm * lineDir < 0 ) ? intersector._transIn : intersector._transOut;
1788 if ( surf.GetType() == GeomAbs_Cylinder )
1790 // check if all lines in this direction are parallel to a cylinder
1791 if ( intersector._cylinder.Axis().IsParallel( _grid->_lines[iDir][0]._line.Position(),
1792 Precision::Angular()))
1796 // intersect the grid lines with the face
1797 for ( size_t iL = 0; iL < _grid->_lines[iDir].size(); ++iL )
1799 GridLine& gridLine = _grid->_lines[iDir][iL];
1800 if ( _bndBox.IsOut( gridLine._line )) continue;
1802 intersector._intPoints.clear();
1803 (intersector.*interFunction)( gridLine ); // <- intersection with gridLine
1804 for ( size_t i = 0; i < intersector._intPoints.size(); ++i )
1805 _intersections.push_back( make_pair( &gridLine, intersector._intPoints[i] ));
1809 if ( _face.Orientation() == TopAbs_INTERNAL )
1811 for ( size_t i = 0; i < _intersections.size(); ++i )
1812 if ( _intersections[i].second._transition == Trans_IN ||
1813 _intersections[i].second._transition == Trans_OUT )
1815 _intersections[i].second._transition = Trans_INTERNAL;
1820 //================================================================================
1822 * Return true if (_u,_v) is on the face
1824 bool FaceLineIntersector::UVIsOnFace() const
1826 TopAbs_State state = _surfaceInt->ClassifyUVPoint(gp_Pnt2d( _u,_v ));
1827 return ( state == TopAbs_IN || state == TopAbs_ON );
1829 //================================================================================
1831 * Store an intersection if it is IN or ON the face
1833 void FaceLineIntersector::addIntPoint(const bool toClassify)
1835 if ( !toClassify || UVIsOnFace() )
1838 p._paramOnLine = _w;
1841 p._transition = _transition;
1842 _intPoints.push_back( p );
1845 //================================================================================
1847 * Intersect a line with a plane
1849 void FaceLineIntersector::IntersectWithPlane(const GridLine& gridLine)
1851 IntAna_IntConicQuad linPlane( gridLine._line, _plane, Precision::Angular());
1852 _w = linPlane.ParamOnConic(1);
1853 if ( isParamOnLineOK( gridLine._length ))
1855 ElSLib::Parameters(_plane, linPlane.Point(1) ,_u,_v);
1859 //================================================================================
1861 * Intersect a line with a cylinder
1863 void FaceLineIntersector::IntersectWithCylinder(const GridLine& gridLine)
1865 IntAna_IntConicQuad linCylinder( gridLine._line, _cylinder );
1866 if ( linCylinder.IsDone() && linCylinder.NbPoints() > 0 )
1868 _w = linCylinder.ParamOnConic(1);
1869 if ( linCylinder.NbPoints() == 1 )
1870 _transition = Trans_TANGENT;
1872 _transition = _w < linCylinder.ParamOnConic(2) ? _transIn : _transOut;
1873 if ( isParamOnLineOK( gridLine._length ))
1875 ElSLib::Parameters(_cylinder, linCylinder.Point(1) ,_u,_v);
1878 if ( linCylinder.NbPoints() > 1 )
1880 _w = linCylinder.ParamOnConic(2);
1881 if ( isParamOnLineOK( gridLine._length ))
1883 ElSLib::Parameters(_cylinder, linCylinder.Point(2) ,_u,_v);
1884 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
1890 //================================================================================
1892 * Intersect a line with a cone
1894 void FaceLineIntersector::IntersectWithCone (const GridLine& gridLine)
1896 IntAna_IntConicQuad linCone(gridLine._line,_cone);
1897 if ( !linCone.IsDone() ) return;
1899 gp_Vec du, dv, norm;
1900 for ( int i = 1; i <= linCone.NbPoints(); ++i )
1902 _w = linCone.ParamOnConic( i );
1903 if ( !isParamOnLineOK( gridLine._length )) continue;
1904 ElSLib::Parameters(_cone, linCone.Point(i) ,_u,_v);
1907 ElSLib::D1( _u, _v, _cone, P, du, dv );
1909 double normSize2 = norm.SquareMagnitude();
1910 if ( normSize2 > Precision::Angular() * Precision::Angular() )
1912 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
1913 cos /= sqrt( normSize2 );
1914 if ( cos < -Precision::Angular() )
1915 _transition = _transIn;
1916 else if ( cos > Precision::Angular() )
1917 _transition = _transOut;
1919 _transition = Trans_TANGENT;
1923 _transition = Trans_APEX;
1925 addIntPoint( /*toClassify=*/false);
1929 //================================================================================
1931 * Intersect a line with a sphere
1933 void FaceLineIntersector::IntersectWithSphere (const GridLine& gridLine)
1935 IntAna_IntConicQuad linSphere(gridLine._line,_sphere);
1936 if ( linSphere.IsDone() && linSphere.NbPoints() > 0 )
1938 _w = linSphere.ParamOnConic(1);
1939 if ( linSphere.NbPoints() == 1 )
1940 _transition = Trans_TANGENT;
1942 _transition = _w < linSphere.ParamOnConic(2) ? _transIn : _transOut;
1943 if ( isParamOnLineOK( gridLine._length ))
1945 ElSLib::Parameters(_sphere, linSphere.Point(1) ,_u,_v);
1948 if ( linSphere.NbPoints() > 1 )
1950 _w = linSphere.ParamOnConic(2);
1951 if ( isParamOnLineOK( gridLine._length ))
1953 ElSLib::Parameters(_sphere, linSphere.Point(2) ,_u,_v);
1954 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
1960 //================================================================================
1962 * Intersect a line with a torus
1964 void FaceLineIntersector::IntersectWithTorus (const GridLine& gridLine)
1966 IntAna_IntLinTorus linTorus(gridLine._line,_torus);
1967 if ( !linTorus.IsDone()) return;
1969 gp_Vec du, dv, norm;
1970 for ( int i = 1; i <= linTorus.NbPoints(); ++i )
1972 _w = linTorus.ParamOnLine( i );
1973 if ( !isParamOnLineOK( gridLine._length )) continue;
1974 linTorus.ParamOnTorus( i, _u,_v );
1977 ElSLib::D1( _u, _v, _torus, P, du, dv );
1979 double normSize = norm.Magnitude();
1980 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
1982 if ( cos < -Precision::Angular() )
1983 _transition = _transIn;
1984 else if ( cos > Precision::Angular() )
1985 _transition = _transOut;
1987 _transition = Trans_TANGENT;
1988 addIntPoint( /*toClassify=*/false);
1992 //================================================================================
1994 * Intersect a line with a non-analytical surface
1996 void FaceLineIntersector::IntersectWithSurface (const GridLine& gridLine)
1998 _surfaceInt->Perform( gridLine._line, 0.0, gridLine._length );
1999 if ( !_surfaceInt->IsDone() ) return;
2000 for ( int i = 1; i <= _surfaceInt->NbPnt(); ++i )
2002 _transition = Transition( _surfaceInt->Transition( i ) );
2003 _w = _surfaceInt->WParameter( i );
2004 addIntPoint(/*toClassify=*/false);
2007 //================================================================================
2009 * check if its face can be safely intersected in a thread
2011 bool FaceGridIntersector::IsThreadSafe(set< const Standard_Transient* >& noSafeTShapes) const
2016 TopLoc_Location loc;
2017 Handle(Geom_Surface) surf = BRep_Tool::Surface( _face, loc );
2018 Handle(Geom_RectangularTrimmedSurface) ts =
2019 Handle(Geom_RectangularTrimmedSurface)::DownCast( surf );
2020 while( !ts.IsNull() ) {
2021 surf = ts->BasisSurface();
2022 ts = Handle(Geom_RectangularTrimmedSurface)::DownCast(surf);
2024 if ( surf->IsKind( STANDARD_TYPE(Geom_BSplineSurface )) ||
2025 surf->IsKind( STANDARD_TYPE(Geom_BezierSurface )))
2026 if ( !noSafeTShapes.insert( _face.TShape().get() ).second )
2030 TopExp_Explorer exp( _face, TopAbs_EDGE );
2031 for ( ; exp.More(); exp.Next() )
2033 bool edgeIsSafe = true;
2034 const TopoDS_Edge& e = TopoDS::Edge( exp.Current() );
2037 Handle(Geom_Curve) c = BRep_Tool::Curve( e, loc, f, l);
2040 Handle(Geom_TrimmedCurve) tc = Handle(Geom_TrimmedCurve)::DownCast(c);
2041 while( !tc.IsNull() ) {
2042 c = tc->BasisCurve();
2043 tc = Handle(Geom_TrimmedCurve)::DownCast(c);
2045 if ( c->IsKind( STANDARD_TYPE(Geom_BSplineCurve )) ||
2046 c->IsKind( STANDARD_TYPE(Geom_BezierCurve )))
2053 Handle(Geom2d_Curve) c2 = BRep_Tool::CurveOnSurface( e, surf, loc, f, l);
2056 Handle(Geom2d_TrimmedCurve) tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
2057 while( !tc.IsNull() ) {
2058 c2 = tc->BasisCurve();
2059 tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
2061 if ( c2->IsKind( STANDARD_TYPE(Geom2d_BSplineCurve )) ||
2062 c2->IsKind( STANDARD_TYPE(Geom2d_BezierCurve )))
2066 if ( !edgeIsSafe && !noSafeTShapes.insert( e.TShape().get() ).second )
2071 //================================================================================
2073 * \brief Creates topology of the hexahedron
2075 Hexahedron::Hexahedron(Grid* grid)
2076 : _grid( grid ), _nbFaceIntNodes(0), _hasTooSmall( false )
2078 _polygons.reserve(100); // to avoid reallocation;
2080 //set nodes shift within grid->_nodes from the node 000
2081 size_t dx = _grid->NodeIndexDX();
2082 size_t dy = _grid->NodeIndexDY();
2083 size_t dz = _grid->NodeIndexDZ();
2085 size_t i100 = i000 + dx;
2086 size_t i010 = i000 + dy;
2087 size_t i110 = i010 + dx;
2088 size_t i001 = i000 + dz;
2089 size_t i101 = i100 + dz;
2090 size_t i011 = i010 + dz;
2091 size_t i111 = i110 + dz;
2092 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V000 )] = i000;
2093 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V100 )] = i100;
2094 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V010 )] = i010;
2095 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V110 )] = i110;
2096 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V001 )] = i001;
2097 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V101 )] = i101;
2098 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V011 )] = i011;
2099 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V111 )] = i111;
2101 vector< int > idVec;
2102 // set nodes to links
2103 for ( int linkID = SMESH_Block::ID_Ex00; linkID <= SMESH_Block::ID_E11z; ++linkID )
2105 SMESH_Block::GetEdgeVertexIDs( linkID, idVec );
2106 _Link& link = _hexLinks[ SMESH_Block::ShapeIndex( linkID )];
2107 link._nodes[0] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[0] )];
2108 link._nodes[1] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[1] )];
2111 // set links to faces
2112 int interlace[4] = { 0, 3, 1, 2 }; // to walk by links around a face: { u0, 1v, u1, 0v }
2113 for ( int faceID = SMESH_Block::ID_Fxy0; faceID <= SMESH_Block::ID_F1yz; ++faceID )
2115 SMESH_Block::GetFaceEdgesIDs( faceID, idVec );
2116 _Face& quad = _hexQuads[ SMESH_Block::ShapeIndex( faceID )];
2117 bool revFace = ( faceID == SMESH_Block::ID_Fxy0 ||
2118 faceID == SMESH_Block::ID_Fx1z ||
2119 faceID == SMESH_Block::ID_F0yz );
2120 quad._links.resize(4);
2121 vector<_OrientedLink>::iterator frwLinkIt = quad._links.begin();
2122 vector<_OrientedLink>::reverse_iterator revLinkIt = quad._links.rbegin();
2123 for ( int i = 0; i < 4; ++i )
2125 bool revLink = revFace;
2126 if ( i > 1 ) // reverse links u1 and v0
2128 _OrientedLink& link = revFace ? *revLinkIt++ : *frwLinkIt++;
2129 link = _OrientedLink( & _hexLinks[ SMESH_Block::ShapeIndex( idVec[interlace[i]] )],
2134 //================================================================================
2136 * \brief Copy constructor
2138 Hexahedron::Hexahedron( const Hexahedron& other, size_t i, size_t j, size_t k, int cellID )
2139 :_grid( other._grid ), _nbFaceIntNodes(0), _i( i ), _j( j ), _k( k ), _hasTooSmall( false )
2141 _polygons.reserve(100); // to avoid reallocation;
2144 for ( int i = 0; i < 8; ++i )
2145 _nodeShift[i] = other._nodeShift[i];
2147 for ( int i = 0; i < 12; ++i )
2149 const _Link& srcLink = other._hexLinks[ i ];
2150 _Link& tgtLink = this->_hexLinks[ i ];
2151 tgtLink._nodes[0] = _hexNodes + ( srcLink._nodes[0] - other._hexNodes );
2152 tgtLink._nodes[1] = _hexNodes + ( srcLink._nodes[1] - other._hexNodes );
2155 for ( int i = 0; i < 6; ++i )
2157 const _Face& srcQuad = other._hexQuads[ i ];
2158 _Face& tgtQuad = this->_hexQuads[ i ];
2159 tgtQuad._links.resize(4);
2160 for ( int j = 0; j < 4; ++j )
2162 const _OrientedLink& srcLink = srcQuad._links[ j ];
2163 _OrientedLink& tgtLink = tgtQuad._links[ j ];
2164 tgtLink._reverse = srcLink._reverse;
2165 tgtLink._link = _hexLinks + ( srcLink._link - other._hexLinks );
2173 //================================================================================
2175 * \brief Return IDs of SOLIDs interfering with this Hexahedron
2177 vector< TGeomID > Hexahedron::getSolids()
2179 // count intersection points belonging to each SOLID
2181 id2NbPoints.reserve( 3 );
2183 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
2184 for ( int iN = 0; iN < 8; ++iN )
2186 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
2187 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
2189 if ( _hexNodes[iN]._intPoint ) // intersection with a FACE
2191 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2193 const vector< TGeomID > & solidIDs =
2194 _grid->GetSolidIDs( _hexNodes[iN]._intPoint->_faceIDs[iF] );
2195 for ( size_t i = 0; i < solidIDs.size(); ++i )
2196 insertAndIncrement( solidIDs[i], id2NbPoints );
2199 else if ( _hexNodes[iN]._node ) // node inside a SOLID
2201 insertAndIncrement( _hexNodes[iN]._node->GetShapeID(), id2NbPoints );
2205 for ( int iL = 0; iL < 12; ++iL )
2207 const _Link& link = _hexLinks[ iL ];
2208 for ( size_t iP = 0; iP < link._fIntPoints.size(); ++iP )
2210 for ( size_t iF = 0; iF < link._fIntPoints[iP]->_faceIDs.size(); ++iF )
2212 const vector< TGeomID > & solidIDs =
2213 _grid->GetSolidIDs( link._fIntPoints[iP]->_faceIDs[iF] );
2214 for ( size_t i = 0; i < solidIDs.size(); ++i )
2215 insertAndIncrement( solidIDs[i], id2NbPoints );
2220 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2222 const vector< TGeomID > & solidIDs = _grid->GetSolidIDs( _eIntPoints[iP]->_shapeID );
2223 for ( size_t i = 0; i < solidIDs.size(); ++i )
2224 insertAndIncrement( solidIDs[i], id2NbPoints );
2227 vector< TGeomID > solids; solids.reserve( id2NbPoints.size() );
2228 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2229 if ( id2nb->second >= 3 )
2230 solids.push_back( id2nb->first );
2235 //================================================================================
2237 * \brief Count cuts by INTERNAL FACEs and set _Node::_isInternalFlags
2239 bool Hexahedron::isCutByInternalFace( IsInternalFlag & maxFlag )
2242 id2NbPoints.reserve( 3 );
2244 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2245 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2247 if ( _grid->IsInternal( _intNodes[iN]._intPoint->_faceIDs[iF]))
2248 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2250 for ( size_t iN = 0; iN < 8; ++iN )
2251 if ( _hexNodes[iN]._intPoint )
2252 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2254 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
2255 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2258 maxFlag = IS_NOT_INTERNAL;
2259 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2261 TGeomID intFace = id2nb->first;
2262 IsInternalFlag intFlag = ( id2nb->second >= 3 ? IS_CUT_BY_INTERNAL_FACE : IS_INTERNAL );
2263 if ( intFlag > maxFlag )
2266 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2267 if ( _intNodes[iN].IsOnFace( intFace ))
2268 _intNodes[iN].SetInternal( intFlag );
2270 for ( size_t iN = 0; iN < 8; ++iN )
2271 if ( _hexNodes[iN].IsOnFace( intFace ))
2272 _hexNodes[iN].SetInternal( intFlag );
2278 //================================================================================
2280 * \brief Return any FACE interfering with this Hexahedron
2282 TGeomID Hexahedron::getAnyFace() const
2285 id2NbPoints.reserve( 3 );
2287 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2288 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2289 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2291 for ( size_t iN = 0; iN < 8; ++iN )
2292 if ( _hexNodes[iN]._intPoint )
2293 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2294 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2296 for ( unsigned int minNb = 3; minNb > 0; --minNb )
2297 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2298 if ( id2nb->second >= minNb )
2299 return id2nb->first;
2304 //================================================================================
2306 * \brief Initializes IJK by Hexahedron index
2308 void Hexahedron::setIJK( size_t iCell )
2310 size_t iNbCell = _grid->_coords[0].size() - 1;
2311 size_t jNbCell = _grid->_coords[1].size() - 1;
2312 _i = iCell % iNbCell;
2313 _j = ( iCell % ( iNbCell * jNbCell )) / iNbCell;
2314 _k = iCell / iNbCell / jNbCell;
2317 //================================================================================
2319 * \brief Initializes its data by given grid cell (countered from zero)
2321 void Hexahedron::init( size_t iCell )
2327 //================================================================================
2329 * \brief Initializes its data by given grid cell nodes and intersections
2331 void Hexahedron::init( size_t i, size_t j, size_t k, const Solid* solid )
2333 _i = i; _j = j; _k = k;
2336 solid = _grid->GetSolid();
2338 // set nodes of grid to nodes of the hexahedron and
2339 // count nodes at hexahedron corners located IN and ON geometry
2340 _nbCornerNodes = _nbBndNodes = 0;
2341 _origNodeInd = _grid->NodeIndex( i,j,k );
2342 for ( int iN = 0; iN < 8; ++iN )
2344 _hexNodes[iN]._isInternalFlags = 0;
2346 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
2347 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
2349 if ( _hexNodes[iN]._node && !solid->Contains( _hexNodes[iN]._node->GetShapeID() ))
2350 _hexNodes[iN]._node = 0;
2351 if ( _hexNodes[iN]._intPoint && !solid->ContainsAny( _hexNodes[iN]._intPoint->_faceIDs ))
2352 _hexNodes[iN]._intPoint = 0;
2354 _nbCornerNodes += bool( _hexNodes[iN]._node );
2355 _nbBndNodes += bool( _hexNodes[iN]._intPoint );
2357 _sideLength[0] = _grid->_coords[0][i+1] - _grid->_coords[0][i];
2358 _sideLength[1] = _grid->_coords[1][j+1] - _grid->_coords[1][j];
2359 _sideLength[2] = _grid->_coords[2][k+1] - _grid->_coords[2][k];
2364 if ( _nbFaceIntNodes + _eIntPoints.size() > 0 &&
2365 _nbFaceIntNodes + _eIntPoints.size() + _nbCornerNodes > 3)
2367 _intNodes.reserve( 3 * _nbBndNodes + _nbFaceIntNodes + _eIntPoints.size() );
2369 // this method can be called in parallel, so use own helper
2370 SMESH_MesherHelper helper( *_grid->_helper->GetMesh() );
2372 // Create sub-links (_Link::_splits) by splitting links with _Link::_fIntPoints
2373 // ---------------------------------------------------------------
2375 for ( int iLink = 0; iLink < 12; ++iLink )
2377 _Link& link = _hexLinks[ iLink ];
2378 link._fIntNodes.clear();
2379 link._fIntNodes.reserve( link._fIntPoints.size() );
2380 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
2381 if ( solid->ContainsAny( link._fIntPoints[i]->_faceIDs ))
2383 _intNodes.push_back( _Node( 0, link._fIntPoints[i] ));
2384 link._fIntNodes.push_back( & _intNodes.back() );
2387 link._splits.clear();
2388 split._nodes[ 0 ] = link._nodes[0];
2389 bool isOut = ( ! link._nodes[0]->Node() );
2390 bool checkTransition;
2391 for ( size_t i = 0; i < link._fIntNodes.size(); ++i )
2393 const bool isGridNode = ( ! link._fIntNodes[i]->Node() );
2394 if ( !isGridNode ) // intersection non-coincident with a grid node
2396 if ( split._nodes[ 0 ]->Node() && !isOut )
2398 split._nodes[ 1 ] = link._fIntNodes[i];
2399 link._splits.push_back( split );
2401 split._nodes[ 0 ] = link._fIntNodes[i];
2402 checkTransition = true;
2404 else // FACE intersection coincident with a grid node (at link ends)
2406 checkTransition = ( i == 0 && link._nodes[0]->Node() );
2408 if ( checkTransition )
2410 const vector< TGeomID >& faceIDs = link._fIntNodes[i]->_intPoint->_faceIDs;
2411 if ( _grid->IsInternal( faceIDs.back() ))
2413 else if ( faceIDs.size() > 1 || _eIntPoints.size() > 0 )
2414 isOut = isOutPoint( link, i, helper, solid );
2417 bool okTransi = _grid->IsCorrectTransition( faceIDs[0], solid );
2418 switch ( link._fIntNodes[i]->FaceIntPnt()->_transition ) {
2419 case Trans_OUT: isOut = okTransi; break;
2420 case Trans_IN : isOut = !okTransi; break;
2422 isOut = isOutPoint( link, i, helper, solid );
2427 if ( link._nodes[ 1 ]->Node() && split._nodes[ 0 ]->Node() && !isOut )
2429 split._nodes[ 1 ] = link._nodes[1];
2430 link._splits.push_back( split );
2434 // Create _Node's at intersections with EDGEs.
2435 // --------------------------------------------
2436 // 1) add this->_eIntPoints to _Face::_eIntNodes
2437 // 2) fill _intNodes and _vIntNodes
2439 const double tol2 = _grid->_tol * _grid->_tol;
2440 int facets[3], nbFacets, subEntity;
2442 for ( int iF = 0; iF < 6; ++iF )
2443 _hexQuads[ iF ]._eIntNodes.clear();
2445 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2447 if ( !solid->ContainsAny( _eIntPoints[iP]->_faceIDs ))
2449 nbFacets = getEntity( _eIntPoints[iP], facets, subEntity );
2450 _Node* equalNode = 0;
2451 switch( nbFacets ) {
2452 case 1: // in a _Face
2454 _Face& quad = _hexQuads[ facets[0] - SMESH_Block::ID_FirstF ];
2455 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2457 equalNode->Add( _eIntPoints[ iP ] );
2460 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2461 quad._eIntNodes.push_back( & _intNodes.back() );
2465 case 2: // on a _Link
2467 _Link& link = _hexLinks[ subEntity - SMESH_Block::ID_FirstE ];
2468 if ( link._splits.size() > 0 )
2470 equalNode = findEqualNode( link._fIntNodes, _eIntPoints[ iP ], tol2 );
2472 equalNode->Add( _eIntPoints[ iP ] );
2473 else if ( link._splits.size() == 1 &&
2474 link._splits[0]._nodes[0] &&
2475 link._splits[0]._nodes[1] )
2476 link._splits.clear(); // hex edge is divided by _eIntPoints[iP]
2481 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2482 bool newNodeUsed = false;
2483 for ( int iF = 0; iF < 2; ++iF )
2485 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2486 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2488 equalNode->Add( _eIntPoints[ iP ] );
2491 quad._eIntNodes.push_back( & _intNodes.back() );
2496 _intNodes.pop_back();
2500 case 3: // at a corner
2502 _Node& node = _hexNodes[ subEntity - SMESH_Block::ID_FirstV ];
2503 if ( node.Node() > 0 )
2505 if ( node._intPoint )
2506 node._intPoint->Add( _eIntPoints[ iP ]->_faceIDs, _eIntPoints[ iP ]->_node );
2510 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2511 for ( int iF = 0; iF < 3; ++iF )
2513 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2514 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2516 equalNode->Add( _eIntPoints[ iP ] );
2519 quad._eIntNodes.push_back( & _intNodes.back() );
2525 } // switch( nbFacets )
2527 if ( nbFacets == 0 ||
2528 _grid->ShapeType( _eIntPoints[ iP ]->_shapeID ) == TopAbs_VERTEX )
2530 equalNode = findEqualNode( _vIntNodes, _eIntPoints[ iP ], tol2 );
2532 equalNode->Add( _eIntPoints[ iP ] );
2534 else if ( nbFacets == 0 ) {
2535 if ( _intNodes.empty() || _intNodes.back().EdgeIntPnt() != _eIntPoints[ iP ])
2536 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2537 _vIntNodes.push_back( & _intNodes.back() );
2540 } // loop on _eIntPoints
2543 else if ( 3 < _nbCornerNodes && _nbCornerNodes < 8 ) // _nbFaceIntNodes == 0
2546 // create sub-links (_splits) of whole links
2547 for ( int iLink = 0; iLink < 12; ++iLink )
2549 _Link& link = _hexLinks[ iLink ];
2550 link._splits.clear();
2551 if ( link._nodes[ 0 ]->Node() && link._nodes[ 1 ]->Node() )
2553 split._nodes[ 0 ] = link._nodes[0];
2554 split._nodes[ 1 ] = link._nodes[1];
2555 link._splits.push_back( split );
2561 } // init( _i, _j, _k )
2563 //================================================================================
2565 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2567 void Hexahedron::ComputeElements( const Solid* solid, int solidIndex )
2571 solid = _grid->GetSolid();
2572 if ( !_grid->_geometry.IsOneSolid() )
2574 vector< TGeomID > solidIDs = getSolids();
2575 if ( solidIDs.size() > 1 )
2577 for ( size_t i = 0; i < solidIDs.size(); ++i )
2579 solid = _grid->GetSolid( solidIDs[i] );
2580 ComputeElements( solid, i );
2581 if ( !_volumeDefs._nodes.empty() && i < solidIDs.size() - 1 )
2582 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2586 solid = _grid->GetSolid( solidIDs[0] );
2590 init( _i, _j, _k, solid ); // get nodes and intersections from grid nodes and split links
2592 int nbIntersections = _nbFaceIntNodes + _eIntPoints.size();
2593 if ( _nbCornerNodes + nbIntersections < 4 )
2596 if ( _nbBndNodes == _nbCornerNodes && nbIntersections == 0 && isInHole() )
2597 return; // cell is in a hole
2599 IsInternalFlag intFlag = IS_NOT_INTERNAL;
2600 if ( solid->HasInternalFaces() && this->isCutByInternalFace( intFlag ))
2602 for ( _SplitIterator it( _hexLinks ); it.More(); it.Next() )
2604 if ( compute( solid, intFlag ))
2605 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2610 if ( solidIndex >= 0 )
2611 intFlag = IS_CUT_BY_INTERNAL_FACE;
2613 compute( solid, intFlag );
2617 //================================================================================
2619 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2621 bool Hexahedron::compute( const Solid* solid, const IsInternalFlag intFlag )
2624 _polygons.reserve( 20 );
2626 for ( int iN = 0; iN < 8; ++iN )
2627 _hexNodes[iN]._usedInFace = 0;
2629 // Create polygons from quadrangles
2630 // --------------------------------
2632 vector< _OrientedLink > splits;
2633 vector<_Node*> chainNodes;
2634 _Face* coplanarPolyg;
2636 bool hasEdgeIntersections = !_eIntPoints.empty();
2638 for ( int iF = 0; iF < 6; ++iF ) // loop on 6 sides of a hexahedron
2640 _Face& quad = _hexQuads[ iF ] ;
2642 _polygons.resize( _polygons.size() + 1 );
2643 _Face* polygon = &_polygons.back();
2644 polygon->_polyLinks.reserve( 20 );
2647 for ( int iE = 0; iE < 4; ++iE ) // loop on 4 sides of a quadrangle
2648 for ( int iS = 0; iS < quad._links[ iE ].NbResultLinks(); ++iS )
2649 splits.push_back( quad._links[ iE ].ResultLink( iS ));
2651 // add splits of links to a polygon and add _polyLinks to make
2652 // polygon's boundary closed
2654 int nbSplits = splits.size();
2655 if (( nbSplits == 1 ) &&
2656 ( quad._eIntNodes.empty() ||
2657 splits[0].FirstNode()->IsLinked( splits[0].LastNode()->_intPoint )))
2658 //( quad._eIntNodes.empty() || _nbCornerNodes + nbIntersections > 6 ))
2661 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
2662 if ( quad._eIntNodes[ iP ]->IsUsedInFace( polygon ))
2663 quad._eIntNodes[ iP ]->_usedInFace = 0;
2665 size_t nbUsedEdgeNodes = 0;
2666 _Face* prevPolyg = 0; // polygon previously created from this quad
2668 while ( nbSplits > 0 )
2671 while ( !splits[ iS ] )
2674 if ( !polygon->_links.empty() )
2676 _polygons.resize( _polygons.size() + 1 );
2677 polygon = &_polygons.back();
2678 polygon->_polyLinks.reserve( 20 );
2680 polygon->_links.push_back( splits[ iS ] );
2681 splits[ iS++ ]._link = 0;
2684 _Node* nFirst = polygon->_links.back().FirstNode();
2685 _Node *n1,*n2 = polygon->_links.back().LastNode();
2686 for ( ; nFirst != n2 && iS < splits.size(); ++iS )
2688 _OrientedLink& split = splits[ iS ];
2689 if ( !split ) continue;
2691 n1 = split.FirstNode();
2694 (( n1->_intPoint->_faceIDs.size() > 1 && isImplementEdges() ) ||
2695 ( n1->_isInternalFlags )))
2697 // n1 is at intersection with EDGE
2698 if ( findChainOnEdge( splits, polygon->_links.back(), split, iS, quad, chainNodes ))
2700 for ( size_t i = 1; i < chainNodes.size(); ++i )
2701 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2702 if ( chainNodes.back() != n1 ) // not a partial cut by INTERNAL FACE
2704 prevPolyg = polygon;
2705 n2 = chainNodes.back();
2710 else if ( n1 != n2 )
2712 // try to connect to intersections with EDGEs
2713 if ( quad._eIntNodes.size() > nbUsedEdgeNodes &&
2714 findChain( n2, n1, quad, chainNodes ))
2716 for ( size_t i = 1; i < chainNodes.size(); ++i )
2718 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i] );
2719 nbUsedEdgeNodes += ( chainNodes[i]->IsUsedInFace( polygon ));
2721 if ( chainNodes.back() != n1 )
2723 n2 = chainNodes.back();
2728 // try to connect to a split ending on the same FACE
2731 _OrientedLink foundSplit;
2732 for ( size_t i = iS; i < splits.size() && !foundSplit; ++i )
2733 if (( foundSplit = splits[ i ]) &&
2734 ( n2->IsLinked( foundSplit.FirstNode()->_intPoint )))
2740 foundSplit._link = 0;
2744 if ( n2 != foundSplit.FirstNode() )
2746 polygon->AddPolyLink( n2, foundSplit.FirstNode() );
2747 n2 = foundSplit.FirstNode();
2753 if ( n2->IsLinked( nFirst->_intPoint ))
2755 polygon->AddPolyLink( n2, n1, prevPolyg );
2758 } // if ( n1 != n2 )
2760 polygon->_links.push_back( split );
2763 n2 = polygon->_links.back().LastNode();
2767 if ( nFirst != n2 ) // close a polygon
2769 if ( !findChain( n2, nFirst, quad, chainNodes ))
2771 if ( !closePolygon( polygon, chainNodes ))
2772 if ( !isImplementEdges() )
2773 chainNodes.push_back( nFirst );
2775 for ( size_t i = 1; i < chainNodes.size(); ++i )
2777 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2778 nbUsedEdgeNodes += bool( chainNodes[i]->IsUsedInFace( polygon ));
2782 if ( polygon->_links.size() < 3 && nbSplits > 0 )
2784 polygon->_polyLinks.clear();
2785 polygon->_links.clear();
2787 } // while ( nbSplits > 0 )
2789 if ( polygon->_links.size() < 3 )
2791 _polygons.pop_back();
2793 } // loop on 6 hexahedron sides
2795 // Create polygons closing holes in a polyhedron
2796 // ----------------------------------------------
2798 // clear _usedInFace
2799 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2800 _intNodes[ iN ]._usedInFace = 0;
2802 // add polygons to their links and mark used nodes
2803 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2805 _Face& polygon = _polygons[ iP ];
2806 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2808 polygon._links[ iL ].AddFace( &polygon );
2809 polygon._links[ iL ].FirstNode()->_usedInFace = &polygon;
2813 vector< _OrientedLink* > freeLinks;
2814 freeLinks.reserve(20);
2815 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2817 _Face& polygon = _polygons[ iP ];
2818 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2819 if ( polygon._links[ iL ].NbFaces() < 2 )
2820 freeLinks.push_back( & polygon._links[ iL ]);
2822 int nbFreeLinks = freeLinks.size();
2823 if ( nbFreeLinks == 1 ) return false;
2825 // put not used intersection nodes to _vIntNodes
2826 int nbVertexNodes = 0; // nb not used vertex nodes
2828 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
2829 nbVertexNodes += ( !_vIntNodes[ iN ]->IsUsedInFace() );
2831 const double tol = 1e-3 * Min( Min( _sideLength[0], _sideLength[1] ), _sideLength[0] );
2832 for ( size_t iN = _nbFaceIntNodes; iN < _intNodes.size(); ++iN )
2834 if ( _intNodes[ iN ].IsUsedInFace() ) continue;
2835 if ( dynamic_cast< const F_IntersectPoint* >( _intNodes[ iN ]._intPoint )) continue;
2837 findEqualNode( _vIntNodes, _intNodes[ iN ].EdgeIntPnt(), tol*tol );
2840 _vIntNodes.push_back( &_intNodes[ iN ]);
2846 set<TGeomID> usedFaceIDs;
2847 vector< TGeomID > faces;
2848 TGeomID curFace = 0;
2849 const size_t nbQuadPolygons = _polygons.size();
2850 E_IntersectPoint ipTmp;
2852 // create polygons by making closed chains of free links
2853 size_t iPolygon = _polygons.size();
2854 while ( nbFreeLinks > 0 )
2856 if ( iPolygon == _polygons.size() )
2858 _polygons.resize( _polygons.size() + 1 );
2859 _polygons[ iPolygon ]._polyLinks.reserve( 20 );
2860 _polygons[ iPolygon ]._links.reserve( 20 );
2862 _Face& polygon = _polygons[ iPolygon ];
2864 _OrientedLink* curLink = 0;
2866 if (( !hasEdgeIntersections ) ||
2867 ( nbFreeLinks < 4 && nbVertexNodes == 0 ))
2869 // get a remaining link to start from
2870 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2871 if (( curLink = freeLinks[ iL ] ))
2872 freeLinks[ iL ] = 0;
2873 polygon._links.push_back( *curLink );
2877 // find all links connected to curLink
2878 curNode = curLink->FirstNode();
2880 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2881 if ( freeLinks[ iL ] && freeLinks[ iL ]->LastNode() == curNode )
2883 curLink = freeLinks[ iL ];
2884 freeLinks[ iL ] = 0;
2886 polygon._links.push_back( *curLink );
2888 } while ( curLink );
2890 else // there are intersections with EDGEs
2892 // get a remaining link to start from, one lying on minimal nb of FACEs
2894 typedef pair< TGeomID, int > TFaceOfLink;
2895 TFaceOfLink faceOfLink( -1, -1 );
2896 TFaceOfLink facesOfLink[3] = { faceOfLink, faceOfLink, faceOfLink };
2897 for ( size_t iL = 0; iL < freeLinks.size(); ++iL )
2898 if ( freeLinks[ iL ] )
2900 faces = freeLinks[ iL ]->GetNotUsedFace( usedFaceIDs );
2901 if ( faces.size() == 1 )
2903 faceOfLink = TFaceOfLink( faces[0], iL );
2904 if ( !freeLinks[ iL ]->HasEdgeNodes() )
2906 facesOfLink[0] = faceOfLink;
2908 else if ( facesOfLink[0].first < 0 )
2910 faceOfLink = TFaceOfLink(( faces.empty() ? -1 : faces[0]), iL );
2911 facesOfLink[ 1 + faces.empty() ] = faceOfLink;
2914 for ( int i = 0; faceOfLink.first < 0 && i < 3; ++i )
2915 faceOfLink = facesOfLink[i];
2917 if ( faceOfLink.first < 0 ) // all faces used
2919 for ( size_t iL = 0; iL < freeLinks.size() && faceOfLink.first < 1; ++iL )
2920 if (( curLink = freeLinks[ iL ]))
2923 curLink->FirstNode()->IsLinked( curLink->LastNode()->_intPoint );
2924 faceOfLink.second = iL;
2926 usedFaceIDs.clear();
2928 curFace = faceOfLink.first;
2929 curLink = freeLinks[ faceOfLink.second ];
2930 freeLinks[ faceOfLink.second ] = 0;
2932 usedFaceIDs.insert( curFace );
2933 polygon._links.push_back( *curLink );
2936 // find all links lying on a curFace
2939 // go forward from curLink
2940 curNode = curLink->LastNode();
2942 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2943 if ( freeLinks[ iL ] &&
2944 freeLinks[ iL ]->FirstNode() == curNode &&
2945 freeLinks[ iL ]->LastNode()->IsOnFace( curFace ))
2947 curLink = freeLinks[ iL ];
2948 freeLinks[ iL ] = 0;
2949 polygon._links.push_back( *curLink );
2952 } while ( curLink );
2954 std::reverse( polygon._links.begin(), polygon._links.end() );
2956 curLink = & polygon._links.back();
2959 // go backward from curLink
2960 curNode = curLink->FirstNode();
2962 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2963 if ( freeLinks[ iL ] &&
2964 freeLinks[ iL ]->LastNode() == curNode &&
2965 freeLinks[ iL ]->FirstNode()->IsOnFace( curFace ))
2967 curLink = freeLinks[ iL ];
2968 freeLinks[ iL ] = 0;
2969 polygon._links.push_back( *curLink );
2972 } while ( curLink );
2974 curNode = polygon._links.back().FirstNode();
2976 if ( polygon._links[0].LastNode() != curNode )
2978 if ( nbVertexNodes > 0 )
2980 // add links with _vIntNodes if not already used
2982 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
2983 if ( !_vIntNodes[ iN ]->IsUsedInFace() &&
2984 _vIntNodes[ iN ]->IsOnFace( curFace ))
2986 _vIntNodes[ iN ]->_usedInFace = &polygon;
2987 chainNodes.push_back( _vIntNodes[ iN ] );
2989 if ( chainNodes.size() > 1 &&
2990 curFace != _grid->PseudoIntExtFaceID() ) /////// TODO
2992 sortVertexNodes( chainNodes, curNode, curFace );
2994 for ( size_t i = 0; i < chainNodes.size(); ++i )
2996 polygon.AddPolyLink( chainNodes[ i ], curNode );
2997 curNode = chainNodes[ i ];
2998 freeLinks.push_back( &polygon._links.back() );
3001 nbVertexNodes -= chainNodes.size();
3003 // if ( polygon._links.size() > 1 )
3005 polygon.AddPolyLink( polygon._links[0].LastNode(), curNode );
3006 freeLinks.push_back( &polygon._links.back() );
3010 } // if there are intersections with EDGEs
3012 if ( polygon._links.size() < 2 ||
3013 polygon._links[0].LastNode() != polygon._links.back().FirstNode() )
3014 return false; // closed polygon not found -> invalid polyhedron
3016 if ( polygon._links.size() == 2 )
3018 if ( freeLinks.back() == &polygon._links.back() )
3020 freeLinks.pop_back();
3023 if ( polygon._links.front().NbFaces() > 0 )
3024 polygon._links.back().AddFace( polygon._links.front()._link->_faces[0] );
3025 if ( polygon._links.back().NbFaces() > 0 )
3026 polygon._links.front().AddFace( polygon._links.back()._link->_faces[0] );
3028 if ( iPolygon == _polygons.size()-1 )
3029 _polygons.pop_back();
3031 else // polygon._links.size() >= 2
3033 // add polygon to its links
3034 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3036 polygon._links[ iL ].AddFace( &polygon );
3037 polygon._links[ iL ].Reverse();
3039 if ( /*hasEdgeIntersections &&*/ iPolygon == _polygons.size() - 1 )
3041 // check that a polygon does not lie on a hexa side
3043 for ( size_t iL = 0; iL < polygon._links.size() && !coplanarPolyg; ++iL )
3045 if ( polygon._links[ iL ].NbFaces() < 2 )
3046 continue; // it's a just added free link
3047 // look for a polygon made on a hexa side and sharing
3048 // two or more haxa links
3050 coplanarPolyg = polygon._links[ iL ]._link->_faces[0];
3051 for ( iL2 = iL + 1; iL2 < polygon._links.size(); ++iL2 )
3052 if ( polygon._links[ iL2 ]._link->_faces[0] == coplanarPolyg &&
3053 !coplanarPolyg->IsPolyLink( polygon._links[ iL ]) &&
3054 !coplanarPolyg->IsPolyLink( polygon._links[ iL2 ]) &&
3055 coplanarPolyg < & _polygons[ nbQuadPolygons ])
3057 if ( iL2 == polygon._links.size() )
3060 if ( coplanarPolyg ) // coplanar polygon found
3062 freeLinks.resize( freeLinks.size() - polygon._polyLinks.size() );
3063 nbFreeLinks -= polygon._polyLinks.size();
3065 // an E_IntersectPoint used to mark nodes of coplanarPolyg
3066 // as lying on curFace while they are not at intersection with geometry
3067 ipTmp._faceIDs.resize(1);
3068 ipTmp._faceIDs[0] = curFace;
3070 // fill freeLinks with links not shared by coplanarPolyg and polygon
3071 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3072 if ( polygon._links[ iL ]._link->_faces[1] &&
3073 polygon._links[ iL ]._link->_faces[0] != coplanarPolyg )
3075 _Face* p = polygon._links[ iL ]._link->_faces[0];
3076 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3077 if ( p->_links[ iL2 ]._link == polygon._links[ iL ]._link )
3079 freeLinks.push_back( & p->_links[ iL2 ] );
3081 freeLinks.back()->RemoveFace( &polygon );
3085 for ( size_t iL = 0; iL < coplanarPolyg->_links.size(); ++iL )
3086 if ( coplanarPolyg->_links[ iL ]._link->_faces[1] &&
3087 coplanarPolyg->_links[ iL ]._link->_faces[1] != &polygon )
3089 _Face* p = coplanarPolyg->_links[ iL ]._link->_faces[0];
3090 if ( p == coplanarPolyg )
3091 p = coplanarPolyg->_links[ iL ]._link->_faces[1];
3092 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3093 if ( p->_links[ iL2 ]._link == coplanarPolyg->_links[ iL ]._link )
3095 // set links of coplanarPolyg in place of used freeLinks
3096 // to re-create coplanarPolyg next
3098 for ( ; iL3 < freeLinks.size() && freeLinks[ iL3 ]; ++iL3 );
3099 if ( iL3 < freeLinks.size() )
3100 freeLinks[ iL3 ] = ( & p->_links[ iL2 ] );
3102 freeLinks.push_back( & p->_links[ iL2 ] );
3104 freeLinks[ iL3 ]->RemoveFace( coplanarPolyg );
3105 // mark nodes of coplanarPolyg as lying on curFace
3106 for ( int iN = 0; iN < 2; ++iN )
3108 _Node* n = freeLinks[ iL3 ]->_link->_nodes[ iN ];
3109 if ( n->_intPoint ) n->_intPoint->Add( ipTmp._faceIDs );
3110 else n->_intPoint = &ipTmp;
3115 // set coplanarPolyg to be re-created next
3116 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
3117 if ( coplanarPolyg == & _polygons[ iP ] )
3120 _polygons[ iPolygon ]._links.clear();
3121 _polygons[ iPolygon ]._polyLinks.clear();
3124 _polygons.pop_back();
3125 usedFaceIDs.erase( curFace );
3127 } // if ( coplanarPolyg )
3128 } // if ( hasEdgeIntersections ) - search for coplanarPolyg
3130 iPolygon = _polygons.size();
3132 } // end of case ( polygon._links.size() > 2 )
3133 } // while ( nbFreeLinks > 0 )
3135 // check volume size
3136 _hasTooSmall = ! checkPolyhedronSize( intFlag & IS_CUT_BY_INTERNAL_FACE );
3138 for ( size_t i = 0; i < 8; ++i )
3139 if ( _hexNodes[ i ]._intPoint == &ipTmp )
3140 _hexNodes[ i ]._intPoint = 0;
3143 return false; // too small volume
3145 // create a classic cell if possible
3148 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3149 nbPolygons += (_polygons[ iF ]._links.size() > 0 );
3151 //const int nbNodes = _nbCornerNodes + nbIntersections;
3153 for ( size_t i = 0; i < 8; ++i )
3154 nbNodes += _hexNodes[ i ].IsUsedInFace();
3155 for ( size_t i = 0; i < _intNodes.size(); ++i )
3156 nbNodes += _intNodes[ i ].IsUsedInFace();
3158 bool isClassicElem = false;
3159 if ( nbNodes == 8 && nbPolygons == 6 ) isClassicElem = addHexa();
3160 else if ( nbNodes == 4 && nbPolygons == 4 ) isClassicElem = addTetra();
3161 else if ( nbNodes == 6 && nbPolygons == 5 ) isClassicElem = addPenta();
3162 else if ( nbNodes == 5 && nbPolygons == 5 ) isClassicElem = addPyra ();
3163 if ( !isClassicElem )
3165 _volumeDefs._nodes.clear();
3166 _volumeDefs._quantities.clear();
3168 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3170 const size_t nbLinks = _polygons[ iF ]._links.size();
3171 if ( nbLinks == 0 ) continue;
3172 _volumeDefs._quantities.push_back( nbLinks );
3173 for ( size_t iL = 0; iL < nbLinks; ++iL )
3174 _volumeDefs._nodes.push_back( _polygons[ iF ]._links[ iL ].FirstNode() );
3177 _volumeDefs._solidID = solid->ID();
3179 return !_volumeDefs._nodes.empty();
3181 //================================================================================
3183 * \brief Create elements in the mesh
3185 int Hexahedron::MakeElements(SMESH_MesherHelper& helper,
3186 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3188 SMESHDS_Mesh* mesh = helper.GetMeshDS();
3190 CellsAroundLink c( _grid, 0 );
3191 const size_t nbGridCells = c._nbCells[0] * c._nbCells[1] * c._nbCells[2];
3192 vector< Hexahedron* > allHexa( nbGridCells, 0 );
3195 // set intersection nodes from GridLine's to links of allHexa
3196 int i,j,k, cellIndex;
3197 for ( int iDir = 0; iDir < 3; ++iDir )
3199 // loop on GridLine's parallel to iDir
3200 LineIndexer lineInd = _grid->GetLineIndexer( iDir );
3201 CellsAroundLink fourCells( _grid, iDir );
3202 for ( ; lineInd.More(); ++lineInd )
3204 GridLine& line = _grid->_lines[ iDir ][ lineInd.LineIndex() ];
3205 multiset< F_IntersectPoint >::const_iterator ip = line._intPoints.begin();
3206 for ( ; ip != line._intPoints.end(); ++ip )
3208 // if ( !ip->_node ) continue; // intersection at a grid node
3209 lineInd.SetIndexOnLine( ip->_indexOnLine );
3210 fourCells.Init( lineInd.I(), lineInd.J(), lineInd.K() );
3211 for ( int iL = 0; iL < 4; ++iL ) // loop on 4 cells sharing a link
3213 if ( !fourCells.GetCell( iL, i,j,k, cellIndex ))
3215 Hexahedron *& hex = allHexa[ cellIndex ];
3218 hex = new Hexahedron( *this, i, j, k, cellIndex );
3221 const int iLink = iL + iDir * 4;
3222 hex->_hexLinks[iLink]._fIntPoints.push_back( &(*ip) );
3223 hex->_nbFaceIntNodes += bool( ip->_node );
3229 // implement geom edges into the mesh
3230 addEdges( helper, allHexa, edge2faceIDsMap );
3232 // add not split hexahedra to the mesh
3234 vector< Hexahedron* > intHexa; intHexa.reserve( nbIntHex );
3235 vector< const SMDS_MeshElement* > boundaryVolumes; boundaryVolumes.reserve( nbIntHex * 1.1 );
3236 for ( size_t i = 0; i < allHexa.size(); ++i )
3238 // initialize this by not cut allHexa[ i ]
3239 Hexahedron * & hex = allHexa[ i ];
3240 if ( hex ) // split hexahedron
3242 intHexa.push_back( hex );
3243 if ( hex->_nbFaceIntNodes > 0 || hex->_eIntPoints.size() > 0 )
3244 continue; // treat intersected hex later in parallel
3245 this->init( hex->_i, hex->_j, hex->_k );
3249 this->init( i ); // == init(i,j,k)
3251 if (( _nbCornerNodes == 8 ) &&
3252 ( _nbBndNodes < _nbCornerNodes || !isInHole() ))
3254 // order of _hexNodes is defined by enum SMESH_Block::TShapeID
3255 SMDS_MeshElement* el =
3256 mesh->AddVolume( _hexNodes[0].Node(), _hexNodes[2].Node(),
3257 _hexNodes[3].Node(), _hexNodes[1].Node(),
3258 _hexNodes[4].Node(), _hexNodes[6].Node(),
3259 _hexNodes[7].Node(), _hexNodes[5].Node() );
3260 TGeomID solidID = 0;
3261 if ( _nbBndNodes < _nbCornerNodes )
3263 for ( int iN = 0; iN < 8 && !solidID; ++iN )
3264 if ( !_hexNodes[iN]._intPoint ) // no intersection
3265 solidID = _hexNodes[iN].Node()->GetShapeID();
3269 solidID = getSolids()[0];
3271 mesh->SetMeshElementOnShape( el, solidID );
3275 if ( _grid->_toCreateFaces && _nbBndNodes >= 3 )
3277 boundaryVolumes.push_back( el );
3278 el->setIsMarked( true );
3281 else if ( _nbCornerNodes > 3 && !hex )
3283 // all intersection of hex with geometry are at grid nodes
3284 hex = new Hexahedron( *this, _i, _j, _k, i );
3285 intHexa.push_back( hex );
3289 // add elements resulted from hexadron intersection
3291 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, intHexa.size() ),
3292 ParallelHexahedron( intHexa ),
3293 tbb::simple_partitioner()); // ComputeElements() is called here
3294 for ( size_t i = 0; i < intHexa.size(); ++i )
3295 if ( Hexahedron * hex = intHexa[ i ] )
3296 nbAdded += hex->addVolumes( helper );
3298 for ( size_t i = 0; i < intHexa.size(); ++i )
3299 if ( Hexahedron * hex = intHexa[ i ] )
3301 hex->ComputeElements();
3302 nbAdded += hex->addVolumes( helper );
3306 // fill boundaryVolumes with volumes neighboring too small skipped volumes
3307 if ( _grid->_toCreateFaces )
3309 for ( size_t i = 0; i < intHexa.size(); ++i )
3310 if ( Hexahedron * hex = intHexa[ i ] )
3311 hex->getBoundaryElems( boundaryVolumes );
3314 // create boundary mesh faces
3315 addFaces( helper, boundaryVolumes );
3317 // create mesh edges
3318 addSegments( helper, edge2faceIDsMap );
3320 for ( size_t i = 0; i < allHexa.size(); ++i )
3322 delete allHexa[ i ];
3327 //================================================================================
3329 * \brief Implements geom edges into the mesh
3331 void Hexahedron::addEdges(SMESH_MesherHelper& helper,
3332 vector< Hexahedron* >& hexes,
3333 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3335 if ( edge2faceIDsMap.empty() ) return;
3337 // Prepare planes for intersecting with EDGEs
3340 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ ) // iDirZ gives normal direction to planes
3342 GridPlanes& planes = pln[ iDirZ ];
3343 int iDirX = ( iDirZ + 1 ) % 3;
3344 int iDirY = ( iDirZ + 2 ) % 3;
3345 planes._zNorm = ( _grid->_axes[ iDirX ] ^ _grid->_axes[ iDirY ] ).Normalized();
3346 planes._zProjs.resize ( _grid->_coords[ iDirZ ].size() );
3347 planes._zProjs [0] = 0;
3348 const double zFactor = _grid->_axes[ iDirZ ] * planes._zNorm;
3349 const vector< double > & u = _grid->_coords[ iDirZ ];
3350 for ( size_t i = 1; i < planes._zProjs.size(); ++i )
3352 planes._zProjs [i] = zFactor * ( u[i] - u[0] );
3356 const double deflection = _grid->_minCellSize / 20.;
3357 const double tol = _grid->_tol;
3358 E_IntersectPoint ip;
3360 TColStd_MapOfInteger intEdgeIDs; // IDs of not shared INTERNAL EDGES
3362 // Intersect EDGEs with the planes
3363 map< TGeomID, vector< TGeomID > >::const_iterator e2fIt = edge2faceIDsMap.begin();
3364 for ( ; e2fIt != edge2faceIDsMap.end(); ++e2fIt )
3366 const TGeomID edgeID = e2fIt->first;
3367 const TopoDS_Edge & E = TopoDS::Edge( _grid->Shape( edgeID ));
3368 BRepAdaptor_Curve curve( E );
3369 TopoDS_Vertex v1 = helper.IthVertex( 0, E, false );
3370 TopoDS_Vertex v2 = helper.IthVertex( 1, E, false );
3372 ip._faceIDs = e2fIt->second;
3373 ip._shapeID = edgeID;
3375 bool isInternal = ( ip._faceIDs.size() == 1 && _grid->IsInternal( edgeID ));
3378 intEdgeIDs.Add( edgeID );
3379 intEdgeIDs.Add( _grid->ShapeID( v1 ));
3380 intEdgeIDs.Add( _grid->ShapeID( v2 ));
3383 // discretize the EDGE
3384 GCPnts_UniformDeflection discret( curve, deflection, true );
3385 if ( !discret.IsDone() || discret.NbPoints() < 2 )
3388 // perform intersection
3389 E_IntersectPoint* eip, *vip;
3390 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ )
3392 GridPlanes& planes = pln[ iDirZ ];
3393 int iDirX = ( iDirZ + 1 ) % 3;
3394 int iDirY = ( iDirZ + 2 ) % 3;
3395 double xLen = _grid->_coords[ iDirX ].back() - _grid->_coords[ iDirX ][0];
3396 double yLen = _grid->_coords[ iDirY ].back() - _grid->_coords[ iDirY ][0];
3397 double zLen = _grid->_coords[ iDirZ ].back() - _grid->_coords[ iDirZ ][0];
3398 int dIJK[3], d000[3] = { 0,0,0 };
3399 double o[3] = { _grid->_coords[0][0],
3400 _grid->_coords[1][0],
3401 _grid->_coords[2][0] };
3403 // locate the 1st point of a segment within the grid
3404 gp_XYZ p1 = discret.Value( 1 ).XYZ();
3405 double u1 = discret.Parameter( 1 );
3406 double zProj1 = planes._zNorm * ( p1 - _grid->_origin );
3408 _grid->ComputeUVW( p1, ip._uvw );
3409 int iX1 = int(( ip._uvw[iDirX] - o[iDirX]) / xLen * (_grid->_coords[ iDirX ].size() - 1));
3410 int iY1 = int(( ip._uvw[iDirY] - o[iDirY]) / yLen * (_grid->_coords[ iDirY ].size() - 1));
3411 int iZ1 = int(( ip._uvw[iDirZ] - o[iDirZ]) / zLen * (_grid->_coords[ iDirZ ].size() - 1));
3412 locateValue( iX1, ip._uvw[iDirX], _grid->_coords[ iDirX ], dIJK[ iDirX ], tol );
3413 locateValue( iY1, ip._uvw[iDirY], _grid->_coords[ iDirY ], dIJK[ iDirY ], tol );
3414 locateValue( iZ1, ip._uvw[iDirZ], _grid->_coords[ iDirZ ], dIJK[ iDirZ ], tol );
3416 int ijk[3]; // grid index where a segment intersects a plane
3421 // add the 1st vertex point to a hexahedron
3425 ip._shapeID = _grid->ShapeID( v1 );
3426 vip = _grid->Add( ip );
3428 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3429 if ( !addIntersection( vip, hexes, ijk, d000 ))
3430 _grid->Remove( vip );
3431 ip._shapeID = edgeID;
3433 for ( int iP = 2; iP <= discret.NbPoints(); ++iP )
3435 // locate the 2nd point of a segment within the grid
3436 gp_XYZ p2 = discret.Value( iP ).XYZ();
3437 double u2 = discret.Parameter( iP );
3438 double zProj2 = planes._zNorm * ( p2 - _grid->_origin );
3440 if ( Abs( zProj2 - zProj1 ) > std::numeric_limits<double>::min() )
3442 locateValue( iZ2, zProj2, planes._zProjs, dIJK[ iDirZ ], tol );
3444 // treat intersections with planes between 2 end points of a segment
3445 int dZ = ( iZ1 <= iZ2 ) ? +1 : -1;
3446 int iZ = iZ1 + ( iZ1 < iZ2 );
3447 for ( int i = 0, nb = Abs( iZ1 - iZ2 ); i < nb; ++i, iZ += dZ )
3449 ip._point = findIntPoint( u1, zProj1, u2, zProj2,
3450 planes._zProjs[ iZ ],
3451 curve, planes._zNorm, _grid->_origin );
3452 _grid->ComputeUVW( ip._point.XYZ(), ip._uvw );
3453 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3454 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3457 // add ip to hex "above" the plane
3458 eip = _grid->Add( ip );
3460 eip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3462 bool added = addIntersection( eip, hexes, ijk, dIJK);
3464 // add ip to hex "below" the plane
3465 ijk[ iDirZ ] = iZ-1;
3466 if ( !addIntersection( eip, hexes, ijk, dIJK ) &&
3468 _grid->Remove( eip );
3476 // add the 2nd vertex point to a hexahedron
3480 ip._shapeID = _grid->ShapeID( v2 );
3481 _grid->ComputeUVW( p1, ip._uvw );
3482 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3483 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3485 bool sameV = ( v1.IsSame( v2 ));
3487 vip = _grid->Add( ip );
3488 if ( isInternal && !sameV )
3489 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3490 if ( !addIntersection( vip, hexes, ijk, d000 ) && !sameV )
3491 _grid->Remove( vip );
3492 ip._shapeID = edgeID;
3494 } // loop on 3 grid directions
3498 if ( intEdgeIDs.Size() > 0 )
3499 cutByExtendedInternal( hexes, intEdgeIDs );
3504 //================================================================================
3506 * \brief Fully cut hexes that are partially cut by INTERNAL FACE.
3507 * Cut them by extended INTERNAL FACE.
3509 void Hexahedron::cutByExtendedInternal( std::vector< Hexahedron* >& hexes,
3510 const TColStd_MapOfInteger& intEdgeIDs )
3512 IntAna_IntConicQuad intersection;
3513 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
3514 const double tol2 = _grid->_tol * _grid->_tol;
3516 for ( size_t iH = 0; iH < hexes.size(); ++iH )
3518 Hexahedron* hex = hexes[ iH ];
3519 if ( !hex || hex->_eIntPoints.size() < 2 )
3521 if ( !intEdgeIDs.Contains( hex->_eIntPoints.back()->_shapeID ))
3524 // get 3 points on INTERNAL FACE to construct a cutting plane
3525 gp_Pnt p1 = hex->_eIntPoints[0]->_point;
3526 gp_Pnt p2 = hex->_eIntPoints[1]->_point;
3527 gp_Pnt p3 = hex->mostDistantInternalPnt( iH, p1, p2 );
3529 gp_Vec norm = gp_Vec( p1, p2 ) ^ gp_Vec( p1, p3 );
3532 pln = gp_Pln( p1, norm );
3539 TGeomID intFaceID = hex->_eIntPoints.back()->_faceIDs.front(); // FACE being "extended"
3540 TGeomID solidID = _grid->GetSolid( intFaceID )->ID();
3542 // cut links by the plane
3543 //bool isCut = false;
3544 for ( int iLink = 0; iLink < 12; ++iLink )
3546 _Link& link = hex->_hexLinks[ iLink ];
3547 if ( !link._fIntPoints.empty() )
3549 // if ( link._fIntPoints[0]->_faceIDs.back() == _grid->PseudoIntExtFaceID() )
3551 continue; // already cut link
3553 if ( !link._nodes[0]->Node() ||
3554 !link._nodes[1]->Node() )
3555 continue; // outside link
3557 if ( link._nodes[0]->IsOnFace( intFaceID ))
3559 if ( link._nodes[0]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3560 if ( p1.SquareDistance( link._nodes[0]->Point() ) < tol2 ||
3561 p2.SquareDistance( link._nodes[0]->Point() ) < tol2 )
3562 link._nodes[0]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3563 continue; // link is cut by FACE being "extended"
3565 if ( link._nodes[1]->IsOnFace( intFaceID ))
3567 if ( link._nodes[1]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3568 if ( p1.SquareDistance( link._nodes[1]->Point() ) < tol2 ||
3569 p2.SquareDistance( link._nodes[1]->Point() ) < tol2 )
3570 link._nodes[1]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3571 continue; // link is cut by FACE being "extended"
3573 gp_Pnt p4 = link._nodes[0]->Point();
3574 gp_Pnt p5 = link._nodes[1]->Point();
3575 gp_Lin line( p4, gp_Vec( p4, p5 ));
3577 intersection.Perform( line, pln );
3578 if ( !intersection.IsDone() ||
3579 intersection.IsInQuadric() ||
3580 intersection.IsParallel() ||
3581 intersection.NbPoints() < 1 )
3584 double u = intersection.ParamOnConic(1);
3585 if ( u + _grid->_tol < 0 )
3587 int iDir = iLink / 4;
3588 int index = (&hex->_i)[iDir];
3589 double linkLen = _grid->_coords[iDir][index+1] - _grid->_coords[iDir][index];
3590 if ( u - _grid->_tol > linkLen )
3593 if ( u < _grid->_tol ||
3594 u > linkLen - _grid->_tol ) // intersection at grid node
3596 int i = ! ( u < _grid->_tol ); // [0,1]
3597 int iN = link._nodes[ i ] - hex->_hexNodes; // [0-7]
3599 const F_IntersectPoint * & ip = _grid->_gridIntP[ hex->_origNodeInd + _nodeShift[iN] ];
3602 ip = _grid->_extIntPool.getNew();
3603 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3604 //ip->_transition = Trans_INTERNAL;
3606 else if ( ip->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3608 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3610 hex->_nbFaceIntNodes++;
3615 const gp_Pnt& p = intersection.Point( 1 );
3616 F_IntersectPoint* ip = _grid->_extIntPool.getNew();
3617 ip->_node = meshDS->AddNode( p.X(), p.Y(), p.Z() );
3618 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3619 ip->_transition = Trans_INTERNAL;
3620 meshDS->SetNodeInVolume( ip->_node, solidID );
3622 CellsAroundLink fourCells( _grid, iDir );
3623 fourCells.Init( hex->_i, hex->_j, hex->_k, iLink );
3624 int i,j,k, cellIndex;
3625 for ( int iC = 0; iC < 4; ++iC ) // loop on 4 cells sharing the link
3627 if ( !fourCells.GetCell( iC, i,j,k, cellIndex ))
3629 Hexahedron * h = hexes[ cellIndex ];
3631 h = hexes[ cellIndex ] = new Hexahedron( *this, i, j, k, cellIndex );
3632 const int iL = iC + iDir * 4;
3633 h->_hexLinks[iL]._fIntPoints.push_back( ip );
3634 h->_nbFaceIntNodes++;
3641 // for ( size_t i = 0; i < hex->_eIntPoints.size(); ++i )
3643 // if ( _grid->IsInternal( hex->_eIntPoints[i]->_shapeID ) &&
3644 // ! hex->_eIntPoints[i]->IsOnFace( _grid->PseudoIntExtFaceID() ))
3645 // hex->_eIntPoints[i]->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3649 } // loop on all hexes
3653 //================================================================================
3655 * \brief Return intersection point on INTERNAL FACE most distant from given ones
3657 gp_Pnt Hexahedron::mostDistantInternalPnt( int hexIndex, const gp_Pnt& p1, const gp_Pnt& p2 )
3659 gp_Pnt resultPnt = p1;
3661 double maxDist2 = 0;
3662 for ( int iLink = 0; iLink < 12; ++iLink ) // check links
3664 _Link& link = _hexLinks[ iLink ];
3665 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
3666 if ( _grid->PseudoIntExtFaceID() != link._fIntPoints[i]->_faceIDs[0] &&
3667 _grid->IsInternal( link._fIntPoints[i]->_faceIDs[0] ) &&
3668 link._fIntPoints[i]->_node )
3670 gp_Pnt p = SMESH_NodeXYZ( link._fIntPoints[i]->_node );
3671 double d = p1.SquareDistance( p );
3679 d = p2.SquareDistance( p );
3689 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
3691 for ( size_t iN = 0; iN < 8; ++iN ) // check corners
3693 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
3694 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
3695 if ( _hexNodes[iN]._intPoint )
3696 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
3698 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
3700 gp_Pnt p = SMESH_NodeXYZ( _hexNodes[iN]._node );
3701 double d = p1.SquareDistance( p );
3709 d = p2.SquareDistance( p );
3719 if ( maxDist2 < _grid->_tol * _grid->_tol )
3725 //================================================================================
3727 * \brief Finds intersection of a curve with a plane
3728 * \param [in] u1 - parameter of one curve point
3729 * \param [in] proj1 - projection of the curve point to the plane normal
3730 * \param [in] u2 - parameter of another curve point
3731 * \param [in] proj2 - projection of the other curve point to the plane normal
3732 * \param [in] proj - projection of a point where the curve intersects the plane
3733 * \param [in] curve - the curve
3734 * \param [in] axis - the plane normal
3735 * \param [in] origin - the plane origin
3736 * \return gp_Pnt - the found intersection point
3738 gp_Pnt Hexahedron::findIntPoint( double u1, double proj1,
3739 double u2, double proj2,
3741 BRepAdaptor_Curve& curve,
3743 const gp_XYZ& origin)
3745 double r = (( proj - proj1 ) / ( proj2 - proj1 ));
3746 double u = u1 * ( 1 - r ) + u2 * r;
3747 gp_Pnt p = curve.Value( u );
3748 double newProj = axis * ( p.XYZ() - origin );
3749 if ( Abs( proj - newProj ) > _grid->_tol / 10. )
3752 return findIntPoint( u2, proj2, u, newProj, proj, curve, axis, origin );
3754 return findIntPoint( u1, proj2, u, newProj, proj, curve, axis, origin );
3759 //================================================================================
3761 * \brief Returns indices of a hexahedron sub-entities holding a point
3762 * \param [in] ip - intersection point
3763 * \param [out] facets - 0-3 facets holding a point
3764 * \param [out] sub - index of a vertex or an edge holding a point
3765 * \return int - number of facets holding a point
3767 int Hexahedron::getEntity( const E_IntersectPoint* ip, int* facets, int& sub )
3769 enum { X = 1, Y = 2, Z = 4 }; // == 001, 010, 100
3771 int vertex = 0, edgeMask = 0;
3773 if ( Abs( _grid->_coords[0][ _i ] - ip->_uvw[0] ) < _grid->_tol ) {
3774 facets[ nbFacets++ ] = SMESH_Block::ID_F0yz;
3777 else if ( Abs( _grid->_coords[0][ _i+1 ] - ip->_uvw[0] ) < _grid->_tol ) {
3778 facets[ nbFacets++ ] = SMESH_Block::ID_F1yz;
3782 if ( Abs( _grid->_coords[1][ _j ] - ip->_uvw[1] ) < _grid->_tol ) {
3783 facets[ nbFacets++ ] = SMESH_Block::ID_Fx0z;
3786 else if ( Abs( _grid->_coords[1][ _j+1 ] - ip->_uvw[1] ) < _grid->_tol ) {
3787 facets[ nbFacets++ ] = SMESH_Block::ID_Fx1z;
3791 if ( Abs( _grid->_coords[2][ _k ] - ip->_uvw[2] ) < _grid->_tol ) {
3792 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy0;
3795 else if ( Abs( _grid->_coords[2][ _k+1 ] - ip->_uvw[2] ) < _grid->_tol ) {
3796 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy1;
3803 case 0: sub = 0; break;
3804 case 1: sub = facets[0]; break;
3806 const int edge [3][8] = {
3807 { SMESH_Block::ID_E00z, SMESH_Block::ID_E10z,
3808 SMESH_Block::ID_E01z, SMESH_Block::ID_E11z },
3809 { SMESH_Block::ID_E0y0, SMESH_Block::ID_E1y0, 0, 0,
3810 SMESH_Block::ID_E0y1, SMESH_Block::ID_E1y1 },
3811 { SMESH_Block::ID_Ex00, 0, SMESH_Block::ID_Ex10, 0,
3812 SMESH_Block::ID_Ex01, 0, SMESH_Block::ID_Ex11 }
3814 switch ( edgeMask ) {
3815 case X | Y: sub = edge[ 0 ][ vertex ]; break;
3816 case X | Z: sub = edge[ 1 ][ vertex ]; break;
3817 default: sub = edge[ 2 ][ vertex ];
3823 sub = vertex + SMESH_Block::ID_FirstV;
3828 //================================================================================
3830 * \brief Adds intersection with an EDGE
3832 bool Hexahedron::addIntersection( const E_IntersectPoint* ip,
3833 vector< Hexahedron* >& hexes,
3834 int ijk[], int dIJK[] )
3838 size_t hexIndex[4] = {
3839 _grid->CellIndex( ijk[0], ijk[1], ijk[2] ),
3840 dIJK[0] ? _grid->CellIndex( ijk[0]+dIJK[0], ijk[1], ijk[2] ) : -1,
3841 dIJK[1] ? _grid->CellIndex( ijk[0], ijk[1]+dIJK[1], ijk[2] ) : -1,
3842 dIJK[2] ? _grid->CellIndex( ijk[0], ijk[1], ijk[2]+dIJK[2] ) : -1
3844 for ( int i = 0; i < 4; ++i )
3846 if ( hexIndex[i] < hexes.size() && hexes[ hexIndex[i] ] )
3848 Hexahedron* h = hexes[ hexIndex[i] ];
3849 h->_eIntPoints.reserve(2);
3850 h->_eIntPoints.push_back( ip );
3853 // check if ip is really inside the hex
3854 if ( h->isOutParam( ip->_uvw ))
3855 throw SALOME_Exception("ip outside a hex");
3861 //================================================================================
3863 * \brief Finds nodes at a path from one node to another via intersections with EDGEs
3865 bool Hexahedron::findChain( _Node* n1,
3868 vector<_Node*>& chn )
3871 chn.push_back( n1 );
3872 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3873 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3874 n1->IsLinked( quad._eIntNodes[ iP ]->_intPoint ) &&
3875 n2->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3877 chn.push_back( quad._eIntNodes[ iP ]);
3878 chn.push_back( n2 );
3879 quad._eIntNodes[ iP ]->_usedInFace = &quad;
3886 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3887 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3888 chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3890 chn.push_back( quad._eIntNodes[ iP ]);
3891 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
3894 } while ( found && ! chn.back()->IsLinked( n2->_intPoint ) );
3896 if ( chn.back() != n2 && chn.back()->IsLinked( n2->_intPoint ))
3897 chn.push_back( n2 );
3899 return chn.size() > 1;
3901 //================================================================================
3903 * \brief Try to heal a polygon whose ends are not connected
3905 bool Hexahedron::closePolygon( _Face* polygon, vector<_Node*>& chainNodes ) const
3907 int i = -1, nbLinks = polygon->_links.size();
3910 vector< _OrientedLink > newLinks;
3911 // find a node lying on the same FACE as the last one
3912 _Node* node = polygon->_links.back().LastNode();
3913 int avoidFace = node->IsLinked( polygon->_links.back().FirstNode()->_intPoint );
3914 for ( i = nbLinks - 2; i >= 0; --i )
3915 if ( node->IsLinked( polygon->_links[i].FirstNode()->_intPoint, avoidFace ))
3919 for ( ; i < nbLinks; ++i )
3920 newLinks.push_back( polygon->_links[i] );
3924 // find a node lying on the same FACE as the first one
3925 node = polygon->_links[0].FirstNode();
3926 avoidFace = node->IsLinked( polygon->_links[0].LastNode()->_intPoint );
3927 for ( i = 1; i < nbLinks; ++i )
3928 if ( node->IsLinked( polygon->_links[i].LastNode()->_intPoint, avoidFace ))
3931 for ( nbLinks = i + 1, i = 0; i < nbLinks; ++i )
3932 newLinks.push_back( polygon->_links[i] );
3934 if ( newLinks.size() > 1 )
3936 polygon->_links.swap( newLinks );
3938 chainNodes.push_back( polygon->_links.back().LastNode() );
3939 chainNodes.push_back( polygon->_links[0].FirstNode() );
3944 //================================================================================
3946 * \brief Finds nodes on the same EDGE as the first node of avoidSplit.
3948 * This function is for
3949 * 1) a case where an EDGE lies on a quad which lies on a FACE
3950 * so that a part of quad in ON and another part is IN
3951 * 2) INTERNAL FACE passes through the 1st node of avoidSplit
3953 bool Hexahedron::findChainOnEdge( const vector< _OrientedLink >& splits,
3954 const _OrientedLink& prevSplit,
3955 const _OrientedLink& avoidSplit,
3958 vector<_Node*>& chn )
3960 _Node* pn1 = prevSplit.FirstNode();
3961 _Node* pn2 = prevSplit.LastNode();
3962 int avoidFace = pn1->IsLinked( pn2->_intPoint ); // FACE under the quad
3963 if ( avoidFace < 1 && pn1->_intPoint )
3966 _Node* n = 0, *stopNode = avoidSplit.LastNode();
3969 if ( !quad._eIntNodes.empty() ) // connect pn2 with EDGE intersections
3971 chn.push_back( pn2 );
3976 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3977 if (( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad )) &&
3978 ( chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint, avoidFace )) &&
3979 ( !avoidFace || quad._eIntNodes[ iP ]->IsOnFace( avoidFace )))
3981 chn.push_back( quad._eIntNodes[ iP ]);
3982 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
3990 for ( i = splits.size()-1; i >= 0; --i ) // connect new pn2 (at _eIntNodes) with a split
3995 n = splits[i].LastNode();
3996 if ( n == stopNode )
3999 ( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4000 ( !avoidFace || n->IsOnFace( avoidFace )))
4003 n = splits[i].FirstNode();
4004 if ( n == stopNode )
4006 if (( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4007 ( !avoidFace || n->IsOnFace( avoidFace )))
4011 if ( n && n != stopNode )
4014 chn.push_back( pn2 );
4019 else if ( !chn.empty() && chn.back()->_isInternalFlags )
4021 // INTERNAL FACE partially cuts the quad
4022 for ( int i = chn.size() - 2; i >= 0; --i )
4023 chn.push_back( chn[ i ]);
4028 //================================================================================
4030 * \brief Checks transition at the ginen intersection node of a link
4032 bool Hexahedron::isOutPoint( _Link& link, int iP,
4033 SMESH_MesherHelper& helper, const Solid* solid ) const
4037 if ( link._fIntNodes[iP]->faces().size() == 1 &&
4038 _grid->IsInternal( link._fIntNodes[iP]->face(0) ))
4041 const bool moreIntPoints = ( iP+1 < (int) link._fIntNodes.size() );
4044 _Node* n1 = link._fIntNodes[ iP ];
4046 n1 = link._nodes[0];
4047 _Node* n2 = moreIntPoints ? link._fIntNodes[ iP+1 ] : 0;
4048 if ( !n2 || !n2->Node() )
4049 n2 = link._nodes[1];
4053 // get all FACEs under n1 and n2
4054 set< TGeomID > faceIDs;
4055 if ( moreIntPoints ) faceIDs.insert( link._fIntNodes[iP+1]->faces().begin(),
4056 link._fIntNodes[iP+1]->faces().end() );
4057 if ( n2->_intPoint ) faceIDs.insert( n2->_intPoint->_faceIDs.begin(),
4058 n2->_intPoint->_faceIDs.end() );
4059 if ( faceIDs.empty() )
4060 return false; // n2 is inside
4061 if ( n1->_intPoint ) faceIDs.insert( n1->_intPoint->_faceIDs.begin(),
4062 n1->_intPoint->_faceIDs.end() );
4063 faceIDs.insert( link._fIntNodes[iP]->faces().begin(),
4064 link._fIntNodes[iP]->faces().end() );
4066 // get a point between 2 nodes
4067 gp_Pnt p1 = n1->Point();
4068 gp_Pnt p2 = n2->Point();
4069 gp_Pnt pOnLink = 0.8 * p1.XYZ() + 0.2 * p2.XYZ();
4071 TopLoc_Location loc;
4073 set< TGeomID >::iterator faceID = faceIDs.begin();
4074 for ( ; faceID != faceIDs.end(); ++faceID )
4076 // project pOnLink on a FACE
4077 if ( *faceID < 1 || !solid->Contains( *faceID )) continue;
4078 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( *faceID ));
4079 GeomAPI_ProjectPointOnSurf& proj = helper.GetProjector( face, loc, 0.1*_grid->_tol );
4080 gp_Pnt testPnt = pOnLink.Transformed( loc.Transformation().Inverted() );
4081 proj.Perform( testPnt );
4082 if ( proj.IsDone() && proj.NbPoints() > 0 )
4085 proj.LowerDistanceParameters( u,v );
4087 if ( proj.LowerDistance() <= 0.1 * _grid->_tol )
4093 // find isOut by normals
4095 if ( GeomLib::NormEstim( BRep_Tool::Surface( face, loc ),
4100 if ( solid->Orientation( face ) == TopAbs_REVERSED )
4102 gp_Vec v( proj.NearestPoint(), testPnt );
4103 isOut = ( v * normal > 0 );
4108 // classify a projection
4109 if ( !n1->IsOnFace( *faceID ) || !n2->IsOnFace( *faceID ))
4111 BRepTopAdaptor_FClass2d cls( face, Precision::Confusion() );
4112 TopAbs_State state = cls.Perform( gp_Pnt2d( u,v ));
4113 if ( state == TopAbs_OUT )
4125 //================================================================================
4127 * \brief Sort nodes on a FACE
4129 void Hexahedron::sortVertexNodes(vector<_Node*>& nodes, _Node* curNode, TGeomID faceID)
4131 if ( nodes.size() > 20 ) return;
4133 // get shapes under nodes
4134 TGeomID nShapeIds[20], *nShapeIdsEnd = &nShapeIds[0] + nodes.size();
4135 for ( size_t i = 0; i < nodes.size(); ++i )
4136 if ( !( nShapeIds[i] = nodes[i]->ShapeID() ))
4139 // get shapes of the FACE
4140 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( faceID ));
4141 list< TopoDS_Edge > edges;
4142 list< int > nbEdges;
4143 int nbW = SMESH_Block::GetOrderedEdges (face, edges, nbEdges);
4145 // select a WIRE - remove EDGEs of irrelevant WIREs from edges
4146 list< TopoDS_Edge >::iterator e = edges.begin(), eEnd = e;
4147 list< int >::iterator nE = nbEdges.begin();
4148 for ( ; nbW > 0; ++nE, --nbW )
4150 std::advance( eEnd, *nE );
4151 for ( ; e != eEnd; ++e )
4152 for ( int i = 0; i < 2; ++i )
4155 _grid->ShapeID( *e ) :
4156 _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ));
4158 ( std::find( &nShapeIds[0], nShapeIdsEnd, id ) != nShapeIdsEnd ))
4160 edges.erase( eEnd, edges.end() ); // remove rest wires
4161 e = eEnd = edges.end();
4168 edges.erase( edges.begin(), eEnd ); // remove a current irrelevant wire
4171 // rotate edges to have the first one at least partially out of the hexa
4172 list< TopoDS_Edge >::iterator e = edges.begin(), eMidOut = edges.end();
4173 for ( ; e != edges.end(); ++e )
4175 if ( !_grid->ShapeID( *e ))
4180 for ( int i = 0; i < 2 && !isOut; ++i )
4184 TopoDS_Vertex v = SMESH_MesherHelper::IthVertex( 0, *e );
4185 p = BRep_Tool::Pnt( v );
4187 else if ( eMidOut == edges.end() )
4189 TopLoc_Location loc;
4190 Handle(Geom_Curve) c = BRep_Tool::Curve( *e, loc, f, l);
4191 if ( c.IsNull() ) break;
4192 p = c->Value( 0.5 * ( f + l )).Transformed( loc );
4199 _grid->ComputeUVW( p.XYZ(), uvw );
4200 if ( isOutParam( uvw ))
4211 if ( e != edges.end() )
4212 edges.splice( edges.end(), edges, edges.begin(), e );
4213 else if ( eMidOut != edges.end() )
4214 edges.splice( edges.end(), edges, edges.begin(), eMidOut );
4216 // sort nodes according to the order of edges
4217 _Node* orderNodes [20];
4218 //TGeomID orderShapeIDs[20];
4220 TGeomID id, *pID = 0;
4221 for ( e = edges.begin(); e != edges.end(); ++e )
4223 if (( id = _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ))) &&
4224 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4226 //orderShapeIDs[ nbN ] = id;
4227 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4230 if (( id = _grid->ShapeID( *e )) &&
4231 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4233 //orderShapeIDs[ nbN ] = id;
4234 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4238 if ( nbN != nodes.size() )
4241 bool reverse = ( orderNodes[0 ]->Point().SquareDistance( curNode->Point() ) >
4242 orderNodes[nbN-1]->Point().SquareDistance( curNode->Point() ));
4244 for ( size_t i = 0; i < nodes.size(); ++i )
4245 nodes[ i ] = orderNodes[ reverse ? nbN-1-i : i ];
4248 //================================================================================
4250 * \brief Adds computed elements to the mesh
4252 int Hexahedron::addVolumes( SMESH_MesherHelper& helper )
4254 F_IntersectPoint noIntPnt;
4255 const bool toCheckNodePos = _grid->IsToCheckNodePos();
4258 // add elements resulted from hexahedron intersection
4259 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
4261 vector< const SMDS_MeshNode* > nodes( volDef->_nodes.size() );
4262 for ( size_t iN = 0; iN < nodes.size(); ++iN )
4264 if ( !( nodes[iN] = volDef->_nodes[iN].Node() ))
4266 if ( const E_IntersectPoint* eip = volDef->_nodes[iN].EdgeIntPnt() )
4268 nodes[iN] = volDef->_nodes[iN]._intPoint->_node =
4269 helper.AddNode( eip->_point.X(),
4272 if ( _grid->ShapeType( eip->_shapeID ) == TopAbs_VERTEX )
4273 helper.GetMeshDS()->SetNodeOnVertex( nodes[iN], eip->_shapeID );
4275 helper.GetMeshDS()->SetNodeOnEdge( nodes[iN], eip->_shapeID );
4278 throw SALOME_Exception("Bug: no node at intersection point");
4280 else if ( volDef->_nodes[iN]._intPoint &&
4281 volDef->_nodes[iN]._intPoint->_node == volDef->_nodes[iN]._node )
4283 // Update position of node at EDGE intersection;
4284 // see comment to _Node::Add( E_IntersectPoint )
4285 SMESHDS_Mesh* mesh = helper.GetMeshDS();
4286 TGeomID shapeID = volDef->_nodes[iN].EdgeIntPnt()->_shapeID;
4287 mesh->UnSetNodeOnShape( nodes[iN] );
4288 if ( _grid->ShapeType( shapeID ) == TopAbs_VERTEX )
4289 mesh->SetNodeOnVertex( nodes[iN], shapeID );
4291 mesh->SetNodeOnEdge( nodes[iN], shapeID );
4293 else if ( toCheckNodePos &&
4294 !nodes[iN]->isMarked() &&
4295 _grid->ShapeType( nodes[iN]->GetShapeID() ) == TopAbs_FACE )
4297 _grid->SetOnShape( nodes[iN], noIntPnt, /*unset=*/true );
4298 nodes[iN]->setIsMarked( true );
4302 const SMDS_MeshElement* v = 0;
4303 if ( !volDef->_quantities.empty() )
4305 v = helper.AddPolyhedralVolume( nodes, volDef->_quantities );
4309 switch ( nodes.size() )
4311 case 8: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],
4312 nodes[4],nodes[5],nodes[6],nodes[7] );
4314 case 4: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3] );
4316 case 6: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4],nodes[5] );
4318 case 5: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4] );
4322 if (( volDef->_volume = v ))
4324 helper.GetMeshDS()->SetMeshElementOnShape( v, volDef->_solidID );
4331 //================================================================================
4333 * \brief Return true if the element is in a hole
4335 bool Hexahedron::isInHole() const
4337 if ( !_vIntNodes.empty() )
4340 const size_t ijk[3] = { _i, _j, _k };
4341 F_IntersectPoint curIntPnt;
4343 // consider a cell to be in a hole if all links in any direction
4344 // comes OUT of geometry
4345 for ( int iDir = 0; iDir < 3; ++iDir )
4347 const vector<double>& coords = _grid->_coords[ iDir ];
4348 LineIndexer li = _grid->GetLineIndexer( iDir );
4349 li.SetIJK( _i,_j,_k );
4350 size_t lineIndex[4] = { li.LineIndex (),
4354 bool allLinksOut = true, hasLinks = false;
4355 for ( int iL = 0; iL < 4 && allLinksOut; ++iL ) // loop on 4 links parallel to iDir
4357 const _Link& link = _hexLinks[ iL + 4*iDir ];
4358 // check transition of the first node of a link
4359 const F_IntersectPoint* firstIntPnt = 0;
4360 if ( link._nodes[0]->Node() ) // 1st node is a hexa corner
4362 curIntPnt._paramOnLine = coords[ ijk[ iDir ]] - coords[0] + _grid->_tol;
4363 const GridLine& line = _grid->_lines[ iDir ][ lineIndex[ iL ]];
4364 multiset< F_IntersectPoint >::const_iterator ip =
4365 line._intPoints.upper_bound( curIntPnt );
4367 firstIntPnt = &(*ip);
4369 else if ( !link._fIntPoints.empty() )
4371 firstIntPnt = link._fIntPoints[0];
4377 allLinksOut = ( firstIntPnt->_transition == Trans_OUT &&
4378 !_grid->IsShared( firstIntPnt->_faceIDs[0] ));
4381 if ( hasLinks && allLinksOut )
4387 //================================================================================
4389 * \brief Check if a polyherdon has an edge lying on EDGE shared by strange FACE
4390 * that will be meshed by other algo
4392 bool Hexahedron::hasStrangeEdge() const
4394 if ( _eIntPoints.size() < 2 )
4397 TopTools_MapOfShape edges;
4398 for ( size_t i = 0; i < _eIntPoints.size(); ++i )
4400 if ( !_grid->IsStrangeEdge( _eIntPoints[i]->_shapeID ))
4402 const TopoDS_Shape& s = _grid->Shape( _eIntPoints[i]->_shapeID );
4403 if ( s.ShapeType() == TopAbs_EDGE )
4405 if ( ! edges.Add( s ))
4406 return true; // an EDGE encounters twice
4410 PShapeIteratorPtr edgeIt = _grid->_helper->GetAncestors( s,
4411 *_grid->_helper->GetMesh(),
4413 while ( const TopoDS_Shape* edge = edgeIt->next() )
4414 if ( ! edges.Add( *edge ))
4415 return true; // an EDGE encounters twice
4421 //================================================================================
4423 * \brief Return true if a polyhedron passes _sizeThreshold criterion
4425 bool Hexahedron::checkPolyhedronSize( bool cutByInternalFace ) const
4427 if ( cutByInternalFace && !_grid->_toUseThresholdForInternalFaces )
4429 // check if any polygon fully lies on shared/internal FACEs
4430 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4432 const _Face& polygon = _polygons[iP];
4433 if ( polygon._links.empty() )
4435 bool allNodesInternal = true;
4436 for ( size_t iL = 0; iL < polygon._links.size() && allNodesInternal; ++iL )
4438 _Node* n = polygon._links[ iL ].FirstNode();
4439 allNodesInternal = (( n->IsCutByInternal() ) ||
4440 ( n->_intPoint && _grid->IsAnyShared( n->_intPoint->_faceIDs )));
4442 if ( allNodesInternal )
4446 if ( this->hasStrangeEdge() )
4450 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4452 const _Face& polygon = _polygons[iP];
4453 if ( polygon._links.empty() )
4455 gp_XYZ area (0,0,0);
4456 gp_XYZ p1 = polygon._links[ 0 ].FirstNode()->Point().XYZ();
4457 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
4459 gp_XYZ p2 = polygon._links[ iL ].LastNode()->Point().XYZ();
4463 volume += p1 * area;
4467 double initVolume = _sideLength[0] * _sideLength[1] * _sideLength[2];
4469 return volume > initVolume / _grid->_sizeThreshold;
4471 //================================================================================
4473 * \brief Tries to create a hexahedron
4475 bool Hexahedron::addHexa()
4477 int nbQuad = 0, iQuad = -1;
4478 for ( size_t i = 0; i < _polygons.size(); ++i )
4480 if ( _polygons[i]._links.empty() )
4482 if ( _polygons[i]._links.size() != 4 )
4493 for ( int iL = 0; iL < 4; ++iL )
4496 nodes[iL] = _polygons[iQuad]._links[iL].FirstNode();
4499 // find a top node above the base node
4500 _Link* link = _polygons[iQuad]._links[iL]._link;
4501 if ( !link->_faces[0] || !link->_faces[1] )
4502 return debugDumpLink( link );
4503 // a quadrangle sharing <link> with _polygons[iQuad]
4504 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[iQuad] )];
4505 for ( int i = 0; i < 4; ++i )
4506 if ( quad->_links[i]._link == link )
4508 // 1st node of a link opposite to <link> in <quad>
4509 nodes[iL+4] = quad->_links[(i+2)%4].FirstNode();
4515 _volumeDefs.Set( &nodes[0], 8 );
4519 //================================================================================
4521 * \brief Tries to create a tetrahedron
4523 bool Hexahedron::addTetra()
4526 for ( size_t i = 0; i < _polygons.size() && iTria < 0; ++i )
4527 if ( _polygons[i]._links.size() == 3 )
4533 nodes[0] = _polygons[iTria]._links[0].FirstNode();
4534 nodes[1] = _polygons[iTria]._links[1].FirstNode();
4535 nodes[2] = _polygons[iTria]._links[2].FirstNode();
4537 _Link* link = _polygons[iTria]._links[0]._link;
4538 if ( !link->_faces[0] || !link->_faces[1] )
4539 return debugDumpLink( link );
4541 // a triangle sharing <link> with _polygons[0]
4542 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[iTria] )];
4543 for ( int i = 0; i < 3; ++i )
4544 if ( tria->_links[i]._link == link )
4546 nodes[3] = tria->_links[(i+1)%3].LastNode();
4547 _volumeDefs.Set( &nodes[0], 4 );
4553 //================================================================================
4555 * \brief Tries to create a pentahedron
4557 bool Hexahedron::addPenta()
4559 // find a base triangular face
4561 for ( int iF = 0; iF < 5 && iTri < 0; ++iF )
4562 if ( _polygons[ iF ]._links.size() == 3 )
4564 if ( iTri < 0 ) return false;
4569 for ( int iL = 0; iL < 3; ++iL )
4572 nodes[iL] = _polygons[ iTri ]._links[iL].FirstNode();
4575 // find a top node above the base node
4576 _Link* link = _polygons[ iTri ]._links[iL]._link;
4577 if ( !link->_faces[0] || !link->_faces[1] )
4578 return debugDumpLink( link );
4579 // a quadrangle sharing <link> with a base triangle
4580 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[ iTri ] )];
4581 if ( quad->_links.size() != 4 ) return false;
4582 for ( int i = 0; i < 4; ++i )
4583 if ( quad->_links[i]._link == link )
4585 // 1st node of a link opposite to <link> in <quad>
4586 nodes[iL+3] = quad->_links[(i+2)%4].FirstNode();
4592 _volumeDefs.Set( &nodes[0], 6 );
4594 return ( nbN == 6 );
4596 //================================================================================
4598 * \brief Tries to create a pyramid
4600 bool Hexahedron::addPyra()
4602 // find a base quadrangle
4604 for ( int iF = 0; iF < 5 && iQuad < 0; ++iF )
4605 if ( _polygons[ iF ]._links.size() == 4 )
4607 if ( iQuad < 0 ) return false;
4611 nodes[0] = _polygons[iQuad]._links[0].FirstNode();
4612 nodes[1] = _polygons[iQuad]._links[1].FirstNode();
4613 nodes[2] = _polygons[iQuad]._links[2].FirstNode();
4614 nodes[3] = _polygons[iQuad]._links[3].FirstNode();
4616 _Link* link = _polygons[iQuad]._links[0]._link;
4617 if ( !link->_faces[0] || !link->_faces[1] )
4618 return debugDumpLink( link );
4620 // a triangle sharing <link> with a base quadrangle
4621 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[ iQuad ] )];
4622 if ( tria->_links.size() != 3 ) return false;
4623 for ( int i = 0; i < 3; ++i )
4624 if ( tria->_links[i]._link == link )
4626 nodes[4] = tria->_links[(i+1)%3].LastNode();
4627 _volumeDefs.Set( &nodes[0], 5 );
4633 //================================================================================
4635 * \brief Dump a link and return \c false
4637 bool Hexahedron::debugDumpLink( Hexahedron::_Link* link )
4640 gp_Pnt p1 = link->_nodes[0]->Point(), p2 = link->_nodes[1]->Point();
4641 cout << "BUG: not shared link. IKJ = ( "<< _i << " " << _j << " " << _k << " )" << endl
4642 << "n1 (" << p1.X() << ", "<< p1.Y() << ", "<< p1.Z() << " )" << endl
4643 << "n2 (" << p2.X() << ", "<< p2.Y() << ", "<< p2.Z() << " )" << endl;
4647 //================================================================================
4649 * \brief Classify a point by grid parameters
4651 bool Hexahedron::isOutParam(const double uvw[3]) const
4653 return (( _grid->_coords[0][ _i ] - _grid->_tol > uvw[0] ) ||
4654 ( _grid->_coords[0][ _i+1 ] + _grid->_tol < uvw[0] ) ||
4655 ( _grid->_coords[1][ _j ] - _grid->_tol > uvw[1] ) ||
4656 ( _grid->_coords[1][ _j+1 ] + _grid->_tol < uvw[1] ) ||
4657 ( _grid->_coords[2][ _k ] - _grid->_tol > uvw[2] ) ||
4658 ( _grid->_coords[2][ _k+1 ] + _grid->_tol < uvw[2] ));
4660 //================================================================================
4662 * \brief Divide a polygon into triangles and modify accordingly an adjacent polyhedron
4664 void splitPolygon( const SMDS_MeshElement* polygon,
4665 SMDS_VolumeTool & volume,
4666 const int facetIndex,
4667 const TGeomID faceID,
4668 const TGeomID solidID,
4669 SMESH_MeshEditor::ElemFeatures& face,
4670 SMESH_MeshEditor& editor,
4671 const bool reinitVolume)
4673 SMESH_MeshAlgos::Triangulate divider(/*optimize=*/false);
4674 int nbTrias = divider.GetTriangles( polygon, face.myNodes );
4675 face.myNodes.resize( nbTrias * 3 );
4677 SMESH_MeshEditor::ElemFeatures newVolumeDef;
4678 newVolumeDef.Init( volume.Element() );
4679 newVolumeDef.SetID( volume.Element()->GetID() );
4681 newVolumeDef.myPolyhedQuantities.reserve( volume.NbFaces() + nbTrias );
4682 newVolumeDef.myNodes.reserve( volume.NbNodes() + nbTrias * 3 );
4684 SMESHDS_Mesh* meshDS = editor.GetMeshDS();
4685 SMDS_MeshElement* newTriangle;
4686 for ( int iF = 0, nF = volume.NbFaces(); iF < nF; iF++ )
4688 if ( iF == facetIndex )
4690 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4691 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4692 face.myNodes.begin(),
4693 face.myNodes.begin() + 3 );
4694 meshDS->RemoveFreeElement( polygon, 0, false );
4695 newTriangle = meshDS->AddFace( face.myNodes[0], face.myNodes[1], face.myNodes[2] );
4696 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4700 const SMDS_MeshNode** nn = volume.GetFaceNodes( iF );
4701 const size_t nbFaceNodes = volume.NbFaceNodes ( iF );
4702 newVolumeDef.myPolyhedQuantities.push_back( nbFaceNodes );
4703 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(), nn, nn + nbFaceNodes );
4707 for ( size_t iN = 3; iN < face.myNodes.size(); iN += 3 )
4709 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4710 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4711 face.myNodes.begin() + iN,
4712 face.myNodes.begin() + iN + 3 );
4713 newTriangle = meshDS->AddFace( face.myNodes[iN], face.myNodes[iN+1], face.myNodes[iN+2] );
4714 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4717 meshDS->RemoveFreeElement( volume.Element(), 0, false );
4718 SMDS_MeshElement* newVolume = editor.AddElement( newVolumeDef.myNodes, newVolumeDef );
4719 meshDS->SetMeshElementOnShape( newVolume, solidID );
4724 volume.Set( newVolume );
4728 //================================================================================
4730 * \brief Create mesh faces at free facets
4732 void Hexahedron::addFaces( SMESH_MesherHelper& helper,
4733 const vector< const SMDS_MeshElement* > & boundaryVolumes )
4735 if ( !_grid->_toCreateFaces )
4738 SMDS_VolumeTool vTool;
4739 vector<int> bndFacets;
4740 SMESH_MeshEditor editor( helper.GetMesh() );
4741 SMESH_MeshEditor::ElemFeatures face( SMDSAbs_Face );
4742 SMESHDS_Mesh* meshDS = helper.GetMeshDS();
4744 // check if there are internal or shared FACEs
4745 bool hasInternal = ( !_grid->_geometry.IsOneSolid() ||
4746 _grid->_geometry._soleSolid.HasInternalFaces() );
4748 for ( size_t iV = 0; iV < boundaryVolumes.size(); ++iV )
4750 if ( !vTool.Set( boundaryVolumes[ iV ]))
4753 TGeomID solidID = vTool.Element()->GetShapeID();
4754 Solid * solid = _grid->GetOneOfSolids( solidID );
4756 // find boundary facets
4759 for ( int iF = 0, n = vTool.NbFaces(); iF < n; iF++ )
4761 bool isBoundary = vTool.IsFreeFace( iF );
4764 bndFacets.push_back( iF );
4766 else if ( hasInternal )
4768 // check if all nodes are on internal/shared FACEs
4770 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iF );
4771 const size_t nbFaceNodes = vTool.NbFaceNodes ( iF );
4772 for ( size_t iN = 0; iN < nbFaceNodes && isBoundary; ++iN )
4773 isBoundary = ( nn[ iN ]->GetShapeID() != solidID );
4775 bndFacets.push_back( -( iF+1 )); // !!! minus ==> to check the FACE
4778 if ( bndFacets.empty() )
4783 if ( !vTool.IsPoly() )
4784 vTool.SetExternalNormal();
4785 for ( size_t i = 0; i < bndFacets.size(); ++i ) // loop on boundary facets
4787 const bool isBoundary = ( bndFacets[i] >= 0 );
4788 const int iFacet = isBoundary ? bndFacets[i] : -bndFacets[i]-1;
4789 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iFacet );
4790 const size_t nbFaceNodes = vTool.NbFaceNodes ( iFacet );
4791 face.myNodes.assign( nn, nn + nbFaceNodes );
4794 const SMDS_MeshElement* existFace = 0, *newFace = 0;
4796 if (( existFace = meshDS->FindElement( face.myNodes, SMDSAbs_Face )))
4798 if ( existFace->isMarked() )
4799 continue; // created by this method
4800 faceID = existFace->GetShapeID();
4804 // look for a supporting FACE
4805 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN ) // look for a node on FACE
4807 if ( nn[ iN ]->GetPosition()->GetDim() == 2 )
4808 faceID = nn[ iN ]->GetShapeID();
4810 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN )
4812 // look for a father FACE of EDGEs and VERTEXes
4813 const TopoDS_Shape& s1 = _grid->Shape( nn[ iN ]->GetShapeID() );
4814 const TopoDS_Shape& s2 = _grid->Shape( nn[ iN+1 ]->GetShapeID() );
4815 if ( s1 != s2 && s1.ShapeType() == TopAbs_EDGE && s2.ShapeType() == TopAbs_EDGE )
4817 TopoDS_Shape f = helper.GetCommonAncestor( s1, s2, *helper.GetMesh(), TopAbs_FACE );
4819 faceID = _grid->ShapeID( f );
4823 bool toCheckFace = faceID && (( !isBoundary ) ||
4824 ( hasInternal && _grid->_toUseThresholdForInternalFaces ));
4825 if ( toCheckFace ) // check if all nodes are on the found FACE
4827 SMESH_subMesh* faceSM = helper.GetMesh()->GetSubMeshContaining( faceID );
4828 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4830 TGeomID subID = nn[ iN ]->GetShapeID();
4831 if ( subID != faceID && !faceSM->DependsOn( subID ))
4834 if ( !faceID && !isBoundary )
4838 // orient a new face according to supporting FACE orientation in shape_to_mesh
4839 if ( !solid->IsOutsideOriented( faceID ))
4842 editor.Reorient( existFace );
4844 std::reverse( face.myNodes.begin(), face.myNodes.end() );
4847 if ( ! ( newFace = existFace ))
4849 face.SetPoly( nbFaceNodes > 4 );
4850 newFace = editor.AddElement( face.myNodes, face );
4853 newFace->setIsMarked( true ); // to distinguish from face created in getBoundaryElems()
4856 if ( faceID && _grid->IsBoundaryFace( faceID )) // face is not shared
4858 // set newFace to the found FACE provided that it fully lies on the FACE
4859 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4860 if ( nn[iN]->GetShapeID() == solidID )
4863 meshDS->UnSetMeshElementOnShape( existFace, _grid->Shape( faceID ));
4868 // split a polygon that will be used by other 3D algorithm
4869 if ( faceID && nbFaceNodes > 4 &&
4870 !_grid->IsInternal( faceID ) &&
4871 !_grid->IsShared( faceID ) &&
4872 !_grid->IsBoundaryFace( faceID ))
4874 splitPolygon( newFace, vTool, iFacet, faceID, solidID,
4875 face, editor, i+1 < bndFacets.size() );
4880 meshDS->SetMeshElementOnShape( newFace, faceID );
4882 meshDS->SetMeshElementOnShape( newFace, solidID );
4884 } // loop on bndFacets
4885 } // loop on boundaryVolumes
4888 // Orient coherently mesh faces on INTERNAL FACEs
4892 TopExp_Explorer faceExp( _grid->_geometry._mainShape, TopAbs_FACE );
4893 for ( ; faceExp.More(); faceExp.Next() )
4895 if ( faceExp.Current().Orientation() != TopAbs_INTERNAL )
4898 SMESHDS_SubMesh* sm = meshDS->MeshElements( faceExp.Current() );
4899 if ( !sm ) continue;
4901 TIDSortedElemSet facesToOrient;
4902 for ( SMDS_ElemIteratorPtr fIt = sm->GetElements(); fIt->more(); )
4903 facesToOrient.insert( facesToOrient.end(), fIt->next() );
4904 if ( facesToOrient.size() < 2 )
4907 gp_Dir direction(1,0,0);
4908 const SMDS_MeshElement* anyFace = *facesToOrient.begin();
4909 editor.Reorient2D( facesToOrient, direction, anyFace );
4915 //================================================================================
4917 * \brief Create mesh segments.
4919 void Hexahedron::addSegments( SMESH_MesherHelper& helper,
4920 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap )
4922 SMESHDS_Mesh* mesh = helper.GetMeshDS();
4924 std::vector<const SMDS_MeshNode*> nodes;
4925 std::vector<const SMDS_MeshElement *> elems;
4926 map< TGeomID, vector< TGeomID > >::const_iterator e2ff = edge2faceIDsMap.begin();
4927 for ( ; e2ff != edge2faceIDsMap.end(); ++e2ff )
4929 const TopoDS_Edge& edge = TopoDS::Edge( _grid->Shape( e2ff->first ));
4930 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( e2ff->second[0] ));
4931 StdMeshers_FaceSide side( face, edge, helper.GetMesh(), /*isFwd=*/true, /*skipMed=*/true );
4932 nodes = side.GetOrderedNodes();
4935 if ( nodes.size() == 2 )
4936 // check that there is an element connecting two nodes
4937 if ( !mesh->GetElementsByNodes( nodes, elems ))
4940 for ( size_t i = 1; i < nodes.size(); i++ )
4942 SMDS_MeshElement* segment = mesh->AddEdge( nodes[i-1], nodes[i] );
4943 mesh->SetMeshElementOnShape( segment, e2ff->first );
4949 //================================================================================
4951 * \brief Return created volumes and volumes that can have free facet because of
4952 * skipped small volume. Also create mesh faces on free facets
4953 * of adjacent not-cut volumes id the result volume is too small.
4955 void Hexahedron::getBoundaryElems( vector< const SMDS_MeshElement* > & boundaryElems )
4957 if ( _hasTooSmall /*|| _volumeDefs.IsEmpty()*/ )
4959 // create faces around a missing small volume
4961 SMESH_MeshEditor editor( _grid->_helper->GetMesh() );
4962 SMESH_MeshEditor::ElemFeatures polygon( SMDSAbs_Face );
4963 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
4964 std::vector<const SMDS_MeshElement *> adjVolumes(2);
4965 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
4967 const size_t nbLinks = _polygons[ iF ]._links.size();
4968 if ( nbLinks != 4 ) continue;
4969 polygon.myNodes.resize( nbLinks );
4970 polygon.myNodes.back() = 0;
4971 for ( size_t iL = 0, iN = nbLinks - 1; iL < nbLinks; ++iL, --iN )
4972 if ( ! ( polygon.myNodes[iN] = _polygons[ iF ]._links[ iL ].FirstNode()->Node() ))
4974 if ( !polygon.myNodes.back() )
4977 meshDS->GetElementsByNodes( polygon.myNodes, adjVolumes, SMDSAbs_Volume );
4978 if ( adjVolumes.size() != 1 )
4980 if ( !adjVolumes[0]->isMarked() )
4982 boundaryElems.push_back( adjVolumes[0] );
4983 adjVolumes[0]->setIsMarked( true );
4986 bool sameShape = true;
4987 TGeomID shapeID = polygon.myNodes[0]->GetShapeID();
4988 for ( size_t i = 1; i < polygon.myNodes.size() && sameShape; ++i )
4989 sameShape = ( shapeID == polygon.myNodes[i]->GetShapeID() );
4991 if ( !sameShape || !_grid->IsSolid( shapeID ))
4992 continue; // some of shapes must be FACE
4996 faceID = getAnyFace();
4999 if ( _grid->IsInternal( faceID ) ||
5000 _grid->IsShared( faceID ) ||
5001 _grid->IsBoundaryFace( faceID ))
5002 break; // create only if a new face will be used by other 3D algo
5005 Solid * solid = _grid->GetOneOfSolids( adjVolumes[0]->GetShapeID() );
5006 if ( !solid->IsOutsideOriented( faceID ))
5007 std::reverse( polygon.myNodes.begin(), polygon.myNodes.end() );
5009 //polygon.SetPoly( polygon.myNodes.size() > 4 );
5010 const SMDS_MeshElement* newFace = editor.AddElement( polygon.myNodes, polygon );
5011 meshDS->SetMeshElementOnShape( newFace, faceID );
5015 // return created volumes
5016 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
5018 if ( volDef->_volume && !volDef->_volume->isMarked() )
5020 volDef->_volume->setIsMarked( true );
5021 boundaryElems.push_back( volDef->_volume );
5023 if ( _grid->IsToCheckNodePos() ) // un-mark nodes marked in addVolumes()
5024 for ( size_t iN = 0; iN < volDef->_nodes.size(); ++iN )
5025 volDef->_nodes[iN].Node()->setIsMarked( false );
5030 //================================================================================
5032 * \brief Set to _hexLinks a next portion of splits located on one side of INTERNAL FACEs
5034 bool Hexahedron::_SplitIterator::Next()
5036 if ( _iterationNb > 0 )
5037 // count used splits
5038 for ( size_t i = 0; i < _splits.size(); ++i )
5040 if ( _splits[i]._iCheckIteration == _iterationNb )
5042 _splits[i]._isUsed = _splits[i]._checkedSplit->_faces[1];
5043 _nbUsed += _splits[i]._isUsed;
5051 bool toTestUsed = ( _nbChecked >= _splits.size() );
5054 // all splits are checked; find all not used splits
5055 for ( size_t i = 0; i < _splits.size(); ++i )
5056 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5057 _splits[i]._iCheckIteration = _iterationNb;
5059 _nbUsed = _splits.size(); // to stop iteration
5063 // get any not used/checked split to start from
5065 for ( size_t i = 0; i < _splits.size(); ++i )
5067 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5069 _freeNodes.push_back( _splits[i]._nodes[0] );
5070 _freeNodes.push_back( _splits[i]._nodes[1] );
5071 _splits[i]._iCheckIteration = _iterationNb;
5075 // find splits connected to the start one via _freeNodes
5076 for ( size_t iN = 0; iN < _freeNodes.size(); ++iN )
5078 for ( size_t iS = 0; iS < _splits.size(); ++iS )
5080 if ( _splits[iS].IsCheckedOrUsed( toTestUsed ))
5083 if ( _freeNodes[iN] == _splits[iS]._nodes[0] )
5085 else if ( _freeNodes[iN] == _splits[iS]._nodes[1] )
5089 if ( _freeNodes[iN]->_isInternalFlags > 0 )
5091 if ( _splits[iS]._nodes[ iN2 ]->_isInternalFlags == 0 )
5093 if ( !_splits[iS]._nodes[ iN2 ]->IsLinked( _freeNodes[iN]->_intPoint ))
5096 _splits[iS]._iCheckIteration = _iterationNb;
5097 _freeNodes.push_back( _splits[iS]._nodes[ iN2 ]);
5101 // set splits to hex links
5103 for ( int iL = 0; iL < 12; ++iL )
5104 _hexLinks[ iL ]._splits.clear();
5107 for ( size_t i = 0; i < _splits.size(); ++i )
5109 if ( _splits[i]._iCheckIteration == _iterationNb )
5111 split._nodes[0] = _splits[i]._nodes[0];
5112 split._nodes[1] = _splits[i]._nodes[1];
5113 _Link & hexLink = _hexLinks[ _splits[i]._linkID ];
5114 hexLink._splits.push_back( split );
5115 _splits[i]._checkedSplit = & hexLink._splits.back();
5122 //================================================================================
5124 * \brief computes exact bounding box with axes parallel to given ones
5126 //================================================================================
5128 void getExactBndBox( const vector< TopoDS_Shape >& faceVec,
5129 const double* axesDirs,
5133 TopoDS_Compound allFacesComp;
5134 b.MakeCompound( allFacesComp );
5135 for ( size_t iF = 0; iF < faceVec.size(); ++iF )
5136 b.Add( allFacesComp, faceVec[ iF ] );
5138 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
5139 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
5141 for ( int i = 0; i < 6; ++i )
5142 farDist = Max( farDist, 10 * sP[i] );
5144 gp_XYZ axis[3] = { gp_XYZ( axesDirs[0], axesDirs[1], axesDirs[2] ),
5145 gp_XYZ( axesDirs[3], axesDirs[4], axesDirs[5] ),
5146 gp_XYZ( axesDirs[6], axesDirs[7], axesDirs[8] ) };
5147 axis[0].Normalize();
5148 axis[1].Normalize();
5149 axis[2].Normalize();
5151 gp_Mat basis( axis[0], axis[1], axis[2] );
5152 gp_Mat bi = basis.Inverted();
5155 for ( int iDir = 0; iDir < 3; ++iDir )
5157 gp_XYZ axis0 = axis[ iDir ];
5158 gp_XYZ axis1 = axis[ ( iDir + 1 ) % 3 ];
5159 gp_XYZ axis2 = axis[ ( iDir + 2 ) % 3 ];
5160 for ( int isMax = 0; isMax < 2; ++isMax )
5162 double shift = isMax ? farDist : -farDist;
5163 gp_XYZ orig = shift * axis0;
5164 gp_XYZ norm = axis1 ^ axis2;
5165 gp_Pln pln( orig, norm );
5166 norm = pln.Axis().Direction().XYZ();
5167 BRepBuilderAPI_MakeFace plane( pln, -farDist, farDist, -farDist, farDist );
5169 gp_Pnt& pAxis = isMax ? pMax : pMin;
5170 gp_Pnt pPlane, pFaces;
5171 double dist = GEOMUtils::GetMinDistance( plane, allFacesComp, pPlane, pFaces );
5176 for ( int i = 0; i < 2; ++i ) {
5177 corner.SetCoord( 1, sP[ i*3 ]);
5178 for ( int j = 0; j < 2; ++j ) {
5179 corner.SetCoord( 2, sP[ i*3 + 1 ]);
5180 for ( int k = 0; k < 2; ++k )
5182 corner.SetCoord( 3, sP[ i*3 + 2 ]);
5188 corner = isMax ? bb.CornerMax() : bb.CornerMin();
5189 pAxis.SetCoord( iDir+1, corner.Coord( iDir+1 ));
5193 gp_XYZ pf = pFaces.XYZ() * bi;
5194 pAxis.SetCoord( iDir+1, pf.Coord( iDir+1 ) );
5200 shapeBox.Add( pMin );
5201 shapeBox.Add( pMax );
5208 //=============================================================================
5210 * \brief Generates 3D structured Cartesian mesh in the internal part of
5211 * solid shapes and polyhedral volumes near the shape boundary.
5212 * \param theMesh - mesh to fill in
5213 * \param theShape - a compound of all SOLIDs to mesh
5214 * \retval bool - true in case of success
5216 //=============================================================================
5218 bool StdMeshers_Cartesian_3D::Compute(SMESH_Mesh & theMesh,
5219 const TopoDS_Shape & theShape)
5221 // The algorithm generates the mesh in following steps:
5223 // 1) Intersection of grid lines with the geometry boundary.
5224 // This step allows to find out if a given node of the initial grid is
5225 // inside or outside the geometry.
5227 // 2) For each cell of the grid, check how many of it's nodes are outside
5228 // of the geometry boundary. Depending on a result of this check
5229 // - skip a cell, if all it's nodes are outside
5230 // - skip a cell, if it is too small according to the size threshold
5231 // - add a hexahedron in the mesh, if all nodes are inside
5232 // - add a polyhedron in the mesh, if some nodes are inside and some outside
5234 _computeCanceled = false;
5236 SMESH_MesherHelper helper( theMesh );
5237 SMESHDS_Mesh* meshDS = theMesh.GetMeshDS();
5242 grid._helper = &helper;
5243 grid._toAddEdges = _hyp->GetToAddEdges();
5244 grid._toCreateFaces = _hyp->GetToCreateFaces();
5245 grid._toConsiderInternalFaces = _hyp->GetToConsiderInternalFaces();
5246 grid._toUseThresholdForInternalFaces = _hyp->GetToUseThresholdForInternalFaces();
5247 grid._sizeThreshold = _hyp->GetSizeThreshold();
5248 grid.InitGeometry( theShape );
5250 vector< TopoDS_Shape > faceVec;
5252 TopTools_MapOfShape faceMap;
5253 TopExp_Explorer fExp;
5254 for ( fExp.Init( theShape, TopAbs_FACE ); fExp.More(); fExp.Next() )
5256 bool isNewFace = faceMap.Add( fExp.Current() );
5257 if ( !grid._toConsiderInternalFaces )
5258 if ( !isNewFace || fExp.Current().Orientation() == TopAbs_INTERNAL )
5259 // remove an internal face
5260 faceMap.Remove( fExp.Current() );
5262 faceVec.reserve( faceMap.Extent() );
5263 faceVec.assign( faceMap.cbegin(), faceMap.cend() );
5265 vector<FaceGridIntersector> facesItersectors( faceVec.size() );
5267 for ( size_t i = 0; i < faceVec.size(); ++i )
5269 facesItersectors[i]._face = TopoDS::Face( faceVec[i] );
5270 facesItersectors[i]._faceID = grid.ShapeID( faceVec[i] );
5271 facesItersectors[i]._grid = &grid;
5272 shapeBox.Add( facesItersectors[i].GetFaceBndBox() );
5274 getExactBndBox( faceVec, _hyp->GetAxisDirs(), shapeBox );
5277 vector<double> xCoords, yCoords, zCoords;
5278 _hyp->GetCoordinates( xCoords, yCoords, zCoords, shapeBox );
5280 grid.SetCoordinates( xCoords, yCoords, zCoords, _hyp->GetAxisDirs(), shapeBox );
5282 if ( _computeCanceled ) return false;
5285 { // copy partner faces and curves of not thread-safe types
5286 set< const Standard_Transient* > tshapes;
5287 BRepBuilderAPI_Copy copier;
5288 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5290 if ( !facesItersectors[i].IsThreadSafe( tshapes ))
5292 copier.Perform( facesItersectors[i]._face );
5293 facesItersectors[i]._face = TopoDS::Face( copier );
5297 // Intersection of grid lines with the geometry boundary.
5298 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, facesItersectors.size() ),
5299 ParallelIntersector( facesItersectors ),
5300 tbb::simple_partitioner());
5302 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5303 facesItersectors[i].Intersect();
5306 // put intersection points onto the GridLine's; this is done after intersection
5307 // to avoid contention of facesItersectors for writing into the same GridLine
5308 // in case of parallel work of facesItersectors
5309 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5310 facesItersectors[i].StoreIntersections();
5312 if ( _computeCanceled ) return false;
5314 // create nodes on the geometry
5315 grid.ComputeNodes( helper );
5317 if ( _computeCanceled ) return false;
5319 // get EDGEs to take into account
5320 map< TGeomID, vector< TGeomID > > edge2faceIDsMap;
5321 grid.GetEdgesToImplement( edge2faceIDsMap, theShape, faceVec );
5323 // create volume elements
5324 Hexahedron hex( &grid );
5325 int nbAdded = hex.MakeElements( helper, edge2faceIDsMap );
5329 if ( !grid._toConsiderInternalFaces )
5331 // make all SOLIDs computed
5332 TopExp_Explorer solidExp( theShape, TopAbs_SOLID );
5333 if ( SMESHDS_SubMesh* sm1 = meshDS->MeshElements( solidExp.Current()) )
5335 SMDS_ElemIteratorPtr volIt = sm1->GetElements();
5336 for ( ; solidExp.More() && volIt->more(); solidExp.Next() )
5338 const SMDS_MeshElement* vol = volIt->next();
5339 sm1->RemoveElement( vol );
5340 meshDS->SetMeshElementOnShape( vol, solidExp.Current() );
5344 // make other sub-shapes computed
5345 setSubmeshesComputed( theMesh, theShape );
5348 // remove free nodes
5349 //if ( SMESHDS_SubMesh * smDS = meshDS->MeshElements( helper.GetSubShapeID() ))
5351 std::vector< const SMDS_MeshNode* > nodesToRemove;
5352 // get intersection nodes
5353 for ( int iDir = 0; iDir < 3; ++iDir )
5355 vector< GridLine >& lines = grid._lines[ iDir ];
5356 for ( size_t i = 0; i < lines.size(); ++i )
5358 multiset< F_IntersectPoint >::iterator ip = lines[i]._intPoints.begin();
5359 for ( ; ip != lines[i]._intPoints.end(); ++ip )
5360 if ( ip->_node && ip->_node->NbInverseElements() == 0 && !ip->_node->isMarked() )
5362 nodesToRemove.push_back( ip->_node );
5363 ip->_node->setIsMarked( true );
5368 for ( size_t i = 0; i < grid._nodes.size(); ++i )
5369 if ( grid._nodes[i] && grid._nodes[i]->NbInverseElements() == 0 &&
5370 !grid._nodes[i]->isMarked() )
5372 nodesToRemove.push_back( grid._nodes[i] );
5373 grid._nodes[i]->setIsMarked( true );
5377 for ( size_t i = 0; i < nodesToRemove.size(); ++i )
5378 meshDS->RemoveFreeNode( nodesToRemove[i], /*smD=*/0, /*fromGroups=*/false );
5384 // SMESH_ComputeError is not caught at SMESH_submesh level for an unknown reason
5385 catch ( SMESH_ComputeError& e)
5387 return error( SMESH_ComputeErrorPtr( new SMESH_ComputeError( e )));
5392 //=============================================================================
5396 //=============================================================================
5398 bool StdMeshers_Cartesian_3D::Evaluate(SMESH_Mesh & theMesh,
5399 const TopoDS_Shape & theShape,
5400 MapShapeNbElems& theResMap)
5403 // std::vector<int> aResVec(SMDSEntity_Last);
5404 // for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
5405 // if(IsQuadratic) {
5406 // aResVec[SMDSEntity_Quad_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5407 // int nb1d_face0_int = ( nb2d_face0*4 - nb1d ) / 2;
5408 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
5411 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
5412 // aResVec[SMDSEntity_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5414 // SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
5415 // aResMap.insert(std::make_pair(sm,aResVec));
5420 //=============================================================================
5424 * \brief Event listener setting/unsetting _alwaysComputed flag to
5425 * submeshes of inferior levels to prevent their computing
5427 struct _EventListener : public SMESH_subMeshEventListener
5431 _EventListener(const string& algoName):
5432 SMESH_subMeshEventListener(/*isDeletable=*/true,"StdMeshers_Cartesian_3D::_EventListener"),
5435 // --------------------------------------------------------------------------------
5436 // setting/unsetting _alwaysComputed flag to submeshes of inferior levels
5438 static void setAlwaysComputed( const bool isComputed,
5439 SMESH_subMesh* subMeshOfSolid)
5441 SMESH_subMeshIteratorPtr smIt =
5442 subMeshOfSolid->getDependsOnIterator(/*includeSelf=*/false, /*complexShapeFirst=*/false);
5443 while ( smIt->more() )
5445 SMESH_subMesh* sm = smIt->next();
5446 sm->SetIsAlwaysComputed( isComputed );
5448 subMeshOfSolid->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
5451 // --------------------------------------------------------------------------------
5452 // unsetting _alwaysComputed flag if "Cartesian_3D" was removed
5454 virtual void ProcessEvent(const int event,
5455 const int eventType,
5456 SMESH_subMesh* subMeshOfSolid,
5457 SMESH_subMeshEventListenerData* data,
5458 const SMESH_Hypothesis* hyp = 0)
5460 if ( eventType == SMESH_subMesh::COMPUTE_EVENT )
5462 setAlwaysComputed( subMeshOfSolid->GetComputeState() == SMESH_subMesh::COMPUTE_OK,
5467 SMESH_Algo* algo3D = subMeshOfSolid->GetAlgo();
5468 if ( !algo3D || _algoName != algo3D->GetName() )
5469 setAlwaysComputed( false, subMeshOfSolid );
5473 // --------------------------------------------------------------------------------
5474 // set the event listener
5476 static void SetOn( SMESH_subMesh* subMeshOfSolid, const string& algoName )
5478 subMeshOfSolid->SetEventListener( new _EventListener( algoName ),
5483 }; // struct _EventListener
5487 //================================================================================
5489 * \brief Sets event listener to submeshes if necessary
5490 * \param subMesh - submesh where algo is set
5491 * This method is called when a submesh gets HYP_OK algo_state.
5492 * After being set, event listener is notified on each event of a submesh.
5494 //================================================================================
5496 void StdMeshers_Cartesian_3D::SetEventListener(SMESH_subMesh* subMesh)
5498 _EventListener::SetOn( subMesh, GetName() );
5501 //================================================================================
5503 * \brief Set _alwaysComputed flag to submeshes of inferior levels to avoid their computing
5505 //================================================================================
5507 void StdMeshers_Cartesian_3D::setSubmeshesComputed(SMESH_Mesh& theMesh,
5508 const TopoDS_Shape& theShape)
5510 for ( TopExp_Explorer soExp( theShape, TopAbs_SOLID ); soExp.More(); soExp.Next() )
5511 _EventListener::setAlwaysComputed( true, theMesh.GetSubMesh( soExp.Current() ));