1 // Copyright (C) 2007-2019 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // File : StdMeshers_Cartesian_3D.cxx
25 #include "StdMeshers_Cartesian_3D.hxx"
26 #include "StdMeshers_CartesianParameters3D.hxx"
28 #include "ObjectPool.hxx"
29 #include "SMDS_MeshNode.hxx"
30 #include "SMDS_VolumeTool.hxx"
31 #include "SMESHDS_Mesh.hxx"
32 #include "SMESH_Block.hxx"
33 #include "SMESH_Comment.hxx"
34 #include "SMESH_ControlsDef.hxx"
35 #include "SMESH_Mesh.hxx"
36 #include "SMESH_MeshAlgos.hxx"
37 #include "SMESH_MeshEditor.hxx"
38 #include "SMESH_MesherHelper.hxx"
39 #include "SMESH_subMesh.hxx"
40 #include "SMESH_subMeshEventListener.hxx"
41 #include "StdMeshers_FaceSide.hxx"
43 #include <utilities.h>
44 #include <Utils_ExceptHandlers.hxx>
46 #include <GEOMUtils.hxx>
48 #include <BRepAdaptor_Curve.hxx>
49 #include <BRepAdaptor_Surface.hxx>
50 #include <BRepBndLib.hxx>
51 #include <BRepBuilderAPI_Copy.hxx>
52 #include <BRepBuilderAPI_MakeFace.hxx>
53 #include <BRepTools.hxx>
54 #include <BRepTopAdaptor_FClass2d.hxx>
55 #include <BRep_Builder.hxx>
56 #include <BRep_Tool.hxx>
57 #include <Bnd_B3d.hxx>
58 #include <Bnd_Box.hxx>
60 #include <GCPnts_UniformDeflection.hxx>
61 #include <Geom2d_BSplineCurve.hxx>
62 #include <Geom2d_BezierCurve.hxx>
63 #include <Geom2d_TrimmedCurve.hxx>
64 #include <GeomAPI_ProjectPointOnSurf.hxx>
65 #include <GeomLib.hxx>
66 #include <Geom_BSplineCurve.hxx>
67 #include <Geom_BSplineSurface.hxx>
68 #include <Geom_BezierCurve.hxx>
69 #include <Geom_BezierSurface.hxx>
70 #include <Geom_RectangularTrimmedSurface.hxx>
71 #include <Geom_TrimmedCurve.hxx>
72 #include <IntAna_IntConicQuad.hxx>
73 #include <IntAna_IntLinTorus.hxx>
74 #include <IntAna_Quadric.hxx>
75 #include <IntCurveSurface_TransitionOnCurve.hxx>
76 #include <IntCurvesFace_Intersector.hxx>
77 #include <Poly_Triangulation.hxx>
78 #include <Precision.hxx>
80 #include <TopExp_Explorer.hxx>
81 #include <TopLoc_Location.hxx>
82 #include <TopTools_IndexedMapOfShape.hxx>
83 #include <TopTools_MapOfShape.hxx>
85 #include <TopoDS_Compound.hxx>
86 #include <TopoDS_Face.hxx>
87 #include <TopoDS_TShape.hxx>
88 #include <gp_Cone.hxx>
89 #include <gp_Cylinder.hxx>
92 #include <gp_Pnt2d.hxx>
93 #include <gp_Sphere.hxx>
94 #include <gp_Torus.hxx>
98 #include <boost/container/flat_map.hpp>
104 // See https://docs.microsoft.com/en-gb/cpp/porting/modifying-winver-and-win32-winnt?view=vs-2019
105 // Windows 10 = 0x0A00
106 #define WINVER 0x0A00
107 #define _WIN32_WINNT 0x0A00
110 #include <tbb/parallel_for.h>
111 //#include <tbb/enumerable_thread_specific.h>
115 using namespace SMESH;
121 //=============================================================================
125 //=============================================================================
127 StdMeshers_Cartesian_3D::StdMeshers_Cartesian_3D(int hypId, SMESH_Gen * gen)
128 :SMESH_3D_Algo(hypId, gen)
130 _name = "Cartesian_3D";
131 _shapeType = (1 << TopAbs_SOLID); // 1 bit /shape type
132 _compatibleHypothesis.push_back("CartesianParameters3D");
134 _onlyUnaryInput = false; // to mesh all SOLIDs at once
135 _requireDiscreteBoundary = false; // 2D mesh not needed
136 _supportSubmeshes = false; // do not use any existing mesh
139 //=============================================================================
141 * Check presence of a hypothesis
143 //=============================================================================
145 bool StdMeshers_Cartesian_3D::CheckHypothesis (SMESH_Mesh& aMesh,
146 const TopoDS_Shape& aShape,
147 Hypothesis_Status& aStatus)
149 aStatus = SMESH_Hypothesis::HYP_MISSING;
151 const list<const SMESHDS_Hypothesis*>& hyps = GetUsedHypothesis(aMesh, aShape);
152 list <const SMESHDS_Hypothesis* >::const_iterator h = hyps.begin();
153 if ( h == hyps.end())
158 for ( ; h != hyps.end(); ++h )
160 if (( _hyp = dynamic_cast<const StdMeshers_CartesianParameters3D*>( *h )))
162 aStatus = _hyp->IsDefined() ? HYP_OK : HYP_BAD_PARAMETER;
167 return aStatus == HYP_OK;
172 typedef int TGeomID; // IDs of sub-shapes
174 //=============================================================================
175 // Definitions of internal utils
176 // --------------------------------------------------------------------------
178 Trans_TANGENT = IntCurveSurface_Tangent,
179 Trans_IN = IntCurveSurface_In,
180 Trans_OUT = IntCurveSurface_Out,
182 Trans_INTERNAL // for INTERNAL FACE
184 // --------------------------------------------------------------------------
186 * \brief Container of IDs of SOLID sub-shapes
188 class Solid // sole SOLID contains all sub-shapes
190 TGeomID _id; // SOLID id
191 bool _hasInternalFaces;
194 virtual bool Contains( TGeomID subID ) const { return true; }
195 virtual bool ContainsAny( const vector< TGeomID>& subIDs ) const { return true; }
196 virtual TopAbs_Orientation Orientation( const TopoDS_Shape& s ) const { return s.Orientation(); }
197 virtual bool IsOutsideOriented( TGeomID faceID ) const { return true; }
198 void SetID( TGeomID id ) { _id = id; }
199 TGeomID ID() const { return _id; }
200 void SetHasInternalFaces( bool has ) { _hasInternalFaces = has; }
201 bool HasInternalFaces() const { return _hasInternalFaces; }
203 // --------------------------------------------------------------------------
204 class OneOfSolids : public Solid
206 TColStd_MapOfInteger _subIDs;
207 TopTools_MapOfShape _faces; // keep FACE orientation
208 TColStd_MapOfInteger _outFaceIDs; // FACEs of shape_to_mesh oriented outside the SOLID
210 void Init( const TopoDS_Shape& solid,
211 TopAbs_ShapeEnum subType,
212 const SMESHDS_Mesh* mesh );
213 virtual bool Contains( TGeomID i ) const { return i == ID() || _subIDs.Contains( i ); }
214 virtual bool ContainsAny( const vector< TGeomID>& subIDs ) const
216 for ( size_t i = 0; i < subIDs.size(); ++i ) if ( Contains( subIDs[ i ])) return true;
219 virtual TopAbs_Orientation Orientation( const TopoDS_Shape& face ) const
221 const TopoDS_Shape& sInMap = const_cast< OneOfSolids* >(this)->_faces.Added( face );
222 return sInMap.Orientation();
224 virtual bool IsOutsideOriented( TGeomID faceID ) const
226 return faceID == 0 || _outFaceIDs.Contains( faceID );
229 // --------------------------------------------------------------------------
235 TopoDS_Shape _mainShape;
236 vector< vector< TGeomID > > _solidIDsByShapeID;// V/E/F ID -> SOLID IDs
238 map< TGeomID, OneOfSolids > _solidByID;
239 TColStd_MapOfInteger _boundaryFaces; // FACEs on boundary of mesh->ShapeToMesh()
240 TColStd_MapOfInteger _strangeEdges; // EDGEs shared by strange FACEs
241 TGeomID _extIntFaceID; // pseudo FACE - extension of INTERNAL FACE
243 Controls::ElementsOnShape _edgeClassifier;
244 Controls::ElementsOnShape _vertexClassifier;
246 bool IsOneSolid() const { return _solidByID.size() < 2; }
248 // --------------------------------------------------------------------------
250 * \brief Common data of any intersection between a Grid and a shape
252 struct B_IntersectPoint
254 mutable const SMDS_MeshNode* _node;
255 mutable vector< TGeomID > _faceIDs;
257 B_IntersectPoint(): _node(NULL) {}
258 void Add( const vector< TGeomID >& fIDs, const SMDS_MeshNode* n=0 ) const;
259 int HasCommonFace( const B_IntersectPoint * other, int avoidFace=-1 ) const;
260 bool IsOnFace( int faceID ) const;
261 virtual ~B_IntersectPoint() {}
263 // --------------------------------------------------------------------------
265 * \brief Data of intersection between a GridLine and a TopoDS_Face
267 struct F_IntersectPoint : public B_IntersectPoint
271 mutable Transition _transition;
272 mutable size_t _indexOnLine;
274 bool operator< ( const F_IntersectPoint& o ) const { return _paramOnLine < o._paramOnLine; }
276 // --------------------------------------------------------------------------
278 * \brief Data of intersection between GridPlanes and a TopoDS_EDGE
280 struct E_IntersectPoint : public B_IntersectPoint
284 TGeomID _shapeID; // ID of EDGE or VERTEX
286 // --------------------------------------------------------------------------
288 * \brief A line of the grid and its intersections with 2D geometry
293 double _length; // line length
294 multiset< F_IntersectPoint > _intPoints;
296 void RemoveExcessIntPoints( const double tol );
297 TGeomID GetSolidIDBefore( multiset< F_IntersectPoint >::iterator ip,
298 const TGeomID prevID,
299 const Geometry& geom);
301 // --------------------------------------------------------------------------
303 * \brief Planes of the grid used to find intersections of an EDGE with a hexahedron
308 vector< gp_XYZ > _origins; // origin points of all planes in one direction
309 vector< double > _zProjs; // projections of origins to _zNorm
311 // --------------------------------------------------------------------------
313 * \brief Iterator on the parallel grid lines of one direction
319 size_t _iVar1, _iVar2, _iConst;
320 string _name1, _name2, _nameConst;
322 LineIndexer( size_t sz1, size_t sz2, size_t sz3,
323 size_t iv1, size_t iv2, size_t iConst,
324 const string& nv1, const string& nv2, const string& nConst )
326 _size[0] = sz1; _size[1] = sz2; _size[2] = sz3;
327 _curInd[0] = _curInd[1] = _curInd[2] = 0;
328 _iVar1 = iv1; _iVar2 = iv2; _iConst = iConst;
329 _name1 = nv1; _name2 = nv2; _nameConst = nConst;
332 size_t I() const { return _curInd[0]; }
333 size_t J() const { return _curInd[1]; }
334 size_t K() const { return _curInd[2]; }
335 void SetIJK( size_t i, size_t j, size_t k )
337 _curInd[0] = i; _curInd[1] = j; _curInd[2] = k;
341 if ( ++_curInd[_iVar1] == _size[_iVar1] )
342 _curInd[_iVar1] = 0, ++_curInd[_iVar2];
344 bool More() const { return _curInd[_iVar2] < _size[_iVar2]; }
345 size_t LineIndex () const { return _curInd[_iVar1] + _curInd[_iVar2]* _size[_iVar1]; }
346 size_t LineIndex10 () const { return (_curInd[_iVar1] + 1 ) + _curInd[_iVar2]* _size[_iVar1]; }
347 size_t LineIndex01 () const { return _curInd[_iVar1] + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
348 size_t LineIndex11 () const { return (_curInd[_iVar1] + 1 ) + (_curInd[_iVar2] + 1 )* _size[_iVar1]; }
349 void SetIndexOnLine (size_t i) { _curInd[ _iConst ] = i; }
350 size_t NbLines() const { return _size[_iVar1] * _size[_iVar2]; }
352 // --------------------------------------------------------------------------
354 * \brief Container of GridLine's
358 vector< double > _coords[3]; // coordinates of grid nodes
359 gp_XYZ _axes [3]; // axis directions
360 vector< GridLine > _lines [3]; // in 3 directions
361 double _tol, _minCellSize;
363 gp_Mat _invB; // inverted basis of _axes
365 vector< const SMDS_MeshNode* > _nodes; // mesh nodes at grid nodes
366 vector< const F_IntersectPoint* > _gridIntP; // grid node intersection with geometry
367 ObjectPool< E_IntersectPoint > _edgeIntPool; // intersections with EDGEs
368 ObjectPool< F_IntersectPoint > _extIntPool; // intersections with extended INTERNAL FACEs
369 //list< E_IntersectPoint > _edgeIntP; // intersections with EDGEs
374 bool _toConsiderInternalFaces;
375 bool _toUseThresholdForInternalFaces;
376 double _sizeThreshold;
378 vector< TGeomID > _shapeIDs; // returned by Hexahedron::getSolids()
379 SMESH_MesherHelper* _helper;
381 size_t CellIndex( size_t i, size_t j, size_t k ) const
383 return i + j*(_coords[0].size()-1) + k*(_coords[0].size()-1)*(_coords[1].size()-1);
385 size_t NodeIndex( size_t i, size_t j, size_t k ) const
387 return i + j*_coords[0].size() + k*_coords[0].size()*_coords[1].size();
389 size_t NodeIndexDX() const { return 1; }
390 size_t NodeIndexDY() const { return _coords[0].size(); }
391 size_t NodeIndexDZ() const { return _coords[0].size() * _coords[1].size(); }
393 LineIndexer GetLineIndexer(size_t iDir) const;
395 E_IntersectPoint* Add( const E_IntersectPoint& ip )
397 E_IntersectPoint* eip = _edgeIntPool.getNew();
401 void Remove( E_IntersectPoint* eip ) { _edgeIntPool.destroy( eip ); }
403 TGeomID ShapeID( const TopoDS_Shape& s ) const;
404 const TopoDS_Shape& Shape( TGeomID id ) const;
405 TopAbs_ShapeEnum ShapeType( TGeomID id ) const { return Shape(id).ShapeType(); }
406 void InitGeometry( const TopoDS_Shape& theShape );
407 void InitClassifier( const TopoDS_Shape& mainShape,
408 TopAbs_ShapeEnum shapeType,
409 Controls::ElementsOnShape& classifier );
410 void GetEdgesToImplement( map< TGeomID, vector< TGeomID > > & edge2faceMap,
411 const TopoDS_Shape& shape,
412 const vector< TopoDS_Shape >& faces );
413 void SetSolidFather( const TopoDS_Shape& s, const TopoDS_Shape& theShapeToMesh );
414 bool IsShared( TGeomID faceID ) const;
415 bool IsAnyShared( const std::vector< TGeomID >& faceIDs ) const;
416 bool IsInternal( TGeomID faceID ) const {
417 return ( faceID == PseudoIntExtFaceID() ||
418 Shape( faceID ).Orientation() == TopAbs_INTERNAL ); }
419 bool IsSolid( TGeomID shapeID ) const {
420 if ( _geometry.IsOneSolid() ) return _geometry._soleSolid.ID() == shapeID;
421 else return _geometry._solidByID.count( shapeID ); }
422 bool IsStrangeEdge( TGeomID id ) const { return _geometry._strangeEdges.Contains( id ); }
423 TGeomID PseudoIntExtFaceID() const { return _geometry._extIntFaceID; }
424 Solid* GetSolid( TGeomID solidID = 0 );
425 Solid* GetOneOfSolids( TGeomID solidID );
426 const vector< TGeomID > & GetSolidIDs( TGeomID subShapeID ) const;
427 bool IsCorrectTransition( TGeomID faceID, const Solid* solid );
428 bool IsBoundaryFace( TGeomID face ) const { return _geometry._boundaryFaces.Contains( face ); }
429 void SetOnShape( const SMDS_MeshNode* n, const F_IntersectPoint& ip, bool unset=false );
430 bool IsToCheckNodePos() const { return !_toAddEdges && _toCreateFaces; }
432 void SetCoordinates(const vector<double>& xCoords,
433 const vector<double>& yCoords,
434 const vector<double>& zCoords,
435 const double* axesDirs,
436 const Bnd_Box& bndBox );
437 void ComputeUVW(const gp_XYZ& p, double uvw[3]);
438 void ComputeNodes(SMESH_MesherHelper& helper);
440 // --------------------------------------------------------------------------
442 * \brief Return cells sharing a link
444 struct CellsAroundLink
451 CellsAroundLink( Grid* grid, int iDir ):
452 _dInd{ {0,0,0}, {0,0,0}, {0,0,0}, {0,0,0} },
453 _nbCells{ grid->_coords[0].size() - 1,
454 grid->_coords[1].size() - 1,
455 grid->_coords[2].size() - 1 },
458 const int iDirOther[3][2] = {{ 1,2 },{ 0,2 },{ 0,1 }};
459 _dInd[1][ iDirOther[iDir][0] ] = -1;
460 _dInd[2][ iDirOther[iDir][1] ] = -1;
461 _dInd[3][ iDirOther[iDir][0] ] = -1; _dInd[3][ iDirOther[iDir][1] ] = -1;
463 void Init( int i, int j, int k, int link12 = 0 )
466 _i = i - _dInd[iL][0];
467 _j = j - _dInd[iL][1];
468 _k = k - _dInd[iL][2];
470 bool GetCell( int iL, int& i, int& j, int& k, int& cellIndex )
472 i = _i + _dInd[iL][0];
473 j = _j + _dInd[iL][1];
474 k = _k + _dInd[iL][2];
475 if ( i < 0 || i >= (int)_nbCells[0] ||
476 j < 0 || j >= (int)_nbCells[1] ||
477 k < 0 || k >= (int)_nbCells[2] )
479 cellIndex = _grid->CellIndex( i,j,k );
483 // --------------------------------------------------------------------------
485 * \brief Intersector of TopoDS_Face with all GridLine's
487 struct FaceGridIntersector
493 IntCurvesFace_Intersector* _surfaceInt;
494 vector< std::pair< GridLine*, F_IntersectPoint > > _intersections;
496 FaceGridIntersector(): _grid(0), _surfaceInt(0) {}
499 void StoreIntersections()
501 for ( size_t i = 0; i < _intersections.size(); ++i )
503 multiset< F_IntersectPoint >::iterator ip =
504 _intersections[i].first->_intPoints.insert( _intersections[i].second );
505 ip->_faceIDs.reserve( 1 );
506 ip->_faceIDs.push_back( _faceID );
509 const Bnd_Box& GetFaceBndBox()
511 GetCurveFaceIntersector();
514 IntCurvesFace_Intersector* GetCurveFaceIntersector()
518 _surfaceInt = new IntCurvesFace_Intersector( _face, Precision::PConfusion() );
519 _bndBox = _surfaceInt->Bounding();
520 if ( _bndBox.IsVoid() )
521 BRepBndLib::Add (_face, _bndBox);
525 bool IsThreadSafe(set< const Standard_Transient* >& noSafeTShapes) const;
527 // --------------------------------------------------------------------------
529 * \brief Intersector of a surface with a GridLine
531 struct FaceLineIntersector
534 double _u, _v, _w; // params on the face and the line
535 Transition _transition; // transition at intersection (see IntCurveSurface.cdl)
536 Transition _transIn, _transOut; // IN and OUT transitions depending of face orientation
539 gp_Cylinder _cylinder;
543 IntCurvesFace_Intersector* _surfaceInt;
545 vector< F_IntersectPoint > _intPoints;
547 void IntersectWithPlane (const GridLine& gridLine);
548 void IntersectWithCylinder(const GridLine& gridLine);
549 void IntersectWithCone (const GridLine& gridLine);
550 void IntersectWithSphere (const GridLine& gridLine);
551 void IntersectWithTorus (const GridLine& gridLine);
552 void IntersectWithSurface (const GridLine& gridLine);
554 bool UVIsOnFace() const;
555 void addIntPoint(const bool toClassify=true);
556 bool isParamOnLineOK( const double linLength )
558 return -_tol < _w && _w < linLength + _tol;
560 FaceLineIntersector():_surfaceInt(0) {}
561 ~FaceLineIntersector() { if (_surfaceInt ) delete _surfaceInt; _surfaceInt = 0; }
563 // --------------------------------------------------------------------------
565 * \brief Class representing topology of the hexahedron and creating a mesh
566 * volume basing on analysis of hexahedron intersection with geometry
570 // --------------------------------------------------------------------------------
573 enum IsInternalFlag { IS_NOT_INTERNAL, IS_INTERNAL, IS_CUT_BY_INTERNAL_FACE };
574 // --------------------------------------------------------------------------------
575 struct _Node //!< node either at a hexahedron corner or at intersection
577 const SMDS_MeshNode* _node; // mesh node at hexahedron corner
578 const B_IntersectPoint* _intPoint;
579 const _Face* _usedInFace;
580 char _isInternalFlags;
582 _Node(const SMDS_MeshNode* n=0, const B_IntersectPoint* ip=0)
583 :_node(n), _intPoint(ip), _usedInFace(0), _isInternalFlags(0) {}
584 const SMDS_MeshNode* Node() const
585 { return ( _intPoint && _intPoint->_node ) ? _intPoint->_node : _node; }
586 const E_IntersectPoint* EdgeIntPnt() const
587 { return static_cast< const E_IntersectPoint* >( _intPoint ); }
588 const F_IntersectPoint* FaceIntPnt() const
589 { return static_cast< const F_IntersectPoint* >( _intPoint ); }
590 const vector< TGeomID >& faces() const { return _intPoint->_faceIDs; }
591 TGeomID face(size_t i) const { return _intPoint->_faceIDs[ i ]; }
592 void SetInternal( IsInternalFlag intFlag ) { _isInternalFlags |= intFlag; }
593 bool IsCutByInternal() const { return _isInternalFlags & IS_CUT_BY_INTERNAL_FACE; }
594 bool IsUsedInFace( const _Face* polygon = 0 )
596 return polygon ? ( _usedInFace == polygon ) : bool( _usedInFace );
598 TGeomID IsLinked( const B_IntersectPoint* other,
599 TGeomID avoidFace=-1 ) const // returns id of a common face
601 return _intPoint ? _intPoint->HasCommonFace( other, avoidFace ) : 0;
603 bool IsOnFace( TGeomID faceID ) const // returns true if faceID is found
605 return _intPoint ? _intPoint->IsOnFace( faceID ) : false;
609 if ( const SMDS_MeshNode* n = Node() )
610 return SMESH_NodeXYZ( n );
611 if ( const E_IntersectPoint* eip =
612 dynamic_cast< const E_IntersectPoint* >( _intPoint ))
614 return gp_Pnt( 1e100, 0, 0 );
616 TGeomID ShapeID() const
618 if ( const E_IntersectPoint* eip = dynamic_cast< const E_IntersectPoint* >( _intPoint ))
619 return eip->_shapeID;
622 void Add( const E_IntersectPoint* ip )
624 // Possible cases before Add(ip):
625 /// 1) _node != 0 --> _Node at hex corner ( _intPoint == 0 || _intPoint._node == 0 )
626 /// 2) _node == 0 && _intPoint._node != 0 --> link intersected by FACE
627 /// 3) _node == 0 && _intPoint._node == 0 --> _Node at EDGE intersection
629 // If ip is added in cases 1) and 2) _node position must be changed to ip._shapeID
630 // at creation of elements
631 // To recognize this case, set _intPoint._node = Node()
632 const SMDS_MeshNode* node = Node();
637 ip->Add( _intPoint->_faceIDs );
641 _node = _intPoint->_node = node;
644 // --------------------------------------------------------------------------------
645 struct _Link // link connecting two _Node's
648 _Face* _faces[2]; // polygons sharing a link
649 vector< const F_IntersectPoint* > _fIntPoints; // GridLine intersections with FACEs
650 vector< _Node* > _fIntNodes; // _Node's at _fIntPoints
651 vector< _Link > _splits;
652 _Link(): _faces{ 0, 0 } {}
654 // --------------------------------------------------------------------------------
659 _OrientedLink( _Link* link=0, bool reverse=false ): _link(link), _reverse(reverse) {}
660 void Reverse() { _reverse = !_reverse; }
661 int NbResultLinks() const { return _link->_splits.size(); }
662 _OrientedLink ResultLink(int i) const
664 return _OrientedLink(&_link->_splits[_reverse ? NbResultLinks()-i-1 : i],_reverse);
666 _Node* FirstNode() const { return _link->_nodes[ _reverse ]; }
667 _Node* LastNode() const { return _link->_nodes[ !_reverse ]; }
668 operator bool() const { return _link; }
669 vector< TGeomID > GetNotUsedFace(const set<TGeomID>& usedIDs ) const // returns supporting FACEs
671 vector< TGeomID > faces;
672 const B_IntersectPoint *ip0, *ip1;
673 if (( ip0 = _link->_nodes[0]->_intPoint ) &&
674 ( ip1 = _link->_nodes[1]->_intPoint ))
676 for ( size_t i = 0; i < ip0->_faceIDs.size(); ++i )
677 if ( ip1->IsOnFace ( ip0->_faceIDs[i] ) &&
678 !usedIDs.count( ip0->_faceIDs[i] ) )
679 faces.push_back( ip0->_faceIDs[i] );
683 bool HasEdgeNodes() const
685 return ( dynamic_cast< const E_IntersectPoint* >( _link->_nodes[0]->_intPoint ) ||
686 dynamic_cast< const E_IntersectPoint* >( _link->_nodes[1]->_intPoint ));
690 return !_link->_faces[0] ? 0 : 1 + bool( _link->_faces[1] );
692 void AddFace( _Face* f )
694 if ( _link->_faces[0] )
696 _link->_faces[1] = f;
700 _link->_faces[0] = f;
701 _link->_faces[1] = 0;
704 void RemoveFace( _Face* f )
706 if ( !_link->_faces[0] ) return;
708 if ( _link->_faces[1] == f )
710 _link->_faces[1] = 0;
712 else if ( _link->_faces[0] == f )
714 _link->_faces[0] = 0;
715 if ( _link->_faces[1] )
717 _link->_faces[0] = _link->_faces[1];
718 _link->_faces[1] = 0;
723 // --------------------------------------------------------------------------------
724 struct _SplitIterator //! set to _hexLinks splits on one side of INTERNAL FACEs
726 struct _Split // data of a link split
728 int _linkID; // hex link ID
730 int _iCheckIteration; // iteration where split is tried as Hexahedron split
731 _Link* _checkedSplit; // split set to hex links
732 bool _isUsed; // used in a volume
734 _Split( _Link & split, int iLink ):
735 _linkID( iLink ), _nodes{ split._nodes[0], split._nodes[1] },
736 _iCheckIteration( 0 ), _isUsed( false )
738 bool IsCheckedOrUsed( bool used ) const { return used ? _isUsed : _iCheckIteration > 0; }
741 std::vector< _Split > _splits;
745 std::vector< _Node* > _freeNodes; // nodes reached while composing a split set
747 _SplitIterator( _Link* hexLinks ):
748 _hexLinks( hexLinks ), _iterationNb(0), _nbChecked(0), _nbUsed(0)
750 _freeNodes.reserve( 12 );
751 _splits.reserve( 24 );
752 for ( int iL = 0; iL < 12; ++iL )
753 for ( size_t iS = 0; iS < _hexLinks[ iL ]._splits.size(); ++iS )
754 _splits.emplace_back( _hexLinks[ iL ]._splits[ iS ], iL );
757 bool More() const { return _nbUsed < _splits.size(); }
760 // --------------------------------------------------------------------------------
763 vector< _OrientedLink > _links; // links on GridLine's
764 vector< _Link > _polyLinks; // links added to close a polygonal face
765 vector< _Node* > _eIntNodes; // nodes at intersection with EDGEs
766 bool IsPolyLink( const _OrientedLink& ol )
768 return _polyLinks.empty() ? false :
769 ( &_polyLinks[0] <= ol._link && ol._link <= &_polyLinks.back() );
771 void AddPolyLink(_Node* n0, _Node* n1, _Face* faceToFindEqual=0)
773 if ( faceToFindEqual && faceToFindEqual != this ) {
774 for ( size_t iL = 0; iL < faceToFindEqual->_polyLinks.size(); ++iL )
775 if ( faceToFindEqual->_polyLinks[iL]._nodes[0] == n1 &&
776 faceToFindEqual->_polyLinks[iL]._nodes[1] == n0 )
779 ( _OrientedLink( & faceToFindEqual->_polyLinks[iL], /*reverse=*/true ));
786 _polyLinks.push_back( l );
787 _links.push_back( _OrientedLink( &_polyLinks.back() ));
790 // --------------------------------------------------------------------------------
791 struct _volumeDef // holder of nodes of a volume mesh element
795 const SMDS_MeshNode* _node; // mesh node at hexahedron corner
796 const B_IntersectPoint* _intPoint;
798 _nodeDef( _Node* n ): _node( n->_node), _intPoint( n->_intPoint ) {}
799 const SMDS_MeshNode* Node() const
800 { return ( _intPoint && _intPoint->_node ) ? _intPoint->_node : _node; }
801 const E_IntersectPoint* EdgeIntPnt() const
802 { return static_cast< const E_IntersectPoint* >( _intPoint ); }
804 vector< _nodeDef > _nodes;
805 vector< int > _quantities;
806 _volumeDef* _next; // to store several _volumeDefs in a chain
808 const SMDS_MeshElement* _volume; // new volume
810 _volumeDef(): _next(0), _solidID(0), _volume(0) {}
811 ~_volumeDef() { delete _next; }
812 _volumeDef( _volumeDef& other ):
813 _next(0), _solidID( other._solidID ), _volume( other._volume )
814 { _nodes.swap( other._nodes ); _quantities.swap( other._quantities ); other._volume = 0; }
816 void Set( const vector< _Node* >& nodes, const vector< int >& quant = vector< int >() )
817 { _nodes.assign( nodes.begin(), nodes.end() ); _quantities = quant; }
819 void Set( _Node** nodes, int nb )
820 { _nodes.assign( nodes, nodes + nb ); }
822 void SetNext( _volumeDef* vd )
823 { if ( _next ) { _next->SetNext( vd ); } else { _next = vd; }}
826 // topology of a hexahedron
829 _Link _hexLinks [12];
832 // faces resulted from hexahedron intersection
833 vector< _Face > _polygons;
835 // intresections with EDGEs
836 vector< const E_IntersectPoint* > _eIntPoints;
838 // additional nodes created at intersection points
839 vector< _Node > _intNodes;
841 // nodes inside the hexahedron (at VERTEXes)
842 vector< _Node* > _vIntNodes;
844 // computed volume elements
845 _volumeDef _volumeDefs;
848 double _sideLength[3];
849 int _nbCornerNodes, _nbFaceIntNodes, _nbBndNodes;
850 int _origNodeInd; // index of _hexNodes[0] node within the _grid
859 Hexahedron(Grid* grid);
860 int MakeElements(SMESH_MesherHelper& helper,
861 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap);
862 void ComputeElements( const Solid* solid = 0, int solidIndex = -1 );
865 Hexahedron(const Hexahedron& other, size_t i, size_t j, size_t k, int cellID );
866 void init( size_t i, size_t j, size_t k, const Solid* solid=0 );
867 void init( size_t i );
868 void setIJK( size_t i );
869 bool compute( const Solid* solid, const IsInternalFlag intFlag );
870 const vector< TGeomID >& getSolids();
871 bool isCutByInternalFace( IsInternalFlag & maxFlag );
872 void addEdges(SMESH_MesherHelper& helper,
873 vector< Hexahedron* >& intersectedHex,
874 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap);
875 gp_Pnt findIntPoint( double u1, double proj1, double u2, double proj2,
876 double proj, BRepAdaptor_Curve& curve,
877 const gp_XYZ& axis, const gp_XYZ& origin );
878 int getEntity( const E_IntersectPoint* ip, int* facets, int& sub );
879 bool addIntersection( const E_IntersectPoint* ip,
880 vector< Hexahedron* >& hexes,
881 int ijk[], int dIJK[] );
882 bool findChain( _Node* n1, _Node* n2, _Face& quad, vector<_Node*>& chainNodes );
883 bool closePolygon( _Face* polygon, vector<_Node*>& chainNodes ) const;
884 bool findChainOnEdge( const vector< _OrientedLink >& splits,
885 const _OrientedLink& prevSplit,
886 const _OrientedLink& avoidSplit,
889 vector<_Node*>& chn);
890 int addVolumes(SMESH_MesherHelper& helper );
891 void addFaces( SMESH_MesherHelper& helper,
892 const vector< const SMDS_MeshElement* > & boundaryVolumes );
893 void addSegments( SMESH_MesherHelper& helper,
894 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap );
895 void getVolumes( vector< const SMDS_MeshElement* > & volumes );
896 void getBoundaryElems( vector< const SMDS_MeshElement* > & boundaryVolumes );
897 TGeomID getAnyFace() const;
898 void cutByExtendedInternal( std::vector< Hexahedron* >& hexes,
899 const TColStd_MapOfInteger& intEdgeIDs );
900 gp_Pnt mostDistantInternalPnt( int hexIndex, const gp_Pnt& p1, const gp_Pnt& p2 );
901 bool isOutPoint( _Link& link, int iP, SMESH_MesherHelper& helper, const Solid* solid ) const;
902 void sortVertexNodes(vector<_Node*>& nodes, _Node* curNode, TGeomID face);
903 bool isInHole() const;
904 bool hasStrangeEdge() const;
905 bool checkPolyhedronSize( bool isCutByInternalFace ) const;
910 bool debugDumpLink( _Link* link );
911 _Node* findEqualNode( vector< _Node* >& nodes,
912 const E_IntersectPoint* ip,
915 for ( size_t i = 0; i < nodes.size(); ++i )
916 if ( nodes[i]->EdgeIntPnt() == ip ||
917 nodes[i]->Point().SquareDistance( ip->_point ) <= tol2 )
921 bool isImplementEdges() const { return _grid->_edgeIntPool.nbElements(); }
922 bool isOutParam(const double uvw[3]) const;
924 typedef boost::container::flat_map< TGeomID, size_t > TID2Nb;
925 static void insertAndIncrement( TGeomID id, TID2Nb& id2nbMap )
927 TID2Nb::value_type s0( id, 0 );
928 TID2Nb::iterator id2nb = id2nbMap.insert( s0 ).first;
934 // --------------------------------------------------------------------------
936 * \brief Hexahedron computing volumes in one thread
938 struct ParallelHexahedron
940 vector< Hexahedron* >& _hexVec;
941 ParallelHexahedron( vector< Hexahedron* >& hv ): _hexVec(hv) {}
942 void operator() ( const tbb::blocked_range<size_t>& r ) const
944 for ( size_t i = r.begin(); i != r.end(); ++i )
945 if ( Hexahedron* hex = _hexVec[ i ] )
946 hex->ComputeElements();
949 // --------------------------------------------------------------------------
951 * \brief Structure intersecting certain nb of faces with GridLine's in one thread
953 struct ParallelIntersector
955 vector< FaceGridIntersector >& _faceVec;
956 ParallelIntersector( vector< FaceGridIntersector >& faceVec): _faceVec(faceVec){}
957 void operator() ( const tbb::blocked_range<size_t>& r ) const
959 for ( size_t i = r.begin(); i != r.end(); ++i )
960 _faceVec[i].Intersect();
965 //=============================================================================
966 // Implementation of internal utils
967 //=============================================================================
969 * \brief adjust \a i to have \a val between values[i] and values[i+1]
971 inline void locateValue( int & i, double val, const vector<double>& values,
972 int& di, double tol )
974 //val += values[0]; // input \a val is measured from 0.
975 if ( i > (int) values.size()-2 )
978 while ( i+2 < (int) values.size() && val > values[ i+1 ])
980 while ( i > 0 && val < values[ i ])
983 if ( i > 0 && val - values[ i ] < tol )
985 else if ( i+2 < (int) values.size() && values[ i+1 ] - val < tol )
990 //=============================================================================
992 * Remove coincident intersection points
994 void GridLine::RemoveExcessIntPoints( const double tol )
996 if ( _intPoints.size() < 2 ) return;
998 set< Transition > tranSet;
999 multiset< F_IntersectPoint >::iterator ip1, ip2 = _intPoints.begin();
1000 while ( ip2 != _intPoints.end() )
1004 while ( ip2 != _intPoints.end() && ip2->_paramOnLine - ip1->_paramOnLine <= tol )
1006 tranSet.insert( ip1->_transition );
1007 tranSet.insert( ip2->_transition );
1008 ip2->Add( ip1->_faceIDs );
1009 _intPoints.erase( ip1 );
1012 if ( tranSet.size() > 1 ) // points with different transition coincide
1014 bool isIN = tranSet.count( Trans_IN );
1015 bool isOUT = tranSet.count( Trans_OUT );
1016 if ( isIN && isOUT )
1017 (*ip1)._transition = Trans_TANGENT;
1019 (*ip1)._transition = isIN ? Trans_IN : Trans_OUT;
1023 //================================================================================
1025 * Return ID of SOLID for nodes before the given intersection point
1027 TGeomID GridLine::GetSolidIDBefore( multiset< F_IntersectPoint >::iterator ip,
1028 const TGeomID prevID,
1029 const Geometry& geom )
1031 if ( ip == _intPoints.begin() )
1034 if ( geom.IsOneSolid() )
1037 switch ( ip->_transition ) {
1038 case Trans_IN: isOut = true; break;
1039 case Trans_OUT: isOut = false; break;
1040 case Trans_TANGENT: isOut = ( prevID == 0 ); break;
1043 // singularity point (apex of a cone)
1044 multiset< F_IntersectPoint >::iterator ipBef = ip, ipAft = ++ip;
1045 if ( ipAft == _intPoints.end() )
1050 if ( ipBef->_transition != ipAft->_transition )
1051 isOut = ( ipBef->_transition == Trans_OUT );
1053 isOut = ( ipBef->_transition != Trans_OUT );
1057 case Trans_INTERNAL: isOut = false;
1060 return isOut ? 0 : geom._soleSolid.ID();
1063 const vector< TGeomID >& solids = geom._solidIDsByShapeID[ ip->_faceIDs[ 0 ]];
1066 if ( ip->_transition == Trans_INTERNAL )
1069 const vector< TGeomID >& solidsBef = geom._solidIDsByShapeID[ ip->_faceIDs[ 0 ]];
1071 if ( ip->_transition == Trans_IN ||
1072 ip->_transition == Trans_OUT )
1074 if ( solidsBef.size() == 1 )
1075 return ( solidsBef[0] == prevID ) ? 0 : solidsBef[0];
1077 return solidsBef[ solidsBef[0] == prevID ];
1080 if ( solidsBef.size() == 1 )
1081 return solidsBef[0];
1083 for ( size_t i = 0; i < solids.size(); ++i )
1085 vector< TGeomID >::const_iterator it =
1086 std::find( solidsBef.begin(), solidsBef.end(), solids[i] );
1087 if ( it != solidsBef.end() )
1092 //================================================================================
1096 void B_IntersectPoint::Add( const vector< TGeomID >& fIDs,
1097 const SMDS_MeshNode* n) const
1099 if ( _faceIDs.empty() )
1102 for ( size_t i = 0; i < fIDs.size(); ++i )
1104 vector< TGeomID >::iterator it =
1105 std::find( _faceIDs.begin(), _faceIDs.end(), fIDs[i] );
1106 if ( it == _faceIDs.end() )
1107 _faceIDs.push_back( fIDs[i] );
1112 //================================================================================
1114 * Returns index of a common face if any, else zero
1116 int B_IntersectPoint::HasCommonFace( const B_IntersectPoint * other, int avoidFace ) const
1119 for ( size_t i = 0; i < other->_faceIDs.size(); ++i )
1120 if ( avoidFace != other->_faceIDs[i] &&
1121 IsOnFace ( other->_faceIDs[i] ))
1122 return other->_faceIDs[i];
1125 //================================================================================
1127 * Returns \c true if \a faceID in in this->_faceIDs
1129 bool B_IntersectPoint::IsOnFace( int faceID ) const // returns true if faceID is found
1131 vector< TGeomID >::const_iterator it =
1132 std::find( _faceIDs.begin(), _faceIDs.end(), faceID );
1133 return ( it != _faceIDs.end() );
1135 //================================================================================
1137 * OneOfSolids initialization
1139 void OneOfSolids::Init( const TopoDS_Shape& solid,
1140 TopAbs_ShapeEnum subType,
1141 const SMESHDS_Mesh* mesh )
1143 SetID( mesh->ShapeToIndex( solid ));
1145 if ( subType == TopAbs_FACE )
1146 SetHasInternalFaces( false );
1148 for ( TopExp_Explorer sub( solid, subType ); sub.More(); sub.Next() )
1150 _subIDs.Add( mesh->ShapeToIndex( sub.Current() ));
1151 if ( subType == TopAbs_FACE )
1153 _faces.Add( sub.Current() );
1154 if ( sub.Current().Orientation() == TopAbs_INTERNAL )
1155 SetHasInternalFaces( true );
1157 TGeomID faceID = mesh->ShapeToIndex( sub.Current() );
1158 if ( sub.Current().Orientation() == TopAbs_INTERNAL ||
1159 sub.Current().Orientation() == mesh->IndexToShape( faceID ).Orientation() )
1160 _outFaceIDs.Add( faceID );
1164 //================================================================================
1166 * Return an iterator on GridLine's in a given direction
1168 LineIndexer Grid::GetLineIndexer(size_t iDir) const
1170 const size_t indices[] = { 1,2,0, 0,2,1, 0,1,2 };
1171 const string s [] = { "X", "Y", "Z" };
1172 LineIndexer li( _coords[0].size(), _coords[1].size(), _coords[2].size(),
1173 indices[iDir*3], indices[iDir*3+1], indices[iDir*3+2],
1174 s[indices[iDir*3]], s[indices[iDir*3+1]], s[indices[iDir*3+2]]);
1177 //=============================================================================
1179 * Creates GridLine's of the grid
1181 void Grid::SetCoordinates(const vector<double>& xCoords,
1182 const vector<double>& yCoords,
1183 const vector<double>& zCoords,
1184 const double* axesDirs,
1185 const Bnd_Box& shapeBox)
1187 _coords[0] = xCoords;
1188 _coords[1] = yCoords;
1189 _coords[2] = zCoords;
1191 _axes[0].SetCoord( axesDirs[0],
1194 _axes[1].SetCoord( axesDirs[3],
1197 _axes[2].SetCoord( axesDirs[6],
1200 _axes[0].Normalize();
1201 _axes[1].Normalize();
1202 _axes[2].Normalize();
1204 _invB.SetCols( _axes[0], _axes[1], _axes[2] );
1207 // compute tolerance
1208 _minCellSize = Precision::Infinite();
1209 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1211 for ( size_t i = 1; i < _coords[ iDir ].size(); ++i )
1213 double cellLen = _coords[ iDir ][ i ] - _coords[ iDir ][ i-1 ];
1214 if ( cellLen < _minCellSize )
1215 _minCellSize = cellLen;
1218 if ( _minCellSize < Precision::Confusion() )
1219 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1220 SMESH_Comment("Too small cell size: ") << _minCellSize );
1221 _tol = _minCellSize / 1000.;
1223 // attune grid extremities to shape bounding box
1225 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
1226 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
1227 double* cP[6] = { &_coords[0].front(), &_coords[1].front(), &_coords[2].front(),
1228 &_coords[0].back(), &_coords[1].back(), &_coords[2].back() };
1229 for ( int i = 0; i < 6; ++i )
1230 if ( fabs( sP[i] - *cP[i] ) < _tol )
1231 *cP[i] = sP[i];// + _tol/1000. * ( i < 3 ? +1 : -1 );
1233 for ( int iDir = 0; iDir < 3; ++iDir )
1235 if ( _coords[iDir][0] - sP[iDir] > _tol )
1237 _minCellSize = Min( _minCellSize, _coords[iDir][0] - sP[iDir] );
1238 _coords[iDir].insert( _coords[iDir].begin(), sP[iDir] + _tol/1000.);
1240 if ( sP[iDir+3] - _coords[iDir].back() > _tol )
1242 _minCellSize = Min( _minCellSize, sP[iDir+3] - _coords[iDir].back() );
1243 _coords[iDir].push_back( sP[iDir+3] - _tol/1000.);
1246 _tol = _minCellSize / 1000.;
1248 _origin = ( _coords[0][0] * _axes[0] +
1249 _coords[1][0] * _axes[1] +
1250 _coords[2][0] * _axes[2] );
1253 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1255 LineIndexer li = GetLineIndexer( iDir );
1256 _lines[iDir].resize( li.NbLines() );
1257 double len = _coords[ iDir ].back() - _coords[iDir].front();
1258 for ( ; li.More(); ++li )
1260 GridLine& gl = _lines[iDir][ li.LineIndex() ];
1261 gl._line.SetLocation( _coords[0][li.I()] * _axes[0] +
1262 _coords[1][li.J()] * _axes[1] +
1263 _coords[2][li.K()] * _axes[2] );
1264 gl._line.SetDirection( _axes[ iDir ]);
1269 //================================================================================
1271 * Return local ID of shape
1273 TGeomID Grid::ShapeID( const TopoDS_Shape& s ) const
1275 return _helper->GetMeshDS()->ShapeToIndex( s );
1277 //================================================================================
1279 * Return a shape by its local ID
1281 const TopoDS_Shape& Grid::Shape( TGeomID id ) const
1283 return _helper->GetMeshDS()->IndexToShape( id );
1285 //================================================================================
1287 * Initialize _geometry
1289 void Grid::InitGeometry( const TopoDS_Shape& theShapeToMesh )
1291 SMESH_Mesh* mesh = _helper->GetMesh();
1293 _geometry._mainShape = theShapeToMesh;
1294 _geometry._extIntFaceID = mesh->GetMeshDS()->MaxShapeIndex() * 100;
1295 _geometry._soleSolid.SetID( 0 );
1296 _geometry._soleSolid.SetHasInternalFaces( false );
1298 InitClassifier( theShapeToMesh, TopAbs_VERTEX, _geometry._vertexClassifier );
1299 InitClassifier( theShapeToMesh, TopAbs_EDGE , _geometry._edgeClassifier );
1301 TopExp_Explorer solidExp( theShapeToMesh, TopAbs_SOLID );
1303 bool isSeveralSolids = false;
1304 if ( _toConsiderInternalFaces ) // check nb SOLIDs
1307 isSeveralSolids = solidExp.More();
1308 _toConsiderInternalFaces = isSeveralSolids;
1311 if ( !isSeveralSolids ) // look for an internal FACE
1313 TopExp_Explorer fExp( theShapeToMesh, TopAbs_FACE );
1314 for ( ; fExp.More() && !_toConsiderInternalFaces; fExp.Next() )
1315 _toConsiderInternalFaces = ( fExp.Current().Orientation() == TopAbs_INTERNAL );
1317 _geometry._soleSolid.SetHasInternalFaces( _toConsiderInternalFaces );
1318 _geometry._soleSolid.SetID( ShapeID( solidExp.Current() ));
1320 else // fill Geometry::_solidByID
1322 for ( ; solidExp.More(); solidExp.Next() )
1324 OneOfSolids & solid = _geometry._solidByID[ ShapeID( solidExp.Current() )];
1325 solid.Init( solidExp.Current(), TopAbs_FACE, mesh->GetMeshDS() );
1326 solid.Init( solidExp.Current(), TopAbs_EDGE, mesh->GetMeshDS() );
1327 solid.Init( solidExp.Current(), TopAbs_VERTEX, mesh->GetMeshDS() );
1333 _geometry._soleSolid.SetID( ShapeID( solidExp.Current() ));
1336 if ( !_toCreateFaces )
1338 int nbSolidsGlobal = _helper->Count( mesh->GetShapeToMesh(), TopAbs_SOLID, false );
1339 int nbSolidsLocal = _helper->Count( theShapeToMesh, TopAbs_SOLID, false );
1340 _toCreateFaces = ( nbSolidsLocal < nbSolidsGlobal );
1343 TopTools_IndexedMapOfShape faces;
1344 if ( _toCreateFaces || isSeveralSolids )
1345 TopExp::MapShapes( theShapeToMesh, TopAbs_FACE, faces );
1347 // find boundary FACEs on boundary of mesh->ShapeToMesh()
1348 if ( _toCreateFaces )
1349 for ( int i = 1; i <= faces.Size(); ++i )
1350 if ( faces(i).Orientation() != TopAbs_INTERNAL &&
1351 _helper->NbAncestors( faces(i), *mesh, TopAbs_SOLID ) == 1 )
1353 _geometry._boundaryFaces.Add( ShapeID( faces(i) ));
1356 if ( isSeveralSolids )
1357 for ( int i = 1; i <= faces.Size(); ++i )
1359 SetSolidFather( faces(i), theShapeToMesh );
1360 for ( TopExp_Explorer eExp( faces(i), TopAbs_EDGE ); eExp.More(); eExp.Next() )
1362 const TopoDS_Edge& edge = TopoDS::Edge( eExp.Current() );
1363 SetSolidFather( edge, theShapeToMesh );
1364 SetSolidFather( _helper->IthVertex( 0, edge ), theShapeToMesh );
1365 SetSolidFather( _helper->IthVertex( 1, edge ), theShapeToMesh );
1370 //================================================================================
1372 * Store ID of SOLID as father of its child shape ID
1374 void Grid::SetSolidFather( const TopoDS_Shape& s, const TopoDS_Shape& theShapeToMesh )
1376 if ( _geometry._solidIDsByShapeID.empty() )
1377 _geometry._solidIDsByShapeID.resize( _helper->GetMeshDS()->MaxShapeIndex() + 1 );
1379 vector< TGeomID > & solidIDs = _geometry._solidIDsByShapeID[ ShapeID( s )];
1380 if ( !solidIDs.empty() )
1382 solidIDs.reserve(2);
1383 PShapeIteratorPtr solidIt = _helper->GetAncestors( s,
1384 *_helper->GetMesh(),
1387 while ( const TopoDS_Shape* solid = solidIt->next() )
1388 solidIDs.push_back( ShapeID( *solid ));
1390 //================================================================================
1392 * Return IDs of solids given sub-shape belongs to
1394 const vector< TGeomID > & Grid::GetSolidIDs( TGeomID subShapeID ) const
1396 return _geometry._solidIDsByShapeID[ subShapeID ];
1398 //================================================================================
1400 * Check if a sub-shape belongs to several SOLIDs
1402 bool Grid::IsShared( TGeomID shapeID ) const
1404 return !_geometry.IsOneSolid() && ( _geometry._solidIDsByShapeID[ shapeID ].size() > 1 );
1406 //================================================================================
1408 * Check if any of FACEs belongs to several SOLIDs
1410 bool Grid::IsAnyShared( const std::vector< TGeomID >& faceIDs ) const
1412 for ( size_t i = 0; i < faceIDs.size(); ++i )
1413 if ( IsShared( faceIDs[ i ]))
1417 //================================================================================
1419 * Return Solid by ID
1421 Solid* Grid::GetSolid( TGeomID solidID )
1423 if ( !solidID || _geometry.IsOneSolid() || _geometry._solidByID.empty() )
1424 return & _geometry._soleSolid;
1426 return & _geometry._solidByID[ solidID ];
1428 //================================================================================
1430 * Return OneOfSolids by ID
1432 Solid* Grid::GetOneOfSolids( TGeomID solidID )
1434 map< TGeomID, OneOfSolids >::iterator is2s = _geometry._solidByID.find( solidID );
1435 if ( is2s != _geometry._solidByID.end() )
1436 return & is2s->second;
1438 return & _geometry._soleSolid;
1440 //================================================================================
1442 * Check if transition on given FACE is correct for a given SOLID
1444 bool Grid::IsCorrectTransition( TGeomID faceID, const Solid* solid )
1446 if ( _geometry.IsOneSolid() )
1449 const vector< TGeomID >& solidIDs = _geometry._solidIDsByShapeID[ faceID ];
1450 return solidIDs[0] == solid->ID();
1453 //================================================================================
1455 * Assign to geometry a node at FACE intersection
1457 void Grid::SetOnShape( const SMDS_MeshNode* n, const F_IntersectPoint& ip, bool unset )
1460 SMESHDS_Mesh* mesh = _helper->GetMeshDS();
1461 if ( ip._faceIDs.size() == 1 )
1463 mesh->SetNodeOnFace( n, ip._faceIDs[0], ip._u, ip._v );
1465 else if ( _geometry._vertexClassifier.IsSatisfy( n, &s ))
1467 if ( unset ) mesh->UnSetNodeOnShape( n );
1468 mesh->SetNodeOnVertex( n, TopoDS::Vertex( s ));
1470 else if ( _geometry._edgeClassifier.IsSatisfy( n, &s ))
1472 if ( unset ) mesh->UnSetNodeOnShape( n );
1473 mesh->SetNodeOnEdge( n, TopoDS::Edge( s ));
1475 else if ( ip._faceIDs.size() > 0 )
1477 mesh->SetNodeOnFace( n, ip._faceIDs[0], ip._u, ip._v );
1479 else if ( !unset && _geometry.IsOneSolid() )
1481 mesh->SetNodeInVolume( n, _geometry._soleSolid.ID() );
1484 //================================================================================
1486 * Initialize a classifier
1488 void Grid::InitClassifier( const TopoDS_Shape& mainShape,
1489 TopAbs_ShapeEnum shapeType,
1490 Controls::ElementsOnShape& classifier )
1492 TopTools_IndexedMapOfShape shapes;
1493 TopExp::MapShapes( mainShape, shapeType, shapes );
1495 TopoDS_Compound compound; BRep_Builder builder;
1496 builder.MakeCompound( compound );
1497 for ( int i = 1; i <= shapes.Size(); ++i )
1498 builder.Add( compound, shapes(i) );
1500 classifier.SetMesh( _helper->GetMeshDS() );
1501 //classifier.SetTolerance( _tol ); // _tol is not initialised
1502 classifier.SetShape( compound, SMDSAbs_Node );
1505 //================================================================================
1507 * Return EDGEs with FACEs to implement into the mesh
1509 void Grid::GetEdgesToImplement( map< TGeomID, vector< TGeomID > > & edge2faceIDsMap,
1510 const TopoDS_Shape& shape,
1511 const vector< TopoDS_Shape >& faces )
1513 // check if there are strange EDGEs
1514 TopTools_IndexedMapOfShape faceMap;
1515 TopExp::MapShapes( _helper->GetMesh()->GetShapeToMesh(), TopAbs_FACE, faceMap );
1516 int nbFacesGlobal = faceMap.Size();
1517 faceMap.Clear( false );
1518 TopExp::MapShapes( shape, TopAbs_FACE, faceMap );
1519 int nbFacesLocal = faceMap.Size();
1520 bool hasStrangeEdges = ( nbFacesGlobal > nbFacesLocal );
1521 if ( !_toAddEdges && !hasStrangeEdges )
1522 return; // no FACEs in contact with those meshed by other algo
1524 for ( size_t i = 0; i < faces.size(); ++i )
1526 _helper->SetSubShape( faces[i] );
1527 for ( TopExp_Explorer eExp( faces[i], TopAbs_EDGE ); eExp.More(); eExp.Next() )
1529 const TopoDS_Edge& edge = TopoDS::Edge( eExp.Current() );
1530 if ( hasStrangeEdges )
1532 bool hasStrangeFace = false;
1533 PShapeIteratorPtr faceIt = _helper->GetAncestors( edge, *_helper->GetMesh(), TopAbs_FACE);
1534 while ( const TopoDS_Shape* face = faceIt->next() )
1535 if (( hasStrangeFace = !faceMap.Contains( *face )))
1537 if ( !hasStrangeFace && !_toAddEdges )
1539 _geometry._strangeEdges.Add( ShapeID( edge ));
1540 _geometry._strangeEdges.Add( ShapeID( _helper->IthVertex( 0, edge )));
1541 _geometry._strangeEdges.Add( ShapeID( _helper->IthVertex( 1, edge )));
1543 if ( !SMESH_Algo::isDegenerated( edge ) &&
1544 !_helper->IsRealSeam( edge ))
1546 edge2faceIDsMap[ ShapeID( edge )].push_back( ShapeID( faces[i] ));
1553 //================================================================================
1555 * Computes coordinates of a point in the grid CS
1557 void Grid::ComputeUVW(const gp_XYZ& P, double UVW[3])
1559 gp_XYZ p = P * _invB;
1560 p.Coord( UVW[0], UVW[1], UVW[2] );
1562 //================================================================================
1566 void Grid::ComputeNodes(SMESH_MesherHelper& helper)
1568 // state of each node of the grid relative to the geometry
1569 const size_t nbGridNodes = _coords[0].size() * _coords[1].size() * _coords[2].size();
1570 const TGeomID undefID = 1e+9;
1571 vector< TGeomID > shapeIDVec( nbGridNodes, undefID );
1572 _nodes.resize( nbGridNodes, 0 );
1573 _gridIntP.resize( nbGridNodes, NULL );
1575 SMESHDS_Mesh* mesh = helper.GetMeshDS();
1577 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1579 LineIndexer li = GetLineIndexer( iDir );
1581 // find out a shift of node index while walking along a GridLine in this direction
1582 li.SetIndexOnLine( 0 );
1583 size_t nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
1584 li.SetIndexOnLine( 1 );
1585 const size_t nShift = NodeIndex( li.I(), li.J(), li.K() ) - nIndex0;
1587 const vector<double> & coords = _coords[ iDir ];
1588 for ( ; li.More(); ++li ) // loop on lines in iDir
1590 li.SetIndexOnLine( 0 );
1591 nIndex0 = NodeIndex( li.I(), li.J(), li.K() );
1593 GridLine& line = _lines[ iDir ][ li.LineIndex() ];
1594 const gp_XYZ lineLoc = line._line.Location().XYZ();
1595 const gp_XYZ lineDir = line._line.Direction().XYZ();
1597 line.RemoveExcessIntPoints( _tol );
1598 multiset< F_IntersectPoint >& intPnts = line._intPoints;
1599 multiset< F_IntersectPoint >::iterator ip = intPnts.begin();
1601 // Create mesh nodes at intersections with geometry
1602 // and set OUT state of nodes between intersections
1604 TGeomID solidID = 0;
1605 const double* nodeCoord = & coords[0];
1606 const double* coord0 = nodeCoord;
1607 const double* coordEnd = coord0 + coords.size();
1608 double nodeParam = 0;
1609 for ( ; ip != intPnts.end(); ++ip )
1611 solidID = line.GetSolidIDBefore( ip, solidID, _geometry );
1613 // set OUT state or just skip IN nodes before ip
1614 if ( nodeParam < ip->_paramOnLine - _tol )
1616 while ( nodeParam < ip->_paramOnLine - _tol )
1618 TGeomID & nodeShapeID = shapeIDVec[ nIndex0 + nShift * ( nodeCoord-coord0 ) ];
1619 nodeShapeID = Min( solidID, nodeShapeID );
1620 if ( ++nodeCoord < coordEnd )
1621 nodeParam = *nodeCoord - *coord0;
1625 if ( nodeCoord == coordEnd ) break;
1627 // create a mesh node on a GridLine at ip if it does not coincide with a grid node
1628 if ( nodeParam > ip->_paramOnLine + _tol )
1630 gp_XYZ xyz = lineLoc + ip->_paramOnLine * lineDir;
1631 ip->_node = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1632 ip->_indexOnLine = nodeCoord-coord0-1;
1633 SetOnShape( ip->_node, *ip );
1635 // create a mesh node at ip coincident with a grid node
1638 int nodeIndex = nIndex0 + nShift * ( nodeCoord-coord0 );
1639 if ( !_nodes[ nodeIndex ] )
1641 gp_XYZ xyz = lineLoc + nodeParam * lineDir;
1642 _nodes [ nodeIndex ] = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1643 //_gridIntP[ nodeIndex ] = & * ip;
1644 //SetOnShape( _nodes[ nodeIndex ], *ip );
1646 if ( _gridIntP[ nodeIndex ] )
1647 _gridIntP[ nodeIndex ]->Add( ip->_faceIDs );
1649 _gridIntP[ nodeIndex ] = & * ip;
1650 // ip->_node = _nodes[ nodeIndex ]; -- to differ from ip on links
1651 ip->_indexOnLine = nodeCoord-coord0;
1652 if ( ++nodeCoord < coordEnd )
1653 nodeParam = *nodeCoord - *coord0;
1656 // set OUT state to nodes after the last ip
1657 for ( ; nodeCoord < coordEnd; ++nodeCoord )
1658 shapeIDVec[ nIndex0 + nShift * ( nodeCoord-coord0 ) ] = 0;
1662 // Create mesh nodes at !OUT nodes of the grid
1664 for ( size_t z = 0; z < _coords[2].size(); ++z )
1665 for ( size_t y = 0; y < _coords[1].size(); ++y )
1666 for ( size_t x = 0; x < _coords[0].size(); ++x )
1668 size_t nodeIndex = NodeIndex( x, y, z );
1669 if ( !_nodes[ nodeIndex ] &&
1670 0 < shapeIDVec[ nodeIndex ] && shapeIDVec[ nodeIndex ] < undefID )
1672 gp_XYZ xyz = ( _coords[0][x] * _axes[0] +
1673 _coords[1][y] * _axes[1] +
1674 _coords[2][z] * _axes[2] );
1675 _nodes[ nodeIndex ] = mesh->AddNode( xyz.X(), xyz.Y(), xyz.Z() );
1676 mesh->SetNodeInVolume( _nodes[ nodeIndex ], shapeIDVec[ nodeIndex ]);
1678 else if ( _nodes[ nodeIndex ] && _gridIntP[ nodeIndex ] /*&&
1679 !_nodes[ nodeIndex]->GetShapeID()*/ )
1681 SetOnShape( _nodes[ nodeIndex ], *_gridIntP[ nodeIndex ]);
1686 // check validity of transitions
1687 const char* trName[] = { "TANGENT", "IN", "OUT", "APEX" };
1688 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1690 LineIndexer li = GetLineIndexer( iDir );
1691 for ( ; li.More(); ++li )
1693 multiset< F_IntersectPoint >& intPnts = _lines[ iDir ][ li.LineIndex() ]._intPoints;
1694 if ( intPnts.empty() ) continue;
1695 if ( intPnts.size() == 1 )
1697 if ( intPnts.begin()->_transition != Trans_TANGENT &&
1698 intPnts.begin()->_transition != Trans_APEX )
1699 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1700 SMESH_Comment("Wrong SOLE transition of GridLine (")
1701 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1702 << ") along " << li._nameConst
1703 << ": " << trName[ intPnts.begin()->_transition] );
1707 if ( intPnts.begin()->_transition == Trans_OUT )
1708 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1709 SMESH_Comment("Wrong START transition of GridLine (")
1710 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1711 << ") along " << li._nameConst
1712 << ": " << trName[ intPnts.begin()->_transition ]);
1713 if ( intPnts.rbegin()->_transition == Trans_IN )
1714 throw SMESH_ComputeError (COMPERR_ALGO_FAILED,
1715 SMESH_Comment("Wrong END transition of GridLine (")
1716 << li._curInd[li._iVar1] << ", " << li._curInd[li._iVar2]
1717 << ") along " << li._nameConst
1718 << ": " << trName[ intPnts.rbegin()->_transition ]);
1725 //=============================================================================
1727 * Intersects TopoDS_Face with all GridLine's
1729 void FaceGridIntersector::Intersect()
1731 FaceLineIntersector intersector;
1732 intersector._surfaceInt = GetCurveFaceIntersector();
1733 intersector._tol = _grid->_tol;
1734 intersector._transOut = _face.Orientation() == TopAbs_REVERSED ? Trans_IN : Trans_OUT;
1735 intersector._transIn = _face.Orientation() == TopAbs_REVERSED ? Trans_OUT : Trans_IN;
1737 typedef void (FaceLineIntersector::* PIntFun )(const GridLine& gridLine);
1738 PIntFun interFunction;
1740 bool isDirect = true;
1741 BRepAdaptor_Surface surf( _face );
1742 switch ( surf.GetType() ) {
1744 intersector._plane = surf.Plane();
1745 interFunction = &FaceLineIntersector::IntersectWithPlane;
1746 isDirect = intersector._plane.Direct();
1748 case GeomAbs_Cylinder:
1749 intersector._cylinder = surf.Cylinder();
1750 interFunction = &FaceLineIntersector::IntersectWithCylinder;
1751 isDirect = intersector._cylinder.Direct();
1754 intersector._cone = surf.Cone();
1755 interFunction = &FaceLineIntersector::IntersectWithCone;
1756 //isDirect = intersector._cone.Direct();
1758 case GeomAbs_Sphere:
1759 intersector._sphere = surf.Sphere();
1760 interFunction = &FaceLineIntersector::IntersectWithSphere;
1761 isDirect = intersector._sphere.Direct();
1764 intersector._torus = surf.Torus();
1765 interFunction = &FaceLineIntersector::IntersectWithTorus;
1766 //isDirect = intersector._torus.Direct();
1769 interFunction = &FaceLineIntersector::IntersectWithSurface;
1772 std::swap( intersector._transOut, intersector._transIn );
1774 _intersections.clear();
1775 for ( int iDir = 0; iDir < 3; ++iDir ) // loop on 3 line directions
1777 if ( surf.GetType() == GeomAbs_Plane )
1779 // check if all lines in this direction are parallel to a plane
1780 if ( intersector._plane.Axis().IsNormal( _grid->_lines[iDir][0]._line.Position(),
1781 Precision::Angular()))
1783 // find out a transition, that is the same for all lines of a direction
1784 gp_Dir plnNorm = intersector._plane.Axis().Direction();
1785 gp_Dir lineDir = _grid->_lines[iDir][0]._line.Direction();
1786 intersector._transition =
1787 ( plnNorm * lineDir < 0 ) ? intersector._transIn : intersector._transOut;
1789 if ( surf.GetType() == GeomAbs_Cylinder )
1791 // check if all lines in this direction are parallel to a cylinder
1792 if ( intersector._cylinder.Axis().IsParallel( _grid->_lines[iDir][0]._line.Position(),
1793 Precision::Angular()))
1797 // intersect the grid lines with the face
1798 for ( size_t iL = 0; iL < _grid->_lines[iDir].size(); ++iL )
1800 GridLine& gridLine = _grid->_lines[iDir][iL];
1801 if ( _bndBox.IsOut( gridLine._line )) continue;
1803 intersector._intPoints.clear();
1804 (intersector.*interFunction)( gridLine ); // <- intersection with gridLine
1805 for ( size_t i = 0; i < intersector._intPoints.size(); ++i )
1806 _intersections.push_back( make_pair( &gridLine, intersector._intPoints[i] ));
1810 if ( _face.Orientation() == TopAbs_INTERNAL )
1812 for ( size_t i = 0; i < _intersections.size(); ++i )
1813 if ( _intersections[i].second._transition == Trans_IN ||
1814 _intersections[i].second._transition == Trans_OUT )
1816 _intersections[i].second._transition = Trans_INTERNAL;
1821 //================================================================================
1823 * Return true if (_u,_v) is on the face
1825 bool FaceLineIntersector::UVIsOnFace() const
1827 TopAbs_State state = _surfaceInt->ClassifyUVPoint(gp_Pnt2d( _u,_v ));
1828 return ( state == TopAbs_IN || state == TopAbs_ON );
1830 //================================================================================
1832 * Store an intersection if it is IN or ON the face
1834 void FaceLineIntersector::addIntPoint(const bool toClassify)
1836 if ( !toClassify || UVIsOnFace() )
1839 p._paramOnLine = _w;
1842 p._transition = _transition;
1843 _intPoints.push_back( p );
1846 //================================================================================
1848 * Intersect a line with a plane
1850 void FaceLineIntersector::IntersectWithPlane(const GridLine& gridLine)
1852 IntAna_IntConicQuad linPlane( gridLine._line, _plane, Precision::Angular());
1853 _w = linPlane.ParamOnConic(1);
1854 if ( isParamOnLineOK( gridLine._length ))
1856 ElSLib::Parameters(_plane, linPlane.Point(1) ,_u,_v);
1860 //================================================================================
1862 * Intersect a line with a cylinder
1864 void FaceLineIntersector::IntersectWithCylinder(const GridLine& gridLine)
1866 IntAna_IntConicQuad linCylinder( gridLine._line, _cylinder );
1867 if ( linCylinder.IsDone() && linCylinder.NbPoints() > 0 )
1869 _w = linCylinder.ParamOnConic(1);
1870 if ( linCylinder.NbPoints() == 1 )
1871 _transition = Trans_TANGENT;
1873 _transition = _w < linCylinder.ParamOnConic(2) ? _transIn : _transOut;
1874 if ( isParamOnLineOK( gridLine._length ))
1876 ElSLib::Parameters(_cylinder, linCylinder.Point(1) ,_u,_v);
1879 if ( linCylinder.NbPoints() > 1 )
1881 _w = linCylinder.ParamOnConic(2);
1882 if ( isParamOnLineOK( gridLine._length ))
1884 ElSLib::Parameters(_cylinder, linCylinder.Point(2) ,_u,_v);
1885 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
1891 //================================================================================
1893 * Intersect a line with a cone
1895 void FaceLineIntersector::IntersectWithCone (const GridLine& gridLine)
1897 IntAna_IntConicQuad linCone(gridLine._line,_cone);
1898 if ( !linCone.IsDone() ) return;
1900 gp_Vec du, dv, norm;
1901 for ( int i = 1; i <= linCone.NbPoints(); ++i )
1903 _w = linCone.ParamOnConic( i );
1904 if ( !isParamOnLineOK( gridLine._length )) continue;
1905 ElSLib::Parameters(_cone, linCone.Point(i) ,_u,_v);
1908 ElSLib::D1( _u, _v, _cone, P, du, dv );
1910 double normSize2 = norm.SquareMagnitude();
1911 if ( normSize2 > Precision::Angular() * Precision::Angular() )
1913 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
1914 cos /= sqrt( normSize2 );
1915 if ( cos < -Precision::Angular() )
1916 _transition = _transIn;
1917 else if ( cos > Precision::Angular() )
1918 _transition = _transOut;
1920 _transition = Trans_TANGENT;
1924 _transition = Trans_APEX;
1926 addIntPoint( /*toClassify=*/false);
1930 //================================================================================
1932 * Intersect a line with a sphere
1934 void FaceLineIntersector::IntersectWithSphere (const GridLine& gridLine)
1936 IntAna_IntConicQuad linSphere(gridLine._line,_sphere);
1937 if ( linSphere.IsDone() && linSphere.NbPoints() > 0 )
1939 _w = linSphere.ParamOnConic(1);
1940 if ( linSphere.NbPoints() == 1 )
1941 _transition = Trans_TANGENT;
1943 _transition = _w < linSphere.ParamOnConic(2) ? _transIn : _transOut;
1944 if ( isParamOnLineOK( gridLine._length ))
1946 ElSLib::Parameters(_sphere, linSphere.Point(1) ,_u,_v);
1949 if ( linSphere.NbPoints() > 1 )
1951 _w = linSphere.ParamOnConic(2);
1952 if ( isParamOnLineOK( gridLine._length ))
1954 ElSLib::Parameters(_sphere, linSphere.Point(2) ,_u,_v);
1955 _transition = ( _transition == Trans_OUT ) ? Trans_IN : Trans_OUT;
1961 //================================================================================
1963 * Intersect a line with a torus
1965 void FaceLineIntersector::IntersectWithTorus (const GridLine& gridLine)
1967 IntAna_IntLinTorus linTorus(gridLine._line,_torus);
1968 if ( !linTorus.IsDone()) return;
1970 gp_Vec du, dv, norm;
1971 for ( int i = 1; i <= linTorus.NbPoints(); ++i )
1973 _w = linTorus.ParamOnLine( i );
1974 if ( !isParamOnLineOK( gridLine._length )) continue;
1975 linTorus.ParamOnTorus( i, _u,_v );
1978 ElSLib::D1( _u, _v, _torus, P, du, dv );
1980 double normSize = norm.Magnitude();
1981 double cos = norm.XYZ() * gridLine._line.Direction().XYZ();
1983 if ( cos < -Precision::Angular() )
1984 _transition = _transIn;
1985 else if ( cos > Precision::Angular() )
1986 _transition = _transOut;
1988 _transition = Trans_TANGENT;
1989 addIntPoint( /*toClassify=*/false);
1993 //================================================================================
1995 * Intersect a line with a non-analytical surface
1997 void FaceLineIntersector::IntersectWithSurface (const GridLine& gridLine)
1999 _surfaceInt->Perform( gridLine._line, 0.0, gridLine._length );
2000 if ( !_surfaceInt->IsDone() ) return;
2001 for ( int i = 1; i <= _surfaceInt->NbPnt(); ++i )
2003 _transition = Transition( _surfaceInt->Transition( i ) );
2004 _w = _surfaceInt->WParameter( i );
2005 addIntPoint(/*toClassify=*/false);
2008 //================================================================================
2010 * check if its face can be safely intersected in a thread
2012 bool FaceGridIntersector::IsThreadSafe(set< const Standard_Transient* >& noSafeTShapes) const
2017 TopLoc_Location loc;
2018 Handle(Geom_Surface) surf = BRep_Tool::Surface( _face, loc );
2019 Handle(Geom_RectangularTrimmedSurface) ts =
2020 Handle(Geom_RectangularTrimmedSurface)::DownCast( surf );
2021 while( !ts.IsNull() ) {
2022 surf = ts->BasisSurface();
2023 ts = Handle(Geom_RectangularTrimmedSurface)::DownCast(surf);
2025 if ( surf->IsKind( STANDARD_TYPE(Geom_BSplineSurface )) ||
2026 surf->IsKind( STANDARD_TYPE(Geom_BezierSurface )))
2027 if ( !noSafeTShapes.insert( _face.TShape().get() ).second )
2031 TopExp_Explorer exp( _face, TopAbs_EDGE );
2032 for ( ; exp.More(); exp.Next() )
2034 bool edgeIsSafe = true;
2035 const TopoDS_Edge& e = TopoDS::Edge( exp.Current() );
2038 Handle(Geom_Curve) c = BRep_Tool::Curve( e, loc, f, l);
2041 Handle(Geom_TrimmedCurve) tc = Handle(Geom_TrimmedCurve)::DownCast(c);
2042 while( !tc.IsNull() ) {
2043 c = tc->BasisCurve();
2044 tc = Handle(Geom_TrimmedCurve)::DownCast(c);
2046 if ( c->IsKind( STANDARD_TYPE(Geom_BSplineCurve )) ||
2047 c->IsKind( STANDARD_TYPE(Geom_BezierCurve )))
2054 Handle(Geom2d_Curve) c2 = BRep_Tool::CurveOnSurface( e, surf, loc, f, l);
2057 Handle(Geom2d_TrimmedCurve) tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
2058 while( !tc.IsNull() ) {
2059 c2 = tc->BasisCurve();
2060 tc = Handle(Geom2d_TrimmedCurve)::DownCast(c2);
2062 if ( c2->IsKind( STANDARD_TYPE(Geom2d_BSplineCurve )) ||
2063 c2->IsKind( STANDARD_TYPE(Geom2d_BezierCurve )))
2067 if ( !edgeIsSafe && !noSafeTShapes.insert( e.TShape().get() ).second )
2072 //================================================================================
2074 * \brief Creates topology of the hexahedron
2076 Hexahedron::Hexahedron(Grid* grid)
2077 : _grid( grid ), _nbFaceIntNodes(0), _hasTooSmall( false )
2079 _polygons.reserve(100); // to avoid reallocation;
2081 //set nodes shift within grid->_nodes from the node 000
2082 size_t dx = _grid->NodeIndexDX();
2083 size_t dy = _grid->NodeIndexDY();
2084 size_t dz = _grid->NodeIndexDZ();
2086 size_t i100 = i000 + dx;
2087 size_t i010 = i000 + dy;
2088 size_t i110 = i010 + dx;
2089 size_t i001 = i000 + dz;
2090 size_t i101 = i100 + dz;
2091 size_t i011 = i010 + dz;
2092 size_t i111 = i110 + dz;
2093 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V000 )] = i000;
2094 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V100 )] = i100;
2095 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V010 )] = i010;
2096 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V110 )] = i110;
2097 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V001 )] = i001;
2098 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V101 )] = i101;
2099 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V011 )] = i011;
2100 _nodeShift[ SMESH_Block::ShapeIndex( SMESH_Block::ID_V111 )] = i111;
2102 vector< int > idVec;
2103 // set nodes to links
2104 for ( int linkID = SMESH_Block::ID_Ex00; linkID <= SMESH_Block::ID_E11z; ++linkID )
2106 SMESH_Block::GetEdgeVertexIDs( linkID, idVec );
2107 _Link& link = _hexLinks[ SMESH_Block::ShapeIndex( linkID )];
2108 link._nodes[0] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[0] )];
2109 link._nodes[1] = &_hexNodes[ SMESH_Block::ShapeIndex( idVec[1] )];
2112 // set links to faces
2113 int interlace[4] = { 0, 3, 1, 2 }; // to walk by links around a face: { u0, 1v, u1, 0v }
2114 for ( int faceID = SMESH_Block::ID_Fxy0; faceID <= SMESH_Block::ID_F1yz; ++faceID )
2116 SMESH_Block::GetFaceEdgesIDs( faceID, idVec );
2117 _Face& quad = _hexQuads[ SMESH_Block::ShapeIndex( faceID )];
2118 bool revFace = ( faceID == SMESH_Block::ID_Fxy0 ||
2119 faceID == SMESH_Block::ID_Fx1z ||
2120 faceID == SMESH_Block::ID_F0yz );
2121 quad._links.resize(4);
2122 vector<_OrientedLink>::iterator frwLinkIt = quad._links.begin();
2123 vector<_OrientedLink>::reverse_iterator revLinkIt = quad._links.rbegin();
2124 for ( int i = 0; i < 4; ++i )
2126 bool revLink = revFace;
2127 if ( i > 1 ) // reverse links u1 and v0
2129 _OrientedLink& link = revFace ? *revLinkIt++ : *frwLinkIt++;
2130 link = _OrientedLink( & _hexLinks[ SMESH_Block::ShapeIndex( idVec[interlace[i]] )],
2135 //================================================================================
2137 * \brief Copy constructor
2139 Hexahedron::Hexahedron( const Hexahedron& other, size_t i, size_t j, size_t k, int cellID )
2140 :_grid( other._grid ), _nbFaceIntNodes(0), _i( i ), _j( j ), _k( k ), _hasTooSmall( false )
2142 _polygons.reserve(100); // to avoid reallocation;
2145 for ( int i = 0; i < 8; ++i )
2146 _nodeShift[i] = other._nodeShift[i];
2148 for ( int i = 0; i < 12; ++i )
2150 const _Link& srcLink = other._hexLinks[ i ];
2151 _Link& tgtLink = this->_hexLinks[ i ];
2152 tgtLink._nodes[0] = _hexNodes + ( srcLink._nodes[0] - other._hexNodes );
2153 tgtLink._nodes[1] = _hexNodes + ( srcLink._nodes[1] - other._hexNodes );
2156 for ( int i = 0; i < 6; ++i )
2158 const _Face& srcQuad = other._hexQuads[ i ];
2159 _Face& tgtQuad = this->_hexQuads[ i ];
2160 tgtQuad._links.resize(4);
2161 for ( int j = 0; j < 4; ++j )
2163 const _OrientedLink& srcLink = srcQuad._links[ j ];
2164 _OrientedLink& tgtLink = tgtQuad._links[ j ];
2165 tgtLink._reverse = srcLink._reverse;
2166 tgtLink._link = _hexLinks + ( srcLink._link - other._hexLinks );
2174 //================================================================================
2176 * \brief Return IDs of SOLIDs interfering with this Hexahedron
2178 const vector< TGeomID >& Hexahedron::getSolids()
2180 _grid->_shapeIDs.clear();
2181 if ( _grid->_geometry.IsOneSolid() )
2183 _grid->_shapeIDs.push_back( _grid->GetSolid()->ID() );
2184 return _grid->_shapeIDs;
2186 // count intersection points belonging to each SOLID
2188 id2NbPoints.reserve( 3 );
2190 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
2191 for ( int iN = 0; iN < 8; ++iN )
2193 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
2194 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
2196 if ( _hexNodes[iN]._intPoint ) // intersection with a FACE
2198 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2200 const vector< TGeomID > & solidIDs =
2201 _grid->GetSolidIDs( _hexNodes[iN]._intPoint->_faceIDs[iF] );
2202 for ( size_t i = 0; i < solidIDs.size(); ++i )
2203 insertAndIncrement( solidIDs[i], id2NbPoints );
2206 else if ( _hexNodes[iN]._node ) // node inside a SOLID
2208 insertAndIncrement( _hexNodes[iN]._node->GetShapeID(), id2NbPoints );
2212 for ( int iL = 0; iL < 12; ++iL )
2214 const _Link& link = _hexLinks[ iL ];
2215 for ( size_t iP = 0; iP < link._fIntPoints.size(); ++iP )
2217 for ( size_t iF = 0; iF < link._fIntPoints[iP]->_faceIDs.size(); ++iF )
2219 const vector< TGeomID > & solidIDs =
2220 _grid->GetSolidIDs( link._fIntPoints[iP]->_faceIDs[iF] );
2221 for ( size_t i = 0; i < solidIDs.size(); ++i )
2222 insertAndIncrement( solidIDs[i], id2NbPoints );
2227 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2229 const vector< TGeomID > & solidIDs = _grid->GetSolidIDs( _eIntPoints[iP]->_shapeID );
2230 for ( size_t i = 0; i < solidIDs.size(); ++i )
2231 insertAndIncrement( solidIDs[i], id2NbPoints );
2234 _grid->_shapeIDs.reserve( id2NbPoints.size() );
2235 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2236 if ( id2nb->second >= 3 )
2237 _grid->_shapeIDs.push_back( id2nb->first );
2239 return _grid->_shapeIDs;
2242 //================================================================================
2244 * \brief Count cuts by INTERNAL FACEs and set _Node::_isInternalFlags
2246 bool Hexahedron::isCutByInternalFace( IsInternalFlag & maxFlag )
2249 id2NbPoints.reserve( 3 );
2251 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2252 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2254 if ( _grid->IsInternal( _intNodes[iN]._intPoint->_faceIDs[iF]))
2255 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2257 for ( size_t iN = 0; iN < 8; ++iN )
2258 if ( _hexNodes[iN]._intPoint )
2259 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2261 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
2262 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2265 maxFlag = IS_NOT_INTERNAL;
2266 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2268 TGeomID intFace = id2nb->first;
2269 IsInternalFlag intFlag = ( id2nb->second >= 3 ? IS_CUT_BY_INTERNAL_FACE : IS_INTERNAL );
2270 if ( intFlag > maxFlag )
2273 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2274 if ( _intNodes[iN].IsOnFace( intFace ))
2275 _intNodes[iN].SetInternal( intFlag );
2277 for ( size_t iN = 0; iN < 8; ++iN )
2278 if ( _hexNodes[iN].IsOnFace( intFace ))
2279 _hexNodes[iN].SetInternal( intFlag );
2285 //================================================================================
2287 * \brief Return any FACE interfering with this Hexahedron
2289 TGeomID Hexahedron::getAnyFace() const
2292 id2NbPoints.reserve( 3 );
2294 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2295 for ( size_t iF = 0; iF < _intNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2296 insertAndIncrement( _intNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2298 for ( size_t iN = 0; iN < 8; ++iN )
2299 if ( _hexNodes[iN]._intPoint )
2300 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
2301 insertAndIncrement( _hexNodes[iN]._intPoint->_faceIDs[iF], id2NbPoints );
2303 for ( unsigned int minNb = 3; minNb > 0; --minNb )
2304 for ( TID2Nb::iterator id2nb = id2NbPoints.begin(); id2nb != id2NbPoints.end(); ++id2nb )
2305 if ( id2nb->second >= minNb )
2306 return id2nb->first;
2311 //================================================================================
2313 * \brief Initializes IJK by Hexahedron index
2315 void Hexahedron::setIJK( size_t iCell )
2317 size_t iNbCell = _grid->_coords[0].size() - 1;
2318 size_t jNbCell = _grid->_coords[1].size() - 1;
2319 _i = iCell % iNbCell;
2320 _j = ( iCell % ( iNbCell * jNbCell )) / iNbCell;
2321 _k = iCell / iNbCell / jNbCell;
2324 //================================================================================
2326 * \brief Initializes its data by given grid cell (countered from zero)
2328 void Hexahedron::init( size_t iCell )
2334 //================================================================================
2336 * \brief Initializes its data by given grid cell nodes and intersections
2338 void Hexahedron::init( size_t i, size_t j, size_t k, const Solid* solid )
2340 _i = i; _j = j; _k = k;
2343 solid = _grid->GetSolid();
2345 // set nodes of grid to nodes of the hexahedron and
2346 // count nodes at hexahedron corners located IN and ON geometry
2347 _nbCornerNodes = _nbBndNodes = 0;
2348 _origNodeInd = _grid->NodeIndex( i,j,k );
2349 for ( int iN = 0; iN < 8; ++iN )
2351 _hexNodes[iN]._isInternalFlags = 0;
2353 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
2354 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
2356 if ( _hexNodes[iN]._node && !solid->Contains( _hexNodes[iN]._node->GetShapeID() ))
2357 _hexNodes[iN]._node = 0;
2358 if ( _hexNodes[iN]._intPoint && !solid->ContainsAny( _hexNodes[iN]._intPoint->_faceIDs ))
2359 _hexNodes[iN]._intPoint = 0;
2361 _nbCornerNodes += bool( _hexNodes[iN]._node );
2362 _nbBndNodes += bool( _hexNodes[iN]._intPoint );
2364 _sideLength[0] = _grid->_coords[0][i+1] - _grid->_coords[0][i];
2365 _sideLength[1] = _grid->_coords[1][j+1] - _grid->_coords[1][j];
2366 _sideLength[2] = _grid->_coords[2][k+1] - _grid->_coords[2][k];
2371 if ( _nbFaceIntNodes + _eIntPoints.size() > 0 &&
2372 _nbFaceIntNodes + _eIntPoints.size() + _nbCornerNodes > 3)
2374 _intNodes.reserve( 3 * _nbBndNodes + _nbFaceIntNodes + _eIntPoints.size() );
2376 // this method can be called in parallel, so use own helper
2377 SMESH_MesherHelper helper( *_grid->_helper->GetMesh() );
2379 // Create sub-links (_Link::_splits) by splitting links with _Link::_fIntPoints
2380 // ---------------------------------------------------------------
2382 for ( int iLink = 0; iLink < 12; ++iLink )
2384 _Link& link = _hexLinks[ iLink ];
2385 link._fIntNodes.clear();
2386 link._fIntNodes.reserve( link._fIntPoints.size() );
2387 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
2388 if ( solid->ContainsAny( link._fIntPoints[i]->_faceIDs ))
2390 _intNodes.push_back( _Node( 0, link._fIntPoints[i] ));
2391 link._fIntNodes.push_back( & _intNodes.back() );
2394 link._splits.clear();
2395 split._nodes[ 0 ] = link._nodes[0];
2396 bool isOut = ( ! link._nodes[0]->Node() );
2397 bool checkTransition;
2398 for ( size_t i = 0; i < link._fIntNodes.size(); ++i )
2400 const bool isGridNode = ( ! link._fIntNodes[i]->Node() );
2401 if ( !isGridNode ) // intersection non-coincident with a grid node
2403 if ( split._nodes[ 0 ]->Node() && !isOut )
2405 split._nodes[ 1 ] = link._fIntNodes[i];
2406 link._splits.push_back( split );
2408 split._nodes[ 0 ] = link._fIntNodes[i];
2409 checkTransition = true;
2411 else // FACE intersection coincident with a grid node (at link ends)
2413 checkTransition = ( i == 0 && link._nodes[0]->Node() );
2415 if ( checkTransition )
2417 const vector< TGeomID >& faceIDs = link._fIntNodes[i]->_intPoint->_faceIDs;
2418 if ( _grid->IsInternal( faceIDs.back() ))
2420 else if ( faceIDs.size() > 1 || _eIntPoints.size() > 0 )
2421 isOut = isOutPoint( link, i, helper, solid );
2424 bool okTransi = _grid->IsCorrectTransition( faceIDs[0], solid );
2425 switch ( link._fIntNodes[i]->FaceIntPnt()->_transition ) {
2426 case Trans_OUT: isOut = okTransi; break;
2427 case Trans_IN : isOut = !okTransi; break;
2429 isOut = isOutPoint( link, i, helper, solid );
2434 if ( link._nodes[ 1 ]->Node() && split._nodes[ 0 ]->Node() && !isOut )
2436 split._nodes[ 1 ] = link._nodes[1];
2437 link._splits.push_back( split );
2441 // Create _Node's at intersections with EDGEs.
2442 // --------------------------------------------
2443 // 1) add this->_eIntPoints to _Face::_eIntNodes
2444 // 2) fill _intNodes and _vIntNodes
2446 const double tol2 = _grid->_tol * _grid->_tol;
2447 int facets[3], nbFacets, subEntity;
2449 for ( int iF = 0; iF < 6; ++iF )
2450 _hexQuads[ iF ]._eIntNodes.clear();
2452 for ( size_t iP = 0; iP < _eIntPoints.size(); ++iP )
2454 if ( !solid->ContainsAny( _eIntPoints[iP]->_faceIDs ))
2456 nbFacets = getEntity( _eIntPoints[iP], facets, subEntity );
2457 _Node* equalNode = 0;
2458 switch( nbFacets ) {
2459 case 1: // in a _Face
2461 _Face& quad = _hexQuads[ facets[0] - SMESH_Block::ID_FirstF ];
2462 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2464 equalNode->Add( _eIntPoints[ iP ] );
2467 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2468 quad._eIntNodes.push_back( & _intNodes.back() );
2472 case 2: // on a _Link
2474 _Link& link = _hexLinks[ subEntity - SMESH_Block::ID_FirstE ];
2475 if ( link._splits.size() > 0 )
2477 equalNode = findEqualNode( link._fIntNodes, _eIntPoints[ iP ], tol2 );
2479 equalNode->Add( _eIntPoints[ iP ] );
2480 else if ( link._splits.size() == 1 &&
2481 link._splits[0]._nodes[0] &&
2482 link._splits[0]._nodes[1] )
2483 link._splits.clear(); // hex edge is divided by _eIntPoints[iP]
2488 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2489 bool newNodeUsed = false;
2490 for ( int iF = 0; iF < 2; ++iF )
2492 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2493 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2495 equalNode->Add( _eIntPoints[ iP ] );
2498 quad._eIntNodes.push_back( & _intNodes.back() );
2503 _intNodes.pop_back();
2507 case 3: // at a corner
2509 _Node& node = _hexNodes[ subEntity - SMESH_Block::ID_FirstV ];
2510 if ( node.Node() > 0 )
2512 if ( node._intPoint )
2513 node._intPoint->Add( _eIntPoints[ iP ]->_faceIDs, _eIntPoints[ iP ]->_node );
2517 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2518 for ( int iF = 0; iF < 3; ++iF )
2520 _Face& quad = _hexQuads[ facets[iF] - SMESH_Block::ID_FirstF ];
2521 equalNode = findEqualNode( quad._eIntNodes, _eIntPoints[ iP ], tol2 );
2523 equalNode->Add( _eIntPoints[ iP ] );
2526 quad._eIntNodes.push_back( & _intNodes.back() );
2532 } // switch( nbFacets )
2534 if ( nbFacets == 0 ||
2535 _grid->ShapeType( _eIntPoints[ iP ]->_shapeID ) == TopAbs_VERTEX )
2537 equalNode = findEqualNode( _vIntNodes, _eIntPoints[ iP ], tol2 );
2539 equalNode->Add( _eIntPoints[ iP ] );
2541 else if ( nbFacets == 0 ) {
2542 if ( _intNodes.empty() || _intNodes.back().EdgeIntPnt() != _eIntPoints[ iP ])
2543 _intNodes.push_back( _Node( 0, _eIntPoints[ iP ]));
2544 _vIntNodes.push_back( & _intNodes.back() );
2547 } // loop on _eIntPoints
2550 else if ( 3 < _nbCornerNodes && _nbCornerNodes < 8 ) // _nbFaceIntNodes == 0
2553 // create sub-links (_splits) of whole links
2554 for ( int iLink = 0; iLink < 12; ++iLink )
2556 _Link& link = _hexLinks[ iLink ];
2557 link._splits.clear();
2558 if ( link._nodes[ 0 ]->Node() && link._nodes[ 1 ]->Node() )
2560 split._nodes[ 0 ] = link._nodes[0];
2561 split._nodes[ 1 ] = link._nodes[1];
2562 link._splits.push_back( split );
2568 } // init( _i, _j, _k )
2570 //================================================================================
2572 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2574 void Hexahedron::ComputeElements( const Solid* solid, int solidIndex )
2578 solid = _grid->GetSolid();
2579 if ( !_grid->_geometry.IsOneSolid() )
2581 const vector< TGeomID >& solidIDs = getSolids();
2582 if ( solidIDs.size() > 1 )
2584 for ( size_t i = 0; i < solidIDs.size(); ++i )
2586 solid = _grid->GetSolid( solidIDs[i] );
2587 ComputeElements( solid, i );
2588 if ( !_volumeDefs._nodes.empty() && i < solidIDs.size() - 1 )
2589 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2593 solid = _grid->GetSolid( solidIDs[0] );
2597 init( _i, _j, _k, solid ); // get nodes and intersections from grid nodes and split links
2599 int nbIntersections = _nbFaceIntNodes + _eIntPoints.size();
2600 if ( _nbCornerNodes + nbIntersections < 4 )
2603 if ( _nbBndNodes == _nbCornerNodes && nbIntersections == 0 && isInHole() )
2604 return; // cell is in a hole
2606 IsInternalFlag intFlag = IS_NOT_INTERNAL;
2607 if ( solid->HasInternalFaces() && this->isCutByInternalFace( intFlag ))
2609 for ( _SplitIterator it( _hexLinks ); it.More(); it.Next() )
2611 if ( compute( solid, intFlag ))
2612 _volumeDefs.SetNext( new _volumeDef( _volumeDefs ));
2617 if ( solidIndex >= 0 )
2618 intFlag = IS_CUT_BY_INTERNAL_FACE;
2620 compute( solid, intFlag );
2624 //================================================================================
2626 * \brief Compute mesh volumes resulted from intersection of the Hexahedron
2628 bool Hexahedron::compute( const Solid* solid, const IsInternalFlag intFlag )
2631 _polygons.reserve( 20 );
2633 for ( int iN = 0; iN < 8; ++iN )
2634 _hexNodes[iN]._usedInFace = 0;
2636 // Create polygons from quadrangles
2637 // --------------------------------
2639 vector< _OrientedLink > splits;
2640 vector<_Node*> chainNodes;
2641 _Face* coplanarPolyg;
2643 bool hasEdgeIntersections = !_eIntPoints.empty();
2645 for ( int iF = 0; iF < 6; ++iF ) // loop on 6 sides of a hexahedron
2647 _Face& quad = _hexQuads[ iF ] ;
2649 _polygons.resize( _polygons.size() + 1 );
2650 _Face* polygon = &_polygons.back();
2651 polygon->_polyLinks.reserve( 20 );
2654 for ( int iE = 0; iE < 4; ++iE ) // loop on 4 sides of a quadrangle
2655 for ( int iS = 0; iS < quad._links[ iE ].NbResultLinks(); ++iS )
2656 splits.push_back( quad._links[ iE ].ResultLink( iS ));
2658 // add splits of links to a polygon and add _polyLinks to make
2659 // polygon's boundary closed
2661 int nbSplits = splits.size();
2662 if (( nbSplits == 1 ) &&
2663 ( quad._eIntNodes.empty() ||
2664 splits[0].FirstNode()->IsLinked( splits[0].LastNode()->_intPoint )))
2665 //( quad._eIntNodes.empty() || _nbCornerNodes + nbIntersections > 6 ))
2668 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
2669 if ( quad._eIntNodes[ iP ]->IsUsedInFace( polygon ))
2670 quad._eIntNodes[ iP ]->_usedInFace = 0;
2672 size_t nbUsedEdgeNodes = 0;
2673 _Face* prevPolyg = 0; // polygon previously created from this quad
2675 while ( nbSplits > 0 )
2678 while ( !splits[ iS ] )
2681 if ( !polygon->_links.empty() )
2683 _polygons.resize( _polygons.size() + 1 );
2684 polygon = &_polygons.back();
2685 polygon->_polyLinks.reserve( 20 );
2687 polygon->_links.push_back( splits[ iS ] );
2688 splits[ iS++ ]._link = 0;
2691 _Node* nFirst = polygon->_links.back().FirstNode();
2692 _Node *n1,*n2 = polygon->_links.back().LastNode();
2693 for ( ; nFirst != n2 && iS < splits.size(); ++iS )
2695 _OrientedLink& split = splits[ iS ];
2696 if ( !split ) continue;
2698 n1 = split.FirstNode();
2701 (( n1->_intPoint->_faceIDs.size() > 1 && isImplementEdges() ) ||
2702 ( n1->_isInternalFlags )))
2704 // n1 is at intersection with EDGE
2705 if ( findChainOnEdge( splits, polygon->_links.back(), split, iS, quad, chainNodes ))
2707 for ( size_t i = 1; i < chainNodes.size(); ++i )
2708 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2709 if ( chainNodes.back() != n1 ) // not a partial cut by INTERNAL FACE
2711 prevPolyg = polygon;
2712 n2 = chainNodes.back();
2717 else if ( n1 != n2 )
2719 // try to connect to intersections with EDGEs
2720 if ( quad._eIntNodes.size() > nbUsedEdgeNodes &&
2721 findChain( n2, n1, quad, chainNodes ))
2723 for ( size_t i = 1; i < chainNodes.size(); ++i )
2725 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i] );
2726 nbUsedEdgeNodes += ( chainNodes[i]->IsUsedInFace( polygon ));
2728 if ( chainNodes.back() != n1 )
2730 n2 = chainNodes.back();
2735 // try to connect to a split ending on the same FACE
2738 _OrientedLink foundSplit;
2739 for ( size_t i = iS; i < splits.size() && !foundSplit; ++i )
2740 if (( foundSplit = splits[ i ]) &&
2741 ( n2->IsLinked( foundSplit.FirstNode()->_intPoint )))
2747 foundSplit._link = 0;
2751 if ( n2 != foundSplit.FirstNode() )
2753 polygon->AddPolyLink( n2, foundSplit.FirstNode() );
2754 n2 = foundSplit.FirstNode();
2760 if ( n2->IsLinked( nFirst->_intPoint ))
2762 polygon->AddPolyLink( n2, n1, prevPolyg );
2765 } // if ( n1 != n2 )
2767 polygon->_links.push_back( split );
2770 n2 = polygon->_links.back().LastNode();
2774 if ( nFirst != n2 ) // close a polygon
2776 if ( !findChain( n2, nFirst, quad, chainNodes ))
2778 if ( !closePolygon( polygon, chainNodes ))
2779 if ( !isImplementEdges() )
2780 chainNodes.push_back( nFirst );
2782 for ( size_t i = 1; i < chainNodes.size(); ++i )
2784 polygon->AddPolyLink( chainNodes[i-1], chainNodes[i], prevPolyg );
2785 nbUsedEdgeNodes += bool( chainNodes[i]->IsUsedInFace( polygon ));
2789 if ( polygon->_links.size() < 3 && nbSplits > 0 )
2791 polygon->_polyLinks.clear();
2792 polygon->_links.clear();
2794 } // while ( nbSplits > 0 )
2796 if ( polygon->_links.size() < 3 )
2798 _polygons.pop_back();
2800 } // loop on 6 hexahedron sides
2802 // Create polygons closing holes in a polyhedron
2803 // ----------------------------------------------
2805 // clear _usedInFace
2806 for ( size_t iN = 0; iN < _intNodes.size(); ++iN )
2807 _intNodes[ iN ]._usedInFace = 0;
2809 // add polygons to their links and mark used nodes
2810 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2812 _Face& polygon = _polygons[ iP ];
2813 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2815 polygon._links[ iL ].AddFace( &polygon );
2816 polygon._links[ iL ].FirstNode()->_usedInFace = &polygon;
2820 vector< _OrientedLink* > freeLinks;
2821 freeLinks.reserve(20);
2822 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
2824 _Face& polygon = _polygons[ iP ];
2825 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
2826 if ( polygon._links[ iL ].NbFaces() < 2 )
2827 freeLinks.push_back( & polygon._links[ iL ]);
2829 int nbFreeLinks = freeLinks.size();
2830 if ( nbFreeLinks == 1 ) return false;
2832 // put not used intersection nodes to _vIntNodes
2833 int nbVertexNodes = 0; // nb not used vertex nodes
2835 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
2836 nbVertexNodes += ( !_vIntNodes[ iN ]->IsUsedInFace() );
2838 const double tol = 1e-3 * Min( Min( _sideLength[0], _sideLength[1] ), _sideLength[0] );
2839 for ( size_t iN = _nbFaceIntNodes; iN < _intNodes.size(); ++iN )
2841 if ( _intNodes[ iN ].IsUsedInFace() ) continue;
2842 if ( dynamic_cast< const F_IntersectPoint* >( _intNodes[ iN ]._intPoint )) continue;
2844 findEqualNode( _vIntNodes, _intNodes[ iN ].EdgeIntPnt(), tol*tol );
2847 _vIntNodes.push_back( &_intNodes[ iN ]);
2853 set<TGeomID> usedFaceIDs;
2854 vector< TGeomID > faces;
2855 TGeomID curFace = 0;
2856 const size_t nbQuadPolygons = _polygons.size();
2857 E_IntersectPoint ipTmp;
2859 // create polygons by making closed chains of free links
2860 size_t iPolygon = _polygons.size();
2861 while ( nbFreeLinks > 0 )
2863 if ( iPolygon == _polygons.size() )
2865 _polygons.resize( _polygons.size() + 1 );
2866 _polygons[ iPolygon ]._polyLinks.reserve( 20 );
2867 _polygons[ iPolygon ]._links.reserve( 20 );
2869 _Face& polygon = _polygons[ iPolygon ];
2871 _OrientedLink* curLink = 0;
2873 if (( !hasEdgeIntersections ) ||
2874 ( nbFreeLinks < 4 && nbVertexNodes == 0 ))
2876 // get a remaining link to start from
2877 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2878 if (( curLink = freeLinks[ iL ] ))
2879 freeLinks[ iL ] = 0;
2880 polygon._links.push_back( *curLink );
2884 // find all links connected to curLink
2885 curNode = curLink->FirstNode();
2887 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2888 if ( freeLinks[ iL ] && freeLinks[ iL ]->LastNode() == curNode )
2890 curLink = freeLinks[ iL ];
2891 freeLinks[ iL ] = 0;
2893 polygon._links.push_back( *curLink );
2895 } while ( curLink );
2897 else // there are intersections with EDGEs
2899 // get a remaining link to start from, one lying on minimal nb of FACEs
2901 typedef pair< TGeomID, int > TFaceOfLink;
2902 TFaceOfLink faceOfLink( -1, -1 );
2903 TFaceOfLink facesOfLink[3] = { faceOfLink, faceOfLink, faceOfLink };
2904 for ( size_t iL = 0; iL < freeLinks.size(); ++iL )
2905 if ( freeLinks[ iL ] )
2907 faces = freeLinks[ iL ]->GetNotUsedFace( usedFaceIDs );
2908 if ( faces.size() == 1 )
2910 faceOfLink = TFaceOfLink( faces[0], iL );
2911 if ( !freeLinks[ iL ]->HasEdgeNodes() )
2913 facesOfLink[0] = faceOfLink;
2915 else if ( facesOfLink[0].first < 0 )
2917 faceOfLink = TFaceOfLink(( faces.empty() ? -1 : faces[0]), iL );
2918 facesOfLink[ 1 + faces.empty() ] = faceOfLink;
2921 for ( int i = 0; faceOfLink.first < 0 && i < 3; ++i )
2922 faceOfLink = facesOfLink[i];
2924 if ( faceOfLink.first < 0 ) // all faces used
2926 for ( size_t iL = 0; iL < freeLinks.size() && faceOfLink.first < 1; ++iL )
2927 if (( curLink = freeLinks[ iL ]))
2930 curLink->FirstNode()->IsLinked( curLink->LastNode()->_intPoint );
2931 faceOfLink.second = iL;
2933 usedFaceIDs.clear();
2935 curFace = faceOfLink.first;
2936 curLink = freeLinks[ faceOfLink.second ];
2937 freeLinks[ faceOfLink.second ] = 0;
2939 usedFaceIDs.insert( curFace );
2940 polygon._links.push_back( *curLink );
2943 // find all links lying on a curFace
2946 // go forward from curLink
2947 curNode = curLink->LastNode();
2949 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2950 if ( freeLinks[ iL ] &&
2951 freeLinks[ iL ]->FirstNode() == curNode &&
2952 freeLinks[ iL ]->LastNode()->IsOnFace( curFace ))
2954 curLink = freeLinks[ iL ];
2955 freeLinks[ iL ] = 0;
2956 polygon._links.push_back( *curLink );
2959 } while ( curLink );
2961 std::reverse( polygon._links.begin(), polygon._links.end() );
2963 curLink = & polygon._links.back();
2966 // go backward from curLink
2967 curNode = curLink->FirstNode();
2969 for ( size_t iL = 0; iL < freeLinks.size() && !curLink; ++iL )
2970 if ( freeLinks[ iL ] &&
2971 freeLinks[ iL ]->LastNode() == curNode &&
2972 freeLinks[ iL ]->FirstNode()->IsOnFace( curFace ))
2974 curLink = freeLinks[ iL ];
2975 freeLinks[ iL ] = 0;
2976 polygon._links.push_back( *curLink );
2979 } while ( curLink );
2981 curNode = polygon._links.back().FirstNode();
2983 if ( polygon._links[0].LastNode() != curNode )
2985 if ( nbVertexNodes > 0 )
2987 // add links with _vIntNodes if not already used
2989 for ( size_t iN = 0; iN < _vIntNodes.size(); ++iN )
2990 if ( !_vIntNodes[ iN ]->IsUsedInFace() &&
2991 _vIntNodes[ iN ]->IsOnFace( curFace ))
2993 _vIntNodes[ iN ]->_usedInFace = &polygon;
2994 chainNodes.push_back( _vIntNodes[ iN ] );
2996 if ( chainNodes.size() > 1 &&
2997 curFace != _grid->PseudoIntExtFaceID() ) /////// TODO
2999 sortVertexNodes( chainNodes, curNode, curFace );
3001 for ( size_t i = 0; i < chainNodes.size(); ++i )
3003 polygon.AddPolyLink( chainNodes[ i ], curNode );
3004 curNode = chainNodes[ i ];
3005 freeLinks.push_back( &polygon._links.back() );
3008 nbVertexNodes -= chainNodes.size();
3010 // if ( polygon._links.size() > 1 )
3012 polygon.AddPolyLink( polygon._links[0].LastNode(), curNode );
3013 freeLinks.push_back( &polygon._links.back() );
3017 } // if there are intersections with EDGEs
3019 if ( polygon._links.size() < 2 ||
3020 polygon._links[0].LastNode() != polygon._links.back().FirstNode() )
3021 return false; // closed polygon not found -> invalid polyhedron
3023 if ( polygon._links.size() == 2 )
3025 if ( freeLinks.back() == &polygon._links.back() )
3027 freeLinks.pop_back();
3030 if ( polygon._links.front().NbFaces() > 0 )
3031 polygon._links.back().AddFace( polygon._links.front()._link->_faces[0] );
3032 if ( polygon._links.back().NbFaces() > 0 )
3033 polygon._links.front().AddFace( polygon._links.back()._link->_faces[0] );
3035 if ( iPolygon == _polygons.size()-1 )
3036 _polygons.pop_back();
3038 else // polygon._links.size() >= 2
3040 // add polygon to its links
3041 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3043 polygon._links[ iL ].AddFace( &polygon );
3044 polygon._links[ iL ].Reverse();
3046 if ( /*hasEdgeIntersections &&*/ iPolygon == _polygons.size() - 1 )
3048 // check that a polygon does not lie on a hexa side
3050 for ( size_t iL = 0; iL < polygon._links.size() && !coplanarPolyg; ++iL )
3052 if ( polygon._links[ iL ].NbFaces() < 2 )
3053 continue; // it's a just added free link
3054 // look for a polygon made on a hexa side and sharing
3055 // two or more haxa links
3057 coplanarPolyg = polygon._links[ iL ]._link->_faces[0];
3058 for ( iL2 = iL + 1; iL2 < polygon._links.size(); ++iL2 )
3059 if ( polygon._links[ iL2 ]._link->_faces[0] == coplanarPolyg &&
3060 !coplanarPolyg->IsPolyLink( polygon._links[ iL ]) &&
3061 !coplanarPolyg->IsPolyLink( polygon._links[ iL2 ]) &&
3062 coplanarPolyg < & _polygons[ nbQuadPolygons ])
3064 if ( iL2 == polygon._links.size() )
3067 if ( coplanarPolyg ) // coplanar polygon found
3069 freeLinks.resize( freeLinks.size() - polygon._polyLinks.size() );
3070 nbFreeLinks -= polygon._polyLinks.size();
3072 // an E_IntersectPoint used to mark nodes of coplanarPolyg
3073 // as lying on curFace while they are not at intersection with geometry
3074 ipTmp._faceIDs.resize(1);
3075 ipTmp._faceIDs[0] = curFace;
3077 // fill freeLinks with links not shared by coplanarPolyg and polygon
3078 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
3079 if ( polygon._links[ iL ]._link->_faces[1] &&
3080 polygon._links[ iL ]._link->_faces[0] != coplanarPolyg )
3082 _Face* p = polygon._links[ iL ]._link->_faces[0];
3083 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3084 if ( p->_links[ iL2 ]._link == polygon._links[ iL ]._link )
3086 freeLinks.push_back( & p->_links[ iL2 ] );
3088 freeLinks.back()->RemoveFace( &polygon );
3092 for ( size_t iL = 0; iL < coplanarPolyg->_links.size(); ++iL )
3093 if ( coplanarPolyg->_links[ iL ]._link->_faces[1] &&
3094 coplanarPolyg->_links[ iL ]._link->_faces[1] != &polygon )
3096 _Face* p = coplanarPolyg->_links[ iL ]._link->_faces[0];
3097 if ( p == coplanarPolyg )
3098 p = coplanarPolyg->_links[ iL ]._link->_faces[1];
3099 for ( size_t iL2 = 0; iL2 < p->_links.size(); ++iL2 )
3100 if ( p->_links[ iL2 ]._link == coplanarPolyg->_links[ iL ]._link )
3102 // set links of coplanarPolyg in place of used freeLinks
3103 // to re-create coplanarPolyg next
3105 for ( ; iL3 < freeLinks.size() && freeLinks[ iL3 ]; ++iL3 );
3106 if ( iL3 < freeLinks.size() )
3107 freeLinks[ iL3 ] = ( & p->_links[ iL2 ] );
3109 freeLinks.push_back( & p->_links[ iL2 ] );
3111 freeLinks[ iL3 ]->RemoveFace( coplanarPolyg );
3112 // mark nodes of coplanarPolyg as lying on curFace
3113 for ( int iN = 0; iN < 2; ++iN )
3115 _Node* n = freeLinks[ iL3 ]->_link->_nodes[ iN ];
3116 if ( n->_intPoint ) n->_intPoint->Add( ipTmp._faceIDs );
3117 else n->_intPoint = &ipTmp;
3122 // set coplanarPolyg to be re-created next
3123 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
3124 if ( coplanarPolyg == & _polygons[ iP ] )
3127 _polygons[ iPolygon ]._links.clear();
3128 _polygons[ iPolygon ]._polyLinks.clear();
3131 _polygons.pop_back();
3132 usedFaceIDs.erase( curFace );
3134 } // if ( coplanarPolyg )
3135 } // if ( hasEdgeIntersections ) - search for coplanarPolyg
3137 iPolygon = _polygons.size();
3139 } // end of case ( polygon._links.size() > 2 )
3140 } // while ( nbFreeLinks > 0 )
3142 // check volume size
3143 _hasTooSmall = ! checkPolyhedronSize( intFlag & IS_CUT_BY_INTERNAL_FACE );
3145 for ( size_t i = 0; i < 8; ++i )
3146 if ( _hexNodes[ i ]._intPoint == &ipTmp )
3147 _hexNodes[ i ]._intPoint = 0;
3150 return false; // too small volume
3152 // create a classic cell if possible
3155 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3156 nbPolygons += (_polygons[ iF ]._links.size() > 0 );
3158 //const int nbNodes = _nbCornerNodes + nbIntersections;
3160 for ( size_t i = 0; i < 8; ++i )
3161 nbNodes += _hexNodes[ i ].IsUsedInFace();
3162 for ( size_t i = 0; i < _intNodes.size(); ++i )
3163 nbNodes += _intNodes[ i ].IsUsedInFace();
3165 bool isClassicElem = false;
3166 if ( nbNodes == 8 && nbPolygons == 6 ) isClassicElem = addHexa();
3167 else if ( nbNodes == 4 && nbPolygons == 4 ) isClassicElem = addTetra();
3168 else if ( nbNodes == 6 && nbPolygons == 5 ) isClassicElem = addPenta();
3169 else if ( nbNodes == 5 && nbPolygons == 5 ) isClassicElem = addPyra ();
3170 if ( !isClassicElem )
3172 _volumeDefs._nodes.clear();
3173 _volumeDefs._quantities.clear();
3175 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
3177 const size_t nbLinks = _polygons[ iF ]._links.size();
3178 if ( nbLinks == 0 ) continue;
3179 _volumeDefs._quantities.push_back( nbLinks );
3180 for ( size_t iL = 0; iL < nbLinks; ++iL )
3181 _volumeDefs._nodes.push_back( _polygons[ iF ]._links[ iL ].FirstNode() );
3184 _volumeDefs._solidID = solid->ID();
3186 return !_volumeDefs._nodes.empty();
3188 //================================================================================
3190 * \brief Create elements in the mesh
3192 int Hexahedron::MakeElements(SMESH_MesherHelper& helper,
3193 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3195 SMESHDS_Mesh* mesh = helper.GetMeshDS();
3197 CellsAroundLink c( _grid, 0 );
3198 const size_t nbGridCells = c._nbCells[0] * c._nbCells[1] * c._nbCells[2];
3199 vector< Hexahedron* > allHexa( nbGridCells, 0 );
3202 // set intersection nodes from GridLine's to links of allHexa
3203 int i,j,k, cellIndex;
3204 for ( int iDir = 0; iDir < 3; ++iDir )
3206 // loop on GridLine's parallel to iDir
3207 LineIndexer lineInd = _grid->GetLineIndexer( iDir );
3208 CellsAroundLink fourCells( _grid, iDir );
3209 for ( ; lineInd.More(); ++lineInd )
3211 GridLine& line = _grid->_lines[ iDir ][ lineInd.LineIndex() ];
3212 multiset< F_IntersectPoint >::const_iterator ip = line._intPoints.begin();
3213 for ( ; ip != line._intPoints.end(); ++ip )
3215 // if ( !ip->_node ) continue; // intersection at a grid node
3216 lineInd.SetIndexOnLine( ip->_indexOnLine );
3217 fourCells.Init( lineInd.I(), lineInd.J(), lineInd.K() );
3218 for ( int iL = 0; iL < 4; ++iL ) // loop on 4 cells sharing a link
3220 if ( !fourCells.GetCell( iL, i,j,k, cellIndex ))
3222 Hexahedron *& hex = allHexa[ cellIndex ];
3225 hex = new Hexahedron( *this, i, j, k, cellIndex );
3228 const int iLink = iL + iDir * 4;
3229 hex->_hexLinks[iLink]._fIntPoints.push_back( &(*ip) );
3230 hex->_nbFaceIntNodes += bool( ip->_node );
3236 // implement geom edges into the mesh
3237 addEdges( helper, allHexa, edge2faceIDsMap );
3239 // add not split hexahedra to the mesh
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 solidID = getSolids()[0];
3278 mesh->SetMeshElementOnShape( el, solidID );
3282 if ( _grid->_toCreateFaces && _nbBndNodes >= 3 )
3284 boundaryVolumes.push_back( el );
3285 el->setIsMarked( true );
3288 else if ( _nbCornerNodes > 3 && !hex )
3290 // all intersection of hex with geometry are at grid nodes
3291 hex = new Hexahedron( *this, _i, _j, _k, i );
3292 intHexa.push_back( hex );
3296 // add elements resulted from hexadron intersection
3298 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, intHexa.size() ),
3299 ParallelHexahedron( intHexa ),
3300 tbb::simple_partitioner()); // ComputeElements() is called here
3301 for ( size_t i = 0; i < intHexa.size(); ++i )
3302 if ( Hexahedron * hex = intHexa[ i ] )
3303 nbAdded += hex->addVolumes( helper );
3305 for ( size_t i = 0; i < intHexa.size(); ++i )
3306 if ( Hexahedron * hex = intHexa[ i ] )
3308 hex->ComputeElements();
3309 nbAdded += hex->addVolumes( helper );
3313 // fill boundaryVolumes with volumes neighboring too small skipped volumes
3314 if ( _grid->_toCreateFaces )
3316 for ( size_t i = 0; i < intHexa.size(); ++i )
3317 if ( Hexahedron * hex = intHexa[ i ] )
3318 hex->getBoundaryElems( boundaryVolumes );
3321 // create boundary mesh faces
3322 addFaces( helper, boundaryVolumes );
3324 // create mesh edges
3325 addSegments( helper, edge2faceIDsMap );
3327 for ( size_t i = 0; i < allHexa.size(); ++i )
3329 delete allHexa[ i ];
3334 //================================================================================
3336 * \brief Implements geom edges into the mesh
3338 void Hexahedron::addEdges(SMESH_MesherHelper& helper,
3339 vector< Hexahedron* >& hexes,
3340 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap)
3342 if ( edge2faceIDsMap.empty() ) return;
3344 // Prepare planes for intersecting with EDGEs
3347 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ ) // iDirZ gives normal direction to planes
3349 GridPlanes& planes = pln[ iDirZ ];
3350 int iDirX = ( iDirZ + 1 ) % 3;
3351 int iDirY = ( iDirZ + 2 ) % 3;
3352 planes._zNorm = ( _grid->_axes[ iDirX ] ^ _grid->_axes[ iDirY ] ).Normalized();
3353 planes._zProjs.resize ( _grid->_coords[ iDirZ ].size() );
3354 planes._zProjs [0] = 0;
3355 const double zFactor = _grid->_axes[ iDirZ ] * planes._zNorm;
3356 const vector< double > & u = _grid->_coords[ iDirZ ];
3357 for ( size_t i = 1; i < planes._zProjs.size(); ++i )
3359 planes._zProjs [i] = zFactor * ( u[i] - u[0] );
3363 const double deflection = _grid->_minCellSize / 20.;
3364 const double tol = _grid->_tol;
3365 E_IntersectPoint ip;
3367 TColStd_MapOfInteger intEdgeIDs; // IDs of not shared INTERNAL EDGES
3369 // Intersect EDGEs with the planes
3370 map< TGeomID, vector< TGeomID > >::const_iterator e2fIt = edge2faceIDsMap.begin();
3371 for ( ; e2fIt != edge2faceIDsMap.end(); ++e2fIt )
3373 const TGeomID edgeID = e2fIt->first;
3374 const TopoDS_Edge & E = TopoDS::Edge( _grid->Shape( edgeID ));
3375 BRepAdaptor_Curve curve( E );
3376 TopoDS_Vertex v1 = helper.IthVertex( 0, E, false );
3377 TopoDS_Vertex v2 = helper.IthVertex( 1, E, false );
3379 ip._faceIDs = e2fIt->second;
3380 ip._shapeID = edgeID;
3382 bool isInternal = ( ip._faceIDs.size() == 1 && _grid->IsInternal( edgeID ));
3385 intEdgeIDs.Add( edgeID );
3386 intEdgeIDs.Add( _grid->ShapeID( v1 ));
3387 intEdgeIDs.Add( _grid->ShapeID( v2 ));
3390 // discretize the EDGE
3391 GCPnts_UniformDeflection discret( curve, deflection, true );
3392 if ( !discret.IsDone() || discret.NbPoints() < 2 )
3395 // perform intersection
3396 E_IntersectPoint* eip, *vip;
3397 for ( int iDirZ = 0; iDirZ < 3; ++iDirZ )
3399 GridPlanes& planes = pln[ iDirZ ];
3400 int iDirX = ( iDirZ + 1 ) % 3;
3401 int iDirY = ( iDirZ + 2 ) % 3;
3402 double xLen = _grid->_coords[ iDirX ].back() - _grid->_coords[ iDirX ][0];
3403 double yLen = _grid->_coords[ iDirY ].back() - _grid->_coords[ iDirY ][0];
3404 double zLen = _grid->_coords[ iDirZ ].back() - _grid->_coords[ iDirZ ][0];
3405 int dIJK[3], d000[3] = { 0,0,0 };
3406 double o[3] = { _grid->_coords[0][0],
3407 _grid->_coords[1][0],
3408 _grid->_coords[2][0] };
3410 // locate the 1st point of a segment within the grid
3411 gp_XYZ p1 = discret.Value( 1 ).XYZ();
3412 double u1 = discret.Parameter( 1 );
3413 double zProj1 = planes._zNorm * ( p1 - _grid->_origin );
3415 _grid->ComputeUVW( p1, ip._uvw );
3416 int iX1 = int(( ip._uvw[iDirX] - o[iDirX]) / xLen * (_grid->_coords[ iDirX ].size() - 1));
3417 int iY1 = int(( ip._uvw[iDirY] - o[iDirY]) / yLen * (_grid->_coords[ iDirY ].size() - 1));
3418 int iZ1 = int(( ip._uvw[iDirZ] - o[iDirZ]) / zLen * (_grid->_coords[ iDirZ ].size() - 1));
3419 locateValue( iX1, ip._uvw[iDirX], _grid->_coords[ iDirX ], dIJK[ iDirX ], tol );
3420 locateValue( iY1, ip._uvw[iDirY], _grid->_coords[ iDirY ], dIJK[ iDirY ], tol );
3421 locateValue( iZ1, ip._uvw[iDirZ], _grid->_coords[ iDirZ ], dIJK[ iDirZ ], tol );
3423 int ijk[3]; // grid index where a segment intersects a plane
3428 // add the 1st vertex point to a hexahedron
3432 ip._shapeID = _grid->ShapeID( v1 );
3433 vip = _grid->Add( ip );
3435 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3436 if ( !addIntersection( vip, hexes, ijk, d000 ))
3437 _grid->Remove( vip );
3438 ip._shapeID = edgeID;
3440 for ( int iP = 2; iP <= discret.NbPoints(); ++iP )
3442 // locate the 2nd point of a segment within the grid
3443 gp_XYZ p2 = discret.Value( iP ).XYZ();
3444 double u2 = discret.Parameter( iP );
3445 double zProj2 = planes._zNorm * ( p2 - _grid->_origin );
3447 if ( Abs( zProj2 - zProj1 ) > std::numeric_limits<double>::min() )
3449 locateValue( iZ2, zProj2, planes._zProjs, dIJK[ iDirZ ], tol );
3451 // treat intersections with planes between 2 end points of a segment
3452 int dZ = ( iZ1 <= iZ2 ) ? +1 : -1;
3453 int iZ = iZ1 + ( iZ1 < iZ2 );
3454 for ( int i = 0, nb = Abs( iZ1 - iZ2 ); i < nb; ++i, iZ += dZ )
3456 ip._point = findIntPoint( u1, zProj1, u2, zProj2,
3457 planes._zProjs[ iZ ],
3458 curve, planes._zNorm, _grid->_origin );
3459 _grid->ComputeUVW( ip._point.XYZ(), ip._uvw );
3460 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3461 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3464 // add ip to hex "above" the plane
3465 eip = _grid->Add( ip );
3467 eip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3469 bool added = addIntersection( eip, hexes, ijk, dIJK);
3471 // add ip to hex "below" the plane
3472 ijk[ iDirZ ] = iZ-1;
3473 if ( !addIntersection( eip, hexes, ijk, dIJK ) &&
3475 _grid->Remove( eip );
3483 // add the 2nd vertex point to a hexahedron
3487 ip._shapeID = _grid->ShapeID( v2 );
3488 _grid->ComputeUVW( p1, ip._uvw );
3489 locateValue( ijk[iDirX], ip._uvw[iDirX], _grid->_coords[iDirX], dIJK[iDirX], tol );
3490 locateValue( ijk[iDirY], ip._uvw[iDirY], _grid->_coords[iDirY], dIJK[iDirY], tol );
3492 bool sameV = ( v1.IsSame( v2 ));
3494 vip = _grid->Add( ip );
3495 if ( isInternal && !sameV )
3496 vip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3497 if ( !addIntersection( vip, hexes, ijk, d000 ) && !sameV )
3498 _grid->Remove( vip );
3499 ip._shapeID = edgeID;
3501 } // loop on 3 grid directions
3505 if ( intEdgeIDs.Size() > 0 )
3506 cutByExtendedInternal( hexes, intEdgeIDs );
3511 //================================================================================
3513 * \brief Fully cut hexes that are partially cut by INTERNAL FACE.
3514 * Cut them by extended INTERNAL FACE.
3516 void Hexahedron::cutByExtendedInternal( std::vector< Hexahedron* >& hexes,
3517 const TColStd_MapOfInteger& intEdgeIDs )
3519 IntAna_IntConicQuad intersection;
3520 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
3521 const double tol2 = _grid->_tol * _grid->_tol;
3523 for ( size_t iH = 0; iH < hexes.size(); ++iH )
3525 Hexahedron* hex = hexes[ iH ];
3526 if ( !hex || hex->_eIntPoints.size() < 2 )
3528 if ( !intEdgeIDs.Contains( hex->_eIntPoints.back()->_shapeID ))
3531 // get 3 points on INTERNAL FACE to construct a cutting plane
3532 gp_Pnt p1 = hex->_eIntPoints[0]->_point;
3533 gp_Pnt p2 = hex->_eIntPoints[1]->_point;
3534 gp_Pnt p3 = hex->mostDistantInternalPnt( iH, p1, p2 );
3536 gp_Vec norm = gp_Vec( p1, p2 ) ^ gp_Vec( p1, p3 );
3539 pln = gp_Pln( p1, norm );
3546 TGeomID intFaceID = hex->_eIntPoints.back()->_faceIDs.front(); // FACE being "extended"
3547 TGeomID solidID = _grid->GetSolid( intFaceID )->ID();
3549 // cut links by the plane
3550 //bool isCut = false;
3551 for ( int iLink = 0; iLink < 12; ++iLink )
3553 _Link& link = hex->_hexLinks[ iLink ];
3554 if ( !link._fIntPoints.empty() )
3556 // if ( link._fIntPoints[0]->_faceIDs.back() == _grid->PseudoIntExtFaceID() )
3558 continue; // already cut link
3560 if ( !link._nodes[0]->Node() ||
3561 !link._nodes[1]->Node() )
3562 continue; // outside link
3564 if ( link._nodes[0]->IsOnFace( intFaceID ))
3566 if ( link._nodes[0]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3567 if ( p1.SquareDistance( link._nodes[0]->Point() ) < tol2 ||
3568 p2.SquareDistance( link._nodes[0]->Point() ) < tol2 )
3569 link._nodes[0]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3570 continue; // link is cut by FACE being "extended"
3572 if ( link._nodes[1]->IsOnFace( intFaceID ))
3574 if ( link._nodes[1]->_intPoint->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3575 if ( p1.SquareDistance( link._nodes[1]->Point() ) < tol2 ||
3576 p2.SquareDistance( link._nodes[1]->Point() ) < tol2 )
3577 link._nodes[1]->_intPoint->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3578 continue; // link is cut by FACE being "extended"
3580 gp_Pnt p4 = link._nodes[0]->Point();
3581 gp_Pnt p5 = link._nodes[1]->Point();
3582 gp_Lin line( p4, gp_Vec( p4, p5 ));
3584 intersection.Perform( line, pln );
3585 if ( !intersection.IsDone() ||
3586 intersection.IsInQuadric() ||
3587 intersection.IsParallel() ||
3588 intersection.NbPoints() < 1 )
3591 double u = intersection.ParamOnConic(1);
3592 if ( u + _grid->_tol < 0 )
3594 int iDir = iLink / 4;
3595 int index = (&hex->_i)[iDir];
3596 double linkLen = _grid->_coords[iDir][index+1] - _grid->_coords[iDir][index];
3597 if ( u - _grid->_tol > linkLen )
3600 if ( u < _grid->_tol ||
3601 u > linkLen - _grid->_tol ) // intersection at grid node
3603 int i = ! ( u < _grid->_tol ); // [0,1]
3604 int iN = link._nodes[ i ] - hex->_hexNodes; // [0-7]
3606 const F_IntersectPoint * & ip = _grid->_gridIntP[ hex->_origNodeInd + _nodeShift[iN] ];
3609 ip = _grid->_extIntPool.getNew();
3610 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3611 //ip->_transition = Trans_INTERNAL;
3613 else if ( ip->_faceIDs.back() != _grid->PseudoIntExtFaceID() )
3615 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3617 hex->_nbFaceIntNodes++;
3622 const gp_Pnt& p = intersection.Point( 1 );
3623 F_IntersectPoint* ip = _grid->_extIntPool.getNew();
3624 ip->_node = meshDS->AddNode( p.X(), p.Y(), p.Z() );
3625 ip->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3626 ip->_transition = Trans_INTERNAL;
3627 meshDS->SetNodeInVolume( ip->_node, solidID );
3629 CellsAroundLink fourCells( _grid, iDir );
3630 fourCells.Init( hex->_i, hex->_j, hex->_k, iLink );
3631 int i,j,k, cellIndex;
3632 for ( int iC = 0; iC < 4; ++iC ) // loop on 4 cells sharing the link
3634 if ( !fourCells.GetCell( iC, i,j,k, cellIndex ))
3636 Hexahedron * h = hexes[ cellIndex ];
3638 h = hexes[ cellIndex ] = new Hexahedron( *this, i, j, k, cellIndex );
3639 const int iL = iC + iDir * 4;
3640 h->_hexLinks[iL]._fIntPoints.push_back( ip );
3641 h->_nbFaceIntNodes++;
3648 // for ( size_t i = 0; i < hex->_eIntPoints.size(); ++i )
3650 // if ( _grid->IsInternal( hex->_eIntPoints[i]->_shapeID ) &&
3651 // ! hex->_eIntPoints[i]->IsOnFace( _grid->PseudoIntExtFaceID() ))
3652 // hex->_eIntPoints[i]->_faceIDs.push_back( _grid->PseudoIntExtFaceID() );
3656 } // loop on all hexes
3660 //================================================================================
3662 * \brief Return intersection point on INTERNAL FACE most distant from given ones
3664 gp_Pnt Hexahedron::mostDistantInternalPnt( int hexIndex, const gp_Pnt& p1, const gp_Pnt& p2 )
3666 gp_Pnt resultPnt = p1;
3668 double maxDist2 = 0;
3669 for ( int iLink = 0; iLink < 12; ++iLink ) // check links
3671 _Link& link = _hexLinks[ iLink ];
3672 for ( size_t i = 0; i < link._fIntPoints.size(); ++i )
3673 if ( _grid->PseudoIntExtFaceID() != link._fIntPoints[i]->_faceIDs[0] &&
3674 _grid->IsInternal( link._fIntPoints[i]->_faceIDs[0] ) &&
3675 link._fIntPoints[i]->_node )
3677 gp_Pnt p = SMESH_NodeXYZ( link._fIntPoints[i]->_node );
3678 double d = p1.SquareDistance( p );
3686 d = p2.SquareDistance( p );
3696 _origNodeInd = _grid->NodeIndex( _i,_j,_k );
3698 for ( size_t iN = 0; iN < 8; ++iN ) // check corners
3700 _hexNodes[iN]._node = _grid->_nodes [ _origNodeInd + _nodeShift[iN] ];
3701 _hexNodes[iN]._intPoint = _grid->_gridIntP[ _origNodeInd + _nodeShift[iN] ];
3702 if ( _hexNodes[iN]._intPoint )
3703 for ( size_t iF = 0; iF < _hexNodes[iN]._intPoint->_faceIDs.size(); ++iF )
3705 if ( _grid->IsInternal( _hexNodes[iN]._intPoint->_faceIDs[iF]))
3707 gp_Pnt p = SMESH_NodeXYZ( _hexNodes[iN]._node );
3708 double d = p1.SquareDistance( p );
3716 d = p2.SquareDistance( p );
3726 if ( maxDist2 < _grid->_tol * _grid->_tol )
3732 //================================================================================
3734 * \brief Finds intersection of a curve with a plane
3735 * \param [in] u1 - parameter of one curve point
3736 * \param [in] proj1 - projection of the curve point to the plane normal
3737 * \param [in] u2 - parameter of another curve point
3738 * \param [in] proj2 - projection of the other curve point to the plane normal
3739 * \param [in] proj - projection of a point where the curve intersects the plane
3740 * \param [in] curve - the curve
3741 * \param [in] axis - the plane normal
3742 * \param [in] origin - the plane origin
3743 * \return gp_Pnt - the found intersection point
3745 gp_Pnt Hexahedron::findIntPoint( double u1, double proj1,
3746 double u2, double proj2,
3748 BRepAdaptor_Curve& curve,
3750 const gp_XYZ& origin)
3752 double r = (( proj - proj1 ) / ( proj2 - proj1 ));
3753 double u = u1 * ( 1 - r ) + u2 * r;
3754 gp_Pnt p = curve.Value( u );
3755 double newProj = axis * ( p.XYZ() - origin );
3756 if ( Abs( proj - newProj ) > _grid->_tol / 10. )
3759 return findIntPoint( u2, proj2, u, newProj, proj, curve, axis, origin );
3761 return findIntPoint( u1, proj2, u, newProj, proj, curve, axis, origin );
3766 //================================================================================
3768 * \brief Returns indices of a hexahedron sub-entities holding a point
3769 * \param [in] ip - intersection point
3770 * \param [out] facets - 0-3 facets holding a point
3771 * \param [out] sub - index of a vertex or an edge holding a point
3772 * \return int - number of facets holding a point
3774 int Hexahedron::getEntity( const E_IntersectPoint* ip, int* facets, int& sub )
3776 enum { X = 1, Y = 2, Z = 4 }; // == 001, 010, 100
3778 int vertex = 0, edgeMask = 0;
3780 if ( Abs( _grid->_coords[0][ _i ] - ip->_uvw[0] ) < _grid->_tol ) {
3781 facets[ nbFacets++ ] = SMESH_Block::ID_F0yz;
3784 else if ( Abs( _grid->_coords[0][ _i+1 ] - ip->_uvw[0] ) < _grid->_tol ) {
3785 facets[ nbFacets++ ] = SMESH_Block::ID_F1yz;
3789 if ( Abs( _grid->_coords[1][ _j ] - ip->_uvw[1] ) < _grid->_tol ) {
3790 facets[ nbFacets++ ] = SMESH_Block::ID_Fx0z;
3793 else if ( Abs( _grid->_coords[1][ _j+1 ] - ip->_uvw[1] ) < _grid->_tol ) {
3794 facets[ nbFacets++ ] = SMESH_Block::ID_Fx1z;
3798 if ( Abs( _grid->_coords[2][ _k ] - ip->_uvw[2] ) < _grid->_tol ) {
3799 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy0;
3802 else if ( Abs( _grid->_coords[2][ _k+1 ] - ip->_uvw[2] ) < _grid->_tol ) {
3803 facets[ nbFacets++ ] = SMESH_Block::ID_Fxy1;
3810 case 0: sub = 0; break;
3811 case 1: sub = facets[0]; break;
3813 const int edge [3][8] = {
3814 { SMESH_Block::ID_E00z, SMESH_Block::ID_E10z,
3815 SMESH_Block::ID_E01z, SMESH_Block::ID_E11z },
3816 { SMESH_Block::ID_E0y0, SMESH_Block::ID_E1y0, 0, 0,
3817 SMESH_Block::ID_E0y1, SMESH_Block::ID_E1y1 },
3818 { SMESH_Block::ID_Ex00, 0, SMESH_Block::ID_Ex10, 0,
3819 SMESH_Block::ID_Ex01, 0, SMESH_Block::ID_Ex11 }
3821 switch ( edgeMask ) {
3822 case X | Y: sub = edge[ 0 ][ vertex ]; break;
3823 case X | Z: sub = edge[ 1 ][ vertex ]; break;
3824 default: sub = edge[ 2 ][ vertex ];
3830 sub = vertex + SMESH_Block::ID_FirstV;
3835 //================================================================================
3837 * \brief Adds intersection with an EDGE
3839 bool Hexahedron::addIntersection( const E_IntersectPoint* ip,
3840 vector< Hexahedron* >& hexes,
3841 int ijk[], int dIJK[] )
3845 size_t hexIndex[4] = {
3846 _grid->CellIndex( ijk[0], ijk[1], ijk[2] ),
3847 dIJK[0] ? _grid->CellIndex( ijk[0]+dIJK[0], ijk[1], ijk[2] ) : -1,
3848 dIJK[1] ? _grid->CellIndex( ijk[0], ijk[1]+dIJK[1], ijk[2] ) : -1,
3849 dIJK[2] ? _grid->CellIndex( ijk[0], ijk[1], ijk[2]+dIJK[2] ) : -1
3851 for ( int i = 0; i < 4; ++i )
3853 if ( hexIndex[i] < hexes.size() && hexes[ hexIndex[i] ] )
3855 Hexahedron* h = hexes[ hexIndex[i] ];
3856 h->_eIntPoints.reserve(2);
3857 h->_eIntPoints.push_back( ip );
3860 // check if ip is really inside the hex
3861 if ( h->isOutParam( ip->_uvw ))
3862 throw SALOME_Exception("ip outside a hex");
3868 //================================================================================
3870 * \brief Finds nodes at a path from one node to another via intersections with EDGEs
3872 bool Hexahedron::findChain( _Node* n1,
3875 vector<_Node*>& chn )
3878 chn.push_back( n1 );
3879 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3880 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3881 n1->IsLinked( quad._eIntNodes[ iP ]->_intPoint ) &&
3882 n2->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3884 chn.push_back( quad._eIntNodes[ iP ]);
3885 chn.push_back( n2 );
3886 quad._eIntNodes[ iP ]->_usedInFace = &quad;
3893 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3894 if ( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad ) &&
3895 chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint ))
3897 chn.push_back( quad._eIntNodes[ iP ]);
3898 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
3901 } while ( found && ! chn.back()->IsLinked( n2->_intPoint ) );
3903 if ( chn.back() != n2 && chn.back()->IsLinked( n2->_intPoint ))
3904 chn.push_back( n2 );
3906 return chn.size() > 1;
3908 //================================================================================
3910 * \brief Try to heal a polygon whose ends are not connected
3912 bool Hexahedron::closePolygon( _Face* polygon, vector<_Node*>& chainNodes ) const
3914 int i = -1, nbLinks = polygon->_links.size();
3917 vector< _OrientedLink > newLinks;
3918 // find a node lying on the same FACE as the last one
3919 _Node* node = polygon->_links.back().LastNode();
3920 int avoidFace = node->IsLinked( polygon->_links.back().FirstNode()->_intPoint );
3921 for ( i = nbLinks - 2; i >= 0; --i )
3922 if ( node->IsLinked( polygon->_links[i].FirstNode()->_intPoint, avoidFace ))
3926 for ( ; i < nbLinks; ++i )
3927 newLinks.push_back( polygon->_links[i] );
3931 // find a node lying on the same FACE as the first one
3932 node = polygon->_links[0].FirstNode();
3933 avoidFace = node->IsLinked( polygon->_links[0].LastNode()->_intPoint );
3934 for ( i = 1; i < nbLinks; ++i )
3935 if ( node->IsLinked( polygon->_links[i].LastNode()->_intPoint, avoidFace ))
3938 for ( nbLinks = i + 1, i = 0; i < nbLinks; ++i )
3939 newLinks.push_back( polygon->_links[i] );
3941 if ( newLinks.size() > 1 )
3943 polygon->_links.swap( newLinks );
3945 chainNodes.push_back( polygon->_links.back().LastNode() );
3946 chainNodes.push_back( polygon->_links[0].FirstNode() );
3951 //================================================================================
3953 * \brief Finds nodes on the same EDGE as the first node of avoidSplit.
3955 * This function is for
3956 * 1) a case where an EDGE lies on a quad which lies on a FACE
3957 * so that a part of quad in ON and another part is IN
3958 * 2) INTERNAL FACE passes through the 1st node of avoidSplit
3960 bool Hexahedron::findChainOnEdge( const vector< _OrientedLink >& splits,
3961 const _OrientedLink& prevSplit,
3962 const _OrientedLink& avoidSplit,
3965 vector<_Node*>& chn )
3967 _Node* pn1 = prevSplit.FirstNode();
3968 _Node* pn2 = prevSplit.LastNode();
3969 int avoidFace = pn1->IsLinked( pn2->_intPoint ); // FACE under the quad
3970 if ( avoidFace < 1 && pn1->_intPoint )
3973 _Node* n = 0, *stopNode = avoidSplit.LastNode();
3976 if ( !quad._eIntNodes.empty() ) // connect pn2 with EDGE intersections
3978 chn.push_back( pn2 );
3983 for ( size_t iP = 0; iP < quad._eIntNodes.size(); ++iP )
3984 if (( !quad._eIntNodes[ iP ]->IsUsedInFace( &quad )) &&
3985 ( chn.back()->IsLinked( quad._eIntNodes[ iP ]->_intPoint, avoidFace )) &&
3986 ( !avoidFace || quad._eIntNodes[ iP ]->IsOnFace( avoidFace )))
3988 chn.push_back( quad._eIntNodes[ iP ]);
3989 found = ( quad._eIntNodes[ iP ]->_usedInFace = &quad );
3997 for ( i = splits.size()-1; i >= 0; --i ) // connect new pn2 (at _eIntNodes) with a split
4002 n = splits[i].LastNode();
4003 if ( n == stopNode )
4006 ( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4007 ( !avoidFace || n->IsOnFace( avoidFace )))
4010 n = splits[i].FirstNode();
4011 if ( n == stopNode )
4013 if (( n->IsLinked( pn2->_intPoint, avoidFace )) &&
4014 ( !avoidFace || n->IsOnFace( avoidFace )))
4018 if ( n && n != stopNode )
4021 chn.push_back( pn2 );
4026 else if ( !chn.empty() && chn.back()->_isInternalFlags )
4028 // INTERNAL FACE partially cuts the quad
4029 for ( int i = chn.size() - 2; i >= 0; --i )
4030 chn.push_back( chn[ i ]);
4035 //================================================================================
4037 * \brief Checks transition at the ginen intersection node of a link
4039 bool Hexahedron::isOutPoint( _Link& link, int iP,
4040 SMESH_MesherHelper& helper, const Solid* solid ) const
4044 if ( link._fIntNodes[iP]->faces().size() == 1 &&
4045 _grid->IsInternal( link._fIntNodes[iP]->face(0) ))
4048 const bool moreIntPoints = ( iP+1 < (int) link._fIntNodes.size() );
4051 _Node* n1 = link._fIntNodes[ iP ];
4053 n1 = link._nodes[0];
4054 _Node* n2 = moreIntPoints ? link._fIntNodes[ iP+1 ] : 0;
4055 if ( !n2 || !n2->Node() )
4056 n2 = link._nodes[1];
4060 // get all FACEs under n1 and n2
4061 set< TGeomID > faceIDs;
4062 if ( moreIntPoints ) faceIDs.insert( link._fIntNodes[iP+1]->faces().begin(),
4063 link._fIntNodes[iP+1]->faces().end() );
4064 if ( n2->_intPoint ) faceIDs.insert( n2->_intPoint->_faceIDs.begin(),
4065 n2->_intPoint->_faceIDs.end() );
4066 if ( faceIDs.empty() )
4067 return false; // n2 is inside
4068 if ( n1->_intPoint ) faceIDs.insert( n1->_intPoint->_faceIDs.begin(),
4069 n1->_intPoint->_faceIDs.end() );
4070 faceIDs.insert( link._fIntNodes[iP]->faces().begin(),
4071 link._fIntNodes[iP]->faces().end() );
4073 // get a point between 2 nodes
4074 gp_Pnt p1 = n1->Point();
4075 gp_Pnt p2 = n2->Point();
4076 gp_Pnt pOnLink = 0.8 * p1.XYZ() + 0.2 * p2.XYZ();
4078 TopLoc_Location loc;
4080 set< TGeomID >::iterator faceID = faceIDs.begin();
4081 for ( ; faceID != faceIDs.end(); ++faceID )
4083 // project pOnLink on a FACE
4084 if ( *faceID < 1 || !solid->Contains( *faceID )) continue;
4085 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( *faceID ));
4086 GeomAPI_ProjectPointOnSurf& proj = helper.GetProjector( face, loc, 0.1*_grid->_tol );
4087 gp_Pnt testPnt = pOnLink.Transformed( loc.Transformation().Inverted() );
4088 proj.Perform( testPnt );
4089 if ( proj.IsDone() && proj.NbPoints() > 0 )
4092 proj.LowerDistanceParameters( u,v );
4094 if ( proj.LowerDistance() <= 0.1 * _grid->_tol )
4100 // find isOut by normals
4102 if ( GeomLib::NormEstim( BRep_Tool::Surface( face, loc ),
4107 if ( solid->Orientation( face ) == TopAbs_REVERSED )
4109 gp_Vec v( proj.NearestPoint(), testPnt );
4110 isOut = ( v * normal > 0 );
4115 // classify a projection
4116 if ( !n1->IsOnFace( *faceID ) || !n2->IsOnFace( *faceID ))
4118 BRepTopAdaptor_FClass2d cls( face, Precision::Confusion() );
4119 TopAbs_State state = cls.Perform( gp_Pnt2d( u,v ));
4120 if ( state == TopAbs_OUT )
4132 //================================================================================
4134 * \brief Sort nodes on a FACE
4136 void Hexahedron::sortVertexNodes(vector<_Node*>& nodes, _Node* curNode, TGeomID faceID)
4138 if ( nodes.size() > 20 ) return;
4140 // get shapes under nodes
4141 TGeomID nShapeIds[20], *nShapeIdsEnd = &nShapeIds[0] + nodes.size();
4142 for ( size_t i = 0; i < nodes.size(); ++i )
4143 if ( !( nShapeIds[i] = nodes[i]->ShapeID() ))
4146 // get shapes of the FACE
4147 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( faceID ));
4148 list< TopoDS_Edge > edges;
4149 list< int > nbEdges;
4150 int nbW = SMESH_Block::GetOrderedEdges (face, edges, nbEdges);
4152 // select a WIRE - remove EDGEs of irrelevant WIREs from edges
4153 list< TopoDS_Edge >::iterator e = edges.begin(), eEnd = e;
4154 list< int >::iterator nE = nbEdges.begin();
4155 for ( ; nbW > 0; ++nE, --nbW )
4157 std::advance( eEnd, *nE );
4158 for ( ; e != eEnd; ++e )
4159 for ( int i = 0; i < 2; ++i )
4162 _grid->ShapeID( *e ) :
4163 _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ));
4165 ( std::find( &nShapeIds[0], nShapeIdsEnd, id ) != nShapeIdsEnd ))
4167 edges.erase( eEnd, edges.end() ); // remove rest wires
4168 e = eEnd = edges.end();
4175 edges.erase( edges.begin(), eEnd ); // remove a current irrelevant wire
4178 // rotate edges to have the first one at least partially out of the hexa
4179 list< TopoDS_Edge >::iterator e = edges.begin(), eMidOut = edges.end();
4180 for ( ; e != edges.end(); ++e )
4182 if ( !_grid->ShapeID( *e ))
4187 for ( int i = 0; i < 2 && !isOut; ++i )
4191 TopoDS_Vertex v = SMESH_MesherHelper::IthVertex( 0, *e );
4192 p = BRep_Tool::Pnt( v );
4194 else if ( eMidOut == edges.end() )
4196 TopLoc_Location loc;
4197 Handle(Geom_Curve) c = BRep_Tool::Curve( *e, loc, f, l);
4198 if ( c.IsNull() ) break;
4199 p = c->Value( 0.5 * ( f + l )).Transformed( loc );
4206 _grid->ComputeUVW( p.XYZ(), uvw );
4207 if ( isOutParam( uvw ))
4218 if ( e != edges.end() )
4219 edges.splice( edges.end(), edges, edges.begin(), e );
4220 else if ( eMidOut != edges.end() )
4221 edges.splice( edges.end(), edges, edges.begin(), eMidOut );
4223 // sort nodes according to the order of edges
4224 _Node* orderNodes [20];
4225 //TGeomID orderShapeIDs[20];
4227 TGeomID id, *pID = 0;
4228 for ( e = edges.begin(); e != edges.end(); ++e )
4230 if (( id = _grid->ShapeID( SMESH_MesherHelper::IthVertex( 0, *e ))) &&
4231 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4233 //orderShapeIDs[ nbN ] = id;
4234 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4237 if (( id = _grid->ShapeID( *e )) &&
4238 (( pID = std::find( &nShapeIds[0], nShapeIdsEnd, id )) != nShapeIdsEnd ))
4240 //orderShapeIDs[ nbN ] = id;
4241 orderNodes [ nbN++ ] = nodes[ pID - &nShapeIds[0] ];
4245 if ( nbN != nodes.size() )
4248 bool reverse = ( orderNodes[0 ]->Point().SquareDistance( curNode->Point() ) >
4249 orderNodes[nbN-1]->Point().SquareDistance( curNode->Point() ));
4251 for ( size_t i = 0; i < nodes.size(); ++i )
4252 nodes[ i ] = orderNodes[ reverse ? nbN-1-i : i ];
4255 //================================================================================
4257 * \brief Adds computed elements to the mesh
4259 int Hexahedron::addVolumes( SMESH_MesherHelper& helper )
4261 F_IntersectPoint noIntPnt;
4262 const bool toCheckNodePos = _grid->IsToCheckNodePos();
4265 // add elements resulted from hexahedron intersection
4266 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
4268 vector< const SMDS_MeshNode* > nodes( volDef->_nodes.size() );
4269 for ( size_t iN = 0; iN < nodes.size(); ++iN )
4271 if ( !( nodes[iN] = volDef->_nodes[iN].Node() ))
4273 if ( const E_IntersectPoint* eip = volDef->_nodes[iN].EdgeIntPnt() )
4275 nodes[iN] = volDef->_nodes[iN]._intPoint->_node =
4276 helper.AddNode( eip->_point.X(),
4279 if ( _grid->ShapeType( eip->_shapeID ) == TopAbs_VERTEX )
4280 helper.GetMeshDS()->SetNodeOnVertex( nodes[iN], eip->_shapeID );
4282 helper.GetMeshDS()->SetNodeOnEdge( nodes[iN], eip->_shapeID );
4285 throw SALOME_Exception("Bug: no node at intersection point");
4287 else if ( volDef->_nodes[iN]._intPoint &&
4288 volDef->_nodes[iN]._intPoint->_node == volDef->_nodes[iN]._node )
4290 // Update position of node at EDGE intersection;
4291 // see comment to _Node::Add( E_IntersectPoint )
4292 SMESHDS_Mesh* mesh = helper.GetMeshDS();
4293 TGeomID shapeID = volDef->_nodes[iN].EdgeIntPnt()->_shapeID;
4294 mesh->UnSetNodeOnShape( nodes[iN] );
4295 if ( _grid->ShapeType( shapeID ) == TopAbs_VERTEX )
4296 mesh->SetNodeOnVertex( nodes[iN], shapeID );
4298 mesh->SetNodeOnEdge( nodes[iN], shapeID );
4300 else if ( toCheckNodePos &&
4301 !nodes[iN]->isMarked() &&
4302 _grid->ShapeType( nodes[iN]->GetShapeID() ) == TopAbs_FACE )
4304 _grid->SetOnShape( nodes[iN], noIntPnt, /*unset=*/true );
4305 nodes[iN]->setIsMarked( true );
4309 const SMDS_MeshElement* v = 0;
4310 if ( !volDef->_quantities.empty() )
4312 v = helper.AddPolyhedralVolume( nodes, volDef->_quantities );
4316 switch ( nodes.size() )
4318 case 8: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],
4319 nodes[4],nodes[5],nodes[6],nodes[7] );
4321 case 4: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3] );
4323 case 6: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4],nodes[5] );
4325 case 5: v = helper.AddVolume( nodes[0],nodes[1],nodes[2],nodes[3],nodes[4] );
4329 if (( volDef->_volume = v ))
4331 helper.GetMeshDS()->SetMeshElementOnShape( v, volDef->_solidID );
4338 //================================================================================
4340 * \brief Return true if the element is in a hole
4342 bool Hexahedron::isInHole() const
4344 if ( !_vIntNodes.empty() )
4347 const size_t ijk[3] = { _i, _j, _k };
4348 F_IntersectPoint curIntPnt;
4350 // consider a cell to be in a hole if all links in any direction
4351 // comes OUT of geometry
4352 for ( int iDir = 0; iDir < 3; ++iDir )
4354 const vector<double>& coords = _grid->_coords[ iDir ];
4355 LineIndexer li = _grid->GetLineIndexer( iDir );
4356 li.SetIJK( _i,_j,_k );
4357 size_t lineIndex[4] = { li.LineIndex (),
4361 bool allLinksOut = true, hasLinks = false;
4362 for ( int iL = 0; iL < 4 && allLinksOut; ++iL ) // loop on 4 links parallel to iDir
4364 const _Link& link = _hexLinks[ iL + 4*iDir ];
4365 // check transition of the first node of a link
4366 const F_IntersectPoint* firstIntPnt = 0;
4367 if ( link._nodes[0]->Node() ) // 1st node is a hexa corner
4369 curIntPnt._paramOnLine = coords[ ijk[ iDir ]] - coords[0] + _grid->_tol;
4370 const GridLine& line = _grid->_lines[ iDir ][ lineIndex[ iL ]];
4371 multiset< F_IntersectPoint >::const_iterator ip =
4372 line._intPoints.upper_bound( curIntPnt );
4374 firstIntPnt = &(*ip);
4376 else if ( !link._fIntPoints.empty() )
4378 firstIntPnt = link._fIntPoints[0];
4384 allLinksOut = ( firstIntPnt->_transition == Trans_OUT &&
4385 !_grid->IsShared( firstIntPnt->_faceIDs[0] ));
4388 if ( hasLinks && allLinksOut )
4394 //================================================================================
4396 * \brief Check if a polyherdon has an edge lying on EDGE shared by strange FACE
4397 * that will be meshed by other algo
4399 bool Hexahedron::hasStrangeEdge() const
4401 if ( _eIntPoints.size() < 2 )
4404 TopTools_MapOfShape edges;
4405 for ( size_t i = 0; i < _eIntPoints.size(); ++i )
4407 if ( !_grid->IsStrangeEdge( _eIntPoints[i]->_shapeID ))
4409 const TopoDS_Shape& s = _grid->Shape( _eIntPoints[i]->_shapeID );
4410 if ( s.ShapeType() == TopAbs_EDGE )
4412 if ( ! edges.Add( s ))
4413 return true; // an EDGE encounters twice
4417 PShapeIteratorPtr edgeIt = _grid->_helper->GetAncestors( s,
4418 *_grid->_helper->GetMesh(),
4420 while ( const TopoDS_Shape* edge = edgeIt->next() )
4421 if ( ! edges.Add( *edge ))
4422 return true; // an EDGE encounters twice
4428 //================================================================================
4430 * \brief Return true if a polyhedron passes _sizeThreshold criterion
4432 bool Hexahedron::checkPolyhedronSize( bool cutByInternalFace ) const
4434 if ( cutByInternalFace && !_grid->_toUseThresholdForInternalFaces )
4436 // check if any polygon fully lies on shared/internal FACEs
4437 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4439 const _Face& polygon = _polygons[iP];
4440 if ( polygon._links.empty() )
4442 bool allNodesInternal = true;
4443 for ( size_t iL = 0; iL < polygon._links.size() && allNodesInternal; ++iL )
4445 _Node* n = polygon._links[ iL ].FirstNode();
4446 allNodesInternal = (( n->IsCutByInternal() ) ||
4447 ( n->_intPoint && _grid->IsAnyShared( n->_intPoint->_faceIDs )));
4449 if ( allNodesInternal )
4453 if ( this->hasStrangeEdge() )
4457 for ( size_t iP = 0; iP < _polygons.size(); ++iP )
4459 const _Face& polygon = _polygons[iP];
4460 if ( polygon._links.empty() )
4462 gp_XYZ area (0,0,0);
4463 gp_XYZ p1 = polygon._links[ 0 ].FirstNode()->Point().XYZ();
4464 for ( size_t iL = 0; iL < polygon._links.size(); ++iL )
4466 gp_XYZ p2 = polygon._links[ iL ].LastNode()->Point().XYZ();
4470 volume += p1 * area;
4474 double initVolume = _sideLength[0] * _sideLength[1] * _sideLength[2];
4476 return volume > initVolume / _grid->_sizeThreshold;
4478 //================================================================================
4480 * \brief Tries to create a hexahedron
4482 bool Hexahedron::addHexa()
4484 int nbQuad = 0, iQuad = -1;
4485 for ( size_t i = 0; i < _polygons.size(); ++i )
4487 if ( _polygons[i]._links.empty() )
4489 if ( _polygons[i]._links.size() != 4 )
4500 for ( int iL = 0; iL < 4; ++iL )
4503 nodes[iL] = _polygons[iQuad]._links[iL].FirstNode();
4506 // find a top node above the base node
4507 _Link* link = _polygons[iQuad]._links[iL]._link;
4508 if ( !link->_faces[0] || !link->_faces[1] )
4509 return debugDumpLink( link );
4510 // a quadrangle sharing <link> with _polygons[iQuad]
4511 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[iQuad] )];
4512 for ( int i = 0; i < 4; ++i )
4513 if ( quad->_links[i]._link == link )
4515 // 1st node of a link opposite to <link> in <quad>
4516 nodes[iL+4] = quad->_links[(i+2)%4].FirstNode();
4522 _volumeDefs.Set( &nodes[0], 8 );
4526 //================================================================================
4528 * \brief Tries to create a tetrahedron
4530 bool Hexahedron::addTetra()
4533 for ( size_t i = 0; i < _polygons.size() && iTria < 0; ++i )
4534 if ( _polygons[i]._links.size() == 3 )
4540 nodes[0] = _polygons[iTria]._links[0].FirstNode();
4541 nodes[1] = _polygons[iTria]._links[1].FirstNode();
4542 nodes[2] = _polygons[iTria]._links[2].FirstNode();
4544 _Link* link = _polygons[iTria]._links[0]._link;
4545 if ( !link->_faces[0] || !link->_faces[1] )
4546 return debugDumpLink( link );
4548 // a triangle sharing <link> with _polygons[0]
4549 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[iTria] )];
4550 for ( int i = 0; i < 3; ++i )
4551 if ( tria->_links[i]._link == link )
4553 nodes[3] = tria->_links[(i+1)%3].LastNode();
4554 _volumeDefs.Set( &nodes[0], 4 );
4560 //================================================================================
4562 * \brief Tries to create a pentahedron
4564 bool Hexahedron::addPenta()
4566 // find a base triangular face
4568 for ( int iF = 0; iF < 5 && iTri < 0; ++iF )
4569 if ( _polygons[ iF ]._links.size() == 3 )
4571 if ( iTri < 0 ) return false;
4576 for ( int iL = 0; iL < 3; ++iL )
4579 nodes[iL] = _polygons[ iTri ]._links[iL].FirstNode();
4582 // find a top node above the base node
4583 _Link* link = _polygons[ iTri ]._links[iL]._link;
4584 if ( !link->_faces[0] || !link->_faces[1] )
4585 return debugDumpLink( link );
4586 // a quadrangle sharing <link> with a base triangle
4587 _Face* quad = link->_faces[ bool( link->_faces[0] == & _polygons[ iTri ] )];
4588 if ( quad->_links.size() != 4 ) return false;
4589 for ( int i = 0; i < 4; ++i )
4590 if ( quad->_links[i]._link == link )
4592 // 1st node of a link opposite to <link> in <quad>
4593 nodes[iL+3] = quad->_links[(i+2)%4].FirstNode();
4599 _volumeDefs.Set( &nodes[0], 6 );
4601 return ( nbN == 6 );
4603 //================================================================================
4605 * \brief Tries to create a pyramid
4607 bool Hexahedron::addPyra()
4609 // find a base quadrangle
4611 for ( int iF = 0; iF < 5 && iQuad < 0; ++iF )
4612 if ( _polygons[ iF ]._links.size() == 4 )
4614 if ( iQuad < 0 ) return false;
4618 nodes[0] = _polygons[iQuad]._links[0].FirstNode();
4619 nodes[1] = _polygons[iQuad]._links[1].FirstNode();
4620 nodes[2] = _polygons[iQuad]._links[2].FirstNode();
4621 nodes[3] = _polygons[iQuad]._links[3].FirstNode();
4623 _Link* link = _polygons[iQuad]._links[0]._link;
4624 if ( !link->_faces[0] || !link->_faces[1] )
4625 return debugDumpLink( link );
4627 // a triangle sharing <link> with a base quadrangle
4628 _Face* tria = link->_faces[ bool( link->_faces[0] == & _polygons[ iQuad ] )];
4629 if ( tria->_links.size() != 3 ) return false;
4630 for ( int i = 0; i < 3; ++i )
4631 if ( tria->_links[i]._link == link )
4633 nodes[4] = tria->_links[(i+1)%3].LastNode();
4634 _volumeDefs.Set( &nodes[0], 5 );
4640 //================================================================================
4642 * \brief Dump a link and return \c false
4644 bool Hexahedron::debugDumpLink( Hexahedron::_Link* link )
4647 gp_Pnt p1 = link->_nodes[0]->Point(), p2 = link->_nodes[1]->Point();
4648 cout << "BUG: not shared link. IKJ = ( "<< _i << " " << _j << " " << _k << " )" << endl
4649 << "n1 (" << p1.X() << ", "<< p1.Y() << ", "<< p1.Z() << " )" << endl
4650 << "n2 (" << p2.X() << ", "<< p2.Y() << ", "<< p2.Z() << " )" << endl;
4654 //================================================================================
4656 * \brief Classify a point by grid parameters
4658 bool Hexahedron::isOutParam(const double uvw[3]) const
4660 return (( _grid->_coords[0][ _i ] - _grid->_tol > uvw[0] ) ||
4661 ( _grid->_coords[0][ _i+1 ] + _grid->_tol < uvw[0] ) ||
4662 ( _grid->_coords[1][ _j ] - _grid->_tol > uvw[1] ) ||
4663 ( _grid->_coords[1][ _j+1 ] + _grid->_tol < uvw[1] ) ||
4664 ( _grid->_coords[2][ _k ] - _grid->_tol > uvw[2] ) ||
4665 ( _grid->_coords[2][ _k+1 ] + _grid->_tol < uvw[2] ));
4667 //================================================================================
4669 * \brief Divide a polygon into triangles and modify accordingly an adjacent polyhedron
4671 void splitPolygon( const SMDS_MeshElement* polygon,
4672 SMDS_VolumeTool & volume,
4673 const int facetIndex,
4674 const TGeomID faceID,
4675 const TGeomID solidID,
4676 SMESH_MeshEditor::ElemFeatures& face,
4677 SMESH_MeshEditor& editor,
4678 const bool reinitVolume)
4680 SMESH_MeshAlgos::Triangulate divider(/*optimize=*/false);
4681 int nbTrias = divider.GetTriangles( polygon, face.myNodes );
4682 face.myNodes.resize( nbTrias * 3 );
4684 SMESH_MeshEditor::ElemFeatures newVolumeDef;
4685 newVolumeDef.Init( volume.Element() );
4686 newVolumeDef.SetID( volume.Element()->GetID() );
4688 newVolumeDef.myPolyhedQuantities.reserve( volume.NbFaces() + nbTrias );
4689 newVolumeDef.myNodes.reserve( volume.NbNodes() + nbTrias * 3 );
4691 SMESHDS_Mesh* meshDS = editor.GetMeshDS();
4692 SMDS_MeshElement* newTriangle;
4693 for ( int iF = 0, nF = volume.NbFaces(); iF < nF; iF++ )
4695 if ( iF == facetIndex )
4697 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4698 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4699 face.myNodes.begin(),
4700 face.myNodes.begin() + 3 );
4701 meshDS->RemoveFreeElement( polygon, 0, false );
4702 newTriangle = meshDS->AddFace( face.myNodes[0], face.myNodes[1], face.myNodes[2] );
4703 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4707 const SMDS_MeshNode** nn = volume.GetFaceNodes( iF );
4708 const size_t nbFaceNodes = volume.NbFaceNodes ( iF );
4709 newVolumeDef.myPolyhedQuantities.push_back( nbFaceNodes );
4710 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(), nn, nn + nbFaceNodes );
4714 for ( size_t iN = 3; iN < face.myNodes.size(); iN += 3 )
4716 newVolumeDef.myPolyhedQuantities.push_back( 3 );
4717 newVolumeDef.myNodes.insert( newVolumeDef.myNodes.end(),
4718 face.myNodes.begin() + iN,
4719 face.myNodes.begin() + iN + 3 );
4720 newTriangle = meshDS->AddFace( face.myNodes[iN], face.myNodes[iN+1], face.myNodes[iN+2] );
4721 meshDS->SetMeshElementOnShape( newTriangle, faceID );
4724 meshDS->RemoveFreeElement( volume.Element(), 0, false );
4725 SMDS_MeshElement* newVolume = editor.AddElement( newVolumeDef.myNodes, newVolumeDef );
4726 meshDS->SetMeshElementOnShape( newVolume, solidID );
4731 volume.Set( newVolume );
4735 //================================================================================
4737 * \brief Create mesh faces at free facets
4739 void Hexahedron::addFaces( SMESH_MesherHelper& helper,
4740 const vector< const SMDS_MeshElement* > & boundaryVolumes )
4742 if ( !_grid->_toCreateFaces )
4745 SMDS_VolumeTool vTool;
4746 vector<int> bndFacets;
4747 SMESH_MeshEditor editor( helper.GetMesh() );
4748 SMESH_MeshEditor::ElemFeatures face( SMDSAbs_Face );
4749 SMESHDS_Mesh* meshDS = helper.GetMeshDS();
4751 // check if there are internal or shared FACEs
4752 bool hasInternal = ( !_grid->_geometry.IsOneSolid() ||
4753 _grid->_geometry._soleSolid.HasInternalFaces() );
4755 for ( size_t iV = 0; iV < boundaryVolumes.size(); ++iV )
4757 if ( !vTool.Set( boundaryVolumes[ iV ]))
4760 TGeomID solidID = vTool.Element()->GetShapeID();
4761 Solid * solid = _grid->GetOneOfSolids( solidID );
4763 // find boundary facets
4766 for ( int iF = 0, n = vTool.NbFaces(); iF < n; iF++ )
4768 bool isBoundary = vTool.IsFreeFace( iF );
4771 bndFacets.push_back( iF );
4773 else if ( hasInternal )
4775 // check if all nodes are on internal/shared FACEs
4777 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iF );
4778 const size_t nbFaceNodes = vTool.NbFaceNodes ( iF );
4779 for ( size_t iN = 0; iN < nbFaceNodes && isBoundary; ++iN )
4780 isBoundary = ( nn[ iN ]->GetShapeID() != solidID );
4782 bndFacets.push_back( -( iF+1 )); // !!! minus ==> to check the FACE
4785 if ( bndFacets.empty() )
4790 if ( !vTool.IsPoly() )
4791 vTool.SetExternalNormal();
4792 for ( size_t i = 0; i < bndFacets.size(); ++i ) // loop on boundary facets
4794 const bool isBoundary = ( bndFacets[i] >= 0 );
4795 const int iFacet = isBoundary ? bndFacets[i] : -bndFacets[i]-1;
4796 const SMDS_MeshNode** nn = vTool.GetFaceNodes( iFacet );
4797 const size_t nbFaceNodes = vTool.NbFaceNodes ( iFacet );
4798 face.myNodes.assign( nn, nn + nbFaceNodes );
4801 const SMDS_MeshElement* existFace = 0, *newFace = 0;
4803 if (( existFace = meshDS->FindElement( face.myNodes, SMDSAbs_Face )))
4805 if ( existFace->isMarked() )
4806 continue; // created by this method
4807 faceID = existFace->GetShapeID();
4811 // look for a supporting FACE
4812 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN ) // look for a node on FACE
4814 if ( nn[ iN ]->GetPosition()->GetDim() == 2 )
4815 faceID = nn[ iN ]->GetShapeID();
4817 for ( size_t iN = 0; iN < nbFaceNodes && !faceID; ++iN )
4819 // look for a father FACE of EDGEs and VERTEXes
4820 const TopoDS_Shape& s1 = _grid->Shape( nn[ iN ]->GetShapeID() );
4821 const TopoDS_Shape& s2 = _grid->Shape( nn[ iN+1 ]->GetShapeID() );
4822 if ( s1 != s2 && s1.ShapeType() == TopAbs_EDGE && s2.ShapeType() == TopAbs_EDGE )
4824 TopoDS_Shape f = helper.GetCommonAncestor( s1, s2, *helper.GetMesh(), TopAbs_FACE );
4826 faceID = _grid->ShapeID( f );
4830 bool toCheckFace = faceID && (( !isBoundary ) ||
4831 ( hasInternal && _grid->_toUseThresholdForInternalFaces ));
4832 if ( toCheckFace ) // check if all nodes are on the found FACE
4834 SMESH_subMesh* faceSM = helper.GetMesh()->GetSubMeshContaining( faceID );
4835 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4837 TGeomID subID = nn[ iN ]->GetShapeID();
4838 if ( subID != faceID && !faceSM->DependsOn( subID ))
4841 if ( !faceID && !isBoundary )
4845 // orient a new face according to supporting FACE orientation in shape_to_mesh
4846 if ( !solid->IsOutsideOriented( faceID ))
4849 editor.Reorient( existFace );
4851 std::reverse( face.myNodes.begin(), face.myNodes.end() );
4854 if ( ! ( newFace = existFace ))
4856 face.SetPoly( nbFaceNodes > 4 );
4857 newFace = editor.AddElement( face.myNodes, face );
4860 newFace->setIsMarked( true ); // to distinguish from face created in getBoundaryElems()
4863 if ( faceID && _grid->IsBoundaryFace( faceID )) // face is not shared
4865 // set newFace to the found FACE provided that it fully lies on the FACE
4866 for ( size_t iN = 0; iN < nbFaceNodes && faceID; ++iN )
4867 if ( nn[iN]->GetShapeID() == solidID )
4870 meshDS->UnSetMeshElementOnShape( existFace, _grid->Shape( faceID ));
4875 // split a polygon that will be used by other 3D algorithm
4876 if ( faceID && nbFaceNodes > 4 &&
4877 !_grid->IsInternal( faceID ) &&
4878 !_grid->IsShared( faceID ) &&
4879 !_grid->IsBoundaryFace( faceID ))
4881 splitPolygon( newFace, vTool, iFacet, faceID, solidID,
4882 face, editor, i+1 < bndFacets.size() );
4887 meshDS->SetMeshElementOnShape( newFace, faceID );
4889 meshDS->SetMeshElementOnShape( newFace, solidID );
4891 } // loop on bndFacets
4892 } // loop on boundaryVolumes
4895 // Orient coherently mesh faces on INTERNAL FACEs
4899 TopExp_Explorer faceExp( _grid->_geometry._mainShape, TopAbs_FACE );
4900 for ( ; faceExp.More(); faceExp.Next() )
4902 if ( faceExp.Current().Orientation() != TopAbs_INTERNAL )
4905 SMESHDS_SubMesh* sm = meshDS->MeshElements( faceExp.Current() );
4906 if ( !sm ) continue;
4908 TIDSortedElemSet facesToOrient;
4909 for ( SMDS_ElemIteratorPtr fIt = sm->GetElements(); fIt->more(); )
4910 facesToOrient.insert( facesToOrient.end(), fIt->next() );
4911 if ( facesToOrient.size() < 2 )
4914 gp_Dir direction(1,0,0);
4915 const SMDS_MeshElement* anyFace = *facesToOrient.begin();
4916 editor.Reorient2D( facesToOrient, direction, anyFace );
4922 //================================================================================
4924 * \brief Create mesh segments.
4926 void Hexahedron::addSegments( SMESH_MesherHelper& helper,
4927 const map< TGeomID, vector< TGeomID > >& edge2faceIDsMap )
4929 SMESHDS_Mesh* mesh = helper.GetMeshDS();
4931 std::vector<const SMDS_MeshNode*> nodes;
4932 std::vector<const SMDS_MeshElement *> elems;
4933 map< TGeomID, vector< TGeomID > >::const_iterator e2ff = edge2faceIDsMap.begin();
4934 for ( ; e2ff != edge2faceIDsMap.end(); ++e2ff )
4936 const TopoDS_Edge& edge = TopoDS::Edge( _grid->Shape( e2ff->first ));
4937 const TopoDS_Face& face = TopoDS::Face( _grid->Shape( e2ff->second[0] ));
4938 StdMeshers_FaceSide side( face, edge, helper.GetMesh(), /*isFwd=*/true, /*skipMed=*/true );
4939 nodes = side.GetOrderedNodes();
4942 if ( nodes.size() == 2 )
4943 // check that there is an element connecting two nodes
4944 if ( !mesh->GetElementsByNodes( nodes, elems ))
4947 for ( size_t i = 1; i < nodes.size(); i++ )
4949 SMDS_MeshElement* segment = mesh->AddEdge( nodes[i-1], nodes[i] );
4950 mesh->SetMeshElementOnShape( segment, e2ff->first );
4956 //================================================================================
4958 * \brief Return created volumes and volumes that can have free facet because of
4959 * skipped small volume. Also create mesh faces on free facets
4960 * of adjacent not-cut volumes id the result volume is too small.
4962 void Hexahedron::getBoundaryElems( vector< const SMDS_MeshElement* > & boundaryElems )
4964 if ( _hasTooSmall /*|| _volumeDefs.IsEmpty()*/ )
4966 // create faces around a missing small volume
4968 SMESH_MeshEditor editor( _grid->_helper->GetMesh() );
4969 SMESH_MeshEditor::ElemFeatures polygon( SMDSAbs_Face );
4970 SMESHDS_Mesh* meshDS = _grid->_helper->GetMeshDS();
4971 std::vector<const SMDS_MeshElement *> adjVolumes(2);
4972 for ( size_t iF = 0; iF < _polygons.size(); ++iF )
4974 const size_t nbLinks = _polygons[ iF ]._links.size();
4975 if ( nbLinks != 4 ) continue;
4976 polygon.myNodes.resize( nbLinks );
4977 polygon.myNodes.back() = 0;
4978 for ( size_t iL = 0, iN = nbLinks - 1; iL < nbLinks; ++iL, --iN )
4979 if ( ! ( polygon.myNodes[iN] = _polygons[ iF ]._links[ iL ].FirstNode()->Node() ))
4981 if ( !polygon.myNodes.back() )
4984 meshDS->GetElementsByNodes( polygon.myNodes, adjVolumes, SMDSAbs_Volume );
4985 if ( adjVolumes.size() != 1 )
4987 if ( !adjVolumes[0]->isMarked() )
4989 boundaryElems.push_back( adjVolumes[0] );
4990 adjVolumes[0]->setIsMarked( true );
4993 bool sameShape = true;
4994 TGeomID shapeID = polygon.myNodes[0]->GetShapeID();
4995 for ( size_t i = 1; i < polygon.myNodes.size() && sameShape; ++i )
4996 sameShape = ( shapeID == polygon.myNodes[i]->GetShapeID() );
4998 if ( !sameShape || !_grid->IsSolid( shapeID ))
4999 continue; // some of shapes must be FACE
5003 faceID = getAnyFace();
5006 if ( _grid->IsInternal( faceID ) ||
5007 _grid->IsShared( faceID ) ||
5008 _grid->IsBoundaryFace( faceID ))
5009 break; // create only if a new face will be used by other 3D algo
5012 Solid * solid = _grid->GetOneOfSolids( adjVolumes[0]->GetShapeID() );
5013 if ( !solid->IsOutsideOriented( faceID ))
5014 std::reverse( polygon.myNodes.begin(), polygon.myNodes.end() );
5016 //polygon.SetPoly( polygon.myNodes.size() > 4 );
5017 const SMDS_MeshElement* newFace = editor.AddElement( polygon.myNodes, polygon );
5018 meshDS->SetMeshElementOnShape( newFace, faceID );
5022 // return created volumes
5023 for ( _volumeDef* volDef = &_volumeDefs; volDef; volDef = volDef->_next )
5025 if ( volDef->_volume && !volDef->_volume->isMarked() )
5027 volDef->_volume->setIsMarked( true );
5028 boundaryElems.push_back( volDef->_volume );
5030 if ( _grid->IsToCheckNodePos() ) // un-mark nodes marked in addVolumes()
5031 for ( size_t iN = 0; iN < volDef->_nodes.size(); ++iN )
5032 volDef->_nodes[iN].Node()->setIsMarked( false );
5037 //================================================================================
5039 * \brief Set to _hexLinks a next portion of splits located on one side of INTERNAL FACEs
5041 bool Hexahedron::_SplitIterator::Next()
5043 if ( _iterationNb > 0 )
5044 // count used splits
5045 for ( size_t i = 0; i < _splits.size(); ++i )
5047 if ( _splits[i]._iCheckIteration == _iterationNb )
5049 _splits[i]._isUsed = _splits[i]._checkedSplit->_faces[1];
5050 _nbUsed += _splits[i]._isUsed;
5058 bool toTestUsed = ( _nbChecked >= _splits.size() );
5061 // all splits are checked; find all not used splits
5062 for ( size_t i = 0; i < _splits.size(); ++i )
5063 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5064 _splits[i]._iCheckIteration = _iterationNb;
5066 _nbUsed = _splits.size(); // to stop iteration
5070 // get any not used/checked split to start from
5072 for ( size_t i = 0; i < _splits.size(); ++i )
5074 if ( !_splits[i].IsCheckedOrUsed( toTestUsed ))
5076 _freeNodes.push_back( _splits[i]._nodes[0] );
5077 _freeNodes.push_back( _splits[i]._nodes[1] );
5078 _splits[i]._iCheckIteration = _iterationNb;
5082 // find splits connected to the start one via _freeNodes
5083 for ( size_t iN = 0; iN < _freeNodes.size(); ++iN )
5085 for ( size_t iS = 0; iS < _splits.size(); ++iS )
5087 if ( _splits[iS].IsCheckedOrUsed( toTestUsed ))
5090 if ( _freeNodes[iN] == _splits[iS]._nodes[0] )
5092 else if ( _freeNodes[iN] == _splits[iS]._nodes[1] )
5096 if ( _freeNodes[iN]->_isInternalFlags > 0 )
5098 if ( _splits[iS]._nodes[ iN2 ]->_isInternalFlags == 0 )
5100 if ( !_splits[iS]._nodes[ iN2 ]->IsLinked( _freeNodes[iN]->_intPoint ))
5103 _splits[iS]._iCheckIteration = _iterationNb;
5104 _freeNodes.push_back( _splits[iS]._nodes[ iN2 ]);
5108 // set splits to hex links
5110 for ( int iL = 0; iL < 12; ++iL )
5111 _hexLinks[ iL ]._splits.clear();
5114 for ( size_t i = 0; i < _splits.size(); ++i )
5116 if ( _splits[i]._iCheckIteration == _iterationNb )
5118 split._nodes[0] = _splits[i]._nodes[0];
5119 split._nodes[1] = _splits[i]._nodes[1];
5120 _Link & hexLink = _hexLinks[ _splits[i]._linkID ];
5121 hexLink._splits.push_back( split );
5122 _splits[i]._checkedSplit = & hexLink._splits.back();
5129 //================================================================================
5131 * \brief computes exact bounding box with axes parallel to given ones
5133 //================================================================================
5135 void getExactBndBox( const vector< TopoDS_Shape >& faceVec,
5136 const double* axesDirs,
5140 TopoDS_Compound allFacesComp;
5141 b.MakeCompound( allFacesComp );
5142 for ( size_t iF = 0; iF < faceVec.size(); ++iF )
5143 b.Add( allFacesComp, faceVec[ iF ] );
5145 double sP[6]; // aXmin, aYmin, aZmin, aXmax, aYmax, aZmax
5146 shapeBox.Get(sP[0],sP[1],sP[2],sP[3],sP[4],sP[5]);
5148 for ( int i = 0; i < 6; ++i )
5149 farDist = Max( farDist, 10 * sP[i] );
5151 gp_XYZ axis[3] = { gp_XYZ( axesDirs[0], axesDirs[1], axesDirs[2] ),
5152 gp_XYZ( axesDirs[3], axesDirs[4], axesDirs[5] ),
5153 gp_XYZ( axesDirs[6], axesDirs[7], axesDirs[8] ) };
5154 axis[0].Normalize();
5155 axis[1].Normalize();
5156 axis[2].Normalize();
5158 gp_Mat basis( axis[0], axis[1], axis[2] );
5159 gp_Mat bi = basis.Inverted();
5162 for ( int iDir = 0; iDir < 3; ++iDir )
5164 gp_XYZ axis0 = axis[ iDir ];
5165 gp_XYZ axis1 = axis[ ( iDir + 1 ) % 3 ];
5166 gp_XYZ axis2 = axis[ ( iDir + 2 ) % 3 ];
5167 for ( int isMax = 0; isMax < 2; ++isMax )
5169 double shift = isMax ? farDist : -farDist;
5170 gp_XYZ orig = shift * axis0;
5171 gp_XYZ norm = axis1 ^ axis2;
5172 gp_Pln pln( orig, norm );
5173 norm = pln.Axis().Direction().XYZ();
5174 BRepBuilderAPI_MakeFace plane( pln, -farDist, farDist, -farDist, farDist );
5176 gp_Pnt& pAxis = isMax ? pMax : pMin;
5177 gp_Pnt pPlane, pFaces;
5178 double dist = GEOMUtils::GetMinDistance( plane, allFacesComp, pPlane, pFaces );
5183 for ( int i = 0; i < 2; ++i ) {
5184 corner.SetCoord( 1, sP[ i*3 ]);
5185 for ( int j = 0; j < 2; ++j ) {
5186 corner.SetCoord( 2, sP[ i*3 + 1 ]);
5187 for ( int k = 0; k < 2; ++k )
5189 corner.SetCoord( 3, sP[ i*3 + 2 ]);
5195 corner = isMax ? bb.CornerMax() : bb.CornerMin();
5196 pAxis.SetCoord( iDir+1, corner.Coord( iDir+1 ));
5200 gp_XYZ pf = pFaces.XYZ() * bi;
5201 pAxis.SetCoord( iDir+1, pf.Coord( iDir+1 ) );
5207 shapeBox.Add( pMin );
5208 shapeBox.Add( pMax );
5215 //=============================================================================
5217 * \brief Generates 3D structured Cartesian mesh in the internal part of
5218 * solid shapes and polyhedral volumes near the shape boundary.
5219 * \param theMesh - mesh to fill in
5220 * \param theShape - a compound of all SOLIDs to mesh
5221 * \retval bool - true in case of success
5223 //=============================================================================
5225 bool StdMeshers_Cartesian_3D::Compute(SMESH_Mesh & theMesh,
5226 const TopoDS_Shape & theShape)
5228 // The algorithm generates the mesh in following steps:
5230 // 1) Intersection of grid lines with the geometry boundary.
5231 // This step allows to find out if a given node of the initial grid is
5232 // inside or outside the geometry.
5234 // 2) For each cell of the grid, check how many of it's nodes are outside
5235 // of the geometry boundary. Depending on a result of this check
5236 // - skip a cell, if all it's nodes are outside
5237 // - skip a cell, if it is too small according to the size threshold
5238 // - add a hexahedron in the mesh, if all nodes are inside
5239 // - add a polyhedron in the mesh, if some nodes are inside and some outside
5241 _computeCanceled = false;
5243 SMESH_MesherHelper helper( theMesh );
5244 SMESHDS_Mesh* meshDS = theMesh.GetMeshDS();
5249 grid._helper = &helper;
5250 grid._toAddEdges = _hyp->GetToAddEdges();
5251 grid._toCreateFaces = _hyp->GetToCreateFaces();
5252 grid._toConsiderInternalFaces = _hyp->GetToConsiderInternalFaces();
5253 grid._toUseThresholdForInternalFaces = _hyp->GetToUseThresholdForInternalFaces();
5254 grid._sizeThreshold = _hyp->GetSizeThreshold();
5255 grid.InitGeometry( theShape );
5257 vector< TopoDS_Shape > faceVec;
5259 TopTools_MapOfShape faceMap;
5260 TopExp_Explorer fExp;
5261 for ( fExp.Init( theShape, TopAbs_FACE ); fExp.More(); fExp.Next() )
5263 bool isNewFace = faceMap.Add( fExp.Current() );
5264 if ( !grid._toConsiderInternalFaces )
5265 if ( !isNewFace || fExp.Current().Orientation() == TopAbs_INTERNAL )
5266 // remove an internal face
5267 faceMap.Remove( fExp.Current() );
5269 faceVec.reserve( faceMap.Extent() );
5270 faceVec.assign( faceMap.cbegin(), faceMap.cend() );
5272 vector<FaceGridIntersector> facesItersectors( faceVec.size() );
5274 for ( size_t i = 0; i < faceVec.size(); ++i )
5276 facesItersectors[i]._face = TopoDS::Face( faceVec[i] );
5277 facesItersectors[i]._faceID = grid.ShapeID( faceVec[i] );
5278 facesItersectors[i]._grid = &grid;
5279 shapeBox.Add( facesItersectors[i].GetFaceBndBox() );
5281 getExactBndBox( faceVec, _hyp->GetAxisDirs(), shapeBox );
5284 vector<double> xCoords, yCoords, zCoords;
5285 _hyp->GetCoordinates( xCoords, yCoords, zCoords, shapeBox );
5287 grid.SetCoordinates( xCoords, yCoords, zCoords, _hyp->GetAxisDirs(), shapeBox );
5289 if ( _computeCanceled ) return false;
5292 { // copy partner faces and curves of not thread-safe types
5293 set< const Standard_Transient* > tshapes;
5294 BRepBuilderAPI_Copy copier;
5295 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5297 if ( !facesItersectors[i].IsThreadSafe( tshapes ))
5299 copier.Perform( facesItersectors[i]._face );
5300 facesItersectors[i]._face = TopoDS::Face( copier );
5304 // Intersection of grid lines with the geometry boundary.
5305 tbb::parallel_for ( tbb::blocked_range<size_t>( 0, facesItersectors.size() ),
5306 ParallelIntersector( facesItersectors ),
5307 tbb::simple_partitioner());
5309 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5310 facesItersectors[i].Intersect();
5313 // put intersection points onto the GridLine's; this is done after intersection
5314 // to avoid contention of facesItersectors for writing into the same GridLine
5315 // in case of parallel work of facesItersectors
5316 for ( size_t i = 0; i < facesItersectors.size(); ++i )
5317 facesItersectors[i].StoreIntersections();
5319 if ( _computeCanceled ) return false;
5321 // create nodes on the geometry
5322 grid.ComputeNodes( helper );
5324 if ( _computeCanceled ) return false;
5326 // get EDGEs to take into account
5327 map< TGeomID, vector< TGeomID > > edge2faceIDsMap;
5328 grid.GetEdgesToImplement( edge2faceIDsMap, theShape, faceVec );
5330 // create volume elements
5331 Hexahedron hex( &grid );
5332 int nbAdded = hex.MakeElements( helper, edge2faceIDsMap );
5336 if ( !grid._toConsiderInternalFaces )
5338 // make all SOLIDs computed
5339 TopExp_Explorer solidExp( theShape, TopAbs_SOLID );
5340 if ( SMESHDS_SubMesh* sm1 = meshDS->MeshElements( solidExp.Current()) )
5342 SMDS_ElemIteratorPtr volIt = sm1->GetElements();
5343 for ( ; solidExp.More() && volIt->more(); solidExp.Next() )
5345 const SMDS_MeshElement* vol = volIt->next();
5346 sm1->RemoveElement( vol );
5347 meshDS->SetMeshElementOnShape( vol, solidExp.Current() );
5351 // make other sub-shapes computed
5352 setSubmeshesComputed( theMesh, theShape );
5355 // remove free nodes
5356 //if ( SMESHDS_SubMesh * smDS = meshDS->MeshElements( helper.GetSubShapeID() ))
5358 std::vector< const SMDS_MeshNode* > nodesToRemove;
5359 // get intersection nodes
5360 for ( int iDir = 0; iDir < 3; ++iDir )
5362 vector< GridLine >& lines = grid._lines[ iDir ];
5363 for ( size_t i = 0; i < lines.size(); ++i )
5365 multiset< F_IntersectPoint >::iterator ip = lines[i]._intPoints.begin();
5366 for ( ; ip != lines[i]._intPoints.end(); ++ip )
5367 if ( ip->_node && ip->_node->NbInverseElements() == 0 && !ip->_node->isMarked() )
5369 nodesToRemove.push_back( ip->_node );
5370 ip->_node->setIsMarked( true );
5375 for ( size_t i = 0; i < grid._nodes.size(); ++i )
5376 if ( grid._nodes[i] && grid._nodes[i]->NbInverseElements() == 0 &&
5377 !grid._nodes[i]->isMarked() )
5379 nodesToRemove.push_back( grid._nodes[i] );
5380 grid._nodes[i]->setIsMarked( true );
5384 for ( size_t i = 0; i < nodesToRemove.size(); ++i )
5385 meshDS->RemoveFreeNode( nodesToRemove[i], /*smD=*/0, /*fromGroups=*/false );
5391 // SMESH_ComputeError is not caught at SMESH_submesh level for an unknown reason
5392 catch ( SMESH_ComputeError& e)
5394 return error( SMESH_ComputeErrorPtr( new SMESH_ComputeError( e )));
5399 //=============================================================================
5403 //=============================================================================
5405 bool StdMeshers_Cartesian_3D::Evaluate(SMESH_Mesh & theMesh,
5406 const TopoDS_Shape & theShape,
5407 MapShapeNbElems& theResMap)
5410 // std::vector<int> aResVec(SMDSEntity_Last);
5411 // for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
5412 // if(IsQuadratic) {
5413 // aResVec[SMDSEntity_Quad_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5414 // int nb1d_face0_int = ( nb2d_face0*4 - nb1d ) / 2;
5415 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
5418 // aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
5419 // aResVec[SMDSEntity_Cartesian] = nb2d_face0 * ( nb2d/nb1d );
5421 // SMESH_subMesh * sm = aMesh.GetSubMesh(aShape);
5422 // aResMap.insert(std::make_pair(sm,aResVec));
5427 //=============================================================================
5431 * \brief Event listener setting/unsetting _alwaysComputed flag to
5432 * submeshes of inferior levels to prevent their computing
5434 struct _EventListener : public SMESH_subMeshEventListener
5438 _EventListener(const string& algoName):
5439 SMESH_subMeshEventListener(/*isDeletable=*/true,"StdMeshers_Cartesian_3D::_EventListener"),
5442 // --------------------------------------------------------------------------------
5443 // setting/unsetting _alwaysComputed flag to submeshes of inferior levels
5445 static void setAlwaysComputed( const bool isComputed,
5446 SMESH_subMesh* subMeshOfSolid)
5448 SMESH_subMeshIteratorPtr smIt =
5449 subMeshOfSolid->getDependsOnIterator(/*includeSelf=*/false, /*complexShapeFirst=*/false);
5450 while ( smIt->more() )
5452 SMESH_subMesh* sm = smIt->next();
5453 sm->SetIsAlwaysComputed( isComputed );
5455 subMeshOfSolid->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
5458 // --------------------------------------------------------------------------------
5459 // unsetting _alwaysComputed flag if "Cartesian_3D" was removed
5461 virtual void ProcessEvent(const int event,
5462 const int eventType,
5463 SMESH_subMesh* subMeshOfSolid,
5464 SMESH_subMeshEventListenerData* data,
5465 const SMESH_Hypothesis* hyp = 0)
5467 if ( eventType == SMESH_subMesh::COMPUTE_EVENT )
5469 setAlwaysComputed( subMeshOfSolid->GetComputeState() == SMESH_subMesh::COMPUTE_OK,
5474 SMESH_Algo* algo3D = subMeshOfSolid->GetAlgo();
5475 if ( !algo3D || _algoName != algo3D->GetName() )
5476 setAlwaysComputed( false, subMeshOfSolid );
5480 // --------------------------------------------------------------------------------
5481 // set the event listener
5483 static void SetOn( SMESH_subMesh* subMeshOfSolid, const string& algoName )
5485 subMeshOfSolid->SetEventListener( new _EventListener( algoName ),
5490 }; // struct _EventListener
5494 //================================================================================
5496 * \brief Sets event listener to submeshes if necessary
5497 * \param subMesh - submesh where algo is set
5498 * This method is called when a submesh gets HYP_OK algo_state.
5499 * After being set, event listener is notified on each event of a submesh.
5501 //================================================================================
5503 void StdMeshers_Cartesian_3D::SetEventListener(SMESH_subMesh* subMesh)
5505 _EventListener::SetOn( subMesh, GetName() );
5508 //================================================================================
5510 * \brief Set _alwaysComputed flag to submeshes of inferior levels to avoid their computing
5512 //================================================================================
5514 void StdMeshers_Cartesian_3D::setSubmeshesComputed(SMESH_Mesh& theMesh,
5515 const TopoDS_Shape& theShape)
5517 for ( TopExp_Explorer soExp( theShape, TopAbs_SOLID ); soExp.More(); soExp.Next() )
5518 _EventListener::setAlwaysComputed( true, theMesh.GetSubMesh( soExp.Current() ));