1 // Copyright (C) 2007-2020 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // File : StdMeshers_Cartesian_3D.cxx
25 #include "StdMeshers_Cartesian_3D.hxx"
26 #include "StdMeshers_CartesianParameters3D.hxx"
28 #include "ObjectPool.hxx"
29 #include "SMDS_MeshNode.hxx"
30 #include "SMDS_VolumeTool.hxx"
31 #include "SMESHDS_Mesh.hxx"
32 #include "SMESH_Block.hxx"
33 #include "SMESH_Comment.hxx"
34 #include "SMESH_ControlsDef.hxx"
35 #include "SMESH_Mesh.hxx"
36 #include "SMESH_MeshAlgos.hxx"
37 #include "SMESH_MeshEditor.hxx"
38 #include "SMESH_MesherHelper.hxx"
39 #include "SMESH_subMesh.hxx"
40 #include "SMESH_subMeshEventListener.hxx"
41 #include "StdMeshers_FaceSide.hxx"
43 #include <utilities.h>
44 #include <Utils_ExceptHandlers.hxx>
46 #include <GEOMUtils.hxx>
48 #include <BRepAdaptor_Curve.hxx>
49 #include <BRepAdaptor_Surface.hxx>
50 #include <BRepBndLib.hxx>
51 #include <BRepBuilderAPI_Copy.hxx>
52 #include <BRepBuilderAPI_MakeFace.hxx>
53 #include <BRepTools.hxx>
54 #include <BRepTopAdaptor_FClass2d.hxx>
55 #include <BRep_Builder.hxx>
56 #include <BRep_Tool.hxx>
57 #include <Bnd_B3d.hxx>
58 #include <Bnd_Box.hxx>
60 #include <GCPnts_UniformDeflection.hxx>
61 #include <Geom2d_BSplineCurve.hxx>
62 #include <Geom2d_BezierCurve.hxx>
63 #include <Geom2d_TrimmedCurve.hxx>
64 #include <GeomAPI_ProjectPointOnSurf.hxx>
65 #include <GeomLib.hxx>
66 #include <Geom_BSplineCurve.hxx>
67 #include <Geom_BSplineSurface.hxx>
68 #include <Geom_BezierCurve.hxx>
69 #include <Geom_BezierSurface.hxx>
70 #include <Geom_RectangularTrimmedSurface.hxx>
71 #include <Geom_TrimmedCurve.hxx>
72 #include <IntAna_IntConicQuad.hxx>
73 #include <IntAna_IntLinTorus.hxx>
74 #include <IntAna_Quadric.hxx>
75 #include <IntCurveSurface_TransitionOnCurve.hxx>
76 #include <IntCurvesFace_Intersector.hxx>
77 #include <Poly_Triangulation.hxx>
78 #include <Precision.hxx>
80 #include <TopExp_Explorer.hxx>
81 #include <TopLoc_Location.hxx>
82 #include <TopTools_IndexedMapOfShape.hxx>
83 #include <TopTools_MapOfShape.hxx>
85 #include <TopoDS_Compound.hxx>
86 #include <TopoDS_Face.hxx>
87 #include <TopoDS_TShape.hxx>
88 #include <gp_Cone.hxx>
89 #include <gp_Cylinder.hxx>
92 #include <gp_Pnt2d.hxx>
93 #include <gp_Sphere.hxx>
94 #include <gp_Torus.hxx>
98 #include <boost/container/flat_map.hpp>
104 // See https://docs.microsoft.com/en-gb/cpp/porting/modifying-winver-and-win32-winnt?view=vs-2019
105 // Windows 10 = 0x0A00
106 #define WINVER 0x0A00
107 #define _WIN32_WINNT 0x0A00
110 #include <tbb/parallel_for.h>
111 //#include <tbb/enumerable_thread_specific.h>
115 using namespace SMESH;
121 //=============================================================================
125 //=============================================================================
127 StdMeshers_Cartesian_3D::StdMeshers_Cartesian_3D(int hypId, SMESH_Gen * gen)
128 :SMESH_3D_Algo(hypId, gen)
130 _name = "Cartesian_3D";
131 _shapeType = (1 << TopAbs_SOLID); // 1 bit /shape type
132 _compatibleHypothesis.push_back("CartesianParameters3D");
134 _onlyUnaryInput = false; // to mesh all SOLIDs at once
135 _requireDiscreteBoundary = false; // 2D mesh not needed
136 _supportSubmeshes = false; // do not use any existing mesh
139 //=============================================================================
141 * Check presence of a hypothesis
143 //=============================================================================
145 bool StdMeshers_Cartesian_3D::CheckHypothesis (SMESH_Mesh& aMesh,
146 const TopoDS_Shape& aShape,
147 Hypothesis_Status& aStatus)
149 aStatus = SMESH_Hypothesis::HYP_MISSING;
151 const list<const SMESHDS_Hypothesis*>& hyps = GetUsedHypothesis(aMesh, aShape);
152 list <const SMESHDS_Hypothesis* >::const_iterator h = hyps.begin();
153 if ( h == hyps.end())
158 for ( ; h != hyps.end(); ++h )
160 if (( _hyp = dynamic_cast<const StdMeshers_CartesianParameters3D*>( *h )))
162 aStatus = _hyp->IsDefined() ? HYP_OK : HYP_BAD_PARAMETER;
167 return aStatus == HYP_OK;
172 typedef int TGeomID; // IDs of sub-shapes
174 //=============================================================================
175 // Definitions of internal utils
176 // --------------------------------------------------------------------------
178 Trans_TANGENT = IntCurveSurface_Tangent,
179 Trans_IN = IntCurveSurface_In,
180 Trans_OUT = IntCurveSurface_Out,
182 Trans_INTERNAL // for INTERNAL FACE
184 // --------------------------------------------------------------------------
186 * \brief Container of IDs of SOLID sub-shapes
188 class Solid // sole SOLID contains all sub-shapes
190 TGeomID _id; // SOLID id
191 bool _hasInternalFaces;
194 virtual bool Contains( TGeomID subID ) const { return true; }
195 virtual bool ContainsAny( const vector< TGeomID>& subIDs ) const { return true; }
196 virtual TopAbs_Orientation Orientation( const TopoDS_Shape& s ) const { return s.Orientation(); }
197 virtual bool IsOutsideOriented( TGeomID faceID ) const { return true; }
198 void SetID( TGeomID id ) { _id = id; }
199 TGeomID ID() const { return _id; }
200 void SetHasInternalFaces( bool has ) { _hasInternalFaces = has; }
201 bool HasInternalFaces() const { return _hasInternalFaces; }
203 // --------------------------------------------------------------------------
204 class OneOfSolids : public Solid
206 TColStd_MapOfInteger _subIDs;
207 TopTools_MapOfShape _faces; // keep FACE orientation
208 TColStd_MapOfInteger _outFaceIDs; // FACEs of shape_to_mesh oriented outside the SOLID
210 void Init( const TopoDS_Shape& solid,
211 TopAbs_ShapeEnum subType,
212 const SMESHDS_Mesh* mesh );
213 virtual bool Contains( TGeomID i ) const { return i == ID() || _subIDs.Contains( i ); }
214 virtual bool ContainsAny( const vector< TGeomID>& subIDs ) const
216 for ( size_t i = 0; i < subIDs.size(); ++i ) if ( Contains( subIDs[ i ])) return true;
219 virtual TopAbs_Orientation Orientation( const TopoDS_Shape& face ) const
221 const TopoDS_Shape& sInMap = const_cast< OneOfSolids* >(this)->_faces.Added( face );
222 return sInMap.Orientation();
224 virtual bool IsOutsideOriented( TGeomID faceID ) const
226 return faceID == 0 || _outFaceIDs.Contains( faceID );
229 // --------------------------------------------------------------------------
235 TopoDS_Shape _mainShape;
236 vector< vector< TGeomID > > _solidIDsByShapeID;// V/E/F ID -> SOLID IDs
238 map< TGeomID, OneOfSolids > _solidByID;
239 TColStd_MapOfInteger _boundaryFaces; // FACEs on boundary of mesh->ShapeToMesh()
240 TColStd_MapOfInteger _strangeEdges; // EDGEs shared by strange FACEs
241 TGeomID _extIntFaceID; // pseudo FACE - extension of INTERNAL FACE
243 Controls::ElementsOnShape _edgeClassifier;
244 Controls::ElementsOnShape _vertexClassifier;
246 bool IsOneSolid() const { return _solidByID.size() < 2; }
248 // --------------------------------------------------------------------------
250 * \brief Common data of any intersection between a Grid and a shape
252 struct B_IntersectPoint
254 mutable const SMDS_MeshNode* _node;
255 mutable vector< TGeomID > _faceIDs;
257 B_IntersectPoint(): _node(NULL) {}
258 void Add( const vector< TGeomID >& fIDs, const SMDS_MeshNode* n=0 ) const;
259 int HasCommonFace( const B_IntersectPoint * other, int avoidFace=-1 ) const;
260 bool IsOnFace( int faceID ) const;
261 virtual ~B_IntersectPoint() {}
263 // --------------------------------------------------------------------------
265 * \brief Data of intersection between a GridLine and a TopoDS_Face
267 struct F_IntersectPoint : public B_IntersectPoint
271 mutable Transition _transition;
272 mutable size_t _indexOnLine;
274 bool operator< ( const F_IntersectPoint& o ) const { return _paramOnLine < o._paramOnLine; }
276 // --------------------------------------------------------------------------
278 * \brief Data of intersection between GridPlanes and a TopoDS_EDGE
280 struct E_IntersectPoint : public B_IntersectPoint
284 TGeomID _shapeID; // ID of EDGE or VERTEX
286 // --------------------------------------------------------------------------
288 * \brief A line of the grid and its intersections with 2D geometry
293 double _length; // line length
294 multiset< F_IntersectPoint > _intPoints;
296 void RemoveExcessIntPoints( const double tol );
297 TGeomID GetSolidIDBefore( multiset< F_IntersectPoint >::iterator ip,
298 const TGeomID prevID,
299 const Geometry& geom);
301 // --------------------------------------------------------------------------
303 * \brief Planes of the grid used to find intersections of an EDGE with a hexahedron
308 vector< gp_XYZ > _origins; // origin points of all planes in one direction
309 vector< double > _zProjs; // projections of origins to _zNorm
311 // --------------------------------------------------------------------------
313 * \brief Iterator on the parallel grid lines of one direction
319 size_t _iVar1, _iVar2, _iConst;
320 string _name1, _name2, _nameConst;
322 LineIndexer( size_t sz1, size_t sz2, size_t sz3,
323 size_t iv1, size_t iv2, size_t iConst,
324 const string& nv1, const string& nv2, const string& nConst )
326 _size[0] = sz1; _size[1] = sz2; _size[2] = sz3;
327 _curInd[0] = _curInd[1] = _curInd[2] = 0;
328 _iVar1 = iv1; _iVar2 = iv2; _iConst = iConst;
329 _name1 = nv1; _name2 = nv2; _nameConst = nConst;
332 size_t I() const { return _curInd[0]; }
333 size_t J() const { return _curInd[1]; }
334 size_t K() const { return _curInd[2]; }
335 void SetIJK( size_t i, size_t j, size_t k )
337 _curInd[0] = i; _curInd[1] = j; _curInd[2] = k;
341 if ( ++_curInd[_iVar1] == _size[_iVar1] )
342 _curInd[_iVar1] = 0, ++_curInd[_iVar2];
344 bool More() const { return _curInd[_iVar2] < _size[_iVar2]; }
345 size_t LineIndex () const { return _curInd[_iVar1] + _curInd[_iVar2]* _size[_iVar1]; }
346 size_t LineIndex10 () const { return (_curInd[_iVar1] + 1 ) + _curInd[_iVar2]* _size[_iVar1]; }
347 size_t LineIndex01 () const { return _curInd[_iVar1] + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
348 size_t LineIndex11 () const { return (_curInd[_iVar1] + 1 ) + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
349 void SetIndexOnLine (size_t i) { _curInd[ _iConst ] = i; }
350 size_t NbLines() const { return _size[_iVar1] * _size[_iVar2]; }
352 // --------------------------------------------------------------------------
354 * \brief Container of GridLine's
358 vector< double > _coords[3]; // coordinates of grid nodes
359 gp_XYZ _axes [3]; // axis directions
360 vector< GridLine > _lines [3]; // in 3 directions
361 double _tol, _minCellSize;
363 gp_Mat _invB; // inverted basis of _axes
365 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 size_t getSolids( TGeomID ids[] );
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 size_t Hexahedron::getSolids( TGeomID ids[] )
2179 if ( _grid->_geometry.IsOneSolid() )
2181 ids[0] = _grid->GetSolid()->ID();
2184 // count intersection points belonging to each SOLID
2186 id2NbPoints.reserve( 3 );
2188 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
2189 for ( int iN = 0; iN < 8; ++iN )
2191 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
2192 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
2194 if ( _hexNodes[iN]._intPoint ) // intersection with a FACE
2196 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2198 const vector< TGeomID > & solidIDs =
2199 _grid->GetSolidIDs( _hexNodes[iN]._intPoint->_faceIDs[iF] );
2200 for ( size_t i = 0; i < solidIDs.size(); ++i )
2201 insertAndIncrement( solidIDs[i], id2NbPoints );
2204 else if ( _hexNodes[iN]._node ) // node inside a SOLID
2206 insertAndIncrement( _hexNodes[iN]._node->GetShapeID(), id2NbPoints );
2210 for ( int iL = 0; iL < 12; ++iL )
2212 const _Link& link = _hexLinks[ iL ];
2213 for ( size_t iP = 0; iP < link._fIntPoints.size(); ++iP )
2215 for ( size_t iF = 0; iF < link._fIntPoints[iP]->_faceIDs.size(); ++iF )
2217 const vector< TGeomID > & solidIDs =
2218 _grid->GetSolidIDs( link._fIntPoints[iP]->_faceIDs[iF] );
2219 for ( size_t i = 0; i < solidIDs.size(); ++i )
2220 insertAndIncrement( solidIDs[i], id2NbPoints );
2225 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2227 const vector< TGeomID > & solidIDs = _grid->GetSolidIDs( _eIntPoints[iP]->_shapeID );
2228 for ( size_t i = 0; i < solidIDs.size(); ++i )
2229 insertAndIncrement( solidIDs[i], id2NbPoints );
2232 size_t nbSolids = 0;
2233 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2234 if ( id2nb->second >= 3 )
2235 ids[ nbSolids++ ] = id2nb->first;
2240 //================================================================================
2242 * \brief Count cuts by INTERNAL FACEs and set _Node::_isInternalFlags
2244 bool Hexahedron::isCutByInternalFace( IsInternalFlag & maxFlag )
2247 id2NbPoints.reserve( 3 );
2249 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2250 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2252 if ( _grid->IsInternal( _intNodes[iN]._intPoint->_faceIDs[iF]))
2253 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2255 for ( size_t iN = 0; iN < 8; ++iN )
2256 if ( _hexNodes[iN]._intPoint )
2257 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2259 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
2260 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2263 maxFlag = IS_NOT_INTERNAL;
2264 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2266 TGeomID intFace = id2nb->first;
2267 IsInternalFlag intFlag = ( id2nb->second >= 3 ? IS_CUT_BY_INTERNAL_FACE : IS_INTERNAL );
2268 if ( intFlag > maxFlag )
2271 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2272 if ( _intNodes[iN].IsOnFace( intFace ))
2273 _intNodes[iN].SetInternal( intFlag );
2275 for ( size_t iN = 0; iN < 8; ++iN )
2276 if ( _hexNodes[iN].IsOnFace( intFace ))
2277 _hexNodes[iN].SetInternal( intFlag );
2283 //================================================================================
2285 * \brief Return any FACE interfering with this Hexahedron
2287 TGeomID Hexahedron::getAnyFace() const
2290 id2NbPoints.reserve( 3 );
2292 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2293 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2294 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2296 for ( size_t iN = 0; iN < 8; ++iN )
2297 if ( _hexNodes[iN]._intPoint )
2298 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2299 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2301 for ( unsigned int minNb = 3; minNb > 0; --minNb )
2302 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2303 if ( id2nb->second >= minNb )
2304 return id2nb->first;
2309 //================================================================================
2311 * \brief Initializes IJK by Hexahedron index
2313 void Hexahedron::setIJK( size_t iCell )
2315 size_t iNbCell = _grid->_coords[0].size() - 1;
2316 size_t jNbCell = _grid->_coords[1].size() - 1;
2317 _i = iCell % iNbCell;
2318 _j = ( iCell % ( iNbCell * jNbCell )) / iNbCell;
2319 _k = iCell / iNbCell / jNbCell;
2322 //================================================================================
2324 * \brief Initializes its data by given grid cell (countered from zero)
2326 void Hexahedron::init( size_t iCell )
2332 //================================================================================
2334 * \brief Initializes its data by given grid cell nodes and intersections
2336 void Hexahedron::init( size_t i, size_t j, size_t k, const Solid* solid )
2338 _i = i; _j = j; _k = k;
2341 solid = _grid->GetSolid();
2343 // set nodes of grid to nodes of the hexahedron and
2344 // count nodes at hexahedron corners located IN and ON geometry
2345 _nbCornerNodes = _nbBndNodes = 0;
2346 _origNodeInd = _grid->NodeIndex( i,j,k );
2347 for ( int iN = 0; iN < 8; ++iN )
2349 _hexNodes[iN]._isInternalFlags = 0;
2351 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
2352 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
2354 if ( _hexNodes[iN]._node && !solid->Contains( _hexNodes[iN]._node->GetShapeID() ))
2355 _hexNodes[iN]._node = 0;
2356 if ( _hexNodes[iN]._intPoint && !solid->ContainsAny( _hexNodes[iN]._intPoint->_faceIDs ))
2357 _hexNodes[iN]._intPoint = 0;
2359 _nbCornerNodes += bool( _hexNodes[iN]._node );
2360 _nbBndNodes += bool( _hexNodes[iN]._intPoint );
2362 _sideLength[0] = _grid->_coords[0][i+1] - _grid->_coords[0][i];
2363 _sideLength[1] = _grid->_coords[1][j+1] - _grid->_coords[1][j];
2364 _sideLength[2] = _grid->_coords[2][k+1] - _grid->_coords[2][k];
2369 if ( _nbFaceIntNodes + _eIntPoints.size() > 0 &&
2370 _nbFaceIntNodes + _eIntPoints.size() + _nbCornerNodes > 3)
2372 _intNodes.reserve( 3 * _nbBndNodes + _nbFaceIntNodes + _eIntPoints.size() );
2374 // this method can be called in parallel, so use own helper
2375 SMESH_MesherHelper helper( *_grid->_helper->GetMesh() );
2377 // Create sub-links (_Link::_splits) by splitting links with _Link::_fIntPoints
2378 // ---------------------------------------------------------------
2380 for ( int iLink = 0; iLink < 12; ++iLink )
2382 _Link& link = _hexLinks[ iLink ];
2383 link._fIntNodes.clear();
2384 link._fIntNodes.reserve( link._fIntPoints.size() );
2385 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
2386 if ( solid->ContainsAny( link._fIntPoints[i]->_faceIDs ))
2388 _intNodes.push_back( _Node( 0, link._fIntPoints[i] ));
2389 link._fIntNodes.push_back( & _intNodes.back() );
2392 link._splits.clear();
2393 split._nodes[ 0 ] = link._nodes[0];
2394 bool isOut = ( ! link._nodes[0]->Node() );
2395 bool checkTransition;
2396 for ( size_t i = 0; i < link._fIntNodes.size(); ++i )
2398 const bool isGridNode = ( ! link._fIntNodes[i]->Node() );
2399 if ( !isGridNode ) // intersection non-coincident with a grid node
2401 if ( split._nodes[ 0 ]->Node() && !isOut )
2403 split._nodes[ 1 ] = link._fIntNodes[i];
2404 link._splits.push_back( split );
2406 split._nodes[ 0 ] = link._fIntNodes[i];
2407 checkTransition = true;
2409 else // FACE intersection coincident with a grid node (at link ends)
2411 checkTransition = ( i == 0 && link._nodes[0]->Node() );
2413 if ( checkTransition )
2415 const vector< TGeomID >& faceIDs = link._fIntNodes[i]->_intPoint->_faceIDs;
2416 if ( _grid->IsInternal( faceIDs.back() ))
2418 else if ( faceIDs.size() > 1 || _eIntPoints.size() > 0 )
2419 isOut = isOutPoint( link, i, helper, solid );
2422 bool okTransi = _grid->IsCorrectTransition( faceIDs[0], solid );
2423 switch ( link._fIntNodes[i]->FaceIntPnt()->_transition ) {
2424 case Trans_OUT: isOut = okTransi; break;
2425 case Trans_IN : isOut = !okTransi; break;
2427 isOut = isOutPoint( link, i, helper, solid );
2432 if ( link._nodes[ 1 ]->Node() && split._nodes[ 0 ]->Node() && !isOut )
2434 split._nodes[ 1 ] = link._nodes[1];
2435 link._splits.push_back( split );
2439 // Create _Node's at intersections with EDGEs.
2440 // --------------------------------------------
2441 // 1) add this->_eIntPoints to _Face::_eIntNodes
2442 // 2) fill _intNodes and _vIntNodes
2444 const double tol2 = _grid->_tol * _grid->_tol;
2445 int facets[3], nbFacets, subEntity;
2447 for ( int iF = 0; iF < 6; ++iF )
2448 _hexQuads[ iF ]._eIntNodes.clear();
2450 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2452 if ( !solid->ContainsAny( _eIntPoints[iP]->_faceIDs ))
2454 nbFacets = getEntity( _eIntPoints[iP], facets, subEntity );
2455 _Node* equalNode = 0;
2456 switch( nbFacets ) {
2457 case 1: // in a _Face
2459 _Face& quad = _hexQuads[ facets[0] - SMESH_Block::ID_FirstF ];
2460 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2462 equalNode->Add( _eIntPoints[ iP ] );
2465 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2466 quad._eIntNodes.push_back( & _intNodes.back() );
2470 case 2: // on a _Link
2472 _Link& link = _hexLinks[ subEntity - SMESH_Block::ID_FirstE ];
2473 if ( link._splits.size() > 0 )
2475 equalNode = findEqualNode( link._fIntNodes, _eIntPoints[ iP ], tol2 );
2477 equalNode->Add( _eIntPoints[ iP ] );
2478 else if ( link._splits.size() == 1 &&
2479 link._splits[0]._nodes[0] &&
2480 link._splits[0]._nodes[1] )
2481 link._splits.clear(); // hex edge is divided by _eIntPoints[iP]
2486 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2487 bool newNodeUsed = false;
2488 for ( int iF = 0; iF < 2; ++iF )
2490 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2491 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2493 equalNode->Add( _eIntPoints[ iP ] );
2496 quad._eIntNodes.push_back( & _intNodes.back() );
2501 _intNodes.pop_back();
2505 case 3: // at a corner
2507 _Node& node = _hexNodes[ subEntity - SMESH_Block::ID_FirstV ];
2508 if ( node.Node() > 0 )
2510 if ( node._intPoint )
2511 node._intPoint->Add( _eIntPoints[ iP ]->_faceIDs, _eIntPoints[ iP ]->_node );
2515 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2516 for ( int iF = 0; iF < 3; ++iF )
2518 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2519 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2521 equalNode->Add( _eIntPoints[ iP ] );
2524 quad._eIntNodes.push_back( & _intNodes.back() );
2530 } // switch( nbFacets )
2532 if ( nbFacets == 0 ||
2533 _grid->ShapeType( _eIntPoints[ iP ]->_shapeID ) == TopAbs_VERTEX )
2535 equalNode = findEqualNode( _vIntNodes, _eIntPoints[ iP ], tol2 );
2537 equalNode->Add( _eIntPoints[ iP ] );
2539 else if ( nbFacets == 0 ) {
2540 if ( _intNodes.empty() || _intNodes.back().EdgeIntPnt() != _eIntPoints[ iP ])
2541 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2542 _vIntNodes.push_back( & _intNodes.back() );
2545 } // loop on _eIntPoints
2548 else if ( 3 < _nbCornerNodes && _nbCornerNodes < 8 ) // _nbFaceIntNodes == 0
2551 // create sub-links (_splits) of whole links
2552 for ( int iLink = 0; iLink < 12; ++iLink )
2554 _Link& link = _hexLinks[ iLink ];
2555 link._splits.clear();
2556 if ( link._nodes[ 0 ]->Node() && link._nodes[ 1 ]->Node() )
2558 split._nodes[ 0 ] = link._nodes[0];
2559 split._nodes[ 1 ] = link._nodes[1];
2560 link._splits.push_back( split );
2566 } // init( _i, _j, _k )
2568 //================================================================================
2570 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2572 void Hexahedron::ComputeElements( const Solid* solid, int solidIndex )
2576 solid = _grid->GetSolid();
2577 if ( !_grid->_geometry.IsOneSolid() )
2579 TGeomID solidIDs[20];
2580 size_t nbSolids = getSolids( solidIDs );
2583 for ( size_t i = 0; i < nbSolids; ++i )
2585 solid = _grid->GetSolid( solidIDs[i] );
2586 ComputeElements( solid, i );
2587 if ( !_volumeDefs._nodes.empty() && i < nbSolids - 1 )
2588 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2592 solid = _grid->GetSolid( solidIDs[0] );
2596 init( _i, _j, _k, solid ); // get nodes and intersections from grid nodes and split links
2598 int nbIntersections = _nbFaceIntNodes + _eIntPoints.size();
2599 if ( _nbCornerNodes + nbIntersections < 4 )
2602 if ( _nbBndNodes == _nbCornerNodes && nbIntersections == 0 && isInHole() )
2603 return; // cell is in a hole
2605 IsInternalFlag intFlag = IS_NOT_INTERNAL;
2606 if ( solid->HasInternalFaces() && this->isCutByInternalFace( intFlag ))
2608 for ( _SplitIterator it( _hexLinks ); it.More(); it.Next() )
2610 if ( compute( solid, intFlag ))
2611 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2616 if ( solidIndex >= 0 )
2617 intFlag = IS_CUT_BY_INTERNAL_FACE;
2619 compute( solid, intFlag );
2623 //================================================================================
2625 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2627 bool Hexahedron::compute( const Solid* solid, const IsInternalFlag intFlag )
2630 _polygons.reserve( 20 );
2632 for ( int iN = 0; iN < 8; ++iN )
2633 _hexNodes[iN]._usedInFace = 0;
2635 // Create polygons from quadrangles
2636 // --------------------------------
2638 vector< _OrientedLink > splits;
2639 vector<_Node*> chainNodes;
2640 _Face* coplanarPolyg;
2642 bool hasEdgeIntersections = !_eIntPoints.empty();
2644 for ( int iF = 0; iF < 6; ++iF ) // loop on 6 sides of a hexahedron
2646 _Face& quad = _hexQuads[ iF ] ;
2648 _polygons.resize( _polygons.size() + 1 );
2649 _Face* polygon = &_polygons.back();
2650 polygon->_polyLinks.reserve( 20 );
2653 for ( int iE = 0; iE < 4; ++iE ) // loop on 4 sides of a quadrangle
2654 for ( int iS = 0; iS < quad._links[ iE ].NbResultLinks(); ++iS )
2655 splits.push_back( quad._links[ iE ].ResultLink( iS ));
2657 // add splits of links to a polygon and add _polyLinks to make
2658 // polygon's boundary closed
2660 int nbSplits = splits.size();
2661 if (( nbSplits == 1 ) &&
2662 ( quad._eIntNodes.empty() ||
2663 splits[0].FirstNode()->IsLinked( splits[0].LastNode()->_intPoint )))
2664 //( quad._eIntNodes.empty() || _nbCornerNodes + nbIntersections > 6 ))
2667 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
2668 if ( quad._eIntNodes[ iP ]->IsUsedInFace( polygon ))
2669 quad._eIntNodes[ iP ]->_usedInFace = 0;
2671 size_t nbUsedEdgeNodes = 0;
2672 _Face* prevPolyg = 0; // polygon previously created from this quad
2674 while ( nbSplits > 0 )
2677 while ( !splits[ iS ] )
2680 if ( !polygon->_links.empty() )
2682 _polygons.resize( _polygons.size() + 1 );
2683 polygon = &_polygons.back();
2684 polygon->_polyLinks.reserve( 20 );
2686 polygon->_links.push_back( splits[ iS ] );
2687 splits[ iS++ ]._link = 0;
2690 _Node* nFirst = polygon->_links.back().FirstNode();
2691 _Node *n1,*n2 = polygon->_links.back().LastNode();
2692 for ( ; nFirst != n2 && iS < splits.size(); ++iS )
2694 _OrientedLink& split = splits[ iS ];
2695 if ( !split ) continue;
2697 n1 = split.FirstNode();
2700 (( n1->_intPoint->_faceIDs.size() > 1 && isImplementEdges() ) ||
2701 ( n1->_isInternalFlags )))
2703 // n1 is at intersection with EDGE
2704 if ( findChainOnEdge( splits, polygon->_links.back(), split, iS, quad, chainNodes ))
2706 for ( size_t i = 1; i < chainNodes.size(); ++i )
2707 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2708 if ( chainNodes.back() != n1 ) // not a partial cut by INTERNAL FACE
2710 prevPolyg = polygon;
2711 n2 = chainNodes.back();
2716 else if ( n1 != n2 )
2718 // try to connect to intersections with EDGEs
2719 if ( quad._eIntNodes.size() > nbUsedEdgeNodes &&
2720 findChain( n2, n1, quad, chainNodes ))
2722 for ( size_t i = 1; i < chainNodes.size(); ++i )
2724 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i] );
2725 nbUsedEdgeNodes += ( chainNodes[i]->IsUsedInFace( polygon ));
2727 if ( chainNodes.back() != n1 )
2729 n2 = chainNodes.back();
2734 // try to connect to a split ending on the same FACE
2737 _OrientedLink foundSplit;
2738 for ( size_t i = iS; i < splits.size() && !foundSplit; ++i )
2739 if (( foundSplit = splits[ i ]) &&
2740 ( n2->IsLinked( foundSplit.FirstNode()->_intPoint )))
2746 foundSplit._link = 0;
2750 if ( n2 != foundSplit.FirstNode() )
2752 polygon->AddPolyLink( n2, foundSplit.FirstNode() );
2753 n2 = foundSplit.FirstNode();
2759 if ( n2->IsLinked( nFirst->_intPoint ))
2761 polygon->AddPolyLink( n2, n1, prevPolyg );
2764 } // if ( n1 != n2 )
2766 polygon->_links.push_back( split );
2769 n2 = polygon->_links.back().LastNode();
2773 if ( nFirst != n2 ) // close a polygon
2775 if ( !findChain( n2, nFirst, quad, chainNodes ))
2777 if ( !closePolygon( polygon, chainNodes ))
2778 if ( !isImplementEdges() )
2779 chainNodes.push_back( nFirst );
2781 for ( size_t i = 1; i < chainNodes.size(); ++i )
2783 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2784 nbUsedEdgeNodes += bool( chainNodes[i]->IsUsedInFace( polygon ));
2788 if ( polygon->_links.size() < 3 && nbSplits > 0 )
2790 polygon->_polyLinks.clear();
2791 polygon->_links.clear();
2793 } // while ( nbSplits > 0 )
2795 if ( polygon->_links.size() < 3 )
2797 _polygons.pop_back();
2799 } // loop on 6 hexahedron sides
2801 // Create polygons closing holes in a polyhedron
2802 // ----------------------------------------------
2804 // clear _usedInFace
2805 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2806 _intNodes[ iN ]._usedInFace = 0;
2808 // add polygons to their links and mark used nodes
2809 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2811 _Face& polygon = _polygons[ iP ];
2812 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2814 polygon._links[ iL ].AddFace( &polygon );
2815 polygon._links[ iL ].FirstNode()->_usedInFace = &polygon;
2819 vector< _OrientedLink* > freeLinks;
2820 freeLinks.reserve(20);
2821 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2823 _Face& polygon = _polygons[ iP ];
2824 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2825 if ( polygon._links[ iL ].NbFaces() < 2 )
2826 freeLinks.push_back( & polygon._links[ iL ]);
2828 int nbFreeLinks = freeLinks.size();
2829 if ( nbFreeLinks == 1 ) return false;
2831 // put not used intersection nodes to _vIntNodes
2832 int nbVertexNodes = 0; // nb not used vertex nodes
2834 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
2835 nbVertexNodes += ( !_vIntNodes[ iN ]->IsUsedInFace() );
2837 const double tol = 1e-3 * Min( Min( _sideLength[0], _sideLength[1] ), _sideLength[0] );
2838 for ( size_t iN = _nbFaceIntNodes; iN < _intNodes.size(); ++iN )
2840 if ( _intNodes[ iN ].IsUsedInFace() ) continue;
2841 if ( dynamic_cast< const F_IntersectPoint* >( _intNodes[ iN ]._intPoint )) continue;
2843 findEqualNode( _vIntNodes, _intNodes[ iN ].EdgeIntPnt(), tol*tol );
2846 _vIntNodes.push_back( &_intNodes[ iN ]);
2852 set<TGeomID> usedFaceIDs;
2853 vector< TGeomID > faces;
2854 TGeomID curFace = 0;
2855 const size_t nbQuadPolygons = _polygons.size();
2856 E_IntersectPoint ipTmp;
2858 // create polygons by making closed chains of free links
2859 size_t iPolygon = _polygons.size();
2860 while ( nbFreeLinks > 0 )
2862 if ( iPolygon == _polygons.size() )
2864 _polygons.resize( _polygons.size() + 1 );
2865 _polygons[ iPolygon ]._polyLinks.reserve( 20 );
2866 _polygons[ iPolygon ]._links.reserve( 20 );
2868 _Face& polygon = _polygons[ iPolygon ];
2870 _OrientedLink* curLink = 0;
2872 if (( !hasEdgeIntersections ) ||
2873 ( nbFreeLinks < 4 && nbVertexNodes == 0 ))
2875 // get a remaining link to start from
2876 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2877 if (( curLink = freeLinks[ iL ] ))
2878 freeLinks[ iL ] = 0;
2879 polygon._links.push_back( *curLink );
2883 // find all links connected to curLink
2884 curNode = curLink->FirstNode();
2886 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2887 if ( freeLinks[ iL ] && freeLinks[ iL ]->LastNode() == curNode )
2889 curLink = freeLinks[ iL ];
2890 freeLinks[ iL ] = 0;
2892 polygon._links.push_back( *curLink );
2894 } while ( curLink );
2896 else // there are intersections with EDGEs
2898 // get a remaining link to start from, one lying on minimal nb of FACEs
2900 typedef pair< TGeomID, int > TFaceOfLink;
2901 TFaceOfLink faceOfLink( -1, -1 );
2902 TFaceOfLink facesOfLink[3] = { faceOfLink, faceOfLink, faceOfLink };
2903 for ( size_t iL = 0; iL < freeLinks.size(); ++iL )
2904 if ( freeLinks[ iL ] )
2906 faces = freeLinks[ iL ]->GetNotUsedFace( usedFaceIDs );
2907 if ( faces.size() == 1 )
2909 faceOfLink = TFaceOfLink( faces[0], iL );
2910 if ( !freeLinks[ iL ]->HasEdgeNodes() )
2912 facesOfLink[0] = faceOfLink;
2914 else if ( facesOfLink[0].first < 0 )
2916 faceOfLink = TFaceOfLink(( faces.empty() ? -1 : faces[0]), iL );
2917 facesOfLink[ 1 + faces.empty() ] = faceOfLink;
2920 for ( int i = 0; faceOfLink.first < 0 && i < 3; ++i )
2921 faceOfLink = facesOfLink[i];
2923 if ( faceOfLink.first < 0 ) // all faces used
2925 for ( size_t iL = 0; iL < freeLinks.size() && faceOfLink.first < 1; ++iL )
2926 if (( curLink = freeLinks[ iL ]))
2929 curLink->FirstNode()->IsLinked( curLink->LastNode()->_intPoint );
2930 faceOfLink.second = iL;
2932 usedFaceIDs.clear();
2934 curFace = faceOfLink.first;
2935 curLink = freeLinks[ faceOfLink.second ];
2936 freeLinks[ faceOfLink.second ] = 0;
2938 usedFaceIDs.insert( curFace );
2939 polygon._links.push_back( *curLink );
2942 // find all links lying on a curFace
2945 // go forward from curLink
2946 curNode = curLink->LastNode();
2948 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2949 if ( freeLinks[ iL ] &&
2950 freeLinks[ iL ]->FirstNode() == curNode &&
2951 freeLinks[ iL ]->LastNode()->IsOnFace( curFace ))
2953 curLink = freeLinks[ iL ];
2954 freeLinks[ iL ] = 0;
2955 polygon._links.push_back( *curLink );
2958 } while ( curLink );
2960 std::reverse( polygon._links.begin(), polygon._links.end() );
2962 curLink = & polygon._links.back();
2965 // go backward from curLink
2966 curNode = curLink->FirstNode();
2968 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2969 if ( freeLinks[ iL ] &&
2970 freeLinks[ iL ]->LastNode() == curNode &&
2971 freeLinks[ iL ]->FirstNode()->IsOnFace( curFace ))
2973 curLink = freeLinks[ iL ];
2974 freeLinks[ iL ] = 0;
2975 polygon._links.push_back( *curLink );
2978 } while ( curLink );
2980 curNode = polygon._links.back().FirstNode();
2982 if ( polygon._links[0].LastNode() != curNode )
2984 if ( nbVertexNodes > 0 )
2986 // add links with _vIntNodes if not already used
2988 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
2989 if ( !_vIntNodes[ iN ]->IsUsedInFace() &&
2990 _vIntNodes[ iN ]->IsOnFace( curFace ))
2992 _vIntNodes[ iN ]->_usedInFace = &polygon;
2993 chainNodes.push_back( _vIntNodes[ iN ] );
2995 if ( chainNodes.size() > 1 &&
2996 curFace != _grid->PseudoIntExtFaceID() ) /////// TODO
2998 sortVertexNodes( chainNodes, curNode, curFace );
3000 for ( size_t i = 0; i < chainNodes.size(); ++i )
3002 polygon.AddPolyLink( chainNodes[ i ], curNode );
3003 curNode = chainNodes[ i ];
3004 freeLinks.push_back( &polygon._links.back() );
3007 nbVertexNodes -= chainNodes.size();
3009 // if ( polygon._links.size() > 1 )
3011 polygon.AddPolyLink( polygon._links[0].LastNode(), curNode );
3012 freeLinks.push_back( &polygon._links.back() );
3016 } // if there are intersections with EDGEs
3018 if ( polygon._links.size() < 2 ||
3019 polygon._links[0].LastNode() != polygon._links.back().FirstNode() )
3020 return false; // closed polygon not found -> invalid polyhedron
3022 if ( polygon._links.size() == 2 )
3024 if ( freeLinks.back() == &polygon._links.back() )
3026 freeLinks.pop_back();
3029 if ( polygon._links.front().NbFaces() > 0 )
3030 polygon._links.back().AddFace( polygon._links.front()._link->_faces[0] );
3031 if ( polygon._links.back().NbFaces() > 0 )
3032 polygon._links.front().AddFace( polygon._links.back()._link->_faces[0] );
3034 if ( iPolygon == _polygons.size()-1 )
3035 _polygons.pop_back();
3037 else // polygon._links.size() >= 2
3039 // add polygon to its links
3040 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3042 polygon._links[ iL ].AddFace( &polygon );
3043 polygon._links[ iL ].Reverse();
3045 if ( /*hasEdgeIntersections &&*/ iPolygon == _polygons.size() - 1 )
3047 // check that a polygon does not lie on a hexa side
3049 for ( size_t iL = 0; iL < polygon._links.size() && !coplanarPolyg; ++iL )
3051 if ( polygon._links[ iL ].NbFaces() < 2 )
3052 continue; // it's a just added free link
3053 // look for a polygon made on a hexa side and sharing
3054 // two or more haxa links
3056 coplanarPolyg = polygon._links[ iL ]._link->_faces[0];
3057 for ( iL2 = iL + 1; iL2 < polygon._links.size(); ++iL2 )
3058 if ( polygon._links[ iL2 ]._link->_faces[0] == coplanarPolyg &&
3059 !coplanarPolyg->IsPolyLink( polygon._links[ iL ]) &&
3060 !coplanarPolyg->IsPolyLink( polygon._links[ iL2 ]) &&
3061 coplanarPolyg < & _polygons[ nbQuadPolygons ])
3063 if ( iL2 == polygon._links.size() )
3066 if ( coplanarPolyg ) // coplanar polygon found
3068 freeLinks.resize( freeLinks.size() - polygon._polyLinks.size() );
3069 nbFreeLinks -= polygon._polyLinks.size();
3071 // an E_IntersectPoint used to mark nodes of coplanarPolyg
3072 // as lying on curFace while they are not at intersection with geometry
3073 ipTmp._faceIDs.resize(1);
3074 ipTmp._faceIDs[0] = curFace;
3076 // fill freeLinks with links not shared by coplanarPolyg and polygon
3077 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3078 if ( polygon._links[ iL ]._link->_faces[1] &&
3079 polygon._links[ iL ]._link->_faces[0] != coplanarPolyg )
3081 _Face* p = polygon._links[ iL ]._link->_faces[0];
3082 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3083 if ( p->_links[ iL2 ]._link == polygon._links[ iL ]._link )
3085 freeLinks.push_back( & p->_links[ iL2 ] );
3087 freeLinks.back()->RemoveFace( &polygon );
3091 for ( size_t iL = 0; iL < coplanarPolyg->_links.size(); ++iL )
3092 if ( coplanarPolyg->_links[ iL ]._link->_faces[1] &&
3093 coplanarPolyg->_links[ iL ]._link->_faces[1] != &polygon )
3095 _Face* p = coplanarPolyg->_links[ iL ]._link->_faces[0];
3096 if ( p == coplanarPolyg )
3097 p = coplanarPolyg->_links[ iL ]._link->_faces[1];
3098 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3099 if ( p->_links[ iL2 ]._link == coplanarPolyg->_links[ iL ]._link )
3101 // set links of coplanarPolyg in place of used freeLinks
3102 // to re-create coplanarPolyg next
3104 for ( ; iL3 < freeLinks.size() && freeLinks[ iL3 ]; ++iL3 );
3105 if ( iL3 < freeLinks.size() )
3106 freeLinks[ iL3 ] = ( & p->_links[ iL2 ] );
3108 freeLinks.push_back( & p->_links[ iL2 ] );
3110 freeLinks[ iL3 ]->RemoveFace( coplanarPolyg );
3111 // mark nodes of coplanarPolyg as lying on curFace
3112 for ( int iN = 0; iN < 2; ++iN )
3114 _Node* n = freeLinks[ iL3 ]->_link->_nodes[ iN ];
3115 if ( n->_intPoint ) n->_intPoint->Add( ipTmp._faceIDs );
3116 else n->_intPoint = &ipTmp;
3121 // set coplanarPolyg to be re-created next
3122 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
3123 if ( coplanarPolyg == & _polygons[ iP ] )
3126 _polygons[ iPolygon ]._links.clear();
3127 _polygons[ iPolygon ]._polyLinks.clear();
3130 _polygons.pop_back();
3131 usedFaceIDs.erase( curFace );
3133 } // if ( coplanarPolyg )
3134 } // if ( hasEdgeIntersections ) - search for coplanarPolyg
3136 iPolygon = _polygons.size();
3138 } // end of case ( polygon._links.size() > 2 )
3139 } // while ( nbFreeLinks > 0 )
3141 // check volume size
3142 _hasTooSmall = ! checkPolyhedronSize( intFlag & IS_CUT_BY_INTERNAL_FACE );
3144 for ( size_t i = 0; i < 8; ++i )
3145 if ( _hexNodes[ i ]._intPoint == &ipTmp )
3146 _hexNodes[ i ]._intPoint = 0;
3149 return false; // too small volume
3151 // create a classic cell if possible
3154 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3155 nbPolygons += (_polygons[ iF ]._links.size() > 0 );
3157 //const int nbNodes = _nbCornerNodes + nbIntersections;
3159 for ( size_t i = 0; i < 8; ++i )
3160 nbNodes += _hexNodes[ i ].IsUsedInFace();
3161 for ( size_t i = 0; i < _intNodes.size(); ++i )
3162 nbNodes += _intNodes[ i ].IsUsedInFace();
3164 bool isClassicElem = false;
3165 if ( nbNodes == 8 && nbPolygons == 6 ) isClassicElem = addHexa();
3166 else if ( nbNodes == 4 && nbPolygons == 4 ) isClassicElem = addTetra();
3167 else if ( nbNodes == 6 && nbPolygons == 5 ) isClassicElem = addPenta();
3168 else if ( nbNodes == 5 && nbPolygons == 5 ) isClassicElem = addPyra ();
3169 if ( !isClassicElem )
3171 _volumeDefs._nodes.clear();
3172 _volumeDefs._quantities.clear();
3174 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3176 const size_t nbLinks = _polygons[ iF ]._links.size();
3177 if ( nbLinks == 0 ) continue;
3178 _volumeDefs._quantities.push_back( nbLinks );
3179 for ( size_t iL = 0; iL < nbLinks; ++iL )
3180 _volumeDefs._nodes.push_back( _polygons[ iF ]._links[ iL ].FirstNode() );
3183 _volumeDefs._solidID = solid->ID();
3185 return !_volumeDefs._nodes.empty();
3187 //================================================================================
3189 * \brief Create elements in the mesh
3191 int Hexahedron::MakeElements(SMESH_MesherHelper& helper,
3192 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3194 SMESHDS_Mesh* mesh = helper.GetMeshDS();
3196 CellsAroundLink c( _grid, 0 );
3197 const size_t nbGridCells = c._nbCells[0] * c._nbCells[1] * c._nbCells[2];
3198 vector< Hexahedron* > allHexa( nbGridCells, 0 );
3201 // set intersection nodes from GridLine's to links of allHexa
3202 int i,j,k, cellIndex;
3203 for ( int iDir = 0; iDir < 3; ++iDir )
3205 // loop on GridLine's parallel to iDir
3206 LineIndexer lineInd = _grid->GetLineIndexer( iDir );
3207 CellsAroundLink fourCells( _grid, iDir );
3208 for ( ; lineInd.More(); ++lineInd )
3210 GridLine& line = _grid->_lines[ iDir ][ lineInd.LineIndex() ];
3211 multiset< F_IntersectPoint >::const_iterator ip = line._intPoints.begin();
3212 for ( ; ip != line._intPoints.end(); ++ip )
3214 // if ( !ip->_node ) continue; // intersection at a grid node
3215 lineInd.SetIndexOnLine( ip->_indexOnLine );
3216 fourCells.Init( lineInd.I(), lineInd.J(), lineInd.K() );
3217 for ( int iL = 0; iL < 4; ++iL ) // loop on 4 cells sharing a link
3219 if ( !fourCells.GetCell( iL, i,j,k, cellIndex ))
3221 Hexahedron *& hex = allHexa[ cellIndex ];
3224 hex = new Hexahedron( *this, i, j, k, cellIndex );
3227 const int iLink = iL + iDir * 4;
3228 hex->_hexLinks[iLink]._fIntPoints.push_back( &(*ip) );
3229 hex->_nbFaceIntNodes += bool( ip->_node );
3235 // implement geom edges into the mesh
3236 addEdges( helper, allHexa, edge2faceIDsMap );
3238 // add not split hexahedra to the mesh
3240 TGeomID solidIDs[20];
3241 vector< Hexahedron* > intHexa; intHexa.reserve( nbIntHex );
3242 vector< const SMDS_MeshElement* > boundaryVolumes; boundaryVolumes.reserve( nbIntHex * 1.1 );
3243 for ( size_t i = 0; i < allHexa.size(); ++i )
3245 // initialize this by not cut allHexa[ i ]
3246 Hexahedron * & hex = allHexa[ i ];
3247 if ( hex ) // split hexahedron
3249 intHexa.push_back( hex );
3250 if ( hex->_nbFaceIntNodes > 0 || hex->_eIntPoints.size() > 0 )
3251 continue; // treat intersected hex later in parallel
3252 this->init( hex->_i, hex->_j, hex->_k );
3256 this->init( i ); // == init(i,j,k)
3258 if (( _nbCornerNodes == 8 ) &&
3259 ( _nbBndNodes < _nbCornerNodes || !isInHole() ))
3261 // order of _hexNodes is defined by enum SMESH_Block::TShapeID
3262 SMDS_MeshElement* el =
3263 mesh->AddVolume( _hexNodes[0].Node(), _hexNodes[2].Node(),
3264 _hexNodes[3].Node(), _hexNodes[1].Node(),
3265 _hexNodes[4].Node(), _hexNodes[6].Node(),
3266 _hexNodes[7].Node(), _hexNodes[5].Node() );
3267 TGeomID solidID = 0;
3268 if ( _nbBndNodes < _nbCornerNodes )
3270 for ( int iN = 0; iN < 8 && !solidID; ++iN )
3271 if ( !_hexNodes[iN]._intPoint ) // no intersection
3272 solidID = _hexNodes[iN].Node()->GetShapeID();
3276 getSolids( solidIDs );
3277 solidID = solidIDs[0];
3279 mesh->SetMeshElementOnShape( el, solidID );
3283 if ( _grid->_toCreateFaces && _nbBndNodes >= 3 )
3285 boundaryVolumes.push_back( el );
3286 el->setIsMarked( true );
3289 else if ( _nbCornerNodes > 3 && !hex )
3291 // all intersection of hex with geometry are at grid nodes
3292 hex = new Hexahedron( *this, _i, _j, _k, i );
3293 intHexa.push_back( hex );
3297 // add elements resulted from hexadron intersection
3299 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, intHexa.size() ),
3300 ParallelHexahedron( intHexa ),
3301 tbb::simple_partitioner()); // ComputeElements() is called here
3302 for ( size_t i = 0; i < intHexa.size(); ++i )
3303 if ( Hexahedron * hex = intHexa[ i ] )
3304 nbAdded += hex->addVolumes( helper );
3306 for ( size_t i = 0; i < intHexa.size(); ++i )
3307 if ( Hexahedron * hex = intHexa[ i ] )
3309 hex->ComputeElements();
3310 nbAdded += hex->addVolumes( helper );
3314 // fill boundaryVolumes with volumes neighboring too small skipped volumes
3315 if ( _grid->_toCreateFaces )
3317 for ( size_t i = 0; i < intHexa.size(); ++i )
3318 if ( Hexahedron * hex = intHexa[ i ] )
3319 hex->getBoundaryElems( boundaryVolumes );
3322 // create boundary mesh faces
3323 addFaces( helper, boundaryVolumes );
3325 // create mesh edges
3326 addSegments( helper, edge2faceIDsMap );
3328 for ( size_t i = 0; i < allHexa.size(); ++i )
3330 delete allHexa[ i ];
3335 //================================================================================
3337 * \brief Implements geom edges into the mesh
3339 void Hexahedron::addEdges(SMESH_MesherHelper& helper,
3340 vector< Hexahedron* >& hexes,
3341 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3343 if ( edge2faceIDsMap.empty() ) return;
3345 // Prepare planes for intersecting with EDGEs
3348 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ ) // iDirZ gives normal direction to planes
3350 GridPlanes& planes = pln[ iDirZ ];
3351 int iDirX = ( iDirZ + 1 ) % 3;
3352 int iDirY = ( iDirZ + 2 ) % 3;
3353 planes._zNorm = ( _grid->_axes[ iDirX ] ^ _grid->_axes[ iDirY ] ).Normalized();
3354 planes._zProjs.resize ( _grid->_coords[ iDirZ ].size() );
3355 planes._zProjs [0] = 0;
3356 const double zFactor = _grid->_axes[ iDirZ ] * planes._zNorm;
3357 const vector< double > & u = _grid->_coords[ iDirZ ];
3358 for ( size_t i = 1; i < planes._zProjs.size(); ++i )
3360 planes._zProjs [i] = zFactor * ( u[i] - u[0] );
3364 const double deflection = _grid->_minCellSize / 20.;
3365 const double tol = _grid->_tol;
3366 E_IntersectPoint ip;
3368 TColStd_MapOfInteger intEdgeIDs; // IDs of not shared INTERNAL EDGES
3370 // Intersect EDGEs with the planes
3371 map< TGeomID, vector< TGeomID > >::const_iterator e2fIt = edge2faceIDsMap.begin();
3372 for ( ; e2fIt != edge2faceIDsMap.end(); ++e2fIt )
3374 const TGeomID edgeID = e2fIt->first;
3375 const TopoDS_Edge & E = TopoDS::Edge( _grid->Shape( edgeID ));
3376 BRepAdaptor_Curve curve( E );
3377 TopoDS_Vertex v1 = helper.IthVertex( 0, E, false );
3378 TopoDS_Vertex v2 = helper.IthVertex( 1, E, false );
3380 ip._faceIDs = e2fIt->second;
3381 ip._shapeID = edgeID;
3383 bool isInternal = ( ip._faceIDs.size() == 1 && _grid->IsInternal( edgeID ));
3386 intEdgeIDs.Add( edgeID );
3387 intEdgeIDs.Add( _grid->ShapeID( v1 ));
3388 intEdgeIDs.Add( _grid->ShapeID( v2 ));
3391 // discretize the EDGE
3392 GCPnts_UniformDeflection discret( curve, deflection, true );
3393 if ( !discret.IsDone() || discret.NbPoints() < 2 )
3396 // perform intersection
3397 E_IntersectPoint* eip, *vip;
3398 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ )
3400 GridPlanes& planes = pln[ iDirZ ];
3401 int iDirX = ( iDirZ + 1 ) % 3;
3402 int iDirY = ( iDirZ + 2 ) % 3;
3403 double xLen = _grid->_coords[ iDirX ].back() - _grid->_coords[ iDirX ][0];
3404 double yLen = _grid->_coords[ iDirY ].back() - _grid->_coords[ iDirY ][0];
3405 double zLen = _grid->_coords[ iDirZ ].back() - _grid->_coords[ iDirZ ][0];
3406 int dIJK[3], d000[3] = { 0,0,0 };
3407 double o[3] = { _grid->_coords[0][0],
3408 _grid->_coords[1][0],
3409 _grid->_coords[2][0] };
3411 // locate the 1st point of a segment within the grid
3412 gp_XYZ p1 = discret.Value( 1 ).XYZ();
3413 double u1 = discret.Parameter( 1 );
3414 double zProj1 = planes._zNorm * ( p1 - _grid->_origin );
3416 _grid->ComputeUVW( p1, ip._uvw );
3417 int iX1 = int(( ip._uvw[iDirX] - o[iDirX]) / xLen * (_grid->_coords[ iDirX ].size() - 1));
3418 int iY1 = int(( ip._uvw[iDirY] - o[iDirY]) / yLen * (_grid->_coords[ iDirY ].size() - 1));
3419 int iZ1 = int(( ip._uvw[iDirZ] - o[iDirZ]) / zLen * (_grid->_coords[ iDirZ ].size() - 1));
3420 locateValue( iX1, ip._uvw[iDirX], _grid->_coords[ iDirX ], dIJK[ iDirX ], tol );
3421 locateValue( iY1, ip._uvw[iDirY], _grid->_coords[ iDirY ], dIJK[ iDirY ], tol );
3422 locateValue( iZ1, ip._uvw[iDirZ], _grid->_coords[ iDirZ ], dIJK[ iDirZ ], tol );
3424 int ijk[3]; // grid index where a segment intersects a plane
3429 // add the 1st vertex point to a hexahedron
3433 ip._shapeID = _grid->ShapeID( v1 );
3434 vip = _grid->Add( ip );
3436 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3437 if ( !addIntersection( vip, hexes, ijk, d000 ))
3438 _grid->Remove( vip );
3439 ip._shapeID = edgeID;
3441 for ( int iP = 2; iP <= discret.NbPoints(); ++iP )
3443 // locate the 2nd point of a segment within the grid
3444 gp_XYZ p2 = discret.Value( iP ).XYZ();
3445 double u2 = discret.Parameter( iP );
3446 double zProj2 = planes._zNorm * ( p2 - _grid->_origin );
3448 if ( Abs( zProj2 - zProj1 ) > std::numeric_limits<double>::min() )
3450 locateValue( iZ2, zProj2, planes._zProjs, dIJK[ iDirZ ], tol );
3452 // treat intersections with planes between 2 end points of a segment
3453 int dZ = ( iZ1 <= iZ2 ) ? +1 : -1;
3454 int iZ = iZ1 + ( iZ1 < iZ2 );
3455 for ( int i = 0, nb = Abs( iZ1 - iZ2 ); i < nb; ++i, iZ += dZ )
3457 ip._point = findIntPoint( u1, zProj1, u2, zProj2,
3458 planes._zProjs[ iZ ],
3459 curve, planes._zNorm, _grid->_origin );
3460 _grid->ComputeUVW( ip._point.XYZ(), ip._uvw );
3461 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3462 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3465 // add ip to hex "above" the plane
3466 eip = _grid->Add( ip );
3468 eip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3470 bool added = addIntersection( eip, hexes, ijk, dIJK);
3472 // add ip to hex "below" the plane
3473 ijk[ iDirZ ] = iZ-1;
3474 if ( !addIntersection( eip, hexes, ijk, dIJK ) &&
3476 _grid->Remove( eip );
3484 // add the 2nd vertex point to a hexahedron
3488 ip._shapeID = _grid->ShapeID( v2 );
3489 _grid->ComputeUVW( p1, ip._uvw );
3490 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3491 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3493 bool sameV = ( v1.IsSame( v2 ));
3495 vip = _grid->Add( ip );
3496 if ( isInternal && !sameV )
3497 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3498 if ( !addIntersection( vip, hexes, ijk, d000 ) && !sameV )
3499 _grid->Remove( vip );
3500 ip._shapeID = edgeID;
3502 } // loop on 3 grid directions
3506 if ( intEdgeIDs.Size() > 0 )
3507 cutByExtendedInternal( hexes, intEdgeIDs );
3512 //================================================================================
3514 * \brief Fully cut hexes that are partially cut by INTERNAL FACE.
3515 * Cut them by extended INTERNAL FACE.
3517 void Hexahedron::cutByExtendedInternal( std::vector< Hexahedron* >& hexes,
3518 const TColStd_MapOfInteger& intEdgeIDs )
3520 IntAna_IntConicQuad intersection;
3521 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
3522 const double tol2 = _grid->_tol * _grid->_tol;
3524 for ( size_t iH = 0; iH < hexes.size(); ++iH )
3526 Hexahedron* hex = hexes[ iH ];
3527 if ( !hex || hex->_eIntPoints.size() < 2 )
3529 if ( !intEdgeIDs.Contains( hex->_eIntPoints.back()->_shapeID ))
3532 // get 3 points on INTERNAL FACE to construct a cutting plane
3533 gp_Pnt p1 = hex->_eIntPoints[0]->_point;
3534 gp_Pnt p2 = hex->_eIntPoints[1]->_point;
3535 gp_Pnt p3 = hex->mostDistantInternalPnt( iH, p1, p2 );
3537 gp_Vec norm = gp_Vec( p1, p2 ) ^ gp_Vec( p1, p3 );
3540 pln = gp_Pln( p1, norm );
3547 TGeomID intFaceID = hex->_eIntPoints.back()->_faceIDs.front(); // FACE being "extended"
3548 TGeomID solidID = _grid->GetSolid( intFaceID )->ID();
3550 // cut links by the plane
3551 //bool isCut = false;
3552 for ( int iLink = 0; iLink < 12; ++iLink )
3554 _Link& link = hex->_hexLinks[ iLink ];
3555 if ( !link._fIntPoints.empty() )
3557 // if ( link._fIntPoints[0]->_faceIDs.back() == _grid->PseudoIntExtFaceID() )
3559 continue; // already cut link
3561 if ( !link._nodes[0]->Node() ||
3562 !link._nodes[1]->Node() )
3563 continue; // outside link
3565 if ( link._nodes[0]->IsOnFace( intFaceID ))
3567 if ( link._nodes[0]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3568 if ( p1.SquareDistance( link._nodes[0]->Point() ) < tol2 ||
3569 p2.SquareDistance( link._nodes[0]->Point() ) < tol2 )
3570 link._nodes[0]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3571 continue; // link is cut by FACE being "extended"
3573 if ( link._nodes[1]->IsOnFace( intFaceID ))
3575 if ( link._nodes[1]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3576 if ( p1.SquareDistance( link._nodes[1]->Point() ) < tol2 ||
3577 p2.SquareDistance( link._nodes[1]->Point() ) < tol2 )
3578 link._nodes[1]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3579 continue; // link is cut by FACE being "extended"
3581 gp_Pnt p4 = link._nodes[0]->Point();
3582 gp_Pnt p5 = link._nodes[1]->Point();
3583 gp_Lin line( p4, gp_Vec( p4, p5 ));
3585 intersection.Perform( line, pln );
3586 if ( !intersection.IsDone() ||
3587 intersection.IsInQuadric() ||
3588 intersection.IsParallel() ||
3589 intersection.NbPoints() < 1 )
3592 double u = intersection.ParamOnConic(1);
3593 if ( u + _grid->_tol < 0 )
3595 int iDir = iLink / 4;
3596 int index = (&hex->_i)[iDir];
3597 double linkLen = _grid->_coords[iDir][index+1] - _grid->_coords[iDir][index];
3598 if ( u - _grid->_tol > linkLen )
3601 if ( u < _grid->_tol ||
3602 u > linkLen - _grid->_tol ) // intersection at grid node
3604 int i = ! ( u < _grid->_tol ); // [0,1]
3605 int iN = link._nodes[ i ] - hex->_hexNodes; // [0-7]
3607 const F_IntersectPoint * & ip = _grid->_gridIntP[ hex->_origNodeInd + _nodeShift[iN] ];
3610 ip = _grid->_extIntPool.getNew();
3611 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3612 //ip->_transition = Trans_INTERNAL;
3614 else if ( ip->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3616 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3618 hex->_nbFaceIntNodes++;
3623 const gp_Pnt& p = intersection.Point( 1 );
3624 F_IntersectPoint* ip = _grid->_extIntPool.getNew();
3625 ip->_node = meshDS->AddNode( p.X(), p.Y(), p.Z() );
3626 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3627 ip->_transition = Trans_INTERNAL;
3628 meshDS->SetNodeInVolume( ip->_node, solidID );
3630 CellsAroundLink fourCells( _grid, iDir );
3631 fourCells.Init( hex->_i, hex->_j, hex->_k, iLink );
3632 int i,j,k, cellIndex;
3633 for ( int iC = 0; iC < 4; ++iC ) // loop on 4 cells sharing the link
3635 if ( !fourCells.GetCell( iC, i,j,k, cellIndex ))
3637 Hexahedron * h = hexes[ cellIndex ];
3639 h = hexes[ cellIndex ] = new Hexahedron( *this, i, j, k, cellIndex );
3640 const int iL = iC + iDir * 4;
3641 h->_hexLinks[iL]._fIntPoints.push_back( ip );
3642 h->_nbFaceIntNodes++;
3649 // for ( size_t i = 0; i < hex->_eIntPoints.size(); ++i )
3651 // if ( _grid->IsInternal( hex->_eIntPoints[i]->_shapeID ) &&
3652 // ! hex->_eIntPoints[i]->IsOnFace( _grid->PseudoIntExtFaceID() ))
3653 // hex->_eIntPoints[i]->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3657 } // loop on all hexes
3661 //================================================================================
3663 * \brief Return intersection point on INTERNAL FACE most distant from given ones
3665 gp_Pnt Hexahedron::mostDistantInternalPnt( int hexIndex, const gp_Pnt& p1, const gp_Pnt& p2 )
3667 gp_Pnt resultPnt = p1;
3669 double maxDist2 = 0;
3670 for ( int iLink = 0; iLink < 12; ++iLink ) // check links
3672 _Link& link = _hexLinks[ iLink ];
3673 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
3674 if ( _grid->PseudoIntExtFaceID() != link._fIntPoints[i]->_faceIDs[0] &&
3675 _grid->IsInternal( link._fIntPoints[i]->_faceIDs[0] ) &&
3676 link._fIntPoints[i]->_node )
3678 gp_Pnt p = SMESH_NodeXYZ( link._fIntPoints[i]->_node );
3679 double d = p1.SquareDistance( p );
3687 d = p2.SquareDistance( p );
3697 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
3699 for ( size_t iN = 0; iN < 8; ++iN ) // check corners
3701 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
3702 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
3703 if ( _hexNodes[iN]._intPoint )
3704 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
3706 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
3708 gp_Pnt p = SMESH_NodeXYZ( _hexNodes[iN]._node );
3709 double d = p1.SquareDistance( p );
3717 d = p2.SquareDistance( p );
3727 if ( maxDist2 < _grid->_tol * _grid->_tol )
3733 //================================================================================
3735 * \brief Finds intersection of a curve with a plane
3736 * \param [in] u1 - parameter of one curve point
3737 * \param [in] proj1 - projection of the curve point to the plane normal
3738 * \param [in] u2 - parameter of another curve point
3739 * \param [in] proj2 - projection of the other curve point to the plane normal
3740 * \param [in] proj - projection of a point where the curve intersects the plane
3741 * \param [in] curve - the curve
3742 * \param [in] axis - the plane normal
3743 * \param [in] origin - the plane origin
3744 * \return gp_Pnt - the found intersection point
3746 gp_Pnt Hexahedron::findIntPoint( double u1, double proj1,
3747 double u2, double proj2,
3749 BRepAdaptor_Curve& curve,
3751 const gp_XYZ& origin)
3753 double r = (( proj - proj1 ) / ( proj2 - proj1 ));
3754 double u = u1 * ( 1 - r ) + u2 * r;
3755 gp_Pnt p = curve.Value( u );
3756 double newProj = axis * ( p.XYZ() - origin );
3757 if ( Abs( proj - newProj ) > _grid->_tol / 10. )
3760 return findIntPoint( u2, proj2, u, newProj, proj, curve, axis, origin );
3762 return findIntPoint( u1, proj2, u, newProj, proj, curve, axis, origin );
3767 //================================================================================
3769 * \brief Returns indices of a hexahedron sub-entities holding a point
3770 * \param [in] ip - intersection point
3771 * \param [out] facets - 0-3 facets holding a point
3772 * \param [out] sub - index of a vertex or an edge holding a point
3773 * \return int - number of facets holding a point
3775 int Hexahedron::getEntity( const E_IntersectPoint* ip, int* facets, int& sub )
3777 enum { X = 1, Y = 2, Z = 4 }; // == 001, 010, 100
3779 int vertex = 0, edgeMask = 0;
3781 if ( Abs( _grid->_coords[0][ _i ] - ip->_uvw[0] ) < _grid->_tol ) {
3782 facets[ nbFacets++ ] = SMESH_Block::ID_F0yz;
3785 else if ( Abs( _grid->_coords[0][ _i+1 ] - ip->_uvw[0] ) < _grid->_tol ) {
3786 facets[ nbFacets++ ] = SMESH_Block::ID_F1yz;
3790 if ( Abs( _grid->_coords[1][ _j ] - ip->_uvw[1] ) < _grid->_tol ) {
3791 facets[ nbFacets++ ] = SMESH_Block::ID_Fx0z;
3794 else if ( Abs( _grid->_coords[1][ _j+1 ] - ip->_uvw[1] ) < _grid->_tol ) {
3795 facets[ nbFacets++ ] = SMESH_Block::ID_Fx1z;
3799 if ( Abs( _grid->_coords[2][ _k ] - ip->_uvw[2] ) < _grid->_tol ) {
3800 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy0;
3803 else if ( Abs( _grid->_coords[2][ _k+1 ] - ip->_uvw[2] ) < _grid->_tol ) {
3804 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy1;
3811 case 0: sub = 0; break;
3812 case 1: sub = facets[0]; break;
3814 const int edge [3][8] = {
3815 { SMESH_Block::ID_E00z, SMESH_Block::ID_E10z,
3816 SMESH_Block::ID_E01z, SMESH_Block::ID_E11z },
3817 { SMESH_Block::ID_E0y0, SMESH_Block::ID_E1y0, 0, 0,
3818 SMESH_Block::ID_E0y1, SMESH_Block::ID_E1y1 },
3819 { SMESH_Block::ID_Ex00, 0, SMESH_Block::ID_Ex10, 0,
3820 SMESH_Block::ID_Ex01, 0, SMESH_Block::ID_Ex11 }
3822 switch ( edgeMask ) {
3823 case X | Y: sub = edge[ 0 ][ vertex ]; break;
3824 case X | Z: sub = edge[ 1 ][ vertex ]; break;
3825 default: sub = edge[ 2 ][ vertex ];
3831 sub = vertex + SMESH_Block::ID_FirstV;
3836 //================================================================================
3838 * \brief Adds intersection with an EDGE
3840 bool Hexahedron::addIntersection( const E_IntersectPoint* ip,
3841 vector< Hexahedron* >& hexes,
3842 int ijk[], int dIJK[] )
3846 size_t hexIndex[4] = {
3847 _grid->CellIndex( ijk[0], ijk[1], ijk[2] ),
3848 dIJK[0] ? _grid->CellIndex( ijk[0]+dIJK[0], ijk[1], ijk[2] ) : -1,
3849 dIJK[1] ? _grid->CellIndex( ijk[0], ijk[1]+dIJK[1], ijk[2] ) : -1,
3850 dIJK[2] ? _grid->CellIndex( ijk[0], ijk[1], ijk[2]+dIJK[2] ) : -1
3852 for ( int i = 0; i < 4; ++i )
3854 if ( hexIndex[i] < hexes.size() && hexes[ hexIndex[i] ] )
3856 Hexahedron* h = hexes[ hexIndex[i] ];
3857 h->_eIntPoints.reserve(2);
3858 h->_eIntPoints.push_back( ip );
3861 // check if ip is really inside the hex
3862 if ( h->isOutParam( ip->_uvw ))
3863 throw SALOME_Exception("ip outside a hex");
3869 //================================================================================
3871 * \brief Finds nodes at a path from one node to another via intersections with EDGEs
3873 bool Hexahedron::findChain( _Node* n1,
3876 vector<_Node*>& chn )
3879 chn.push_back( n1 );
3880 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3881 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3882 n1->IsLinked( quad._eIntNodes[ iP ]->_intPoint ) &&
3883 n2->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3885 chn.push_back( quad._eIntNodes[ iP ]);
3886 chn.push_back( n2 );
3887 quad._eIntNodes[ iP ]->_usedInFace = &quad;
3894 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3895 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3896 chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3898 chn.push_back( quad._eIntNodes[ iP ]);
3899 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
3902 } while ( found && ! chn.back()->IsLinked( n2->_intPoint ) );
3904 if ( chn.back() != n2 && chn.back()->IsLinked( n2->_intPoint ))
3905 chn.push_back( n2 );
3907 return chn.size() > 1;
3909 //================================================================================
3911 * \brief Try to heal a polygon whose ends are not connected
3913 bool Hexahedron::closePolygon( _Face* polygon, vector<_Node*>& chainNodes ) const
3915 int i = -1, nbLinks = polygon->_links.size();
3918 vector< _OrientedLink > newLinks;
3919 // find a node lying on the same FACE as the last one
3920 _Node* node = polygon->_links.back().LastNode();
3921 int avoidFace = node->IsLinked( polygon->_links.back().FirstNode()->_intPoint );
3922 for ( i = nbLinks - 2; i >= 0; --i )
3923 if ( node->IsLinked( polygon->_links[i].FirstNode()->_intPoint, avoidFace ))
3927 for ( ; i < nbLinks; ++i )
3928 newLinks.push_back( polygon->_links[i] );
3932 // find a node lying on the same FACE as the first one
3933 node = polygon->_links[0].FirstNode();
3934 avoidFace = node->IsLinked( polygon->_links[0].LastNode()->_intPoint );
3935 for ( i = 1; i < nbLinks; ++i )
3936 if ( node->IsLinked( polygon->_links[i].LastNode()->_intPoint, avoidFace ))
3939 for ( nbLinks = i + 1, i = 0; i < nbLinks; ++i )
3940 newLinks.push_back( polygon->_links[i] );
3942 if ( newLinks.size() > 1 )
3944 polygon->_links.swap( newLinks );
3946 chainNodes.push_back( polygon->_links.back().LastNode() );
3947 chainNodes.push_back( polygon->_links[0].FirstNode() );
3952 //================================================================================
3954 * \brief Finds nodes on the same EDGE as the first node of avoidSplit.
3956 * This function is for
3957 * 1) a case where an EDGE lies on a quad which lies on a FACE
3958 * so that a part of quad in ON and another part is IN
3959 * 2) INTERNAL FACE passes through the 1st node of avoidSplit
3961 bool Hexahedron::findChainOnEdge( const vector< _OrientedLink >& splits,
3962 const _OrientedLink& prevSplit,
3963 const _OrientedLink& avoidSplit,
3966 vector<_Node*>& chn )
3968 _Node* pn1 = prevSplit.FirstNode();
3969 _Node* pn2 = prevSplit.LastNode();
3970 int avoidFace = pn1->IsLinked( pn2->_intPoint ); // FACE under the quad
3971 if ( avoidFace < 1 && pn1->_intPoint )
3974 _Node* n = 0, *stopNode = avoidSplit.LastNode();
3977 if ( !quad._eIntNodes.empty() ) // connect pn2 with EDGE intersections
3979 chn.push_back( pn2 );
3984 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3985 if (( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad )) &&
3986 ( chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint, avoidFace )) &&
3987 ( !avoidFace || quad._eIntNodes[ iP ]->IsOnFace( avoidFace )))
3989 chn.push_back( quad._eIntNodes[ iP ]);
3990 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
3998 for ( i = splits.size()-1; i >= 0; --i ) // connect new pn2 (at _eIntNodes) with a split
4003 n = splits[i].LastNode();
4004 if ( n == stopNode )
4007 ( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4008 ( !avoidFace || n->IsOnFace( avoidFace )))
4011 n = splits[i].FirstNode();
4012 if ( n == stopNode )
4014 if (( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4015 ( !avoidFace || n->IsOnFace( avoidFace )))
4019 if ( n && n != stopNode )
4022 chn.push_back( pn2 );
4027 else if ( !chn.empty() && chn.back()->_isInternalFlags )
4029 // INTERNAL FACE partially cuts the quad
4030 for ( int i = chn.size() - 2; i >= 0; --i )
4031 chn.push_back( chn[ i ]);
4036 //================================================================================
4038 * \brief Checks transition at the ginen intersection node of a link
4040 bool Hexahedron::isOutPoint( _Link& link, int iP,
4041 SMESH_MesherHelper& helper, const Solid* solid ) const
4045 if ( link._fIntNodes[iP]->faces().size() == 1 &&
4046 _grid->IsInternal( link._fIntNodes[iP]->face(0) ))
4049 const bool moreIntPoints = ( iP+1 < (int) link._fIntNodes.size() );
4052 _Node* n1 = link._fIntNodes[ iP ];
4054 n1 = link._nodes[0];
4055 _Node* n2 = moreIntPoints ? link._fIntNodes[ iP+1 ] : 0;
4056 if ( !n2 || !n2->Node() )
4057 n2 = link._nodes[1];
4061 // get all FACEs under n1 and n2
4062 set< TGeomID > faceIDs;
4063 if ( moreIntPoints ) faceIDs.insert( link._fIntNodes[iP+1]->faces().begin(),
4064 link._fIntNodes[iP+1]->faces().end() );
4065 if ( n2->_intPoint ) faceIDs.insert( n2->_intPoint->_faceIDs.begin(),
4066 n2->_intPoint->_faceIDs.end() );
4067 if ( faceIDs.empty() )
4068 return false; // n2 is inside
4069 if ( n1->_intPoint ) faceIDs.insert( n1->_intPoint->_faceIDs.begin(),
4070 n1->_intPoint->_faceIDs.end() );
4071 faceIDs.insert( link._fIntNodes[iP]->faces().begin(),
4072 link._fIntNodes[iP]->faces().end() );
4074 // get a point between 2 nodes
4075 gp_Pnt p1 = n1->Point();
4076 gp_Pnt p2 = n2->Point();
4077 gp_Pnt pOnLink = 0.8 * p1.XYZ() + 0.2 * p2.XYZ();
4079 TopLoc_Location loc;
4081 set< TGeomID >::iterator faceID = faceIDs.begin();
4082 for ( ; faceID != faceIDs.end(); ++faceID )
4084 // project pOnLink on a FACE
4085 if ( *faceID < 1 || !solid->Contains( *faceID )) continue;
4086 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( *faceID ));
4087 GeomAPI_ProjectPointOnSurf& proj = helper.GetProjector( face, loc, 0.1*_grid->_tol );
4088 gp_Pnt testPnt = pOnLink.Transformed( loc.Transformation().Inverted() );
4089 proj.Perform( testPnt );
4090 if ( proj.IsDone() && proj.NbPoints() > 0 )
4093 proj.LowerDistanceParameters( u,v );
4095 if ( proj.LowerDistance() <= 0.1 * _grid->_tol )
4101 // find isOut by normals
4103 if ( GeomLib::NormEstim( BRep_Tool::Surface( face, loc ),
4108 if ( solid->Orientation( face ) == TopAbs_REVERSED )
4110 gp_Vec v( proj.NearestPoint(), testPnt );
4111 isOut = ( v * normal > 0 );
4116 // classify a projection
4117 if ( !n1->IsOnFace( *faceID ) || !n2->IsOnFace( *faceID ))
4119 BRepTopAdaptor_FClass2d cls( face, Precision::Confusion() );
4120 TopAbs_State state = cls.Perform( gp_Pnt2d( u,v ));
4121 if ( state == TopAbs_OUT )
4133 //================================================================================
4135 * \brief Sort nodes on a FACE
4137 void Hexahedron::sortVertexNodes(vector<_Node*>& nodes, _Node* curNode, TGeomID faceID)
4139 if ( nodes.size() > 20 ) return;
4141 // get shapes under nodes
4142 TGeomID nShapeIds[20], *nShapeIdsEnd = &nShapeIds[0] + nodes.size();
4143 for ( size_t i = 0; i < nodes.size(); ++i )
4144 if ( !( nShapeIds[i] = nodes[i]->ShapeID() ))
4147 // get shapes of the FACE
4148 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( faceID ));
4149 list< TopoDS_Edge > edges;
4150 list< int > nbEdges;
4151 int nbW = SMESH_Block::GetOrderedEdges (face, edges, nbEdges);
4153 // select a WIRE - remove EDGEs of irrelevant WIREs from edges
4154 list< TopoDS_Edge >::iterator e = edges.begin(), eEnd = e;
4155 list< int >::iterator nE = nbEdges.begin();
4156 for ( ; nbW > 0; ++nE, --nbW )
4158 std::advance( eEnd, *nE );
4159 for ( ; e != eEnd; ++e )
4160 for ( int i = 0; i < 2; ++i )
4163 _grid->ShapeID( *e ) :
4164 _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ));
4166 ( std::find( &nShapeIds[0], nShapeIdsEnd, id ) != nShapeIdsEnd ))
4168 edges.erase( eEnd, edges.end() ); // remove rest wires
4169 e = eEnd = edges.end();
4176 edges.erase( edges.begin(), eEnd ); // remove a current irrelevant wire
4179 // rotate edges to have the first one at least partially out of the hexa
4180 list< TopoDS_Edge >::iterator e = edges.begin(), eMidOut = edges.end();
4181 for ( ; e != edges.end(); ++e )
4183 if ( !_grid->ShapeID( *e ))
4188 for ( int i = 0; i < 2 && !isOut; ++i )
4192 TopoDS_Vertex v = SMESH_MesherHelper::IthVertex( 0, *e );
4193 p = BRep_Tool::Pnt( v );
4195 else if ( eMidOut == edges.end() )
4197 TopLoc_Location loc;
4198 Handle(Geom_Curve) c = BRep_Tool::Curve( *e, loc, f, l);
4199 if ( c.IsNull() ) break;
4200 p = c->Value( 0.5 * ( f + l )).Transformed( loc );
4207 _grid->ComputeUVW( p.XYZ(), uvw );
4208 if ( isOutParam( uvw ))
4219 if ( e != edges.end() )
4220 edges.splice( edges.end(), edges, edges.begin(), e );
4221 else if ( eMidOut != edges.end() )
4222 edges.splice( edges.end(), edges, edges.begin(), eMidOut );
4224 // sort nodes according to the order of edges
4225 _Node* orderNodes [20];
4226 //TGeomID orderShapeIDs[20];
4228 TGeomID id, *pID = 0;
4229 for ( e = edges.begin(); e != edges.end(); ++e )
4231 if (( id = _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ))) &&
4232 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4234 //orderShapeIDs[ nbN ] = id;
4235 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4238 if (( id = _grid->ShapeID( *e )) &&
4239 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4241 //orderShapeIDs[ nbN ] = id;
4242 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4246 if ( nbN != nodes.size() )
4249 bool reverse = ( orderNodes[0 ]->Point().SquareDistance( curNode->Point() ) >
4250 orderNodes[nbN-1]->Point().SquareDistance( curNode->Point() ));
4252 for ( size_t i = 0; i < nodes.size(); ++i )
4253 nodes[ i ] = orderNodes[ reverse ? nbN-1-i : i ];
4256 //================================================================================
4258 * \brief Adds computed elements to the mesh
4260 int Hexahedron::addVolumes( SMESH_MesherHelper& helper )
4262 F_IntersectPoint noIntPnt;
4263 const bool toCheckNodePos = _grid->IsToCheckNodePos();
4266 // add elements resulted from hexahedron intersection
4267 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
4269 vector< const SMDS_MeshNode* > nodes( volDef->_nodes.size() );
4270 for ( size_t iN = 0; iN < nodes.size(); ++iN )
4272 if ( !( nodes[iN] = volDef->_nodes[iN].Node() ))
4274 if ( const E_IntersectPoint* eip = volDef->_nodes[iN].EdgeIntPnt() )
4276 nodes[iN] = volDef->_nodes[iN]._intPoint->_node =
4277 helper.AddNode( eip->_point.X(),
4280 if ( _grid->ShapeType( eip->_shapeID ) == TopAbs_VERTEX )
4281 helper.GetMeshDS()->SetNodeOnVertex( nodes[iN], eip->_shapeID );
4283 helper.GetMeshDS()->SetNodeOnEdge( nodes[iN], eip->_shapeID );
4286 throw SALOME_Exception("Bug: no node at intersection point");
4288 else if ( volDef->_nodes[iN]._intPoint &&
4289 volDef->_nodes[iN]._intPoint->_node == volDef->_nodes[iN]._node )
4291 // Update position of node at EDGE intersection;
4292 // see comment to _Node::Add( E_IntersectPoint )
4293 SMESHDS_Mesh* mesh = helper.GetMeshDS();
4294 TGeomID shapeID = volDef->_nodes[iN].EdgeIntPnt()->_shapeID;
4295 mesh->UnSetNodeOnShape( nodes[iN] );
4296 if ( _grid->ShapeType( shapeID ) == TopAbs_VERTEX )
4297 mesh->SetNodeOnVertex( nodes[iN], shapeID );
4299 mesh->SetNodeOnEdge( nodes[iN], shapeID );
4301 else if ( toCheckNodePos &&
4302 !nodes[iN]->isMarked() &&
4303 _grid->ShapeType( nodes[iN]->GetShapeID() ) == TopAbs_FACE )
4305 _grid->SetOnShape( nodes[iN], noIntPnt, /*unset=*/true );
4306 nodes[iN]->setIsMarked( true );
4310 const SMDS_MeshElement* v = 0;
4311 if ( !volDef->_quantities.empty() )
4313 v = helper.AddPolyhedralVolume( nodes, volDef->_quantities );
4317 switch ( nodes.size() )
4319 case 8: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],
4320 nodes[4],nodes[5],nodes[6],nodes[7] );
4322 case 4: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3] );
4324 case 6: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4],nodes[5] );
4326 case 5: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4] );
4330 if (( volDef->_volume = v ))
4332 helper.GetMeshDS()->SetMeshElementOnShape( v, volDef->_solidID );
4339 //================================================================================
4341 * \brief Return true if the element is in a hole
4343 bool Hexahedron::isInHole() const
4345 if ( !_vIntNodes.empty() )
4348 const size_t ijk[3] = { _i, _j, _k };
4349 F_IntersectPoint curIntPnt;
4351 // consider a cell to be in a hole if all links in any direction
4352 // comes OUT of geometry
4353 for ( int iDir = 0; iDir < 3; ++iDir )
4355 const vector<double>& coords = _grid->_coords[ iDir ];
4356 LineIndexer li = _grid->GetLineIndexer( iDir );
4357 li.SetIJK( _i,_j,_k );
4358 size_t lineIndex[4] = { li.LineIndex (),
4362 bool allLinksOut = true, hasLinks = false;
4363 for ( int iL = 0; iL < 4 && allLinksOut; ++iL ) // loop on 4 links parallel to iDir
4365 const _Link& link = _hexLinks[ iL + 4*iDir ];
4366 // check transition of the first node of a link
4367 const F_IntersectPoint* firstIntPnt = 0;
4368 if ( link._nodes[0]->Node() ) // 1st node is a hexa corner
4370 curIntPnt._paramOnLine = coords[ ijk[ iDir ]] - coords[0] + _grid->_tol;
4371 const GridLine& line = _grid->_lines[ iDir ][ lineIndex[ iL ]];
4372 multiset< F_IntersectPoint >::const_iterator ip =
4373 line._intPoints.upper_bound( curIntPnt );
4375 firstIntPnt = &(*ip);
4377 else if ( !link._fIntPoints.empty() )
4379 firstIntPnt = link._fIntPoints[0];
4385 allLinksOut = ( firstIntPnt->_transition == Trans_OUT &&
4386 !_grid->IsShared( firstIntPnt->_faceIDs[0] ));
4389 if ( hasLinks && allLinksOut )
4395 //================================================================================
4397 * \brief Check if a polyherdon has an edge lying on EDGE shared by strange FACE
4398 * that will be meshed by other algo
4400 bool Hexahedron::hasStrangeEdge() const
4402 if ( _eIntPoints.size() < 2 )
4405 TopTools_MapOfShape edges;
4406 for ( size_t i = 0; i < _eIntPoints.size(); ++i )
4408 if ( !_grid->IsStrangeEdge( _eIntPoints[i]->_shapeID ))
4410 const TopoDS_Shape& s = _grid->Shape( _eIntPoints[i]->_shapeID );
4411 if ( s.ShapeType() == TopAbs_EDGE )
4413 if ( ! edges.Add( s ))
4414 return true; // an EDGE encounters twice
4418 PShapeIteratorPtr edgeIt = _grid->_helper->GetAncestors( s,
4419 *_grid->_helper->GetMesh(),
4421 while ( const TopoDS_Shape* edge = edgeIt->next() )
4422 if ( ! edges.Add( *edge ))
4423 return true; // an EDGE encounters twice
4429 //================================================================================
4431 * \brief Return true if a polyhedron passes _sizeThreshold criterion
4433 bool Hexahedron::checkPolyhedronSize( bool cutByInternalFace ) const
4435 if ( cutByInternalFace && !_grid->_toUseThresholdForInternalFaces )
4437 // check if any polygon fully lies on shared/internal FACEs
4438 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4440 const _Face& polygon = _polygons[iP];
4441 if ( polygon._links.empty() )
4443 bool allNodesInternal = true;
4444 for ( size_t iL = 0; iL < polygon._links.size() && allNodesInternal; ++iL )
4446 _Node* n = polygon._links[ iL ].FirstNode();
4447 allNodesInternal = (( n->IsCutByInternal() ) ||
4448 ( n->_intPoint && _grid->IsAnyShared( n->_intPoint->_faceIDs )));
4450 if ( allNodesInternal )
4454 if ( this->hasStrangeEdge() )
4458 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4460 const _Face& polygon = _polygons[iP];
4461 if ( polygon._links.empty() )
4463 gp_XYZ area (0,0,0);
4464 gp_XYZ p1 = polygon._links[ 0 ].FirstNode()->Point().XYZ();
4465 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
4467 gp_XYZ p2 = polygon._links[ iL ].LastNode()->Point().XYZ();
4471 volume += p1 * area;
4475 double initVolume = _sideLength[0] * _sideLength[1] * _sideLength[2];
4477 return volume > initVolume / _grid->_sizeThreshold;
4479 //================================================================================
4481 * \brief Tries to create a hexahedron
4483 bool Hexahedron::addHexa()
4485 int nbQuad = 0, iQuad = -1;
4486 for ( size_t i = 0; i < _polygons.size(); ++i )
4488 if ( _polygons[i]._links.empty() )
4490 if ( _polygons[i]._links.size() != 4 )
4501 for ( int iL = 0; iL < 4; ++iL )
4504 nodes[iL] = _polygons[iQuad]._links[iL].FirstNode();
4507 // find a top node above the base node
4508 _Link* link = _polygons[iQuad]._links[iL]._link;
4509 if ( !link->_faces[0] || !link->_faces[1] )
4510 return debugDumpLink( link );
4511 // a quadrangle sharing <link> with _polygons[iQuad]
4512 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[iQuad] )];
4513 for ( int i = 0; i < 4; ++i )
4514 if ( quad->_links[i]._link == link )
4516 // 1st node of a link opposite to <link> in <quad>
4517 nodes[iL+4] = quad->_links[(i+2)%4].FirstNode();
4523 _volumeDefs.Set( &nodes[0], 8 );
4527 //================================================================================
4529 * \brief Tries to create a tetrahedron
4531 bool Hexahedron::addTetra()
4534 for ( size_t i = 0; i < _polygons.size() && iTria < 0; ++i )
4535 if ( _polygons[i]._links.size() == 3 )
4541 nodes[0] = _polygons[iTria]._links[0].FirstNode();
4542 nodes[1] = _polygons[iTria]._links[1].FirstNode();
4543 nodes[2] = _polygons[iTria]._links[2].FirstNode();
4545 _Link* link = _polygons[iTria]._links[0]._link;
4546 if ( !link->_faces[0] || !link->_faces[1] )
4547 return debugDumpLink( link );
4549 // a triangle sharing <link> with _polygons[0]
4550 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[iTria] )];
4551 for ( int i = 0; i < 3; ++i )
4552 if ( tria->_links[i]._link == link )
4554 nodes[3] = tria->_links[(i+1)%3].LastNode();
4555 _volumeDefs.Set( &nodes[0], 4 );
4561 //================================================================================
4563 * \brief Tries to create a pentahedron
4565 bool Hexahedron::addPenta()
4567 // find a base triangular face
4569 for ( int iF = 0; iF < 5 && iTri < 0; ++iF )
4570 if ( _polygons[ iF ]._links.size() == 3 )
4572 if ( iTri < 0 ) return false;
4577 for ( int iL = 0; iL < 3; ++iL )
4580 nodes[iL] = _polygons[ iTri ]._links[iL].FirstNode();
4583 // find a top node above the base node
4584 _Link* link = _polygons[ iTri ]._links[iL]._link;
4585 if ( !link->_faces[0] || !link->_faces[1] )
4586 return debugDumpLink( link );
4587 // a quadrangle sharing <link> with a base triangle
4588 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[ iTri ] )];
4589 if ( quad->_links.size() != 4 ) return false;
4590 for ( int i = 0; i < 4; ++i )
4591 if ( quad->_links[i]._link == link )
4593 // 1st node of a link opposite to <link> in <quad>
4594 nodes[iL+3] = quad->_links[(i+2)%4].FirstNode();
4600 _volumeDefs.Set( &nodes[0], 6 );
4602 return ( nbN == 6 );
4604 //================================================================================
4606 * \brief Tries to create a pyramid
4608 bool Hexahedron::addPyra()
4610 // find a base quadrangle
4612 for ( int iF = 0; iF < 5 && iQuad < 0; ++iF )
4613 if ( _polygons[ iF ]._links.size() == 4 )
4615 if ( iQuad < 0 ) return false;
4619 nodes[0] = _polygons[iQuad]._links[0].FirstNode();
4620 nodes[1] = _polygons[iQuad]._links[1].FirstNode();
4621 nodes[2] = _polygons[iQuad]._links[2].FirstNode();
4622 nodes[3] = _polygons[iQuad]._links[3].FirstNode();
4624 _Link* link = _polygons[iQuad]._links[0]._link;
4625 if ( !link->_faces[0] || !link->_faces[1] )
4626 return debugDumpLink( link );
4628 // a triangle sharing <link> with a base quadrangle
4629 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[ iQuad ] )];
4630 if ( tria->_links.size() != 3 ) return false;
4631 for ( int i = 0; i < 3; ++i )
4632 if ( tria->_links[i]._link == link )
4634 nodes[4] = tria->_links[(i+1)%3].LastNode();
4635 _volumeDefs.Set( &nodes[0], 5 );
4641 //================================================================================
4643 * \brief Dump a link and return \c false
4645 bool Hexahedron::debugDumpLink( Hexahedron::_Link* link )
4648 gp_Pnt p1 = link->_nodes[0]->Point(), p2 = link->_nodes[1]->Point();
4649 cout << "BUG: not shared link. IKJ = ( "<< _i << " " << _j << " " << _k << " )" << endl
4650 << "n1 (" << p1.X() << ", "<< p1.Y() << ", "<< p1.Z() << " )" << endl
4651 << "n2 (" << p2.X() << ", "<< p2.Y() << ", "<< p2.Z() << " )" << endl;
4655 //================================================================================
4657 * \brief Classify a point by grid parameters
4659 bool Hexahedron::isOutParam(const double uvw[3]) const
4661 return (( _grid->_coords[0][ _i ] - _grid->_tol > uvw[0] ) ||
4662 ( _grid->_coords[0][ _i+1 ] + _grid->_tol < uvw[0] ) ||
4663 ( _grid->_coords[1][ _j ] - _grid->_tol > uvw[1] ) ||
4664 ( _grid->_coords[1][ _j+1 ] + _grid->_tol < uvw[1] ) ||
4665 ( _grid->_coords[2][ _k ] - _grid->_tol > uvw[2] ) ||
4666 ( _grid->_coords[2][ _k+1 ] + _grid->_tol < uvw[2] ));
4668 //================================================================================
4670 * \brief Divide a polygon into triangles and modify accordingly an adjacent polyhedron
4672 void splitPolygon( const SMDS_MeshElement* polygon,
4673 SMDS_VolumeTool & volume,
4674 const int facetIndex,
4675 const TGeomID faceID,
4676 const TGeomID solidID,
4677 SMESH_MeshEditor::ElemFeatures& face,
4678 SMESH_MeshEditor& editor,
4679 const bool reinitVolume)
4681 SMESH_MeshAlgos::Triangulate divider(/*optimize=*/false);
4682 int nbTrias = divider.GetTriangles( polygon, face.myNodes );
4683 face.myNodes.resize( nbTrias * 3 );
4685 SMESH_MeshEditor::ElemFeatures newVolumeDef;
4686 newVolumeDef.Init( volume.Element() );
4687 newVolumeDef.SetID( volume.Element()->GetID() );
4689 newVolumeDef.myPolyhedQuantities.reserve( volume.NbFaces() + nbTrias );
4690 newVolumeDef.myNodes.reserve( volume.NbNodes() + nbTrias * 3 );
4692 SMESHDS_Mesh* meshDS = editor.GetMeshDS();
4693 SMDS_MeshElement* newTriangle;
4694 for ( int iF = 0, nF = volume.NbFaces(); iF < nF; iF++ )
4696 if ( iF == facetIndex )
4698 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4699 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4700 face.myNodes.begin(),
4701 face.myNodes.begin() + 3 );
4702 meshDS->RemoveFreeElement( polygon, 0, false );
4703 newTriangle = meshDS->AddFace( face.myNodes[0], face.myNodes[1], face.myNodes[2] );
4704 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4708 const SMDS_MeshNode** nn = volume.GetFaceNodes( iF );
4709 const size_t nbFaceNodes = volume.NbFaceNodes ( iF );
4710 newVolumeDef.myPolyhedQuantities.push_back( nbFaceNodes );
4711 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(), nn, nn + nbFaceNodes );
4715 for ( size_t iN = 3; iN < face.myNodes.size(); iN += 3 )
4717 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4718 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4719 face.myNodes.begin() + iN,
4720 face.myNodes.begin() + iN + 3 );
4721 newTriangle = meshDS->AddFace( face.myNodes[iN], face.myNodes[iN+1], face.myNodes[iN+2] );
4722 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4725 meshDS->RemoveFreeElement( volume.Element(), 0, false );
4726 SMDS_MeshElement* newVolume = editor.AddElement( newVolumeDef.myNodes, newVolumeDef );
4727 meshDS->SetMeshElementOnShape( newVolume, solidID );
4732 volume.Set( newVolume );
4736 //================================================================================
4738 * \brief Create mesh faces at free facets
4740 void Hexahedron::addFaces( SMESH_MesherHelper& helper,
4741 const vector< const SMDS_MeshElement* > & boundaryVolumes )
4743 if ( !_grid->_toCreateFaces )
4746 SMDS_VolumeTool vTool;
4747 vector<int> bndFacets;
4748 SMESH_MeshEditor editor( helper.GetMesh() );
4749 SMESH_MeshEditor::ElemFeatures face( SMDSAbs_Face );
4750 SMESHDS_Mesh* meshDS = helper.GetMeshDS();
4752 // check if there are internal or shared FACEs
4753 bool hasInternal = ( !_grid->_geometry.IsOneSolid() ||
4754 _grid->_geometry._soleSolid.HasInternalFaces() );
4756 for ( size_t iV = 0; iV < boundaryVolumes.size(); ++iV )
4758 if ( !vTool.Set( boundaryVolumes[ iV ]))
4761 TGeomID solidID = vTool.Element()->GetShapeID();
4762 Solid * solid = _grid->GetOneOfSolids( solidID );
4764 // find boundary facets
4767 for ( int iF = 0, n = vTool.NbFaces(); iF < n; iF++ )
4769 bool isBoundary = vTool.IsFreeFace( iF );
4772 bndFacets.push_back( iF );
4774 else if ( hasInternal )
4776 // check if all nodes are on internal/shared FACEs
4778 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iF );
4779 const size_t nbFaceNodes = vTool.NbFaceNodes ( iF );
4780 for ( size_t iN = 0; iN < nbFaceNodes && isBoundary; ++iN )
4781 isBoundary = ( nn[ iN ]->GetShapeID() != solidID );
4783 bndFacets.push_back( -( iF+1 )); // !!! minus ==> to check the FACE
4786 if ( bndFacets.empty() )
4791 if ( !vTool.IsPoly() )
4792 vTool.SetExternalNormal();
4793 for ( size_t i = 0; i < bndFacets.size(); ++i ) // loop on boundary facets
4795 const bool isBoundary = ( bndFacets[i] >= 0 );
4796 const int iFacet = isBoundary ? bndFacets[i] : -bndFacets[i]-1;
4797 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iFacet );
4798 const size_t nbFaceNodes = vTool.NbFaceNodes ( iFacet );
4799 face.myNodes.assign( nn, nn + nbFaceNodes );
4802 const SMDS_MeshElement* existFace = 0, *newFace = 0;
4804 if (( existFace = meshDS->FindElement( face.myNodes, SMDSAbs_Face )))
4806 if ( existFace->isMarked() )
4807 continue; // created by this method
4808 faceID = existFace->GetShapeID();
4812 // look for a supporting FACE
4813 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN ) // look for a node on FACE
4815 if ( nn[ iN ]->GetPosition()->GetDim() == 2 )
4816 faceID = nn[ iN ]->GetShapeID();
4818 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN )
4820 // look for a father FACE of EDGEs and VERTEXes
4821 const TopoDS_Shape& s1 = _grid->Shape( nn[ iN ]->GetShapeID() );
4822 const TopoDS_Shape& s2 = _grid->Shape( nn[ iN+1 ]->GetShapeID() );
4823 if ( s1 != s2 && s1.ShapeType() == TopAbs_EDGE && s2.ShapeType() == TopAbs_EDGE )
4825 TopoDS_Shape f = helper.GetCommonAncestor( s1, s2, *helper.GetMesh(), TopAbs_FACE );
4827 faceID = _grid->ShapeID( f );
4831 bool toCheckFace = faceID && (( !isBoundary ) ||
4832 ( hasInternal && _grid->_toUseThresholdForInternalFaces ));
4833 if ( toCheckFace ) // check if all nodes are on the found FACE
4835 SMESH_subMesh* faceSM = helper.GetMesh()->GetSubMeshContaining( faceID );
4836 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4838 TGeomID subID = nn[ iN ]->GetShapeID();
4839 if ( subID != faceID && !faceSM->DependsOn( subID ))
4842 if ( !faceID && !isBoundary )
4846 // orient a new face according to supporting FACE orientation in shape_to_mesh
4847 if ( !solid->IsOutsideOriented( faceID ))
4850 editor.Reorient( existFace );
4852 std::reverse( face.myNodes.begin(), face.myNodes.end() );
4855 if ( ! ( newFace = existFace ))
4857 face.SetPoly( nbFaceNodes > 4 );
4858 newFace = editor.AddElement( face.myNodes, face );
4861 newFace->setIsMarked( true ); // to distinguish from face created in getBoundaryElems()
4864 if ( faceID && _grid->IsBoundaryFace( faceID )) // face is not shared
4866 // set newFace to the found FACE provided that it fully lies on the FACE
4867 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4868 if ( nn[iN]->GetShapeID() == solidID )
4871 meshDS->UnSetMeshElementOnShape( existFace, _grid->Shape( faceID ));
4876 // split a polygon that will be used by other 3D algorithm
4877 if ( faceID && nbFaceNodes > 4 &&
4878 !_grid->IsInternal( faceID ) &&
4879 !_grid->IsShared( faceID ) &&
4880 !_grid->IsBoundaryFace( faceID ))
4882 splitPolygon( newFace, vTool, iFacet, faceID, solidID,
4883 face, editor, i+1 < bndFacets.size() );
4888 meshDS->SetMeshElementOnShape( newFace, faceID );
4890 meshDS->SetMeshElementOnShape( newFace, solidID );
4892 } // loop on bndFacets
4893 } // loop on boundaryVolumes
4896 // Orient coherently mesh faces on INTERNAL FACEs
4900 TopExp_Explorer faceExp( _grid->_geometry._mainShape, TopAbs_FACE );
4901 for ( ; faceExp.More(); faceExp.Next() )
4903 if ( faceExp.Current().Orientation() != TopAbs_INTERNAL )
4906 SMESHDS_SubMesh* sm = meshDS->MeshElements( faceExp.Current() );
4907 if ( !sm ) continue;
4909 TIDSortedElemSet facesToOrient;
4910 for ( SMDS_ElemIteratorPtr fIt = sm->GetElements(); fIt->more(); )
4911 facesToOrient.insert( facesToOrient.end(), fIt->next() );
4912 if ( facesToOrient.size() < 2 )
4915 gp_Dir direction(1,0,0);
4916 const SMDS_MeshElement* anyFace = *facesToOrient.begin();
4917 editor.Reorient2D( facesToOrient, direction, anyFace );
4923 //================================================================================
4925 * \brief Create mesh segments.
4927 void Hexahedron::addSegments( SMESH_MesherHelper& helper,
4928 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap )
4930 SMESHDS_Mesh* mesh = helper.GetMeshDS();
4932 std::vector<const SMDS_MeshNode*> nodes;
4933 std::vector<const SMDS_MeshElement *> elems;
4934 map< TGeomID, vector< TGeomID > >::const_iterator e2ff = edge2faceIDsMap.begin();
4935 for ( ; e2ff != edge2faceIDsMap.end(); ++e2ff )
4937 const TopoDS_Edge& edge = TopoDS::Edge( _grid->Shape( e2ff->first ));
4938 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( e2ff->second[0] ));
4939 StdMeshers_FaceSide side( face, edge, helper.GetMesh(), /*isFwd=*/true, /*skipMed=*/true );
4940 nodes = side.GetOrderedNodes();
4943 if ( nodes.size() == 2 )
4944 // check that there is an element connecting two nodes
4945 if ( !mesh->GetElementsByNodes( nodes, elems ))
4948 for ( size_t i = 1; i < nodes.size(); i++ )
4950 SMDS_MeshElement* segment = mesh->AddEdge( nodes[i-1], nodes[i] );
4951 mesh->SetMeshElementOnShape( segment, e2ff->first );
4957 //================================================================================
4959 * \brief Return created volumes and volumes that can have free facet because of
4960 * skipped small volume. Also create mesh faces on free facets
4961 * of adjacent not-cut volumes id the result volume is too small.
4963 void Hexahedron::getBoundaryElems( vector< const SMDS_MeshElement* > & boundaryElems )
4965 if ( _hasTooSmall /*|| _volumeDefs.IsEmpty()*/ )
4967 // create faces around a missing small volume
4969 SMESH_MeshEditor editor( _grid->_helper->GetMesh() );
4970 SMESH_MeshEditor::ElemFeatures polygon( SMDSAbs_Face );
4971 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
4972 std::vector<const SMDS_MeshElement *> adjVolumes(2);
4973 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
4975 const size_t nbLinks = _polygons[ iF ]._links.size();
4976 if ( nbLinks != 4 ) continue;
4977 polygon.myNodes.resize( nbLinks );
4978 polygon.myNodes.back() = 0;
4979 for ( size_t iL = 0, iN = nbLinks - 1; iL < nbLinks; ++iL, --iN )
4980 if ( ! ( polygon.myNodes[iN] = _polygons[ iF ]._links[ iL ].FirstNode()->Node() ))
4982 if ( !polygon.myNodes.back() )
4985 meshDS->GetElementsByNodes( polygon.myNodes, adjVolumes, SMDSAbs_Volume );
4986 if ( adjVolumes.size() != 1 )
4988 if ( !adjVolumes[0]->isMarked() )
4990 boundaryElems.push_back( adjVolumes[0] );
4991 adjVolumes[0]->setIsMarked( true );
4994 bool sameShape = true;
4995 TGeomID shapeID = polygon.myNodes[0]->GetShapeID();
4996 for ( size_t i = 1; i < polygon.myNodes.size() && sameShape; ++i )
4997 sameShape = ( shapeID == polygon.myNodes[i]->GetShapeID() );
4999 if ( !sameShape || !_grid->IsSolid( shapeID ))
5000 continue; // some of shapes must be FACE
5004 faceID = getAnyFace();
5007 if ( _grid->IsInternal( faceID ) ||
5008 _grid->IsShared( faceID ) ||
5009 _grid->IsBoundaryFace( faceID ))
5010 break; // create only if a new face will be used by other 3D algo
5013 Solid * solid = _grid->GetOneOfSolids( adjVolumes[0]->GetShapeID() );
5014 if ( !solid->IsOutsideOriented( faceID ))
5015 std::reverse( polygon.myNodes.begin(), polygon.myNodes.end() );
5017 //polygon.SetPoly( polygon.myNodes.size() > 4 );
5018 const SMDS_MeshElement* newFace = editor.AddElement( polygon.myNodes, polygon );
5019 meshDS->SetMeshElementOnShape( newFace, faceID );
5023 // return created volumes
5024 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
5026 if ( volDef->_volume && !volDef->_volume->isMarked() )
5028 volDef->_volume->setIsMarked( true );
5029 boundaryElems.push_back( volDef->_volume );
5031 if ( _grid->IsToCheckNodePos() ) // un-mark nodes marked in addVolumes()
5032 for ( size_t iN = 0; iN < volDef->_nodes.size(); ++iN )
5033 volDef->_nodes[iN].Node()->setIsMarked( false );
5038 //================================================================================
5040 * \brief Set to _hexLinks a next portion of splits located on one side of INTERNAL FACEs
5042 bool Hexahedron::_SplitIterator::Next()
5044 if ( _iterationNb > 0 )
5045 // count used splits
5046 for ( size_t i = 0; i < _splits.size(); ++i )
5048 if ( _splits[i]._iCheckIteration == _iterationNb )
5050 _splits[i]._isUsed = _splits[i]._checkedSplit->_faces[1];
5051 _nbUsed += _splits[i]._isUsed;
5059 bool toTestUsed = ( _nbChecked >= _splits.size() );
5062 // all splits are checked; find all not used splits
5063 for ( size_t i = 0; i < _splits.size(); ++i )
5064 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5065 _splits[i]._iCheckIteration = _iterationNb;
5067 _nbUsed = _splits.size(); // to stop iteration
5071 // get any not used/checked split to start from
5073 for ( size_t i = 0; i < _splits.size(); ++i )
5075 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5077 _freeNodes.push_back( _splits[i]._nodes[0] );
5078 _freeNodes.push_back( _splits[i]._nodes[1] );
5079 _splits[i]._iCheckIteration = _iterationNb;
5083 // find splits connected to the start one via _freeNodes
5084 for ( size_t iN = 0; iN < _freeNodes.size(); ++iN )
5086 for ( size_t iS = 0; iS < _splits.size(); ++iS )
5088 if ( _splits[iS].IsCheckedOrUsed( toTestUsed ))
5091 if ( _freeNodes[iN] == _splits[iS]._nodes[0] )
5093 else if ( _freeNodes[iN] == _splits[iS]._nodes[1] )
5097 if ( _freeNodes[iN]->_isInternalFlags > 0 )
5099 if ( _splits[iS]._nodes[ iN2 ]->_isInternalFlags == 0 )
5101 if ( !_splits[iS]._nodes[ iN2 ]->IsLinked( _freeNodes[iN]->_intPoint ))
5104 _splits[iS]._iCheckIteration = _iterationNb;
5105 _freeNodes.push_back( _splits[iS]._nodes[ iN2 ]);
5109 // set splits to hex links
5111 for ( int iL = 0; iL < 12; ++iL )
5112 _hexLinks[ iL ]._splits.clear();
5115 for ( size_t i = 0; i < _splits.size(); ++i )
5117 if ( _splits[i]._iCheckIteration == _iterationNb )
5119 split._nodes[0] = _splits[i]._nodes[0];
5120 split._nodes[1] = _splits[i]._nodes[1];
5121 _Link & hexLink = _hexLinks[ _splits[i]._linkID ];
5122 hexLink._splits.push_back( split );
5123 _splits[i]._checkedSplit = & hexLink._splits.back();
5130 //================================================================================
5132 * \brief computes exact bounding box with axes parallel to given ones
5134 //================================================================================
5136 void getExactBndBox( const vector< TopoDS_Shape >& faceVec,
5137 const double* axesDirs,
5141 TopoDS_Compound allFacesComp;
5142 b.MakeCompound( allFacesComp );
5143 for ( size_t iF = 0; iF < faceVec.size(); ++iF )
5144 b.Add( allFacesComp, faceVec[ iF ] );
5146 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
5147 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
5149 for ( int i = 0; i < 6; ++i )
5150 farDist = Max( farDist, 10 * sP[i] );
5152 gp_XYZ axis[3] = { gp_XYZ( axesDirs[0], axesDirs[1], axesDirs[2] ),
5153 gp_XYZ( axesDirs[3], axesDirs[4], axesDirs[5] ),
5154 gp_XYZ( axesDirs[6], axesDirs[7], axesDirs[8] ) };
5155 axis[0].Normalize();
5156 axis[1].Normalize();
5157 axis[2].Normalize();
5159 gp_Mat basis( axis[0], axis[1], axis[2] );
5160 gp_Mat bi = basis.Inverted();
5163 for ( int iDir = 0; iDir < 3; ++iDir )
5165 gp_XYZ axis0 = axis[ iDir ];
5166 gp_XYZ axis1 = axis[ ( iDir + 1 ) % 3 ];
5167 gp_XYZ axis2 = axis[ ( iDir + 2 ) % 3 ];
5168 for ( int isMax = 0; isMax < 2; ++isMax )
5170 double shift = isMax ? farDist : -farDist;
5171 gp_XYZ orig = shift * axis0;
5172 gp_XYZ norm = axis1 ^ axis2;
5173 gp_Pln pln( orig, norm );
5174 norm = pln.Axis().Direction().XYZ();
5175 BRepBuilderAPI_MakeFace plane( pln, -farDist, farDist, -farDist, farDist );
5177 gp_Pnt& pAxis = isMax ? pMax : pMin;
5178 gp_Pnt pPlane, pFaces;
5179 double dist = GEOMUtils::GetMinDistance( plane, allFacesComp, pPlane, pFaces );
5184 for ( int i = 0; i < 2; ++i ) {
5185 corner.SetCoord( 1, sP[ i*3 ]);
5186 for ( int j = 0; j < 2; ++j ) {
5187 corner.SetCoord( 2, sP[ i*3 + 1 ]);
5188 for ( int k = 0; k < 2; ++k )
5190 corner.SetCoord( 3, sP[ i*3 + 2 ]);
5196 corner = isMax ? bb.CornerMax() : bb.CornerMin();
5197 pAxis.SetCoord( iDir+1, corner.Coord( iDir+1 ));
5201 gp_XYZ pf = pFaces.XYZ() * bi;
5202 pAxis.SetCoord( iDir+1, pf.Coord( iDir+1 ) );
5208 shapeBox.Add( pMin );
5209 shapeBox.Add( pMax );
5216 //=============================================================================
5218 * \brief Generates 3D structured Cartesian mesh in the internal part of
5219 * solid shapes and polyhedral volumes near the shape boundary.
5220 * \param theMesh - mesh to fill in
5221 * \param theShape - a compound of all SOLIDs to mesh
5222 * \retval bool - true in case of success
5224 //=============================================================================
5226 bool StdMeshers_Cartesian_3D::Compute(SMESH_Mesh & theMesh,
5227 const TopoDS_Shape & theShape)
5229 // The algorithm generates the mesh in following steps:
5231 // 1) Intersection of grid lines with the geometry boundary.
5232 // This step allows to find out if a given node of the initial grid is
5233 // inside or outside the geometry.
5235 // 2) For each cell of the grid, check how many of it's nodes are outside
5236 // of the geometry boundary. Depending on a result of this check
5237 // - skip a cell, if all it's nodes are outside
5238 // - skip a cell, if it is too small according to the size threshold
5239 // - add a hexahedron in the mesh, if all nodes are inside
5240 // - add a polyhedron in the mesh, if some nodes are inside and some outside
5242 _computeCanceled = false;
5244 SMESH_MesherHelper helper( theMesh );
5245 SMESHDS_Mesh* meshDS = theMesh.GetMeshDS();
5250 grid._helper = &helper;
5251 grid._toAddEdges = _hyp->GetToAddEdges();
5252 grid._toCreateFaces = _hyp->GetToCreateFaces();
5253 grid._toConsiderInternalFaces = _hyp->GetToConsiderInternalFaces();
5254 grid._toUseThresholdForInternalFaces = _hyp->GetToUseThresholdForInternalFaces();
5255 grid._sizeThreshold = _hyp->GetSizeThreshold();
5256 grid.InitGeometry( theShape );
5258 vector< TopoDS_Shape > faceVec;
5260 TopTools_MapOfShape faceMap;
5261 TopExp_Explorer fExp;
5262 for ( fExp.Init( theShape, TopAbs_FACE ); fExp.More(); fExp.Next() )
5264 bool isNewFace = faceMap.Add( fExp.Current() );
5265 if ( !grid._toConsiderInternalFaces )
5266 if ( !isNewFace || fExp.Current().Orientation() == TopAbs_INTERNAL )
5267 // remove an internal face
5268 faceMap.Remove( fExp.Current() );
5270 faceVec.reserve( faceMap.Extent() );
5271 faceVec.assign( faceMap.cbegin(), faceMap.cend() );
5273 vector<FaceGridIntersector> facesItersectors( faceVec.size() );
5275 for ( size_t i = 0; i < faceVec.size(); ++i )
5277 facesItersectors[i]._face = TopoDS::Face( faceVec[i] );
5278 facesItersectors[i]._faceID = grid.ShapeID( faceVec[i] );
5279 facesItersectors[i]._grid = &grid;
5280 shapeBox.Add( facesItersectors[i].GetFaceBndBox() );
5282 getExactBndBox( faceVec, _hyp->GetAxisDirs(), shapeBox );
5285 vector<double> xCoords, yCoords, zCoords;
5286 _hyp->GetCoordinates( xCoords, yCoords, zCoords, shapeBox );
5288 grid.SetCoordinates( xCoords, yCoords, zCoords, _hyp->GetAxisDirs(), shapeBox );
5290 if ( _computeCanceled ) return false;
5293 { // copy partner faces and curves of not thread-safe types
5294 set< const Standard_Transient* > tshapes;
5295 BRepBuilderAPI_Copy copier;
5296 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5298 if ( !facesItersectors[i].IsThreadSafe( tshapes ))
5300 copier.Perform( facesItersectors[i]._face );
5301 facesItersectors[i]._face = TopoDS::Face( copier );
5305 // Intersection of grid lines with the geometry boundary.
5306 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, facesItersectors.size() ),
5307 ParallelIntersector( facesItersectors ),
5308 tbb::simple_partitioner());
5310 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5311 facesItersectors[i].Intersect();
5314 // put intersection points onto the GridLine's; this is done after intersection
5315 // to avoid contention of facesItersectors for writing into the same GridLine
5316 // in case of parallel work of facesItersectors
5317 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5318 facesItersectors[i].StoreIntersections();
5320 if ( _computeCanceled ) return false;
5322 // create nodes on the geometry
5323 grid.ComputeNodes( helper );
5325 if ( _computeCanceled ) return false;
5327 // get EDGEs to take into account
5328 map< TGeomID, vector< TGeomID > > edge2faceIDsMap;
5329 grid.GetEdgesToImplement( edge2faceIDsMap, theShape, faceVec );
5331 // create volume elements
5332 Hexahedron hex( &grid );
5333 int nbAdded = hex.MakeElements( helper, edge2faceIDsMap );
5337 if ( !grid._toConsiderInternalFaces )
5339 // make all SOLIDs computed
5340 TopExp_Explorer solidExp( theShape, TopAbs_SOLID );
5341 if ( SMESHDS_SubMesh* sm1 = meshDS->MeshElements( solidExp.Current()) )
5343 SMDS_ElemIteratorPtr volIt = sm1->GetElements();
5344 for ( ; solidExp.More() && volIt->more(); solidExp.Next() )
5346 const SMDS_MeshElement* vol = volIt->next();
5347 sm1->RemoveElement( vol );
5348 meshDS->SetMeshElementOnShape( vol, solidExp.Current() );
5352 // make other sub-shapes computed
5353 setSubmeshesComputed( theMesh, theShape );
5356 // remove free nodes
5357 //if ( SMESHDS_SubMesh * smDS = meshDS->MeshElements( helper.GetSubShapeID() ))
5359 std::vector< const SMDS_MeshNode* > nodesToRemove;
5360 // get intersection nodes
5361 for ( int iDir = 0; iDir < 3; ++iDir )
5363 vector< GridLine >& lines = grid._lines[ iDir ];
5364 for ( size_t i = 0; i < lines.size(); ++i )
5366 multiset< F_IntersectPoint >::iterator ip = lines[i]._intPoints.begin();
5367 for ( ; ip != lines[i]._intPoints.end(); ++ip )
5368 if ( ip->_node && ip->_node->NbInverseElements() == 0 && !ip->_node->isMarked() )
5370 nodesToRemove.push_back( ip->_node );
5371 ip->_node->setIsMarked( true );
5376 for ( size_t i = 0; i < grid._nodes.size(); ++i )
5377 if ( grid._nodes[i] && grid._nodes[i]->NbInverseElements() == 0 &&
5378 !grid._nodes[i]->isMarked() )
5380 nodesToRemove.push_back( grid._nodes[i] );
5381 grid._nodes[i]->setIsMarked( true );
5385 for ( size_t i = 0; i < nodesToRemove.size(); ++i )
5386 meshDS->RemoveFreeNode( nodesToRemove[i], /*smD=*/0, /*fromGroups=*/false );
5392 // SMESH_ComputeError is not caught at SMESH_submesh level for an unknown reason
5393 catch ( SMESH_ComputeError& e)
5395 return error( SMESH_ComputeErrorPtr( new SMESH_ComputeError( e )));
5400 //=============================================================================
5404 //=============================================================================
5406 bool StdMeshers_Cartesian_3D::Evaluate(SMESH_Mesh & theMesh,
5407 const TopoDS_Shape & theShape,
5408 MapShapeNbElems& theResMap)
5411 // std::vector<int> aResVec(SMDSEntity_Last);
5412 // for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
5413 // if(IsQuadratic) {
5414 // aResVec[SMDSEntity_Quad_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5415 // int nb1d_face0_int = ( nb2d_face0*4 - nb1d ) / 2;
5416 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
5419 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
5420 // aResVec[SMDSEntity_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5422 // SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
5423 // aResMap.insert(std::make_pair(sm,aResVec));
5428 //=============================================================================
5432 * \brief Event listener setting/unsetting _alwaysComputed flag to
5433 * submeshes of inferior levels to prevent their computing
5435 struct _EventListener : public SMESH_subMeshEventListener
5439 _EventListener(const string& algoName):
5440 SMESH_subMeshEventListener(/*isDeletable=*/true,"StdMeshers_Cartesian_3D::_EventListener"),
5443 // --------------------------------------------------------------------------------
5444 // setting/unsetting _alwaysComputed flag to submeshes of inferior levels
5446 static void setAlwaysComputed( const bool isComputed,
5447 SMESH_subMesh* subMeshOfSolid)
5449 SMESH_subMeshIteratorPtr smIt =
5450 subMeshOfSolid->getDependsOnIterator(/*includeSelf=*/false, /*complexShapeFirst=*/false);
5451 while ( smIt->more() )
5453 SMESH_subMesh* sm = smIt->next();
5454 sm->SetIsAlwaysComputed( isComputed );
5456 subMeshOfSolid->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
5459 // --------------------------------------------------------------------------------
5460 // unsetting _alwaysComputed flag if "Cartesian_3D" was removed
5462 virtual void ProcessEvent(const int event,
5463 const int eventType,
5464 SMESH_subMesh* subMeshOfSolid,
5465 SMESH_subMeshEventListenerData* data,
5466 const SMESH_Hypothesis* hyp = 0)
5468 if ( eventType == SMESH_subMesh::COMPUTE_EVENT )
5470 setAlwaysComputed( subMeshOfSolid->GetComputeState() == SMESH_subMesh::COMPUTE_OK,
5475 SMESH_Algo* algo3D = subMeshOfSolid->GetAlgo();
5476 if ( !algo3D || _algoName != algo3D->GetName() )
5477 setAlwaysComputed( false, subMeshOfSolid );
5481 // --------------------------------------------------------------------------------
5482 // set the event listener
5484 static void SetOn( SMESH_subMesh* subMeshOfSolid, const string& algoName )
5486 subMeshOfSolid->SetEventListener( new _EventListener( algoName ),
5491 }; // struct _EventListener
5495 //================================================================================
5497 * \brief Sets event listener to submeshes if necessary
5498 * \param subMesh - submesh where algo is set
5499 * This method is called when a submesh gets HYP_OK algo_state.
5500 * After being set, event listener is notified on each event of a submesh.
5502 //================================================================================
5504 void StdMeshers_Cartesian_3D::SetEventListener(SMESH_subMesh* subMesh)
5506 _EventListener::SetOn( subMesh, GetName() );
5509 //================================================================================
5511 * \brief Set _alwaysComputed flag to submeshes of inferior levels to avoid their computing
5513 //================================================================================
5515 void StdMeshers_Cartesian_3D::setSubmeshesComputed(SMESH_Mesh& theMesh,
5516 const TopoDS_Shape& theShape)
5518 for ( TopExp_Explorer soExp( theShape, TopAbs_SOLID ); soExp.More(); soExp.Next() )
5519 _EventListener::setAlwaysComputed( true, theMesh.GetSubMesh( soExp.Current() ));