1 // Copyright (C) 2007-2016 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
23 // File : StdMeshers_Prism_3D.cxx
25 // Created : Fri Oct 20 11:37:07 2006
26 // Author : Edward AGAPOV (eap)
28 #include "StdMeshers_Prism_3D.hxx"
30 #include "SMDS_EdgePosition.hxx"
31 #include "SMDS_VolumeOfNodes.hxx"
32 #include "SMDS_VolumeTool.hxx"
33 #include "SMESH_Comment.hxx"
34 #include "SMESH_Gen.hxx"
35 #include "SMESH_HypoFilter.hxx"
36 #include "SMESH_MesherHelper.hxx"
37 #include "StdMeshers_FaceSide.hxx"
38 #include "StdMeshers_ProjectionSource1D.hxx"
39 #include "StdMeshers_ProjectionSource2D.hxx"
40 #include "StdMeshers_ProjectionUtils.hxx"
41 #include "StdMeshers_Projection_1D.hxx"
42 #include "StdMeshers_Projection_1D2D.hxx"
43 #include "StdMeshers_Quadrangle_2D.hxx"
45 #include "utilities.h"
47 #include <BRepAdaptor_CompCurve.hxx>
48 #include <BRep_Tool.hxx>
49 #include <Bnd_B3d.hxx>
50 #include <Geom2dAdaptor_Curve.hxx>
51 #include <Geom2d_Line.hxx>
52 #include <GeomLib_IsPlanarSurface.hxx>
53 #include <Geom_Curve.hxx>
54 #include <Standard_ErrorHandler.hxx>
56 #include <TopExp_Explorer.hxx>
57 #include <TopTools_ListIteratorOfListOfShape.hxx>
58 #include <TopTools_ListOfShape.hxx>
59 #include <TopTools_MapOfShape.hxx>
60 #include <TopTools_SequenceOfShape.hxx>
70 #define RETURN_BAD_RESULT(msg) { MESSAGE(")-: Error: " << msg); return false; }
71 #define gpXYZ(n) SMESH_TNodeXYZ(n)
74 #define DBGOUT(msg) //cout << msg << endl;
75 #define SHOWYXZ(msg, xyz) \
76 //{ gp_Pnt p (xyz); cout << msg << " ("<< p.X() << "; " <<p.Y() << "; " <<p.Z() << ") " <<endl; }
79 #define SHOWYXZ(msg, xyz)
82 namespace NSProjUtils = StdMeshers_ProjectionUtils;
84 typedef SMESH_Comment TCom;
86 enum { ID_BOT_FACE = SMESH_Block::ID_Fxy0,
87 ID_TOP_FACE = SMESH_Block::ID_Fxy1,
88 BOTTOM_EDGE = 0, TOP_EDGE, V0_EDGE, V1_EDGE, // edge IDs in face
89 NB_WALL_FACES = 4 }; //
93 //=======================================================================
95 * \brief Quadrangle algorithm
97 struct TQuadrangleAlgo : public StdMeshers_Quadrangle_2D
99 TQuadrangleAlgo(int studyId, SMESH_Gen* gen)
100 : StdMeshers_Quadrangle_2D( gen->GetANewId(), studyId, gen)
103 static StdMeshers_Quadrangle_2D* instance( SMESH_Algo* fatherAlgo,
104 SMESH_MesherHelper* helper=0)
106 static TQuadrangleAlgo* algo = new TQuadrangleAlgo( fatherAlgo->GetStudyId(),
107 fatherAlgo->GetGen() );
110 algo->myProxyMesh->GetMesh() != helper->GetMesh() )
111 algo->myProxyMesh.reset( new SMESH_ProxyMesh( *helper->GetMesh() ));
113 algo->myQuadList.clear();
116 algo->_quadraticMesh = helper->GetIsQuadratic();
121 //=======================================================================
123 * \brief Algorithm projecting 1D mesh
125 struct TProjction1dAlgo : public StdMeshers_Projection_1D
127 StdMeshers_ProjectionSource1D myHyp;
129 TProjction1dAlgo(int studyId, SMESH_Gen* gen)
130 : StdMeshers_Projection_1D( gen->GetANewId(), studyId, gen),
131 myHyp( gen->GetANewId(), studyId, gen)
133 StdMeshers_Projection_1D::_sourceHypo = & myHyp;
135 static TProjction1dAlgo* instance( SMESH_Algo* fatherAlgo )
137 static TProjction1dAlgo* algo = new TProjction1dAlgo( fatherAlgo->GetStudyId(),
138 fatherAlgo->GetGen() );
142 //=======================================================================
144 * \brief Algorithm projecting 2D mesh
146 struct TProjction2dAlgo : public StdMeshers_Projection_1D2D
148 StdMeshers_ProjectionSource2D myHyp;
150 TProjction2dAlgo(int studyId, SMESH_Gen* gen)
151 : StdMeshers_Projection_1D2D( gen->GetANewId(), studyId, gen),
152 myHyp( gen->GetANewId(), studyId, gen)
154 StdMeshers_Projection_2D::_sourceHypo = & myHyp;
156 static TProjction2dAlgo* instance( SMESH_Algo* fatherAlgo )
158 static TProjction2dAlgo* algo = new TProjction2dAlgo( fatherAlgo->GetStudyId(),
159 fatherAlgo->GetGen() );
162 const NSProjUtils::TNodeNodeMap& GetNodesMap()
164 return _src2tgtNodes;
166 void SetEventListener( SMESH_subMesh* tgtSubMesh )
168 NSProjUtils::SetEventListener( tgtSubMesh,
169 _sourceHypo->GetSourceFace(),
170 _sourceHypo->GetSourceMesh() );
173 //=======================================================================
175 * \brief Returns already computed EDGEs
177 void getPrecomputedEdges( SMESH_MesherHelper& theHelper,
178 const TopoDS_Shape& theShape,
179 vector< TopoDS_Edge >& theEdges)
183 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
186 TopTools_IndexedMapOfShape edges;
187 TopExp::MapShapes( theShape, TopAbs_EDGE, edges );
188 for ( int iE = 1; iE <= edges.Extent(); ++iE )
190 const TopoDS_Shape edge = edges( iE );
191 if (( ! ( sm = meshDS->MeshElements( edge ))) ||
192 ( sm->NbElements() == 0 ))
195 // there must not be FACEs meshed with triangles and sharing a computed EDGE
196 // as the precomputed EDGEs are used for propagation other to 'vertical' EDGEs
197 bool faceFound = false;
198 PShapeIteratorPtr faceIt =
199 theHelper.GetAncestors( edge, *theHelper.GetMesh(), TopAbs_FACE );
200 while ( const TopoDS_Shape* face = faceIt->next() )
202 if (( sm = meshDS->MeshElements( *face )) &&
203 ( sm->NbElements() > 0 ) &&
204 ( !theHelper.IsSameElemGeometry( sm, SMDSGeom_QUADRANGLE ) ))
210 theEdges.push_back( TopoDS::Edge( edge ));
214 //================================================================================
216 * \brief Make \a botE be the BOTTOM_SIDE of \a quad.
217 * Return false if the BOTTOM_SIDE is composite
219 //================================================================================
221 bool setBottomEdge( const TopoDS_Edge& botE,
222 FaceQuadStruct::Ptr& quad,
223 const TopoDS_Shape& face)
225 quad->side[ QUAD_TOP_SIDE ].grid->Reverse();
226 quad->side[ QUAD_LEFT_SIDE ].grid->Reverse();
228 bool isComposite = false;
229 for ( size_t i = 0; i < quad->side.size(); ++i )
231 StdMeshers_FaceSidePtr quadSide = quad->side[i];
232 for ( int iE = 0; iE < quadSide->NbEdges(); ++iE )
233 if ( botE.IsSame( quadSide->Edge( iE )))
235 if ( quadSide->NbEdges() > 1 )
236 isComposite = true; //return false;
238 i = quad->side.size(); // to quit from the outer loop
242 if ( edgeIndex != QUAD_BOTTOM_SIDE )
243 quad->shift( quad->side.size() - edgeIndex, /*keepUnitOri=*/false );
245 quad->face = TopoDS::Face( face );
250 //================================================================================
252 * \brief Return iterator pointing to node column for the given parameter
253 * \param columnsMap - node column map
254 * \param parameter - parameter
255 * \retval TParam2ColumnMap::iterator - result
257 * it returns closest left column
259 //================================================================================
261 TParam2ColumnIt getColumn( const TParam2ColumnMap* columnsMap,
262 const double parameter )
264 TParam2ColumnIt u_col = columnsMap->upper_bound( parameter );
265 if ( u_col != columnsMap->begin() )
267 return u_col; // return left column
270 //================================================================================
272 * \brief Return nodes around given parameter and a ratio
273 * \param column - node column
274 * \param param - parameter
275 * \param node1 - lower node
276 * \param node2 - upper node
277 * \retval double - ratio
279 //================================================================================
281 double getRAndNodes( const TNodeColumn* column,
283 const SMDS_MeshNode* & node1,
284 const SMDS_MeshNode* & node2)
286 if ( param >= 1.0 || column->size() == 1) {
287 node1 = node2 = column->back();
291 int i = int( param * ( column->size() - 1 ));
292 double u0 = double( i )/ double( column->size() - 1 );
293 double r = ( param - u0 ) * ( column->size() - 1 );
295 node1 = (*column)[ i ];
296 node2 = (*column)[ i + 1];
300 //================================================================================
302 * \brief Compute boundary parameters of face parts
303 * \param nbParts - nb of parts to split columns into
304 * \param columnsMap - node columns of the face to split
305 * \param params - computed parameters
307 //================================================================================
309 void splitParams( const int nbParts,
310 const TParam2ColumnMap* columnsMap,
311 vector< double > & params)
314 params.reserve( nbParts + 1 );
315 TParam2ColumnIt last_par_col = --columnsMap->end();
316 double par = columnsMap->begin()->first; // 0.
317 double parLast = last_par_col->first;
318 params.push_back( par );
319 for ( int i = 0; i < nbParts - 1; ++ i )
321 double partSize = ( parLast - par ) / double ( nbParts - i );
322 TParam2ColumnIt par_col = getColumn( columnsMap, par + partSize );
323 if ( par_col->first == par ) {
325 if ( par_col == last_par_col ) {
326 while ( i < nbParts - 1 )
327 params.push_back( par + partSize * i++ );
331 par = par_col->first;
332 params.push_back( par );
334 params.push_back( parLast ); // 1.
337 //================================================================================
339 * \brief Return coordinate system for z-th layer of nodes
341 //================================================================================
343 gp_Ax2 getLayerCoordSys(const int z,
344 const vector< const TNodeColumn* >& columns,
347 // gravity center of a layer
350 for ( size_t i = 0; i < columns.size(); ++i )
352 O += gpXYZ( (*columns[ i ])[ z ]);
353 if ( vertexCol < 0 &&
354 columns[ i ]->front()->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
361 int iPrev = columns.size()-1;
362 for ( size_t i = 0; i < columns.size(); ++i )
364 gp_Vec v1( O, gpXYZ( (*columns[ iPrev ])[ z ]));
365 gp_Vec v2( O, gpXYZ( (*columns[ i ] )[ z ]));
370 if ( vertexCol >= 0 )
372 O = gpXYZ( (*columns[ vertexCol ])[ z ]);
374 if ( xColumn < 0 || xColumn >= (int) columns.size() )
376 // select a column for X dir
378 for ( size_t i = 0; i < columns.size(); ++i )
380 double dist = ( O - gpXYZ((*columns[ i ])[ z ])).SquareModulus();
381 if ( dist > maxDist )
390 gp_Vec X( O, gpXYZ( (*columns[ xColumn ])[ z ]));
392 return gp_Ax2( O, Z, X);
395 //================================================================================
397 * \brief Removes submeshes that are or can be meshed with regular grid from given list
398 * \retval int - nb of removed submeshes
400 //================================================================================
402 int removeQuasiQuads(list< SMESH_subMesh* >& notQuadSubMesh,
403 SMESH_MesherHelper* helper,
404 StdMeshers_Quadrangle_2D* quadAlgo)
407 //SMESHDS_Mesh* mesh = notQuadSubMesh.front()->GetFather()->GetMeshDS();
408 list< SMESH_subMesh* >::iterator smIt = notQuadSubMesh.begin();
409 while ( smIt != notQuadSubMesh.end() )
411 SMESH_subMesh* faceSm = *smIt;
412 SMESHDS_SubMesh* faceSmDS = faceSm->GetSubMeshDS();
413 int nbQuads = faceSmDS ? faceSmDS->NbElements() : 0;
416 toRemove = helper->IsStructured( faceSm );
418 toRemove = ( quadAlgo->CheckNbEdges( *helper->GetMesh(),
419 faceSm->GetSubShape() ) != NULL );
420 nbRemoved += toRemove;
422 smIt = notQuadSubMesh.erase( smIt );
430 //================================================================================
432 * \brief Return and angle between two EDGEs
433 * \return double - the angle normalized so that
440 //================================================================================
442 // double normAngle(const TopoDS_Edge & E1, const TopoDS_Edge & E2, const TopoDS_Face & F)
444 // return SMESH_MesherHelper::GetAngle( E1, E2, F ) / ( 0.5 * M_PI );
447 //================================================================================
449 * Consider continuous straight EDGES as one side - mark them to unite
451 //================================================================================
453 int countNbSides( const Prism_3D::TPrismTopo & thePrism,
454 vector<int> & nbUnitePerEdge,
455 vector< double > & edgeLength)
457 int nbEdges = thePrism.myNbEdgesInWires.front(); // nb outer edges
458 int nbSides = nbEdges;
461 list< TopoDS_Edge >::const_iterator edgeIt = thePrism.myBottomEdges.begin();
462 std::advance( edgeIt, nbEdges-1 );
463 TopoDS_Edge prevE = *edgeIt;
464 // bool isPrevStraight = SMESH_Algo::IsStraight( prevE );
465 // int iPrev = nbEdges - 1;
467 // int iUnite = -1; // the first of united EDGEs
469 // analyse angles between EDGEs
471 vector< bool > isCorner( nbEdges );
472 edgeIt = thePrism.myBottomEdges.begin();
473 for ( int iE = 0; iE < nbEdges; ++iE, ++edgeIt )
475 const TopoDS_Edge& curE = *edgeIt;
476 edgeLength[ iE ] = SMESH_Algo::EdgeLength( curE );
478 // double normAngle = normAngle( prevE, curE, thePrism.myBottom );
479 // isCorner[ iE ] = false;
480 // if ( normAngle < 2.0 )
482 // if ( normAngle < 0.001 ) // straight or obtuse angle
484 // // unite EDGEs in order not to put a corner of the unit quadrangle at this VERTEX
487 // nbUnitePerEdge[ iUnite ]++;
488 // nbUnitePerEdge[ iE ] = -1;
493 // isCorner[ iE ] = true;
503 // define which of corners to put on a side of the unit quadrangle
505 // edgeIt = thePrism.myBottomEdges.begin();
506 // for ( int iE = 0; iE < nbEdges; ++iE, ++edgeIt )
508 // const TopoDS_Edge& curE = *edgeIt;
509 // edgeLength[ iE ] = SMESH_Algo::EdgeLength( curE );
511 // const bool isCurStraight = SMESH_Algo::IsStraight( curE );
512 // if ( isPrevStraight && isCurStraight && SMESH_Algo::IsContinuous( prevE, curE ))
516 // nbUnitePerEdge[ iUnite ]++;
517 // nbUnitePerEdge[ iE ] = -1;
525 // isPrevStraight = isCurStraight;
532 //================================================================================
534 * \brief Set/get wire index to FaceQuadStruct
536 //================================================================================
538 void setWireIndex( TFaceQuadStructPtr& quad, int iWire )
542 int getWireIndex( const TFaceQuadStructPtr& quad )
547 //================================================================================
549 * \brief Print Python commands adding given points to a mesh
551 //================================================================================
553 void pointsToPython(const std::vector<gp_XYZ>& p)
556 for ( size_t i = SMESH_Block::ID_V000; i < p.size(); ++i )
558 cout << "mesh.AddNode( " << p[i].X() << ", "<< p[i].Y() << ", "<< p[i].Z() << ") # " << i <<" " ;
559 SMESH_Block::DumpShapeID( i, cout ) << endl;
565 //=======================================================================
566 //function : StdMeshers_Prism_3D
568 //=======================================================================
570 StdMeshers_Prism_3D::StdMeshers_Prism_3D(int hypId, int studyId, SMESH_Gen* gen)
571 :SMESH_3D_Algo(hypId, studyId, gen)
574 _shapeType = (1 << TopAbs_SOLID); // 1 bit per shape type
575 _onlyUnaryInput = false; // mesh all SOLIDs at once
576 _requireDiscreteBoundary = false; // mesh FACEs and EDGEs by myself
577 _supportSubmeshes = true; // "source" FACE must be meshed by other algo
578 _neededLowerHyps[ 1 ] = true; // suppress warning on hiding a global 1D algo
579 _neededLowerHyps[ 2 ] = true; // suppress warning on hiding a global 2D algo
581 //myProjectTriangles = false;
582 mySetErrorToSM = true; // to pass an error to a sub-mesh of a current solid or not
583 myPrevBottomSM = 0; // last treated bottom sub-mesh with a suitable algorithm
586 //================================================================================
590 //================================================================================
592 StdMeshers_Prism_3D::~StdMeshers_Prism_3D()
594 pointsToPython( std::vector<gp_XYZ>() ); // avoid warning: pointsToPython defined but not used
597 //=======================================================================
598 //function : CheckHypothesis
600 //=======================================================================
602 bool StdMeshers_Prism_3D::CheckHypothesis(SMESH_Mesh& aMesh,
603 const TopoDS_Shape& aShape,
604 SMESH_Hypothesis::Hypothesis_Status& aStatus)
607 aStatus = SMESH_Hypothesis::HYP_OK;
611 //=======================================================================
613 //purpose : Compute mesh on a COMPOUND of SOLIDs
614 //=======================================================================
616 bool StdMeshers_Prism_3D::Compute(SMESH_Mesh& theMesh, const TopoDS_Shape& theShape)
618 SMESH_MesherHelper helper( theMesh );
622 int nbSolids = helper.Count( theShape, TopAbs_SOLID, /*skipSame=*/false );
626 TopTools_IndexedDataMapOfShapeListOfShape faceToSolids;
627 TopExp::MapShapesAndAncestors( theShape, TopAbs_FACE, TopAbs_SOLID, faceToSolids );
629 // look for meshed FACEs ("source" FACEs) that must be prism bottoms
630 list< TopoDS_Face > meshedFaces, notQuadMeshedFaces, notQuadFaces;
631 const bool meshHasQuads = ( theMesh.NbQuadrangles() > 0 );
632 //StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this );
633 for ( int iF = 1; iF <= faceToSolids.Extent(); ++iF )
635 const TopoDS_Face& face = TopoDS::Face( faceToSolids.FindKey( iF ));
636 SMESH_subMesh* faceSM = theMesh.GetSubMesh( face );
637 if ( !faceSM->IsEmpty() )
639 if ( !meshHasQuads ||
640 !helper.IsSameElemGeometry( faceSM->GetSubMeshDS(), SMDSGeom_QUADRANGLE ) ||
641 !helper.IsStructured( faceSM )
643 notQuadMeshedFaces.push_front( face );
644 else if ( myHelper->Count( face, TopAbs_EDGE, /*ignoreSame=*/false ) != 4 )
645 meshedFaces.push_front( face );
647 meshedFaces.push_back( face );
649 // not add not quadrilateral FACE as we can't compute it
650 // else if ( !quadAlgo->CheckNbEdges( theMesh, face ))
651 // // not add not quadrilateral FACE as it can be a prism side
652 // // else if ( myHelper->Count( face, TopAbs_EDGE, /*ignoreSame=*/false ) != 4 )
654 // notQuadFaces.push_back( face );
657 // notQuadFaces are of medium priority, put them before ordinary meshed faces
658 meshedFaces.splice( meshedFaces.begin(), notQuadFaces );
659 // notQuadMeshedFaces are of highest priority, put them before notQuadFaces
660 meshedFaces.splice( meshedFaces.begin(), notQuadMeshedFaces );
662 Prism_3D::TPrismTopo prism;
664 bool selectBottom = meshedFaces.empty();
668 TopoDS_Shape solid = TopExp_Explorer( theShape, TopAbs_SOLID ).Current();
669 if ( !meshedFaces.empty() )
670 prism.myBottom = meshedFaces.front();
671 return ( initPrism( prism, solid, selectBottom ) &&
675 // find propagation chains from already computed EDGEs
676 vector< TopoDS_Edge > computedEdges;
677 getPrecomputedEdges( helper, theShape, computedEdges );
678 myPropagChains = new TopTools_IndexedMapOfShape[ computedEdges.size() + 1 ];
679 SMESHUtils::ArrayDeleter< TopTools_IndexedMapOfShape > pcDel( myPropagChains );
680 for ( size_t i = 0, nb = 0; i < computedEdges.size(); ++i )
682 StdMeshers_ProjectionUtils::GetPropagationEdge( &theMesh, TopoDS_Edge(),
683 computedEdges[i], myPropagChains + nb );
684 if ( myPropagChains[ nb ].Extent() < 2 ) // an empty map is a termination sign
685 myPropagChains[ nb ].Clear();
690 TopTools_MapOfShape meshedSolids;
691 list< Prism_3D::TPrismTopo > meshedPrism;
692 list< TopoDS_Face > suspectSourceFaces;
693 TopTools_ListIteratorOfListOfShape solidIt;
695 while ( meshedSolids.Extent() < nbSolids )
697 if ( _computeCanceled )
698 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
700 // compute prisms having avident computed source FACE
701 while ( !meshedFaces.empty() )
703 TopoDS_Face face = meshedFaces.front();
704 meshedFaces.pop_front();
705 TopTools_ListOfShape& solidList = faceToSolids.ChangeFromKey( face );
706 while ( !solidList.IsEmpty() )
708 TopoDS_Shape solid = solidList.First();
709 solidList.RemoveFirst();
710 if ( meshedSolids.Add( solid ))
713 prism.myBottom = face;
714 if ( !initPrism( prism, solid, selectBottom ) ||
718 SMESHDS_SubMesh* smDS = theMesh.GetMeshDS()->MeshElements( prism.myTop );
719 if ( !myHelper->IsSameElemGeometry( smDS, SMDSGeom_QUADRANGLE ))
721 meshedFaces.push_front( prism.myTop );
725 suspectSourceFaces.push_back( prism.myTop );
727 meshedPrism.push_back( prism );
731 if ( meshedSolids.Extent() == nbSolids )
734 // below in the loop we try to find source FACEs somehow
736 // project mesh from source FACEs of computed prisms to
737 // prisms sharing wall FACEs
738 list< Prism_3D::TPrismTopo >::iterator prismIt = meshedPrism.begin();
739 for ( ; prismIt != meshedPrism.end(); ++prismIt )
741 for ( size_t iW = 0; iW < prismIt->myWallQuads.size(); ++iW )
743 Prism_3D::TQuadList::iterator wQuad = prismIt->myWallQuads[iW].begin();
744 for ( ; wQuad != prismIt->myWallQuads[iW].end(); ++ wQuad )
746 const TopoDS_Face& wFace = (*wQuad)->face;
747 TopTools_ListOfShape& solidList = faceToSolids.ChangeFromKey( wFace );
748 solidIt.Initialize( solidList );
749 while ( solidIt.More() )
751 const TopoDS_Shape& solid = solidIt.Value();
752 if ( meshedSolids.Contains( solid )) {
753 solidList.Remove( solidIt );
754 continue; // already computed prism
756 if ( myHelper->IsBlock( solid )) {
758 continue; // too trivial
760 // find a source FACE of the SOLID: it's a FACE sharing a bottom EDGE with wFace
761 const TopoDS_Edge& wEdge = (*wQuad)->side[ QUAD_TOP_SIDE ].grid->Edge(0);
762 PShapeIteratorPtr faceIt = myHelper->GetAncestors( wEdge, *myHelper->GetMesh(),
764 while ( const TopoDS_Shape* f = faceIt->next() )
766 const TopoDS_Face& candidateF = TopoDS::Face( *f );
767 if ( candidateF.IsSame( wFace )) continue;
768 // select a source FACE: prismIt->myBottom or prismIt->myTop
769 TopoDS_Face sourceF = prismIt->myBottom;
770 for ( TopExp_Explorer v( prismIt->myTop, TopAbs_VERTEX ); v.More(); v.Next() )
771 if ( myHelper->IsSubShape( v.Current(), candidateF )) {
772 sourceF = prismIt->myTop;
776 prism.myBottom = candidateF;
777 mySetErrorToSM = false;
778 if ( !myHelper->IsSubShape( candidateF, prismIt->myShape3D ) &&
779 myHelper ->IsSubShape( candidateF, solid ) &&
780 !myHelper->GetMesh()->GetSubMesh( candidateF )->IsMeshComputed() &&
781 initPrism( prism, solid, /*selectBottom=*/false ) &&
782 !myHelper->GetMesh()->GetSubMesh( prism.myTop )->IsMeshComputed() &&
783 !myHelper->GetMesh()->GetSubMesh( prism.myBottom )->IsMeshComputed() &&
784 project2dMesh( sourceF, prism.myBottom ))
786 mySetErrorToSM = true;
787 if ( !compute( prism ))
789 SMESHDS_SubMesh* smDS = theMesh.GetMeshDS()->MeshElements( prism.myTop );
790 if ( !myHelper->IsSameElemGeometry( smDS, SMDSGeom_QUADRANGLE ))
792 meshedFaces.push_front( prism.myTop );
793 meshedFaces.push_front( prism.myBottom );
794 selectBottom = false;
796 meshedPrism.push_back( prism );
797 meshedSolids.Add( solid );
801 mySetErrorToSM = true;
803 if ( meshedSolids.Contains( solid ))
804 solidList.Remove( solidIt );
810 if ( !meshedFaces.empty() )
811 break; // to compute prisms with avident sources
814 if ( meshedFaces.empty() )
816 meshedFaces.splice( meshedFaces.end(), suspectSourceFaces );
820 // find FACEs with local 1D hyps, which has to be computed by now,
821 // or at least any computed FACEs
822 if ( meshedFaces.empty() )
825 for ( int iF = 1; iF <= faceToSolids.Extent(); ++iF )
827 const TopoDS_Face& face = TopoDS::Face( faceToSolids.FindKey( iF ));
828 const TopTools_ListOfShape& solidList = faceToSolids.FindFromKey( face );
829 if ( solidList.IsEmpty() ) continue;
830 SMESH_subMesh* faceSM = theMesh.GetSubMesh( face );
831 if ( !faceSM->IsEmpty() )
833 int nbFaces = faceSM->GetSubMeshDS()->NbElements();
834 if ( prevNbFaces < nbFaces )
836 if ( !meshedFaces.empty() ) meshedFaces.pop_back();
837 meshedFaces.push_back( face ); // lower priority
839 prevNbFaces = nbFaces;
844 bool allSubMeComputed = true;
845 SMESH_subMeshIteratorPtr smIt = faceSM->getDependsOnIterator(false,true);
846 while ( smIt->more() && allSubMeComputed )
847 allSubMeComputed = smIt->next()->IsMeshComputed();
848 if ( allSubMeComputed )
850 faceSM->ComputeStateEngine( SMESH_subMesh::COMPUTE );
851 if ( !faceSM->IsEmpty() ) {
852 meshedFaces.push_front( face ); // higher priority
857 faceSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
865 // TODO. there are other ways to find out the source FACE:
866 // propagation, topological similarity, etc...
868 // simply try to mesh all not meshed SOLIDs
869 if ( meshedFaces.empty() )
871 for ( TopExp_Explorer solid( theShape, TopAbs_SOLID ); solid.More(); solid.Next() )
873 mySetErrorToSM = false;
875 if ( !meshedSolids.Contains( solid.Current() ) &&
876 initPrism( prism, solid.Current() ))
878 mySetErrorToSM = true;
879 if ( !compute( prism ))
881 meshedFaces.push_front( prism.myTop );
882 meshedFaces.push_front( prism.myBottom );
883 meshedPrism.push_back( prism );
884 meshedSolids.Add( solid.Current() );
887 mySetErrorToSM = true;
891 if ( meshedFaces.empty() ) // set same error to 10 not-computed solids
893 SMESH_ComputeErrorPtr err = SMESH_ComputeError::New
894 ( COMPERR_BAD_INPUT_MESH, "No meshed source face found", this );
896 const int maxNbErrors = 10; // limit nb errors not to overload the Compute dialog
897 TopExp_Explorer solid( theShape, TopAbs_SOLID );
898 for ( int i = 0; ( i < maxNbErrors && solid.More() ); ++i, solid.Next() )
899 if ( !meshedSolids.Contains( solid.Current() ))
901 SMESH_subMesh* sm = theMesh.GetSubMesh( solid.Current() );
902 sm->GetComputeError() = err;
907 return error( COMPERR_OK );
910 //================================================================================
912 * \brief Find wall faces by bottom edges
914 //================================================================================
916 bool StdMeshers_Prism_3D::getWallFaces( Prism_3D::TPrismTopo & thePrism,
917 const int totalNbFaces)
919 thePrism.myWallQuads.clear();
921 SMESH_Mesh* mesh = myHelper->GetMesh();
923 StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this, myHelper );
925 TopTools_MapOfShape faceMap;
926 TopTools_IndexedDataMapOfShapeListOfShape edgeToFaces;
927 TopExp::MapShapesAndAncestors( thePrism.myShape3D,
928 TopAbs_EDGE, TopAbs_FACE, edgeToFaces );
930 // ------------------------------
931 // Get the 1st row of wall FACEs
932 // ------------------------------
934 list< TopoDS_Edge >::iterator edge = thePrism.myBottomEdges.begin();
935 std::list< int >::iterator nbE = thePrism.myNbEdgesInWires.begin();
936 std::list< int > nbQuadsPerWire;
937 int iE = 0, iWire = 0;
938 while ( edge != thePrism.myBottomEdges.end() )
941 if ( SMESH_Algo::isDegenerated( *edge ))
943 edge = thePrism.myBottomEdges.erase( edge );
949 bool hasWallFace = false;
950 TopTools_ListIteratorOfListOfShape faceIt( edgeToFaces.FindFromKey( *edge ));
951 for ( ; faceIt.More(); faceIt.Next() )
953 const TopoDS_Face& face = TopoDS::Face( faceIt.Value() );
954 if ( !thePrism.myBottom.IsSame( face ))
957 Prism_3D::TQuadList quadList( 1, quadAlgo->CheckNbEdges( *mesh, face ));
958 if ( !quadList.back() )
959 return toSM( error(TCom("Side face #") << shapeID( face )
960 << " not meshable with quadrangles"));
961 bool isCompositeBase = ! setBottomEdge( *edge, quadList.back(), face );
962 if ( isCompositeBase )
964 // it's OK if all EDGEs of the bottom side belongs to the bottom FACE
965 StdMeshers_FaceSidePtr botSide = quadList.back()->side[ QUAD_BOTTOM_SIDE ];
966 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
967 if ( !myHelper->IsSubShape( botSide->Edge(iE), thePrism.myBottom ))
968 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
970 if ( faceMap.Add( face ))
972 setWireIndex( quadList.back(), iWire ); // for use in makeQuadsForOutInProjection()
973 thePrism.myWallQuads.push_back( quadList );
982 else // seam edge (IPAL53561)
984 edge = thePrism.myBottomEdges.erase( edge );
994 int nbQuadPrev = std::accumulate( nbQuadsPerWire.begin(), nbQuadsPerWire.end(), 0 );
995 nbQuadsPerWire.push_back( thePrism.myWallQuads.size() - nbQuadPrev );
999 // -------------------------
1000 // Find the rest wall FACEs
1001 // -------------------------
1003 // Compose a vector of indixes of right neighbour FACE for each wall FACE
1004 // that is not so evident in case of several WIREs in the bottom FACE
1005 thePrism.myRightQuadIndex.clear();
1006 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1008 thePrism.myRightQuadIndex.push_back( i+1 ); // OK for all but the last EDGE of a WIRE
1010 list< int >::iterator nbQinW = nbQuadsPerWire.begin();
1011 for ( int iLeft = 0; nbQinW != nbQuadsPerWire.end(); ++nbQinW )
1013 thePrism.myRightQuadIndex[ iLeft + *nbQinW - 1 ] = iLeft; // for the last EDGE of a WIRE
1017 while ( totalNbFaces - faceMap.Extent() > 2 )
1019 // find wall FACEs adjacent to each of wallQuads by the right side EDGE
1022 nbKnownFaces = faceMap.Extent();
1023 StdMeshers_FaceSidePtr rightSide, topSide; // sides of the quad
1024 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1026 rightSide = thePrism.myWallQuads[i].back()->side[ QUAD_RIGHT_SIDE ];
1027 for ( int iE = 0; iE < rightSide->NbEdges(); ++iE ) // rightSide can be composite
1029 const TopoDS_Edge & rightE = rightSide->Edge( iE );
1030 TopTools_ListIteratorOfListOfShape face( edgeToFaces.FindFromKey( rightE ));
1031 for ( ; face.More(); face.Next() )
1032 if ( faceMap.Add( face.Value() ))
1034 // a new wall FACE encountered, store it in thePrism.myWallQuads
1035 const int iRight = thePrism.myRightQuadIndex[i];
1036 topSide = thePrism.myWallQuads[ iRight ].back()->side[ QUAD_TOP_SIDE ];
1037 const TopoDS_Edge& newBotE = topSide->Edge(0);
1038 const TopoDS_Shape& newWallF = face.Value();
1039 thePrism.myWallQuads[ iRight ].push_back( quadAlgo->CheckNbEdges( *mesh, newWallF ));
1040 if ( !thePrism.myWallQuads[ iRight ].back() )
1041 return toSM( error(TCom("Side face #") << shapeID( newWallF ) <<
1042 " not meshable with quadrangles"));
1043 if ( ! setBottomEdge( newBotE, thePrism.myWallQuads[ iRight ].back(), newWallF ))
1044 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1048 } while ( nbKnownFaces != faceMap.Extent() );
1050 // find wall FACEs adjacent to each of thePrism.myWallQuads by the top side EDGE
1051 if ( totalNbFaces - faceMap.Extent() > 2 )
1053 const int nbFoundWalls = faceMap.Extent();
1054 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1056 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1057 const TopoDS_Edge & topE = topSide->Edge( 0 );
1058 if ( topSide->NbEdges() > 1 )
1059 return toSM( error(COMPERR_BAD_SHAPE, TCom("Side face #") <<
1060 shapeID( thePrism.myWallQuads[i].back()->face )
1061 << " has a composite top edge"));
1062 TopTools_ListIteratorOfListOfShape faceIt( edgeToFaces.FindFromKey( topE ));
1063 for ( ; faceIt.More(); faceIt.Next() )
1064 if ( faceMap.Add( faceIt.Value() ))
1066 // a new wall FACE encountered, store it in wallQuads
1067 thePrism.myWallQuads[ i ].push_back( quadAlgo->CheckNbEdges( *mesh, faceIt.Value() ));
1068 if ( !thePrism.myWallQuads[ i ].back() )
1069 return toSM( error(TCom("Side face #") << shapeID( faceIt.Value() ) <<
1070 " not meshable with quadrangles"));
1071 if ( ! setBottomEdge( topE, thePrism.myWallQuads[ i ].back(), faceIt.Value() ))
1072 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1073 if ( totalNbFaces - faceMap.Extent() == 2 )
1075 i = thePrism.myWallQuads.size(); // to quit from the outer loop
1080 if ( nbFoundWalls == faceMap.Extent() )
1081 return toSM( error("Failed to find wall faces"));
1084 } // while ( totalNbFaces - faceMap.Extent() > 2 )
1086 // ------------------
1087 // Find the top FACE
1088 // ------------------
1090 if ( thePrism.myTop.IsNull() )
1092 // now only top and bottom FACEs are not in the faceMap
1093 faceMap.Add( thePrism.myBottom );
1094 for ( TopExp_Explorer f( thePrism.myShape3D, TopAbs_FACE ); f.More(); f.Next() )
1095 if ( !faceMap.Contains( f.Current() )) {
1096 thePrism.myTop = TopoDS::Face( f.Current() );
1099 if ( thePrism.myTop.IsNull() )
1100 return toSM( error("Top face not found"));
1103 // Check that the top FACE shares all the top EDGEs
1104 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1106 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1107 const TopoDS_Edge & topE = topSide->Edge( 0 );
1108 if ( !myHelper->IsSubShape( topE, thePrism.myTop ))
1109 return toSM( error( TCom("Wrong source face: #") << shapeID( thePrism.myBottom )));
1115 //=======================================================================
1116 //function : compute
1117 //purpose : Compute mesh on a SOLID
1118 //=======================================================================
1120 bool StdMeshers_Prism_3D::compute(const Prism_3D::TPrismTopo& thePrism)
1122 myHelper->IsQuadraticSubMesh( thePrism.myShape3D );
1123 if ( _computeCanceled )
1124 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
1126 // Assure the bottom is meshed
1127 if ( !computeBase( thePrism ))
1130 // Make all side FACEs of thePrism meshed with quads
1131 if ( !computeWalls( thePrism ))
1134 // Analyse mesh and geometry to find all block sub-shapes and submeshes
1135 // (after fixing IPAL52499 myBlock is used as a holder of boundary nodes
1136 // and for 2D projection in hard cases where StdMeshers_Projection_2D fails;
1137 // location of internal nodes is usually computed by StdMeshers_Sweeper)
1138 if ( !myBlock.Init( myHelper, thePrism ))
1139 return toSM( error( myBlock.GetError()));
1141 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1143 int volumeID = meshDS->ShapeToIndex( thePrism.myShape3D );
1145 // Try to get gp_Trsf to get all nodes from bottom ones
1146 vector<gp_Trsf> trsf;
1147 gp_Trsf bottomToTopTrsf;
1148 // if ( !myBlock.GetLayersTransformation( trsf, thePrism ))
1150 // else if ( !trsf.empty() )
1151 // bottomToTopTrsf = trsf.back();
1153 // To compute coordinates of a node inside a block using "block approach",
1154 // it is necessary to know
1155 // 1. normalized parameters of the node by which
1156 // 2. coordinates of node projections on all block sub-shapes are computed
1158 // So we fill projections on vertices at once as they are same for all nodes
1159 myShapeXYZ.resize( myBlock.NbSubShapes() );
1160 for ( int iV = SMESH_Block::ID_FirstV; iV < SMESH_Block::ID_FirstE; ++iV ) {
1161 myBlock.VertexPoint( iV, myShapeXYZ[ iV ]);
1162 SHOWYXZ("V point " <<iV << " ", myShapeXYZ[ iV ]);
1165 // Projections on the top and bottom faces are taken from nodes existing
1166 // on these faces; find correspondence between bottom and top nodes
1167 myUseBlock = false; // is set to true if projection is done using "block approach"
1168 myBotToColumnMap.clear();
1169 if ( !assocOrProjBottom2Top( bottomToTopTrsf, thePrism ) ) // it also fills myBotToColumnMap
1173 // Create nodes inside the block
1177 // use transformation (issue 0020680, IPAL0052499) or a "straight line" approach
1178 StdMeshers_Sweeper sweeper;
1179 sweeper.myHelper = myHelper;
1180 sweeper.myBotFace = thePrism.myBottom;
1181 sweeper.myTopFace = thePrism.myTop;
1183 // load boundary nodes into sweeper
1185 std::set< const SMDS_MeshNode* > usedEndNodes;
1186 list< TopoDS_Edge >::const_iterator edge = thePrism.myBottomEdges.begin();
1187 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
1189 int edgeID = meshDS->ShapeToIndex( *edge );
1190 TParam2ColumnMap* u2col = const_cast<TParam2ColumnMap*>
1191 ( myBlock.GetParam2ColumnMap( edgeID, dummy ));
1193 TParam2ColumnMap::iterator u2colIt = u2col->begin(), u2colEnd = u2col->end();
1194 const SMDS_MeshNode* n0 = u2colIt->second[0];
1195 const SMDS_MeshNode* n1 = u2col->rbegin()->second[0];
1196 if ( !usedEndNodes.insert ( n0 ).second ) ++u2colIt;
1197 if ( !usedEndNodes.insert ( n1 ).second ) --u2colEnd;
1199 for ( ; u2colIt != u2colEnd; ++u2colIt )
1200 sweeper.myBndColumns.push_back( & u2colIt->second );
1202 // load node columns inside the bottom FACE
1203 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1204 sweeper.myIntColumns.reserve( myBotToColumnMap.size() );
1205 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1206 sweeper.myIntColumns.push_back( & bot_column->second );
1208 myHelper->SetElementsOnShape( true );
1210 // If all "vertical" EDGEs are straight, then all nodes of an internal node column
1211 // are located on a line connecting the top node and the bottom node.
1212 bool isStrightColunm = allVerticalEdgesStraight( thePrism );
1213 if ( !isStrightColunm )
1215 double tol = getSweepTolerance( thePrism );
1216 bool allowHighBndError = !isSimpleBottom( thePrism );
1217 myUseBlock = !sweeper.ComputeNodesByTrsf( tol, allowHighBndError );
1219 else if ( sweeper.CheckSameZ() )
1221 myUseBlock = !sweeper.ComputeNodesOnStraightSameZ();
1225 myUseBlock = !sweeper.ComputeNodesOnStraight();
1227 myHelper->SetElementsOnShape( false );
1230 if ( myUseBlock ) // use block approach
1232 // loop on nodes inside the bottom face
1233 Prism_3D::TNode prevBNode;
1234 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1235 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1237 const Prism_3D::TNode& tBotNode = bot_column->first; // bottom TNode
1238 if ( tBotNode.GetPositionType() != SMDS_TOP_FACE &&
1239 myBlock.HasNodeColumn( tBotNode.myNode ))
1240 continue; // node is not inside the FACE
1242 // column nodes; middle part of the column are zero pointers
1243 TNodeColumn& column = bot_column->second;
1245 gp_XYZ botParams, topParams;
1246 if ( !tBotNode.HasParams() )
1248 // compute bottom node parameters
1249 gp_XYZ paramHint(-1,-1,-1);
1250 if ( prevBNode.IsNeighbor( tBotNode ))
1251 paramHint = prevBNode.GetParams();
1252 if ( !myBlock.ComputeParameters( tBotNode.GetCoords(), tBotNode.ChangeParams(),
1253 ID_BOT_FACE, paramHint ))
1254 return toSM( error(TCom("Can't compute normalized parameters for node ")
1255 << tBotNode.myNode->GetID() << " on the face #"
1256 << myBlock.SubMesh( ID_BOT_FACE )->GetId() ));
1257 prevBNode = tBotNode;
1259 botParams = topParams = tBotNode.GetParams();
1260 topParams.SetZ( 1 );
1262 // compute top node parameters
1263 if ( column.size() > 2 ) {
1264 gp_Pnt topCoords = gpXYZ( column.back() );
1265 if ( !myBlock.ComputeParameters( topCoords, topParams, ID_TOP_FACE, topParams ))
1266 return toSM( error(TCom("Can't compute normalized parameters ")
1267 << "for node " << column.back()->GetID()
1268 << " on the face #"<< column.back()->getshapeId() ));
1271 else // top nodes are created by projection using parameters
1273 botParams = topParams = tBotNode.GetParams();
1274 topParams.SetZ( 1 );
1277 myShapeXYZ[ ID_BOT_FACE ] = tBotNode.GetCoords();
1278 myShapeXYZ[ ID_TOP_FACE ] = gpXYZ( column.back() );
1281 TNodeColumn::iterator columnNodes = column.begin();
1282 for ( int z = 0; columnNodes != column.end(); ++columnNodes, ++z)
1284 const SMDS_MeshNode* & node = *columnNodes;
1285 if ( node ) continue; // skip bottom or top node
1287 // params of a node to create
1288 double rz = (double) z / (double) ( column.size() - 1 );
1289 gp_XYZ params = botParams * ( 1 - rz ) + topParams * rz;
1291 // set coords on all faces and nodes
1292 const int nbSideFaces = 4;
1293 int sideFaceIDs[nbSideFaces] = { SMESH_Block::ID_Fx0z,
1294 SMESH_Block::ID_Fx1z,
1295 SMESH_Block::ID_F0yz,
1296 SMESH_Block::ID_F1yz };
1297 for ( int iF = 0; iF < nbSideFaces; ++iF )
1298 if ( !setFaceAndEdgesXYZ( sideFaceIDs[ iF ], params, z ))
1301 // compute coords for a new node
1303 if ( !SMESH_Block::ShellPoint( params, myShapeXYZ, coords ))
1304 return toSM( error("Can't compute coordinates by normalized parameters"));
1306 // if ( !meshDS->MeshElements( volumeID ) ||
1307 // meshDS->MeshElements( volumeID )->NbNodes() == 0 )
1308 // pointsToPython(myShapeXYZ);
1309 SHOWYXZ("TOPFacePoint ",myShapeXYZ[ ID_TOP_FACE]);
1310 SHOWYXZ("BOT Node "<< tBotNode.myNode->GetID(),gpXYZ(tBotNode.myNode));
1311 SHOWYXZ("ShellPoint ",coords);
1314 node = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
1315 meshDS->SetNodeInVolume( node, volumeID );
1317 if ( _computeCanceled )
1320 } // loop on bottom nodes
1325 SMESHDS_SubMesh* smDS = myBlock.SubMeshDS( ID_BOT_FACE );
1326 if ( !smDS ) return toSM( error(COMPERR_BAD_INPUT_MESH, "Null submesh"));
1328 // loop on bottom mesh faces
1329 vector< const TNodeColumn* > columns;
1330 SMDS_ElemIteratorPtr faceIt = smDS->GetElements();
1331 while ( faceIt->more() )
1333 const SMDS_MeshElement* face = faceIt->next();
1334 if ( !face || face->GetType() != SMDSAbs_Face )
1337 // find node columns for each node
1338 int nbNodes = face->NbCornerNodes();
1339 columns.resize( nbNodes );
1340 for ( int i = 0; i < nbNodes; ++i )
1342 const SMDS_MeshNode* n = face->GetNode( i );
1343 columns[ i ] = NULL;
1345 if ( n->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
1346 columns[ i ] = myBlock.GetNodeColumn( n );
1348 if ( !columns[ i ] )
1350 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
1351 if ( bot_column == myBotToColumnMap.end() )
1352 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
1353 columns[ i ] = & bot_column->second;
1357 if ( !AddPrisms( columns, myHelper ))
1358 return toSM( error("Different 'vertical' discretization"));
1360 } // loop on bottom mesh faces
1363 myBotToColumnMap.clear();
1366 // update state of sub-meshes (mostly in order to erase improper errors)
1367 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( thePrism.myShape3D );
1368 SMESH_subMeshIteratorPtr smIt = sm->getDependsOnIterator(/*includeSelf=*/true);
1369 while ( smIt->more() )
1372 sm->GetComputeError().reset();
1373 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1379 //=======================================================================
1380 //function : computeBase
1381 //purpose : Compute the base face of a prism
1382 //=======================================================================
1384 bool StdMeshers_Prism_3D::computeBase(const Prism_3D::TPrismTopo& thePrism)
1386 SMESH_Mesh* mesh = myHelper->GetMesh();
1387 SMESH_subMesh* botSM = mesh->GetSubMesh( thePrism.myBottom );
1388 if (( botSM->IsEmpty() ) &&
1389 ( ! botSM->GetAlgo() ||
1390 ! _gen->Compute( *botSM->GetFather(), botSM->GetSubShape(), /*shapeOnly=*/true )))
1392 // find any applicable algorithm assigned to any FACE of the main shape
1393 std::vector< TopoDS_Shape > faces;
1394 if ( myPrevBottomSM &&
1395 myPrevBottomSM->GetAlgo()->IsApplicableToShape( thePrism.myBottom, /*all=*/false ))
1396 faces.push_back( myPrevBottomSM->GetSubShape() );
1398 TopExp_Explorer faceIt( mesh->GetShapeToMesh(), TopAbs_FACE );
1399 for ( ; faceIt.More(); faceIt.Next() )
1400 faces.push_back( faceIt.Current() );
1402 faces.push_back( TopoDS_Shape() ); // to try quadrangle algorithm
1404 SMESH_Algo* algo = 0;
1405 for ( size_t i = 0; i < faces.size() && botSM->IsEmpty(); ++i )
1407 if ( faces[i].IsNull() ) algo = TQuadrangleAlgo::instance( this, myHelper );
1408 else algo = mesh->GetSubMesh( faces[i] )->GetAlgo();
1409 if ( algo && algo->IsApplicableToShape( thePrism.myBottom, /*all=*/false ))
1411 // try to compute the bottom FACE
1412 if ( algo->NeedDiscreteBoundary() )
1414 // compute sub-shapes
1415 SMESH_subMeshIteratorPtr smIt = botSM->getDependsOnIterator(false,false);
1417 while ( smIt->more() && subOK )
1419 SMESH_subMesh* sub = smIt->next();
1420 sub->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1421 subOK = sub->IsMeshComputed();
1428 algo->InitComputeError();
1429 algo->Compute( *mesh, botSM->GetSubShape() );
1437 if ( botSM->IsEmpty() )
1438 return error( COMPERR_BAD_INPUT_MESH,
1439 TCom( "No mesher defined to compute the base face #")
1440 << shapeID( thePrism.myBottom ));
1442 if ( botSM->GetAlgo() )
1443 myPrevBottomSM = botSM;
1448 //=======================================================================
1449 //function : computeWalls
1450 //purpose : Compute 2D mesh on walls FACEs of a prism
1451 //=======================================================================
1453 bool StdMeshers_Prism_3D::computeWalls(const Prism_3D::TPrismTopo& thePrism)
1455 SMESH_Mesh* mesh = myHelper->GetMesh();
1456 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1457 DBGOUT( endl << "COMPUTE Prism " << meshDS->ShapeToIndex( thePrism.myShape3D ));
1459 TProjction1dAlgo* projector1D = TProjction1dAlgo::instance( this );
1460 StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this, myHelper );
1462 // SMESH_HypoFilter hyp1dFilter( SMESH_HypoFilter::IsAlgo(),/*not=*/true);
1463 // hyp1dFilter.And( SMESH_HypoFilter::HasDim( 1 ));
1464 // hyp1dFilter.And( SMESH_HypoFilter::IsMoreLocalThan( thePrism.myShape3D, *mesh ));
1466 // Discretize equally 'vertical' EDGEs
1467 // -----------------------------------
1468 // find source FACE sides for projection: either already computed ones or
1469 // the 'most composite' ones
1470 const size_t nbWalls = thePrism.myWallQuads.size();
1471 vector< int > wgt( nbWalls, 0 ); // "weight" of a wall
1472 for ( size_t iW = 0; iW != nbWalls; ++iW )
1474 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1475 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1477 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ];
1478 lftSide->Reverse(); // to go up
1479 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1482 const TopoDS_Edge& E = lftSide->Edge(i);
1483 if ( mesh->GetSubMesh( E )->IsMeshComputed() )
1486 wgt[ myHelper->WrapIndex( iW+1, nbWalls)] += 10;
1487 wgt[ myHelper->WrapIndex( iW-1, nbWalls)] += 10;
1489 // else if ( mesh->GetHypothesis( E, hyp1dFilter, true )) // local hypothesis!
1493 // in quadratic mesh, pass ignoreMediumNodes to quad sides
1494 if ( myHelper->GetIsQuadratic() )
1496 quad = thePrism.myWallQuads[iW].begin();
1497 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1498 for ( int i = 0; i < NB_QUAD_SIDES; ++i )
1499 (*quad)->side[ i ].grid->SetIgnoreMediumNodes( true );
1502 multimap< int, int > wgt2quad;
1503 for ( size_t iW = 0; iW != nbWalls; ++iW )
1504 wgt2quad.insert( make_pair( wgt[ iW ], iW ));
1506 // artificial quads to do outer <-> inner wall projection
1507 std::map< int, FaceQuadStruct > iW2oiQuads;
1508 std::map< int, FaceQuadStruct >::iterator w2oiq;
1509 makeQuadsForOutInProjection( thePrism, wgt2quad, iW2oiQuads );
1511 // Project 'vertical' EDGEs, from left to right
1512 multimap< int, int >::reverse_iterator w2q = wgt2quad.rbegin();
1513 for ( ; w2q != wgt2quad.rend(); ++w2q )
1515 const int iW = w2q->second;
1516 const Prism_3D::TQuadList& quads = thePrism.myWallQuads[ iW ];
1517 Prism_3D::TQuadList::const_iterator quad = quads.begin();
1518 for ( ; quad != quads.end(); ++quad )
1520 StdMeshers_FaceSidePtr rgtSide = (*quad)->side[ QUAD_RIGHT_SIDE ]; // tgt
1521 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ]; // src
1522 bool swapLeftRight = ( lftSide->NbSegments( /*update=*/true ) == 0 &&
1523 rgtSide->NbSegments( /*update=*/true ) > 0 );
1524 if ( swapLeftRight )
1525 std::swap( lftSide, rgtSide );
1527 bool isArtificialQuad = (( w2oiq = iW2oiQuads.find( iW )) != iW2oiQuads.end() );
1528 if ( isArtificialQuad )
1530 // reset sides to perform the outer <-> inner projection
1531 FaceQuadStruct& oiQuad = w2oiq->second;
1532 rgtSide = oiQuad.side[ QUAD_RIGHT_SIDE ];
1533 lftSide = oiQuad.side[ QUAD_LEFT_SIDE ];
1534 iW2oiQuads.erase( w2oiq );
1537 // assure that all the source (left) EDGEs are meshed
1538 int nbSrcSegments = 0;
1539 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1541 if ( isArtificialQuad )
1543 nbSrcSegments = lftSide->NbPoints()-1;
1546 const TopoDS_Edge& srcE = lftSide->Edge(i);
1547 SMESH_subMesh* srcSM = mesh->GetSubMesh( srcE );
1548 if ( !srcSM->IsMeshComputed() ) {
1549 DBGOUT( "COMPUTE V edge " << srcSM->GetId() );
1550 TopoDS_Edge prpgSrcE = findPropagationSource( srcE );
1551 if ( !prpgSrcE.IsNull() ) {
1552 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1553 projector1D->myHyp.SetSourceEdge( prpgSrcE );
1554 projector1D->Compute( *mesh, srcE );
1555 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1558 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1559 srcSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1561 if ( !srcSM->IsMeshComputed() )
1562 return toSM( error( "Can't compute 1D mesh" ));
1564 nbSrcSegments += srcSM->GetSubMeshDS()->NbElements();
1566 // check target EDGEs
1567 int nbTgtMeshed = 0, nbTgtSegments = 0;
1568 vector< bool > isTgtEdgeComputed( rgtSide->NbEdges() );
1569 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1571 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1572 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1573 if ( !( isTgtEdgeComputed[ i ] = tgtSM->IsMeshComputed() )) {
1574 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1575 tgtSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1577 if ( tgtSM->IsMeshComputed() ) {
1579 nbTgtSegments += tgtSM->GetSubMeshDS()->NbElements();
1582 if ( rgtSide->NbEdges() == nbTgtMeshed ) // all tgt EDGEs meshed
1584 if ( nbTgtSegments != nbSrcSegments )
1586 bool badMeshRemoved = false;
1587 // remove just computed segments
1588 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1589 if ( !isTgtEdgeComputed[ i ])
1591 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1592 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1593 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1594 badMeshRemoved = true;
1597 if ( !badMeshRemoved )
1599 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1600 addBadInputElements( meshDS->MeshElements( lftSide->Edge( i )));
1601 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1602 addBadInputElements( meshDS->MeshElements( rgtSide->Edge( i )));
1603 return toSM( error( TCom("Different nb of segment on logically vertical edges #")
1604 << shapeID( lftSide->Edge(0) ) << " and #"
1605 << shapeID( rgtSide->Edge(0) ) << ": "
1606 << nbSrcSegments << " != " << nbTgtSegments ));
1609 else // if ( nbTgtSegments == nbSrcSegments )
1614 // Compute 'vertical projection'
1615 if ( nbTgtMeshed == 0 )
1617 // compute nodes on target VERTEXes
1618 const UVPtStructVec& srcNodeStr = lftSide->GetUVPtStruct();
1619 if ( srcNodeStr.size() == 0 )
1620 return toSM( error( TCom("Invalid node positions on edge #") <<
1621 lftSide->EdgeID(0) ));
1622 vector< SMDS_MeshNode* > newNodes( srcNodeStr.size() );
1623 for ( int is2ndV = 0; is2ndV < 2; ++is2ndV )
1625 const TopoDS_Edge& E = rgtSide->Edge( is2ndV ? rgtSide->NbEdges()-1 : 0 );
1626 TopoDS_Vertex v = myHelper->IthVertex( is2ndV, E );
1627 mesh->GetSubMesh( v )->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1628 const SMDS_MeshNode* n = SMESH_Algo::VertexNode( v, meshDS );
1629 newNodes[ is2ndV ? newNodes.size()-1 : 0 ] = (SMDS_MeshNode*) n;
1632 // compute nodes on target EDGEs
1633 DBGOUT( "COMPUTE V edge (proj) " << shapeID( lftSide->Edge(0)));
1634 //rgtSide->Reverse(); // direct it same as the lftSide
1635 myHelper->SetElementsOnShape( false ); // myHelper holds the prism shape
1636 TopoDS_Edge tgtEdge;
1637 for ( size_t iN = 1; iN < srcNodeStr.size()-1; ++iN ) // add nodes
1639 gp_Pnt p = rgtSide->Value3d ( srcNodeStr[ iN ].normParam );
1640 double u = rgtSide->Parameter( srcNodeStr[ iN ].normParam, tgtEdge );
1641 newNodes[ iN ] = meshDS->AddNode( p.X(), p.Y(), p.Z() );
1642 meshDS->SetNodeOnEdge( newNodes[ iN ], tgtEdge, u );
1644 for ( size_t iN = 1; iN < srcNodeStr.size(); ++iN ) // add segments
1646 // find an EDGE to set a new segment
1647 std::pair<int, TopAbs_ShapeEnum> id2type =
1648 myHelper->GetMediumPos( newNodes[ iN-1 ], newNodes[ iN ] );
1649 if ( id2type.second != TopAbs_EDGE )
1651 // new nodes are on different EDGEs; put one of them on VERTEX
1652 const int edgeIndex = rgtSide->EdgeIndex( srcNodeStr[ iN-1 ].normParam );
1653 const double vertexParam = rgtSide->LastParameter( edgeIndex );
1654 TopoDS_Vertex vertex = rgtSide->LastVertex( edgeIndex );
1655 const SMDS_MeshNode* vn = SMESH_Algo::VertexNode( vertex, meshDS );
1656 const gp_Pnt p = BRep_Tool::Pnt( vertex );
1657 const int isPrev = ( Abs( srcNodeStr[ iN-1 ].normParam - vertexParam ) <
1658 Abs( srcNodeStr[ iN ].normParam - vertexParam ));
1659 meshDS->UnSetNodeOnShape( newNodes[ iN-isPrev ] );
1660 meshDS->SetNodeOnVertex ( newNodes[ iN-isPrev ], vertex );
1661 meshDS->MoveNode ( newNodes[ iN-isPrev ], p.X(), p.Y(), p.Z() );
1662 id2type.first = newNodes[ iN-(1-isPrev) ]->getshapeId();
1665 SMESH_MeshEditor::TListOfListOfNodes lln( 1, list< const SMDS_MeshNode* >() );
1666 lln.back().push_back ( vn );
1667 lln.back().push_front( newNodes[ iN-isPrev ] ); // to keep
1668 SMESH_MeshEditor( mesh ).MergeNodes( lln );
1671 SMDS_MeshElement* newEdge = myHelper->AddEdge( newNodes[ iN-1 ], newNodes[ iN ] );
1672 meshDS->SetMeshElementOnShape( newEdge, id2type.first );
1674 myHelper->SetElementsOnShape( true );
1675 for ( int i = 0; i < rgtSide->NbEdges(); ++i ) // update state of sub-meshes
1677 const TopoDS_Edge& E = rgtSide->Edge( i );
1678 SMESH_subMesh* tgtSM = mesh->GetSubMesh( E );
1679 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1682 // to continue projection from the just computed side as a source
1683 if ( !swapLeftRight && rgtSide->NbEdges() > 1 && w2q->second == iW )
1685 std::pair<int,int> wgt2quadKeyVal( w2q->first + 1, thePrism.myRightQuadIndex[ iW ]);
1686 wgt2quad.insert( wgt2quadKeyVal ); // it will be skipped by ++w2q
1687 wgt2quad.insert( wgt2quadKeyVal );
1688 w2q = wgt2quad.rbegin();
1693 // HOPE assigned hypotheses are OK, so that equal nb of segments will be generated
1694 //return toSM( error("Partial projection not implemented"));
1696 } // loop on quads of a composite wall side
1697 } // loop on the ordered wall sides
1701 for ( size_t iW = 0; iW != thePrism.myWallQuads.size(); ++iW )
1703 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1704 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1706 const TopoDS_Face& face = (*quad)->face;
1707 SMESH_subMesh* fSM = mesh->GetSubMesh( face );
1708 if ( ! fSM->IsMeshComputed() )
1710 // Top EDGEs must be projections from the bottom ones
1711 // to compute structured quad mesh on wall FACEs
1712 // ---------------------------------------------------
1713 const TopoDS_Edge& botE = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0);
1714 const TopoDS_Edge& topE = (*quad)->side[ QUAD_TOP_SIDE ].grid->Edge(0);
1715 SMESH_subMesh* botSM = mesh->GetSubMesh( botE );
1716 SMESH_subMesh* topSM = mesh->GetSubMesh( topE );
1717 SMESH_subMesh* srcSM = botSM;
1718 SMESH_subMesh* tgtSM = topSM;
1719 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1720 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1721 if ( !srcSM->IsMeshComputed() && tgtSM->IsMeshComputed() )
1722 std::swap( srcSM, tgtSM );
1724 if ( !srcSM->IsMeshComputed() )
1726 DBGOUT( "COMPUTE H edge " << srcSM->GetId());
1727 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE ); // nodes on VERTEXes
1728 srcSM->ComputeStateEngine( SMESH_subMesh::COMPUTE ); // segments on the EDGE
1731 if ( tgtSM->IsMeshComputed() &&
1732 tgtSM->GetSubMeshDS()->NbNodes() != srcSM->GetSubMeshDS()->NbNodes() )
1734 // the top EDGE is computed differently than the bottom one,
1735 // try to clear a wrong mesh
1736 bool isAdjFaceMeshed = false;
1737 PShapeIteratorPtr fIt = myHelper->GetAncestors( tgtSM->GetSubShape(),
1738 *mesh, TopAbs_FACE );
1739 while ( const TopoDS_Shape* f = fIt->next() )
1740 if (( isAdjFaceMeshed = mesh->GetSubMesh( *f )->IsMeshComputed() ))
1742 if ( isAdjFaceMeshed )
1743 return toSM( error( TCom("Different nb of segment on logically horizontal edges #")
1744 << shapeID( botE ) << " and #"
1745 << shapeID( topE ) << ": "
1746 << tgtSM->GetSubMeshDS()->NbElements() << " != "
1747 << srcSM->GetSubMeshDS()->NbElements() ));
1748 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1750 if ( !tgtSM->IsMeshComputed() )
1752 // compute nodes on VERTEXes
1753 SMESH_subMeshIteratorPtr smIt = tgtSM->getDependsOnIterator(/*includeSelf=*/false);
1754 while ( smIt->more() )
1755 smIt->next()->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1757 DBGOUT( "COMPUTE H edge (proj) " << tgtSM->GetId());
1758 projector1D->myHyp.SetSourceEdge( TopoDS::Edge( srcSM->GetSubShape() ));
1759 projector1D->InitComputeError();
1760 bool ok = projector1D->Compute( *mesh, tgtSM->GetSubShape() );
1763 SMESH_ComputeErrorPtr err = projector1D->GetComputeError();
1764 if ( err->IsOK() ) err->myName = COMPERR_ALGO_FAILED;
1765 tgtSM->GetComputeError() = err;
1769 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1772 // Compute quad mesh on wall FACEs
1773 // -------------------------------
1775 // make all EDGES meshed
1776 fSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1777 if ( !fSM->SubMeshesComputed() )
1778 return toSM( error( COMPERR_BAD_INPUT_MESH,
1779 "Not all edges have valid algorithm and hypothesis"));
1781 quadAlgo->InitComputeError();
1782 DBGOUT( "COMPUTE Quad face " << fSM->GetId());
1783 bool ok = quadAlgo->Compute( *mesh, face );
1784 fSM->GetComputeError() = quadAlgo->GetComputeError();
1787 fSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1789 if ( myHelper->GetIsQuadratic() )
1791 // fill myHelper with medium nodes built by quadAlgo
1792 SMDS_ElemIteratorPtr fIt = fSM->GetSubMeshDS()->GetElements();
1793 while ( fIt->more() )
1794 myHelper->AddTLinks( dynamic_cast<const SMDS_MeshFace*>( fIt->next() ));
1802 //=======================================================================
1803 //function : findPropagationSource
1804 //purpose : Returns a source EDGE of propagation to a given EDGE
1805 //=======================================================================
1807 TopoDS_Edge StdMeshers_Prism_3D::findPropagationSource( const TopoDS_Edge& E )
1809 if ( myPropagChains )
1810 for ( size_t i = 0; !myPropagChains[i].IsEmpty(); ++i )
1811 if ( myPropagChains[i].Contains( E ))
1812 return TopoDS::Edge( myPropagChains[i].FindKey( 1 ));
1814 return TopoDS_Edge();
1817 //=======================================================================
1818 //function : makeQuadsForOutInProjection
1819 //purpose : Create artificial wall quads for vertical projection between
1820 // the outer and inner walls
1821 //=======================================================================
1823 void StdMeshers_Prism_3D::makeQuadsForOutInProjection( const Prism_3D::TPrismTopo& thePrism,
1824 multimap< int, int >& wgt2quad,
1825 map< int, FaceQuadStruct >& iQ2oiQuads)
1827 if ( thePrism.NbWires() <= 1 )
1830 std::set< int > doneWires; // processed wires
1832 SMESH_Mesh* mesh = myHelper->GetMesh();
1833 const bool isForward = true;
1834 const bool skipMedium = myHelper->GetIsQuadratic();
1836 // make a source side for all projections
1838 multimap< int, int >::reverse_iterator w2q = wgt2quad.rbegin();
1839 const int iQuad = w2q->second;
1840 const int iWire = getWireIndex( thePrism.myWallQuads[ iQuad ].front() );
1841 doneWires.insert( iWire );
1843 UVPtStructVec srcNodes;
1845 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iQuad ].begin();
1846 for ( ; quad != thePrism.myWallQuads[ iQuad ].end(); ++quad )
1848 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ];
1850 // assure that all the source (left) EDGEs are meshed
1851 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1853 const TopoDS_Edge& srcE = lftSide->Edge(i);
1854 SMESH_subMesh* srcSM = mesh->GetSubMesh( srcE );
1855 if ( !srcSM->IsMeshComputed() ) {
1856 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1857 srcSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1859 if ( !srcSM->IsMeshComputed() )
1862 const UVPtStructVec& subNodes = lftSide->GetUVPtStruct();
1863 UVPtStructVec::const_iterator subBeg = subNodes.begin(), subEnd = subNodes.end();
1864 if ( !srcNodes.empty() ) ++subBeg;
1865 srcNodes.insert( srcNodes.end(), subBeg, subEnd );
1867 StdMeshers_FaceSidePtr srcSide = StdMeshers_FaceSide::New( srcNodes );
1871 list< TopoDS_Edge > sideEdges;
1873 for ( ++w2q; w2q != wgt2quad.rend(); ++w2q )
1875 const int iQuad = w2q->second;
1876 const Prism_3D::TQuadList& quads = thePrism.myWallQuads[ iQuad ];
1877 const int iWire = getWireIndex( quads.front() );
1878 if ( !doneWires.insert( iWire ).second )
1882 for ( quad = quads.begin(); quad != quads.end(); ++quad )
1884 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ];
1885 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1886 sideEdges.push_back( lftSide->Edge( i ));
1887 face = lftSide->Face();
1889 StdMeshers_FaceSidePtr tgtSide =
1890 StdMeshers_FaceSide::New( face, sideEdges, mesh, isForward, skipMedium, myHelper );
1892 FaceQuadStruct& newQuad = iQ2oiQuads[ iQuad ];
1893 newQuad.side.resize( 4 );
1894 newQuad.side[ QUAD_LEFT_SIDE ] = srcSide;
1895 newQuad.side[ QUAD_RIGHT_SIDE ] = tgtSide;
1897 wgt2quad.insert( *w2q ); // to process this quad after processing the newQuad
1901 //=======================================================================
1902 //function : Evaluate
1904 //=======================================================================
1906 bool StdMeshers_Prism_3D::Evaluate(SMESH_Mesh& theMesh,
1907 const TopoDS_Shape& theShape,
1908 MapShapeNbElems& aResMap)
1910 if ( theShape.ShapeType() == TopAbs_COMPOUND )
1913 for ( TopoDS_Iterator it( theShape ); it.More(); it.Next() )
1914 ok &= Evaluate( theMesh, it.Value(), aResMap );
1917 SMESH_MesherHelper helper( theMesh );
1919 myHelper->SetSubShape( theShape );
1921 // find face contains only triangles
1922 vector < SMESH_subMesh * >meshFaces;
1923 TopTools_SequenceOfShape aFaces;
1924 int NumBase = 0, i = 0, NbQFs = 0;
1925 for (TopExp_Explorer exp(theShape, TopAbs_FACE); exp.More(); exp.Next()) {
1927 aFaces.Append(exp.Current());
1928 SMESH_subMesh *aSubMesh = theMesh.GetSubMesh(exp.Current());
1929 meshFaces.push_back(aSubMesh);
1930 MapShapeNbElemsItr anIt = aResMap.find(meshFaces[i-1]);
1931 if( anIt==aResMap.end() )
1932 return toSM( error( "Submesh can not be evaluated"));
1934 std::vector<int> aVec = (*anIt).second;
1935 int nbtri = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1936 int nbqua = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1937 if( nbtri==0 && nbqua>0 ) {
1946 std::vector<int> aResVec(SMDSEntity_Last);
1947 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1948 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1949 aResMap.insert(std::make_pair(sm,aResVec));
1950 return toSM( error( "Submesh can not be evaluated" ));
1953 if(NumBase==0) NumBase = 1; // only quads => set 1 faces as base
1955 // find number of 1d elems for base face
1957 TopTools_MapOfShape Edges1;
1958 for (TopExp_Explorer exp(aFaces.Value(NumBase), TopAbs_EDGE); exp.More(); exp.Next()) {
1959 Edges1.Add(exp.Current());
1960 SMESH_subMesh *sm = theMesh.GetSubMesh(exp.Current());
1962 MapShapeNbElemsItr anIt = aResMap.find(sm);
1963 if( anIt == aResMap.end() ) continue;
1964 std::vector<int> aVec = (*anIt).second;
1965 nb1d += Max(aVec[SMDSEntity_Edge],aVec[SMDSEntity_Quad_Edge]);
1968 // find face opposite to base face
1970 for(i=1; i<=6; i++) {
1971 if(i==NumBase) continue;
1972 bool IsOpposite = true;
1973 for(TopExp_Explorer exp(aFaces.Value(i), TopAbs_EDGE); exp.More(); exp.Next()) {
1974 if( Edges1.Contains(exp.Current()) ) {
1984 // find number of 2d elems on side faces
1986 for(i=1; i<=6; i++) {
1987 if( i==OppNum || i==NumBase ) continue;
1988 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[i-1] );
1989 if( anIt == aResMap.end() ) continue;
1990 std::vector<int> aVec = (*anIt).second;
1991 nb2d += Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1994 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[NumBase-1] );
1995 std::vector<int> aVec = (*anIt).second;
1996 bool IsQuadratic = (aVec[SMDSEntity_Quad_Triangle]>aVec[SMDSEntity_Triangle]) ||
1997 (aVec[SMDSEntity_Quad_Quadrangle]>aVec[SMDSEntity_Quadrangle]);
1998 int nb2d_face0_3 = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1999 int nb2d_face0_4 = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
2000 int nb0d_face0 = aVec[SMDSEntity_Node];
2001 int nb1d_face0_int = ( nb2d_face0_3*3 + nb2d_face0_4*4 - nb1d ) / 2;
2003 std::vector<int> aResVec(SMDSEntity_Last);
2004 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
2006 aResVec[SMDSEntity_Quad_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
2007 aResVec[SMDSEntity_Quad_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
2008 aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
2011 aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
2012 aResVec[SMDSEntity_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
2013 aResVec[SMDSEntity_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
2015 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
2016 aResMap.insert(std::make_pair(sm,aResVec));
2021 //================================================================================
2023 * \brief Create prisms
2024 * \param columns - columns of nodes generated from nodes of a mesh face
2025 * \param helper - helper initialized by mesh and shape to add prisms to
2027 //================================================================================
2029 bool StdMeshers_Prism_3D::AddPrisms( vector<const TNodeColumn*> & columns,
2030 SMESH_MesherHelper* helper)
2032 size_t nbNodes = columns.size();
2033 size_t nbZ = columns[0]->size();
2034 if ( nbZ < 2 ) return false;
2035 for ( size_t i = 1; i < nbNodes; ++i )
2036 if ( columns[i]->size() != nbZ )
2039 // find out orientation
2040 bool isForward = true;
2041 SMDS_VolumeTool vTool;
2043 switch ( nbNodes ) {
2045 SMDS_VolumeOfNodes tmpPenta ( (*columns[0])[z-1], // bottom
2048 (*columns[0])[z], // top
2051 vTool.Set( &tmpPenta );
2052 isForward = vTool.IsForward();
2056 SMDS_VolumeOfNodes tmpHex( (*columns[0])[z-1], (*columns[1])[z-1], // bottom
2057 (*columns[2])[z-1], (*columns[3])[z-1],
2058 (*columns[0])[z], (*columns[1])[z], // top
2059 (*columns[2])[z], (*columns[3])[z] );
2060 vTool.Set( &tmpHex );
2061 isForward = vTool.IsForward();
2065 const int di = (nbNodes+1) / 3;
2066 SMDS_VolumeOfNodes tmpVol ( (*columns[0] )[z-1],
2067 (*columns[di] )[z-1],
2068 (*columns[2*di])[z-1],
2071 (*columns[2*di])[z] );
2072 vTool.Set( &tmpVol );
2073 isForward = vTool.IsForward();
2076 // vertical loop on columns
2078 helper->SetElementsOnShape( true );
2080 switch ( nbNodes ) {
2082 case 3: { // ---------- pentahedra
2083 const int i1 = isForward ? 1 : 2;
2084 const int i2 = isForward ? 2 : 1;
2085 for ( z = 1; z < nbZ; ++z )
2086 helper->AddVolume( (*columns[0 ])[z-1], // bottom
2087 (*columns[i1])[z-1],
2088 (*columns[i2])[z-1],
2089 (*columns[0 ])[z], // top
2091 (*columns[i2])[z] );
2094 case 4: { // ---------- hexahedra
2095 const int i1 = isForward ? 1 : 3;
2096 const int i3 = isForward ? 3 : 1;
2097 for ( z = 1; z < nbZ; ++z )
2098 helper->AddVolume( (*columns[0])[z-1], (*columns[i1])[z-1], // bottom
2099 (*columns[2])[z-1], (*columns[i3])[z-1],
2100 (*columns[0])[z], (*columns[i1])[z], // top
2101 (*columns[2])[z], (*columns[i3])[z] );
2104 case 6: { // ---------- octahedra
2105 const int iBase1 = isForward ? -1 : 0;
2106 const int iBase2 = isForward ? 0 :-1;
2107 for ( z = 1; z < nbZ; ++z )
2108 helper->AddVolume( (*columns[0])[z+iBase1], (*columns[1])[z+iBase1], // bottom or top
2109 (*columns[2])[z+iBase1], (*columns[3])[z+iBase1],
2110 (*columns[4])[z+iBase1], (*columns[5])[z+iBase1],
2111 (*columns[0])[z+iBase2], (*columns[1])[z+iBase2], // top or bottom
2112 (*columns[2])[z+iBase2], (*columns[3])[z+iBase2],
2113 (*columns[4])[z+iBase2], (*columns[5])[z+iBase2] );
2116 default: // ---------- polyhedra
2117 vector<int> quantities( 2 + nbNodes, 4 );
2118 quantities[0] = quantities[1] = nbNodes;
2119 columns.resize( nbNodes + 1 );
2120 columns[ nbNodes ] = columns[ 0 ];
2121 const int i1 = isForward ? 1 : 3;
2122 const int i3 = isForward ? 3 : 1;
2123 const int iBase1 = isForward ? -1 : 0;
2124 const int iBase2 = isForward ? 0 :-1;
2125 vector<const SMDS_MeshNode*> nodes( 2*nbNodes + 4*nbNodes);
2126 for ( z = 1; z < nbZ; ++z )
2128 for ( size_t i = 0; i < nbNodes; ++i ) {
2129 nodes[ i ] = (*columns[ i ])[z+iBase1]; // bottom or top
2130 nodes[ 2*nbNodes-i-1 ] = (*columns[ i ])[z+iBase2]; // top or bottom
2132 int di = 2*nbNodes + 4*i;
2133 nodes[ di+0 ] = (*columns[i ])[z ];
2134 nodes[ di+i1] = (*columns[i+1])[z ];
2135 nodes[ di+2 ] = (*columns[i+1])[z-1];
2136 nodes[ di+i3] = (*columns[i ])[z-1];
2138 helper->AddPolyhedralVolume( nodes, quantities );
2141 } // switch ( nbNodes )
2146 //================================================================================
2148 * \brief Find correspondence between bottom and top nodes
2149 * If elements on the bottom and top faces are topologically different,
2150 * and projection is possible and allowed, perform the projection
2151 * \retval bool - is a success or not
2153 //================================================================================
2155 bool StdMeshers_Prism_3D::assocOrProjBottom2Top( const gp_Trsf & bottomToTopTrsf,
2156 const Prism_3D::TPrismTopo& thePrism)
2158 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
2159 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
2161 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
2162 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
2164 if ( !botSMDS || botSMDS->NbElements() == 0 )
2166 _gen->Compute( *myHelper->GetMesh(), botSM->GetSubShape(), /*aShapeOnly=*/true );
2167 botSMDS = botSM->GetSubMeshDS();
2168 if ( !botSMDS || botSMDS->NbElements() == 0 )
2169 return toSM( error(TCom("No elements on face #") << botSM->GetId() ));
2172 bool needProject = !topSM->IsMeshComputed();
2173 if ( !needProject &&
2174 (botSMDS->NbElements() != topSMDS->NbElements() ||
2175 botSMDS->NbNodes() != topSMDS->NbNodes()))
2177 MESSAGE("nb elem bot " << botSMDS->NbElements() <<
2178 " top " << ( topSMDS ? topSMDS->NbElements() : 0 ));
2179 MESSAGE("nb node bot " << botSMDS->NbNodes() <<
2180 " top " << ( topSMDS ? topSMDS->NbNodes() : 0 ));
2181 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
2182 <<" and #"<< topSM->GetId() << " seems different" ));
2185 if ( 0/*needProject && !myProjectTriangles*/ )
2186 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
2187 <<" and #"<< topSM->GetId() << " seems different" ));
2188 ///RETURN_BAD_RESULT("Need to project but not allowed");
2190 NSProjUtils::TNodeNodeMap n2nMap;
2191 const NSProjUtils::TNodeNodeMap* n2nMapPtr = & n2nMap;
2194 if ( !projectBottomToTop( bottomToTopTrsf, thePrism ))
2196 n2nMapPtr = & TProjction2dAlgo::instance( this )->GetNodesMap();
2199 if ( !n2nMapPtr || (int) n2nMapPtr->size() < botSMDS->NbNodes() )
2201 // associate top and bottom faces
2202 NSProjUtils::TShapeShapeMap shape2ShapeMap;
2203 const bool sameTopo =
2204 NSProjUtils::FindSubShapeAssociation( thePrism.myBottom, myHelper->GetMesh(),
2205 thePrism.myTop, myHelper->GetMesh(),
2208 for ( size_t iQ = 0; iQ < thePrism.myWallQuads.size(); ++iQ )
2210 const Prism_3D::TQuadList& quadList = thePrism.myWallQuads[iQ];
2211 StdMeshers_FaceSidePtr botSide = quadList.front()->side[ QUAD_BOTTOM_SIDE ];
2212 StdMeshers_FaceSidePtr topSide = quadList.back ()->side[ QUAD_TOP_SIDE ];
2213 if ( botSide->NbEdges() == topSide->NbEdges() )
2215 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
2217 NSProjUtils::InsertAssociation( botSide->Edge( iE ),
2218 topSide->Edge( iE ), shape2ShapeMap );
2219 NSProjUtils::InsertAssociation( myHelper->IthVertex( 0, botSide->Edge( iE )),
2220 myHelper->IthVertex( 0, topSide->Edge( iE )),
2226 TopoDS_Vertex vb, vt;
2227 StdMeshers_FaceSidePtr sideB, sideT;
2228 vb = myHelper->IthVertex( 0, botSide->Edge( 0 ));
2229 vt = myHelper->IthVertex( 0, topSide->Edge( 0 ));
2230 sideB = quadList.front()->side[ QUAD_LEFT_SIDE ];
2231 sideT = quadList.back ()->side[ QUAD_LEFT_SIDE ];
2232 if ( vb.IsSame( sideB->FirstVertex() ) &&
2233 vt.IsSame( sideT->LastVertex() ))
2235 NSProjUtils::InsertAssociation( botSide->Edge( 0 ),
2236 topSide->Edge( 0 ), shape2ShapeMap );
2237 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2239 vb = myHelper->IthVertex( 1, botSide->Edge( botSide->NbEdges()-1 ));
2240 vt = myHelper->IthVertex( 1, topSide->Edge( topSide->NbEdges()-1 ));
2241 sideB = quadList.front()->side[ QUAD_RIGHT_SIDE ];
2242 sideT = quadList.back ()->side[ QUAD_RIGHT_SIDE ];
2243 if ( vb.IsSame( sideB->FirstVertex() ) &&
2244 vt.IsSame( sideT->LastVertex() ))
2246 NSProjUtils::InsertAssociation( botSide->Edge( botSide->NbEdges()-1 ),
2247 topSide->Edge( topSide->NbEdges()-1 ),
2249 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2254 // Find matching nodes of top and bottom faces
2255 n2nMapPtr = & n2nMap;
2256 if ( ! NSProjUtils::FindMatchingNodesOnFaces( thePrism.myBottom, myHelper->GetMesh(),
2257 thePrism.myTop, myHelper->GetMesh(),
2258 shape2ShapeMap, n2nMap ))
2261 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
2262 <<" and #"<< topSM->GetId() << " seems different" ));
2264 return toSM( error(TCom("Topology of faces #") << botSM->GetId()
2265 <<" and #"<< topSM->GetId() << " seems different" ));
2269 // Fill myBotToColumnMap
2271 int zSize = myBlock.VerticalSize();
2272 TNodeNodeMap::const_iterator bN_tN = n2nMapPtr->begin();
2273 for ( ; bN_tN != n2nMapPtr->end(); ++bN_tN )
2275 const SMDS_MeshNode* botNode = bN_tN->first;
2276 const SMDS_MeshNode* topNode = bN_tN->second;
2277 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE &&
2278 myBlock.HasNodeColumn( botNode ))
2279 continue; // wall columns are contained in myBlock
2280 // create node column
2281 Prism_3D::TNode bN( botNode );
2282 TNode2ColumnMap::iterator bN_col =
2283 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2284 TNodeColumn & column = bN_col->second;
2285 column.resize( zSize );
2286 column.front() = botNode;
2287 column.back() = topNode;
2292 //================================================================================
2294 * \brief Remove faces from the top face and re-create them by projection from the bottom
2295 * \retval bool - a success or not
2297 //================================================================================
2299 bool StdMeshers_Prism_3D::projectBottomToTop( const gp_Trsf & bottomToTopTrsf,
2300 const Prism_3D::TPrismTopo& thePrism )
2302 if ( project2dMesh( thePrism.myBottom, thePrism.myTop ))
2306 NSProjUtils::TNodeNodeMap& n2nMap =
2307 (NSProjUtils::TNodeNodeMap&) TProjction2dAlgo::instance( this )->GetNodesMap();
2312 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2313 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
2314 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
2316 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
2317 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
2319 if ( topSMDS && topSMDS->NbElements() > 0 )
2321 //topSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2322 for ( SMDS_ElemIteratorPtr eIt = topSMDS->GetElements(); eIt->more(); )
2323 meshDS->RemoveFreeElement( eIt->next(), topSMDS, /*fromGroups=*/false );
2324 for ( SMDS_NodeIteratorPtr nIt = topSMDS->GetNodes(); nIt->more(); )
2325 meshDS->RemoveFreeNode( nIt->next(), topSMDS, /*fromGroups=*/false );
2328 const TopoDS_Face& botFace = thePrism.myBottom; // oriented within
2329 const TopoDS_Face& topFace = thePrism.myTop; // the 3D SHAPE
2330 int topFaceID = meshDS->ShapeToIndex( thePrism.myTop );
2332 SMESH_MesherHelper botHelper( *myHelper->GetMesh() );
2333 botHelper.SetSubShape( botFace );
2334 botHelper.ToFixNodeParameters( true );
2336 SMESH_MesherHelper topHelper( *myHelper->GetMesh() );
2337 topHelper.SetSubShape( topFace );
2338 topHelper.ToFixNodeParameters( true );
2339 double distXYZ[4], fixTol = 10 * topHelper.MaxTolerance( topFace );
2341 // Fill myBotToColumnMap
2343 int zSize = myBlock.VerticalSize();
2344 Prism_3D::TNode prevTNode;
2345 SMDS_NodeIteratorPtr nIt = botSMDS->GetNodes();
2346 while ( nIt->more() )
2348 const SMDS_MeshNode* botNode = nIt->next();
2349 const SMDS_MeshNode* topNode = 0;
2350 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
2351 continue; // strange
2353 Prism_3D::TNode bN( botNode );
2354 if ( bottomToTopTrsf.Form() == gp_Identity )
2356 // compute bottom node params
2357 gp_XYZ paramHint(-1,-1,-1);
2358 if ( prevTNode.IsNeighbor( bN ))
2360 paramHint = prevTNode.GetParams();
2361 // double tol = 1e-2 * ( prevTNode.GetCoords() - bN.GetCoords() ).Modulus();
2362 // myBlock.SetTolerance( Min( myBlock.GetTolerance(), tol ));
2364 if ( !myBlock.ComputeParameters( bN.GetCoords(), bN.ChangeParams(),
2365 ID_BOT_FACE, paramHint ))
2366 return toSM( error(TCom("Can't compute normalized parameters for node ")
2367 << botNode->GetID() << " on the face #"<< botSM->GetId() ));
2369 // compute top node coords
2370 gp_XYZ topXYZ; gp_XY topUV;
2371 if ( !myBlock.FacePoint( ID_TOP_FACE, bN.GetParams(), topXYZ ) ||
2372 !myBlock.FaceUV ( ID_TOP_FACE, bN.GetParams(), topUV ))
2373 return toSM( error(TCom("Can't compute coordinates "
2374 "by normalized parameters on the face #")<< topSM->GetId() ));
2375 topNode = meshDS->AddNode( topXYZ.X(),topXYZ.Y(),topXYZ.Z() );
2376 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2378 else // use bottomToTopTrsf
2380 gp_XYZ coords = bN.GetCoords();
2381 bottomToTopTrsf.Transforms( coords );
2382 topNode = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
2383 gp_XY topUV = botHelper.GetNodeUV( botFace, botNode, 0, &checkUV );
2384 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2386 if ( topHelper.CheckNodeUV( topFace, topNode, topUV, fixTol, /*force=*/false, distXYZ ) &&
2387 distXYZ[0] > fixTol && distXYZ[0] < fixTol * 1e+3 )
2388 meshDS->MoveNode( topNode, distXYZ[1], distXYZ[2], distXYZ[3] ); // transform can be inaccurate
2390 // create node column
2391 TNode2ColumnMap::iterator bN_col =
2392 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2393 TNodeColumn & column = bN_col->second;
2394 column.resize( zSize );
2395 column.front() = botNode;
2396 column.back() = topNode;
2398 n2nMap.insert( n2nMap.end(), make_pair( botNode, topNode ));
2400 if ( _computeCanceled )
2401 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
2406 const bool oldSetElemsOnShape = myHelper->SetElementsOnShape( false );
2408 // care of orientation;
2409 // if the bottom faces is orienetd OK then top faces must be reversed
2410 bool reverseTop = true;
2411 if ( myHelper->NbAncestors( botFace, *myBlock.Mesh(), TopAbs_SOLID ) > 1 )
2412 reverseTop = ! myHelper->IsReversedSubMesh( botFace );
2413 int iFrw, iRev, *iPtr = &( reverseTop ? iRev : iFrw );
2415 // loop on bottom mesh faces
2416 SMDS_ElemIteratorPtr faceIt = botSMDS->GetElements();
2417 vector< const SMDS_MeshNode* > nodes;
2418 while ( faceIt->more() )
2420 const SMDS_MeshElement* face = faceIt->next();
2421 if ( !face || face->GetType() != SMDSAbs_Face )
2424 // find top node in columns for each bottom node
2425 int nbNodes = face->NbCornerNodes();
2426 nodes.resize( nbNodes );
2427 for ( iFrw = 0, iRev = nbNodes-1; iFrw < nbNodes; ++iFrw, --iRev )
2429 const SMDS_MeshNode* n = face->GetNode( *iPtr );
2430 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) {
2431 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
2432 if ( bot_column == myBotToColumnMap.end() )
2433 return toSM( error(TCom("No nodes found above node ") << n->GetID() ));
2434 nodes[ iFrw ] = bot_column->second.back();
2437 const TNodeColumn* column = myBlock.GetNodeColumn( n );
2439 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
2440 nodes[ iFrw ] = column->back();
2443 SMDS_MeshElement* newFace = 0;
2444 switch ( nbNodes ) {
2447 newFace = myHelper->AddFace(nodes[0], nodes[1], nodes[2]);
2451 newFace = myHelper->AddFace( nodes[0], nodes[1], nodes[2], nodes[3] );
2455 newFace = meshDS->AddPolygonalFace( nodes );
2458 meshDS->SetMeshElementOnShape( newFace, topFaceID );
2461 myHelper->SetElementsOnShape( oldSetElemsOnShape );
2463 // Check the projected mesh
2465 if ( thePrism.NbWires() > 1 && // there are holes
2466 topHelper.IsDistorted2D( topSM, /*checkUV=*/false ))
2468 SMESH_MeshEditor editor( topHelper.GetMesh() );
2470 // smooth in 2D or 3D?
2471 TopLoc_Location loc;
2472 Handle(Geom_Surface) surface = BRep_Tool::Surface( topFace, loc );
2473 bool isPlanar = GeomLib_IsPlanarSurface( surface ).IsPlanar();
2475 set<const SMDS_MeshNode*> fixedNodes;
2476 TIDSortedElemSet faces;
2477 for ( faceIt = topSMDS->GetElements(); faceIt->more(); )
2478 faces.insert( faces.end(), faceIt->next() );
2481 for ( int isCentroidal = 0; isCentroidal < 2; ++isCentroidal )
2483 SMESH_MeshEditor::SmoothMethod algo =
2484 isCentroidal ? SMESH_MeshEditor::CENTROIDAL : SMESH_MeshEditor::LAPLACIAN;
2486 int nbAttempts = isCentroidal ? 1 : 10;
2487 for ( int iAttemp = 0; iAttemp < nbAttempts; ++iAttemp )
2489 TIDSortedElemSet workFaces = faces;
2492 editor.Smooth( workFaces, fixedNodes, algo, /*nbIterations=*/ 10,
2493 /*theTgtAspectRatio=*/1.0, /*the2D=*/!isPlanar);
2495 if (( isOk = !topHelper.IsDistorted2D( topSM, /*checkUV=*/true )) &&
2501 return toSM( error( TCom("Projection from face #") << botSM->GetId()
2502 << " to face #" << topSM->GetId()
2503 << " failed: inverted elements created"));
2506 TProjction2dAlgo::instance( this )->SetEventListener( topSM );
2511 //=======================================================================
2512 //function : getSweepTolerance
2513 //purpose : Compute tolerance to pass to StdMeshers_Sweeper
2514 //=======================================================================
2516 double StdMeshers_Prism_3D::getSweepTolerance( const Prism_3D::TPrismTopo& thePrism )
2518 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2519 SMESHDS_SubMesh * sm[2] = { meshDS->MeshElements( thePrism.myBottom ),
2520 meshDS->MeshElements( thePrism.myTop ) };
2521 double minDist = 1e100;
2523 vector< SMESH_TNodeXYZ > nodes;
2524 for ( int iSM = 0; iSM < 2; ++iSM )
2526 if ( !sm[ iSM ]) continue;
2528 SMDS_ElemIteratorPtr fIt = sm[ iSM ]->GetElements();
2529 while ( fIt->more() )
2531 const SMDS_MeshElement* face = fIt->next();
2532 const int nbNodes = face->NbCornerNodes();
2533 SMDS_ElemIteratorPtr nIt = face->nodesIterator();
2535 nodes.resize( nbNodes + 1 );
2536 for ( int iN = 0; iN < nbNodes; ++iN )
2537 nodes[ iN ] = nIt->next();
2538 nodes.back() = nodes[0];
2542 for ( int iN = 0; iN < nbNodes; ++iN )
2544 if ( nodes[ iN ]._node->GetPosition()->GetDim() < 2 &&
2545 nodes[ iN+1 ]._node->GetPosition()->GetDim() < 2 )
2547 // it's a boundary link; measure distance of other
2548 // nodes to this link
2549 gp_XYZ linkDir = nodes[ iN ] - nodes[ iN+1 ];
2550 double linkLen = linkDir.Modulus();
2551 bool isDegen = ( linkLen < numeric_limits<double>::min() );
2552 if ( !isDegen ) linkDir /= linkLen;
2553 for ( int iN2 = 0; iN2 < nbNodes; ++iN2 ) // loop on other nodes
2555 if ( nodes[ iN2 ] == nodes[ iN ] ||
2556 nodes[ iN2 ] == nodes[ iN+1 ]) continue;
2559 dist2 = ( nodes[ iN ] - nodes[ iN2 ]).SquareModulus();
2563 dist2 = linkDir.CrossSquareMagnitude( nodes[ iN ] - nodes[ iN2 ]);
2565 if ( dist2 > numeric_limits<double>::min() )
2566 minDist = Min ( minDist, dist2 );
2569 // measure length link
2570 else if ( nodes[ iN ]._node < nodes[ iN+1 ]._node ) // not to measure same link twice
2572 dist2 = ( nodes[ iN ] - nodes[ iN+1 ]).SquareModulus();
2573 if ( dist2 > numeric_limits<double>::min() )
2574 minDist = Min ( minDist, dist2 );
2579 return 0.1 * Sqrt ( minDist );
2582 //=======================================================================
2583 //function : isSimpleQuad
2584 //purpose : check if the bottom FACE is meshable with nice qudrangles,
2585 // if so the block aproach can work rather fast.
2586 // This is a temporary mean caused by problems in StdMeshers_Sweeper
2587 //=======================================================================
2589 bool StdMeshers_Prism_3D::isSimpleBottom( const Prism_3D::TPrismTopo& thePrism )
2591 if ( thePrism.myNbEdgesInWires.front() != 4 )
2594 // analyse angles between edges
2595 double nbConcaveAng = 0, nbConvexAng = 0;
2596 TopoDS_Face reverseBottom = TopoDS::Face( thePrism.myBottom.Reversed() ); // see initPrism()
2597 TopoDS_Vertex commonV;
2598 const list< TopoDS_Edge >& botEdges = thePrism.myBottomEdges;
2599 list< TopoDS_Edge >::const_iterator edge = botEdges.begin();
2600 while ( edge != botEdges.end() )
2602 if ( SMESH_Algo::isDegenerated( *edge ))
2604 TopoDS_Edge e1 = *edge++;
2605 TopoDS_Edge e2 = ( edge == botEdges.end() ? botEdges.front() : *edge );
2606 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2608 e2 = botEdges.front();
2609 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2612 double angle = myHelper->GetAngle( e1, e2, reverseBottom, commonV );
2613 if ( angle < -5 * M_PI/180 )
2614 if ( ++nbConcaveAng > 1 )
2616 if ( angle > 85 * M_PI/180 )
2617 if ( ++nbConvexAng > 4 )
2623 //=======================================================================
2624 //function : allVerticalEdgesStraight
2625 //purpose : Defines if all "vertical" EDGEs are straight
2626 //=======================================================================
2628 bool StdMeshers_Prism_3D::allVerticalEdgesStraight( const Prism_3D::TPrismTopo& thePrism )
2630 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
2632 const Prism_3D::TQuadList& quads = thePrism.myWallQuads[i];
2633 Prism_3D::TQuadList::const_iterator quadIt = quads.begin();
2634 TopoDS_Edge prevQuadEdge;
2635 for ( ; quadIt != quads.end(); ++quadIt )
2637 StdMeshers_FaceSidePtr rightSide = (*quadIt)->side[ QUAD_RIGHT_SIDE ];
2639 if ( !prevQuadEdge.IsNull() &&
2640 !SMESH_Algo::IsContinuous( rightSide->Edge( 0 ), prevQuadEdge ))
2643 for ( int iE = 0; iE < rightSide->NbEdges(); ++iE )
2645 const TopoDS_Edge & rightE = rightSide->Edge( iE );
2646 if ( !SMESH_Algo::IsStraight( rightE, /*degenResult=*/true ))
2650 !SMESH_Algo::IsContinuous( rightSide->Edge( iE-1 ), rightE ))
2653 prevQuadEdge = rightE;
2660 //=======================================================================
2661 //function : project2dMesh
2662 //purpose : Project mesh faces from a source FACE of one prism (theSrcFace)
2663 // to a source FACE of another prism (theTgtFace)
2664 //=======================================================================
2666 bool StdMeshers_Prism_3D::project2dMesh(const TopoDS_Face& theSrcFace,
2667 const TopoDS_Face& theTgtFace)
2669 TProjction2dAlgo* projector2D = TProjction2dAlgo::instance( this );
2670 projector2D->myHyp.SetSourceFace( theSrcFace );
2671 bool ok = projector2D->Compute( *myHelper->GetMesh(), theTgtFace );
2673 SMESH_subMesh* tgtSM = myHelper->GetMesh()->GetSubMesh( theTgtFace );
2674 if ( !ok && tgtSM->GetSubMeshDS() ) {
2675 //tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2676 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2677 SMESHDS_SubMesh* tgtSMDS = tgtSM->GetSubMeshDS();
2678 for ( SMDS_ElemIteratorPtr eIt = tgtSMDS->GetElements(); eIt->more(); )
2679 meshDS->RemoveFreeElement( eIt->next(), tgtSMDS, /*fromGroups=*/false );
2680 for ( SMDS_NodeIteratorPtr nIt = tgtSMDS->GetNodes(); nIt->more(); )
2681 meshDS->RemoveFreeNode( nIt->next(), tgtSMDS, /*fromGroups=*/false );
2683 tgtSM->ComputeStateEngine ( SMESH_subMesh::CHECK_COMPUTE_STATE );
2684 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
2686 projector2D->SetEventListener( tgtSM );
2691 //================================================================================
2693 * \brief Set projection coordinates of a node to a face and it's sub-shapes
2694 * \param faceID - the face given by in-block ID
2695 * \param params - node normalized parameters
2696 * \retval bool - is a success
2698 //================================================================================
2700 bool StdMeshers_Prism_3D::setFaceAndEdgesXYZ( const int faceID, const gp_XYZ& params, int z )
2702 // find base and top edges of the face
2703 enum { BASE = 0, TOP, LEFT, RIGHT };
2704 vector< int > edgeVec; // 0-base, 1-top
2705 SMESH_Block::GetFaceEdgesIDs( faceID, edgeVec );
2707 myBlock.EdgePoint( edgeVec[ BASE ], params, myShapeXYZ[ edgeVec[ BASE ]]);
2708 myBlock.EdgePoint( edgeVec[ TOP ], params, myShapeXYZ[ edgeVec[ TOP ]]);
2710 SHOWYXZ("\nparams ", params);
2711 SHOWYXZ("TOP is " <<edgeVec[ TOP ], myShapeXYZ[ edgeVec[ TOP]]);
2712 SHOWYXZ("BASE is "<<edgeVec[ BASE], myShapeXYZ[ edgeVec[ BASE]]);
2714 if ( faceID == SMESH_Block::ID_Fx0z || faceID == SMESH_Block::ID_Fx1z )
2716 myBlock.EdgePoint( edgeVec[ LEFT ], params, myShapeXYZ[ edgeVec[ LEFT ]]);
2717 myBlock.EdgePoint( edgeVec[ RIGHT ], params, myShapeXYZ[ edgeVec[ RIGHT ]]);
2719 SHOWYXZ("VER "<<edgeVec[ LEFT], myShapeXYZ[ edgeVec[ LEFT]]);
2720 SHOWYXZ("VER "<<edgeVec[ RIGHT], myShapeXYZ[ edgeVec[ RIGHT]]);
2722 myBlock.FacePoint( faceID, params, myShapeXYZ[ faceID ]);
2723 SHOWYXZ("FacePoint "<<faceID, myShapeXYZ[ faceID]);
2728 //=======================================================================
2730 //purpose : If (!isOK), sets the error to a sub-mesh of a current SOLID
2731 //=======================================================================
2733 bool StdMeshers_Prism_3D::toSM( bool isOK )
2735 if ( mySetErrorToSM &&
2738 !myHelper->GetSubShape().IsNull() &&
2739 myHelper->GetSubShape().ShapeType() == TopAbs_SOLID)
2741 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( myHelper->GetSubShape() );
2742 sm->GetComputeError() = this->GetComputeError();
2743 // clear error in order not to return it twice
2744 _error = COMPERR_OK;
2750 //=======================================================================
2751 //function : shapeID
2752 //purpose : Return index of a shape
2753 //=======================================================================
2755 int StdMeshers_Prism_3D::shapeID( const TopoDS_Shape& S )
2757 if ( S.IsNull() ) return 0;
2758 if ( !myHelper ) return -3;
2759 return myHelper->GetMeshDS()->ShapeToIndex( S );
2762 namespace // utils used by StdMeshers_Prism_3D::IsApplicable()
2764 struct EdgeWithNeighbors
2767 int _iBase; /* index in a WIRE with non-base EDGEs excluded */
2768 int _iL, _iR; /* used to connect edges in a base FACE */
2769 bool _isBase; /* is used in a base FACE */
2770 EdgeWithNeighbors(const TopoDS_Edge& E, int iE, int nbE, int shift, bool isBase ):
2771 _edge( E ), _iBase( iE + shift ),
2772 _iL( SMESH_MesherHelper::WrapIndex( iE-1, Max( 1, nbE )) + shift ),
2773 _iR( SMESH_MesherHelper::WrapIndex( iE+1, Max( 1, nbE )) + shift ),
2777 EdgeWithNeighbors() {}
2778 bool IsInternal() const { return !_edge.IsNull() && _edge.Orientation() == TopAbs_INTERNAL; }
2780 // PrismSide contains all FACEs linking a bottom EDGE with a top one.
2783 TopoDS_Face _face; // a currently treated upper FACE
2784 TopTools_IndexedMapOfShape *_faces; // all FACEs (pointer because of a private copy constructor)
2785 TopoDS_Edge _topEdge; // a current top EDGE
2786 vector< EdgeWithNeighbors >*_edges; // all EDGEs of _face
2787 int _iBotEdge; // index of _topEdge within _edges
2788 vector< bool > _isCheckedEdge; // mark EDGEs whose two owner FACEs found
2789 int _nbCheckedEdges; // nb of EDGEs whose location is defined
2790 PrismSide *_leftSide; // neighbor sides
2791 PrismSide *_rightSide;
2792 bool _isInternal; // whether this side raises from an INTERNAL EDGE
2793 void SetExcluded() { _leftSide = _rightSide = NULL; }
2794 bool IsExcluded() const { return !_leftSide; }
2795 const TopoDS_Edge& Edge( int i ) const
2797 return (*_edges)[ i ]._edge;
2799 int FindEdge( const TopoDS_Edge& E ) const
2801 for ( size_t i = 0; i < _edges->size(); ++i )
2802 if ( E.IsSame( Edge( i ))) return i;
2805 bool IsSideFace( const TopoDS_Shape& face, const bool checkNeighbors ) const
2807 if ( _faces->Contains( face )) // avoid returning true for a prism top FACE
2808 return ( !_face.IsNull() || !( face.IsSame( _faces->FindKey( _faces->Extent() ))));
2810 if ( checkNeighbors )
2811 return (( _leftSide && _leftSide->IsSideFace ( face, false )) ||
2812 ( _rightSide && _rightSide->IsSideFace( face, false )));
2817 //--------------------------------------------------------------------------------
2819 * \brief Return another faces sharing an edge
2821 const TopoDS_Face & getAnotherFace( const TopoDS_Face& face,
2822 const TopoDS_Edge& edge,
2823 TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge)
2825 TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edge ));
2826 for ( ; faceIt.More(); faceIt.Next() )
2827 if ( !face.IsSame( faceIt.Value() ))
2828 return TopoDS::Face( faceIt.Value() );
2832 //--------------------------------------------------------------------------------
2834 * \brief Return ordered edges of a face
2836 bool getEdges( const TopoDS_Face& face,
2837 vector< EdgeWithNeighbors > & edges,
2838 TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge,
2839 const bool noHolesAllowed)
2841 TopoDS_Face f = face;
2842 if ( f.Orientation() != TopAbs_FORWARD &&
2843 f.Orientation() != TopAbs_REVERSED )
2844 f.Orientation( TopAbs_FORWARD );
2845 list< TopoDS_Edge > ee;
2846 list< int > nbEdgesInWires;
2847 int nbW = SMESH_Block::GetOrderedEdges( f, ee, nbEdgesInWires );
2848 if ( nbW > 1 && noHolesAllowed )
2851 int iE, nbTot = 0, nbBase, iBase;
2852 list< TopoDS_Edge >::iterator e = ee.begin();
2853 list< int >::iterator nbE = nbEdgesInWires.begin();
2854 for ( ; nbE != nbEdgesInWires.end(); ++nbE )
2855 for ( iE = 0; iE < *nbE; ++e, ++iE )
2856 if ( SMESH_Algo::isDegenerated( *e )) // degenerated EDGE is never used
2858 e = --ee.erase( e );
2866 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2869 isBase.resize( *nbE );
2870 list< TopoDS_Edge >::iterator eIt = e;
2871 for ( iE = 0; iE < *nbE; ++eIt, ++iE )
2873 isBase[ iE ] = ( getAnotherFace( face, *eIt, facesOfEdge ) != face );
2874 nbBase += isBase[ iE ];
2876 for ( iBase = 0, iE = 0; iE < *nbE; ++e, ++iE )
2878 edges.push_back( EdgeWithNeighbors( *e, iBase, nbBase, nbTot, isBase[ iE ] ));
2879 iBase += isBase[ iE ];
2886 // IPAL53099. Set correct neighbors to INTERNAL EDGEs, which can be connected to
2887 // EDGEs of the outer WIRE but this fact can't be detected by their order.
2890 int iFirst = 0, iLast;
2891 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2893 iLast = iFirst + *nbE - 1;
2894 TopoDS_Vertex vv[2] = { SMESH_MesherHelper::IthVertex( 0, edges[ iFirst ]._edge ),
2895 SMESH_MesherHelper::IthVertex( 1, edges[ iLast ]._edge ) };
2896 bool isConnectOk = ( vv[0].IsSame( vv[1] ));
2899 edges[ iFirst ]._iL = edges[ iFirst ]._iBase; // connect to self
2900 edges[ iLast ]._iR = edges[ iLast ]._iBase;
2902 // look for an EDGE of the outer WIREs connected to vv
2903 TopoDS_Vertex v0, v1;
2904 for ( iE = 0; iE < iFirst; ++iE )
2906 v0 = SMESH_MesherHelper::IthVertex( 0, edges[ iE ]._edge );
2907 v1 = SMESH_MesherHelper::IthVertex( 1, edges[ iE ]._edge );
2908 if ( vv[0].IsSame( v0 ) || vv[0].IsSame( v1 ))
2909 edges[ iFirst ]._iL = edges[ iE ]._iBase;
2910 if ( vv[1].IsSame( v0 ) || vv[1].IsSame( v1 ))
2911 edges[ iLast ]._iR = edges[ iE ]._iBase;
2917 return edges.size();
2920 //--------------------------------------------------------------------------------
2922 * \brief Return number of faces sharing given edges
2924 // int nbAdjacentFaces( const std::vector< EdgeWithNeighbors >& edges,
2925 // const TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge )
2927 // TopTools_MapOfShape adjFaces;
2929 // for ( size_t i = 0; i < edges.size(); ++i )
2931 // TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edges[i]._edge ));
2932 // for ( ; faceIt.More(); faceIt.Next() )
2933 // adjFaces.Add( faceIt.Value() );
2935 // return adjFaces.Extent();
2939 //================================================================================
2941 * \brief Return true if the algorithm can mesh this shape
2942 * \param [in] aShape - shape to check
2943 * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
2944 * else, returns OK if at least one shape is OK
2946 //================================================================================
2948 bool StdMeshers_Prism_3D::IsApplicable(const TopoDS_Shape & shape, bool toCheckAll)
2950 TopExp_Explorer sExp( shape, TopAbs_SOLID );
2954 for ( ; sExp.More(); sExp.Next() )
2958 TopExp_Explorer shExp( sExp.Current(), TopAbs_SHELL );
2959 while ( shExp.More() ) {
2960 shell = shExp.Current();
2962 if ( shExp.More() && BRep_Tool::IsClosed( shExp.Current() ))
2965 if ( shell.IsNull() ) {
2966 if ( toCheckAll ) return false;
2970 TopTools_IndexedMapOfShape allFaces;
2971 TopExp::MapShapes( sExp.Current(), TopAbs_FACE, allFaces );
2972 if ( allFaces.Extent() < 3 ) {
2973 if ( toCheckAll ) return false;
2977 if ( allFaces.Extent() == 6 )
2979 TopTools_IndexedMapOfOrientedShape map;
2980 bool isBox = SMESH_Block::FindBlockShapes( TopoDS::Shell( shell ),
2981 TopoDS_Vertex(), TopoDS_Vertex(), map );
2983 if ( !toCheckAll ) return true;
2988 TopTools_IndexedMapOfShape allShapes; // usage: allShapes.FindIndex( s )
2989 TopExp::MapShapes( shape, allShapes );
2992 TopTools_IndexedDataMapOfShapeListOfShape facesOfEdge;
2993 TopTools_ListIteratorOfListOfShape faceIt;
2994 TopExp::MapShapesAndAncestors( sExp.Current(), TopAbs_EDGE, TopAbs_FACE , facesOfEdge );
2995 if ( facesOfEdge.IsEmpty() ) {
2996 if ( toCheckAll ) return false;
3000 typedef vector< EdgeWithNeighbors > TEdgeWithNeighborsVec;
3001 vector< TEdgeWithNeighborsVec > faceEdgesVec( allFaces.Extent() + 1 );
3002 const size_t nbEdgesMax = facesOfEdge.Extent() * 2; // there can be seam EDGEs
3003 TopTools_IndexedMapOfShape* facesOfSide = new TopTools_IndexedMapOfShape[ nbEdgesMax ];
3004 SMESHUtils::ArrayDeleter<TopTools_IndexedMapOfShape> delFacesOfSide( facesOfSide );
3006 // try to use each face as a bottom one
3007 bool prismDetected = false;
3008 vector< PrismSide > sides;
3009 for ( int iF = 1; iF < allFaces.Extent() && !prismDetected; ++iF )
3011 const TopoDS_Face& botF = TopoDS::Face( allFaces( iF ));
3013 TEdgeWithNeighborsVec& botEdges = faceEdgesVec[ iF ];
3014 if ( botEdges.empty() )
3015 if ( !getEdges( botF, botEdges, facesOfEdge, /*noHoles=*/false ))
3019 for ( size_t iS = 0; iS < botEdges.size(); ++iS )
3020 nbBase += botEdges[ iS ]._isBase;
3022 if ( allFaces.Extent()-1 <= nbBase )
3023 continue; // all faces are adjacent to botF - no top FACE
3025 // init data of side FACEs
3027 sides.resize( nbBase );
3029 for ( size_t iE = 0; iE < botEdges.size(); ++iE )
3031 if ( !botEdges[ iE ]._isBase )
3033 sides[ iS ]._topEdge = botEdges[ iE ]._edge;
3034 sides[ iS ]._face = botF;
3035 sides[ iS ]._leftSide = & sides[ botEdges[ iE ]._iR ];
3036 sides[ iS ]._rightSide = & sides[ botEdges[ iE ]._iL ];
3037 sides[ iS ]._isInternal = botEdges[ iE ].IsInternal();
3038 sides[ iS ]._faces = & facesOfSide[ iS ];
3039 sides[ iS ]._faces->Clear();
3043 bool isOK = true; // ok for a current botF
3044 bool isAdvanced = true; // is new data found in a current loop
3045 int nbFoundSideFaces = 0;
3046 for ( int iLoop = 0; isOK && isAdvanced; ++iLoop )
3049 for ( size_t iS = 0; iS < sides.size() && isOK; ++iS )
3051 PrismSide& side = sides[ iS ];
3052 if ( side._face.IsNull() )
3053 continue; // probably the prism top face is the last of side._faces
3055 if ( side._topEdge.IsNull() )
3057 // find vertical EDGEs --- EGDEs shared with neighbor side FACEs
3058 for ( int is2nd = 0; is2nd < 2 && isOK; ++is2nd ) // 2 adjacent neighbors
3060 int di = is2nd ? 1 : -1;
3061 const PrismSide* adjSide = is2nd ? side._rightSide : side._leftSide;
3062 for ( size_t i = 1; i < side._edges->size(); ++i )
3064 int iE = SMESH_MesherHelper::WrapIndex( i*di + side._iBotEdge, side._edges->size());
3065 if ( side._isCheckedEdge[ iE ] ) continue;
3066 const TopoDS_Edge& vertE = side.Edge( iE );
3067 const TopoDS_Shape& neighborF = getAnotherFace( side._face, vertE, facesOfEdge );
3068 bool isEdgeShared = (( adjSide->IsSideFace( neighborF, side._isInternal )) ||
3069 ( adjSide == &side && neighborF.IsSame( side._face )) );
3070 if ( isEdgeShared ) // vertE is shared with adjSide
3073 side._isCheckedEdge[ iE ] = true;
3074 side._nbCheckedEdges++;
3075 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
3076 if ( nbNotCheckedE == 1 )
3081 if ( i == 1 && iLoop == 0 ) isOK = false;
3087 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
3088 if ( nbNotCheckedE == 1 )
3090 vector<bool>::iterator ii = std::find( side._isCheckedEdge.begin(),
3091 side._isCheckedEdge.end(), false );
3092 if ( ii != side._isCheckedEdge.end() )
3094 size_t iE = std::distance( side._isCheckedEdge.begin(), ii );
3095 side._topEdge = side.Edge( iE );
3098 isOK = ( nbNotCheckedE >= 1 );
3100 else //if ( !side._topEdge.IsNull() )
3102 // get a next face of a side
3103 const TopoDS_Shape& f = getAnotherFace( side._face, side._topEdge, facesOfEdge );
3104 side._faces->Add( f );
3106 if ( f.IsSame( side._face ) || // _topEdge is a seam
3107 SMESH_MesherHelper::Count( f, TopAbs_WIRE, false ) != 1 )
3111 else if ( side._leftSide != & side && // not closed side face
3112 side._leftSide->_faces->Contains( f ))
3114 stop = true; // probably f is the prism top face
3115 side._leftSide->_face.Nullify();
3116 side._leftSide->_topEdge.Nullify();
3118 else if ( side._rightSide != & side &&
3119 side._rightSide->_faces->Contains( f ))
3121 stop = true; // probably f is the prism top face
3122 side._rightSide->_face.Nullify();
3123 side._rightSide->_topEdge.Nullify();
3127 side._face.Nullify();
3128 side._topEdge.Nullify();
3131 side._face = TopoDS::Face( f );
3132 int faceID = allFaces.FindIndex( side._face );
3133 side._edges = & faceEdgesVec[ faceID ];
3134 if ( side._edges->empty() )
3135 if ( !getEdges( side._face, * side._edges, facesOfEdge, /*noHoles=*/true ))
3137 const int nbE = side._edges->size();
3142 side._iBotEdge = side.FindEdge( side._topEdge );
3143 side._isCheckedEdge.clear();
3144 side._isCheckedEdge.resize( nbE, false );
3145 side._isCheckedEdge[ side._iBotEdge ] = true;
3146 side._nbCheckedEdges = 1; // bottom EDGE is known
3148 else // probably a triangular top face found
3150 side._face.Nullify();
3152 side._topEdge.Nullify();
3153 isOK = ( !side._edges->empty() || side._faces->Extent() > 1 );
3155 } //if ( !side._topEdge.IsNull() )
3157 } // loop on prism sides
3159 if ( nbFoundSideFaces > allFaces.Extent() )
3163 if ( iLoop > allFaces.Extent() * 10 )
3167 cerr << "BUG: infinite loop in StdMeshers_Prism_3D::IsApplicable()" << endl;
3170 } // while isAdvanced
3172 if ( isOK && sides[0]._faces->Extent() > 1 )
3174 const int nbFaces = sides[0]._faces->Extent();
3175 if ( botEdges.size() == 1 ) // cylinder
3177 prismDetected = ( nbFaces == allFaces.Extent()-1 );
3181 const TopoDS_Shape& topFace = sides[0]._faces->FindKey( nbFaces );
3183 for ( iS = 1; iS < sides.size(); ++iS )
3184 if ( ! sides[ iS ]._faces->Contains( topFace ))
3186 prismDetected = ( iS == sides.size() );
3189 } // loop on allFaces
3191 if ( !prismDetected && toCheckAll ) return false;
3192 if ( prismDetected && !toCheckAll ) return true;
3201 //================================================================================
3203 * \brief Return true if this node and other one belong to one face
3205 //================================================================================
3207 bool Prism_3D::TNode::IsNeighbor( const Prism_3D::TNode& other ) const
3209 if ( !other.myNode || !myNode ) return false;
3211 SMDS_ElemIteratorPtr fIt = other.myNode->GetInverseElementIterator(SMDSAbs_Face);
3212 while ( fIt->more() )
3213 if ( fIt->next()->GetNodeIndex( myNode ) >= 0 )
3218 //================================================================================
3220 * \brief Prism initialization
3222 //================================================================================
3224 void TPrismTopo::Clear()
3226 myShape3D.Nullify();
3229 myWallQuads.clear();
3230 myBottomEdges.clear();
3231 myNbEdgesInWires.clear();
3232 myWallQuads.clear();
3235 //================================================================================
3237 * \brief Set upside-down
3239 //================================================================================
3241 void TPrismTopo::SetUpsideDown()
3243 std::swap( myBottom, myTop );
3244 myBottomEdges.clear();
3245 std::reverse( myBottomEdges.begin(), myBottomEdges.end() );
3246 for ( size_t i = 0; i < myWallQuads.size(); ++i )
3248 myWallQuads[i].reverse();
3249 TQuadList::iterator q = myWallQuads[i].begin();
3250 for ( ; q != myWallQuads[i].end(); ++q )
3252 (*q)->shift( 2, /*keepUnitOri=*/true );
3254 myBottomEdges.push_back( myWallQuads[i].front()->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0) );
3258 } // namespace Prism_3D
3260 //================================================================================
3262 * \brief Constructor. Initialization is needed
3264 //================================================================================
3266 StdMeshers_PrismAsBlock::StdMeshers_PrismAsBlock()
3271 StdMeshers_PrismAsBlock::~StdMeshers_PrismAsBlock()
3275 void StdMeshers_PrismAsBlock::Clear()
3278 myShapeIDMap.Clear();
3282 delete mySide; mySide = 0;
3284 myParam2ColumnMaps.clear();
3285 myShapeIndex2ColumnMap.clear();
3288 //=======================================================================
3289 //function : initPrism
3290 //purpose : Analyse shape geometry and mesh.
3291 // If there are triangles on one of faces, it becomes 'bottom'.
3292 // thePrism.myBottom can be already set up.
3293 //=======================================================================
3295 bool StdMeshers_Prism_3D::initPrism(Prism_3D::TPrismTopo& thePrism,
3296 const TopoDS_Shape& theShape3D,
3297 const bool selectBottom)
3299 myHelper->SetSubShape( theShape3D );
3301 SMESH_subMesh* mainSubMesh = myHelper->GetMesh()->GetSubMeshContaining( theShape3D );
3302 if ( !mainSubMesh ) return toSM( error(COMPERR_BAD_INPUT_MESH,"Null submesh of shape3D"));
3304 // detect not-quad FACE sub-meshes of the 3D SHAPE
3305 list< SMESH_subMesh* > notQuadGeomSubMesh;
3306 list< SMESH_subMesh* > notQuadElemSubMesh;
3307 list< SMESH_subMesh* > meshedSubMesh;
3310 SMESH_subMeshIteratorPtr smIt = mainSubMesh->getDependsOnIterator(false,true);
3311 while ( smIt->more() )
3313 SMESH_subMesh* sm = smIt->next();
3314 const TopoDS_Shape& face = sm->GetSubShape();
3315 if ( face.ShapeType() > TopAbs_FACE ) break;
3316 else if ( face.ShapeType() < TopAbs_FACE ) continue;
3319 // is quadrangle FACE?
3320 list< TopoDS_Edge > orderedEdges;
3321 list< int > nbEdgesInWires;
3322 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( face ), orderedEdges,
3324 if ( nbWires != 1 || nbEdgesInWires.front() != 4 )
3325 notQuadGeomSubMesh.push_back( sm );
3327 // look for a not structured sub-mesh
3328 if ( !sm->IsEmpty() )
3330 meshedSubMesh.push_back( sm );
3331 if ( !myHelper->IsSameElemGeometry( sm->GetSubMeshDS(), SMDSGeom_QUADRANGLE ) ||
3332 !myHelper->IsStructured ( sm ))
3333 notQuadElemSubMesh.push_back( sm );
3337 int nbNotQuadMeshed = notQuadElemSubMesh.size();
3338 int nbNotQuad = notQuadGeomSubMesh.size();
3339 bool hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3342 if ( nbNotQuadMeshed > 2 )
3344 return toSM( error(COMPERR_BAD_INPUT_MESH,
3345 TCom("More than 2 faces with not quadrangle elements: ")
3346 <<nbNotQuadMeshed));
3348 if ( nbNotQuad > 2 || !thePrism.myBottom.IsNull() )
3350 // Issue 0020843 - one of side FACEs is quasi-quadrilateral (not 4 EDGEs).
3351 // Remove from notQuadGeomSubMesh faces meshed with regular grid
3352 int nbQuasiQuads = removeQuasiQuads( notQuadGeomSubMesh, myHelper,
3353 TQuadrangleAlgo::instance(this,myHelper) );
3354 nbNotQuad -= nbQuasiQuads;
3355 if ( nbNotQuad > 2 )
3356 return toSM( error(COMPERR_BAD_SHAPE,
3357 TCom("More than 2 not quadrilateral faces: ") <<nbNotQuad));
3358 hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3361 // Analyse mesh and topology of FACEs: choose the bottom sub-mesh.
3362 // If there are not quadrangle FACEs, they are top and bottom ones.
3363 // Not quadrangle FACEs must be only on top and bottom.
3365 SMESH_subMesh * botSM = 0;
3366 SMESH_subMesh * topSM = 0;
3368 if ( hasNotQuad ) // can choose a bottom FACE
3370 if ( nbNotQuadMeshed > 0 ) botSM = notQuadElemSubMesh.front();
3371 else botSM = notQuadGeomSubMesh.front();
3372 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.back();
3373 else if ( nbNotQuad > 1 ) topSM = notQuadGeomSubMesh.back();
3375 if ( topSM == botSM ) {
3376 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.front();
3377 else topSM = notQuadGeomSubMesh.front();
3380 // detect mesh triangles on wall FACEs
3381 if ( nbNotQuad == 2 && nbNotQuadMeshed > 0 ) {
3383 if ( nbNotQuadMeshed == 1 )
3384 ok = ( find( notQuadGeomSubMesh.begin(),
3385 notQuadGeomSubMesh.end(), botSM ) != notQuadGeomSubMesh.end() );
3387 ok = ( notQuadGeomSubMesh == notQuadElemSubMesh );
3389 return toSM( error(COMPERR_BAD_INPUT_MESH,
3390 "Side face meshed with not quadrangle elements"));
3394 thePrism.myNotQuadOnTop = ( nbNotQuadMeshed > 1 );
3396 // use thePrism.myBottom
3397 if ( !thePrism.myBottom.IsNull() )
3399 if ( botSM ) { // <-- not quad geom or mesh on botSM
3400 if ( ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3401 std::swap( botSM, topSM );
3402 if ( !botSM || ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3403 if ( !selectBottom )
3404 return toSM( error( COMPERR_BAD_INPUT_MESH,
3405 "Incompatible non-structured sub-meshes"));
3406 std::swap( botSM, topSM );
3407 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3411 else if ( !selectBottom ) {
3412 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3415 if ( !botSM ) // find a proper bottom
3417 bool savedSetErrorToSM = mySetErrorToSM;
3418 mySetErrorToSM = false; // ingore errors in initPrism()
3420 // search among meshed FACEs
3421 list< SMESH_subMesh* >::iterator sm = meshedSubMesh.begin();
3422 for ( ; !botSM && sm != meshedSubMesh.end(); ++sm )
3426 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3427 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3430 // search among all FACEs
3431 for ( TopExp_Explorer f( theShape3D, TopAbs_FACE ); !botSM && f.More(); f.Next() )
3433 int minNbFaces = 2 + myHelper->Count( f.Current(), TopAbs_EDGE, false);
3434 if ( nbFaces < minNbFaces) continue;
3436 thePrism.myBottom = TopoDS::Face( f.Current() );
3437 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3438 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3441 mySetErrorToSM = savedSetErrorToSM;
3442 return botSM ? true : toSM( error( COMPERR_BAD_SHAPE ));
3445 // find vertex 000 - the one with smallest coordinates (for easy DEBUG :-)
3447 double minVal = DBL_MAX, minX = 0, val;
3448 for ( TopExp_Explorer exp( botSM->GetSubShape(), TopAbs_VERTEX );
3449 exp.More(); exp.Next() )
3451 const TopoDS_Vertex& v = TopoDS::Vertex( exp.Current() );
3452 gp_Pnt P = BRep_Tool::Pnt( v );
3453 val = P.X() + P.Y() + P.Z();
3454 if ( val < minVal || ( val == minVal && P.X() < minX )) {
3461 thePrism.myShape3D = theShape3D;
3462 if ( thePrism.myBottom.IsNull() )
3463 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3464 thePrism.myBottom.Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myBottom ));
3465 thePrism.myTop. Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myTop ));
3467 // Get ordered bottom edges
3468 TopoDS_Face reverseBottom = // to have order of top EDGEs as in the top FACE
3469 TopoDS::Face( thePrism.myBottom.Reversed() );
3470 SMESH_Block::GetOrderedEdges( reverseBottom,
3471 thePrism.myBottomEdges,
3472 thePrism.myNbEdgesInWires, V000 );
3474 // Get Wall faces corresponding to the ordered bottom edges and the top FACE
3475 if ( !getWallFaces( thePrism, nbFaces )) // it also sets thePrism.myTop
3476 return false; //toSM( error(COMPERR_BAD_SHAPE, "Can't find side faces"));
3480 if ( !thePrism.myTop.IsSame( topSM->GetSubShape() ))
3482 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3483 "Non-quadrilateral faces are not opposite"));
3485 // check that the found top and bottom FACEs are opposite
3486 TopTools_IndexedMapOfShape topEdgesMap( thePrism.myBottomEdges.size() );
3487 TopExp::MapShapes( thePrism.myTop, topEdgesMap );
3488 list< TopoDS_Edge >::iterator edge = thePrism.myBottomEdges.begin();
3489 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
3490 if ( topEdgesMap.Contains( *edge ))
3492 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3493 "Non-quadrilateral faces are not opposite"));
3496 if ( thePrism.myBottomEdges.size() > thePrism.myWallQuads.size() )
3498 // composite bottom sides => set thePrism upside-down
3499 thePrism.SetUpsideDown();
3505 //================================================================================
3507 * \brief Initialization.
3508 * \param helper - helper loaded with mesh and 3D shape
3509 * \param thePrism - a prism data
3510 * \retval bool - false if a mesh or a shape are KO
3512 //================================================================================
3514 bool StdMeshers_PrismAsBlock::Init(SMESH_MesherHelper* helper,
3515 const Prism_3D::TPrismTopo& thePrism)
3518 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3519 SMESH_Mesh* mesh = myHelper->GetMesh();
3522 delete mySide; mySide = 0;
3524 vector< TSideFace* > sideFaces( NB_WALL_FACES, 0 );
3525 vector< pair< double, double> > params( NB_WALL_FACES );
3526 mySide = new TSideFace( *mesh, sideFaces, params );
3529 SMESH_Block::init();
3530 myShapeIDMap.Clear();
3531 myShapeIndex2ColumnMap.clear();
3533 int wallFaceIds[ NB_WALL_FACES ] = { // to walk around a block
3534 SMESH_Block::ID_Fx0z, SMESH_Block::ID_F1yz,
3535 SMESH_Block::ID_Fx1z, SMESH_Block::ID_F0yz
3538 myError = SMESH_ComputeError::New();
3540 myNotQuadOnTop = thePrism.myNotQuadOnTop;
3542 // Find columns of wall nodes and calculate edges' lengths
3543 // --------------------------------------------------------
3545 myParam2ColumnMaps.clear();
3546 myParam2ColumnMaps.resize( thePrism.myBottomEdges.size() ); // total nb edges
3548 size_t iE, nbEdges = thePrism.myNbEdgesInWires.front(); // nb outer edges
3549 vector< double > edgeLength( nbEdges );
3550 multimap< double, int > len2edgeMap;
3552 // for each EDGE: either split into several parts, or join with several next EDGEs
3553 vector<int> nbSplitPerEdge( nbEdges, 0 );
3554 vector<int> nbUnitePerEdge( nbEdges, 0 ); // -1 means "joined to a previous"
3556 // consider continuous straight EDGEs as one side
3557 const int nbSides = countNbSides( thePrism, nbUnitePerEdge, edgeLength );
3559 list< TopoDS_Edge >::const_iterator edgeIt = thePrism.myBottomEdges.begin();
3560 for ( iE = 0; iE < nbEdges; ++iE, ++edgeIt )
3562 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3564 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3565 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3567 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3568 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3569 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3570 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3572 SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3573 SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3574 SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3576 if ( nbSides < NB_WALL_FACES ) // fill map used to split faces
3577 len2edgeMap.insert( make_pair( edgeLength[ iE ], iE )); // sort edges by length
3579 // Load columns of internal edges (forming holes)
3580 // and fill map ShapeIndex to TParam2ColumnMap for them
3581 for ( ; edgeIt != thePrism.myBottomEdges.end() ; ++edgeIt, ++iE )
3583 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3585 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3586 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3588 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3589 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3590 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3591 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3593 if ( !faceColumns.empty() && (int)faceColumns.begin()->second.size() != VerticalSize() )
3594 return error(COMPERR_BAD_INPUT_MESH, "Different 'vertical' discretization");
3597 int id = MeshDS()->ShapeToIndex( *edgeIt );
3598 bool isForward = true; // meaningless for intenal wires
3599 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3600 // columns for vertices
3602 const SMDS_MeshNode* n0 = faceColumns.begin()->second.front();
3603 id = n0->getshapeId();
3604 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3606 const SMDS_MeshNode* n1 = faceColumns.rbegin()->second.front();
3607 id = n1->getshapeId();
3608 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3610 // SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3611 // SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3612 // SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3615 // Create 4 wall faces of a block
3616 // -------------------------------
3618 if ( nbSides <= NB_WALL_FACES ) // ************* Split faces if necessary
3620 if ( nbSides != NB_WALL_FACES ) // define how to split
3622 if ( len2edgeMap.size() != nbEdges )
3623 RETURN_BAD_RESULT("Uniqueness of edge lengths not assured");
3625 multimap< double, int >::reverse_iterator maxLen_i = len2edgeMap.rbegin();
3626 multimap< double, int >::reverse_iterator midLen_i = ++len2edgeMap.rbegin();
3628 double maxLen = maxLen_i->first;
3629 double midLen = ( len2edgeMap.size() == 1 ) ? 0 : midLen_i->first;
3630 switch ( nbEdges ) {
3631 case 1: // 0-th edge is split into 4 parts
3632 nbSplitPerEdge[ 0 ] = 4;
3634 case 2: // either the longest edge is split into 3 parts, or both edges into halves
3635 if ( maxLen / 3 > midLen / 2 ) {
3636 nbSplitPerEdge[ maxLen_i->second ] = 3;
3639 nbSplitPerEdge[ maxLen_i->second ] = 2;
3640 nbSplitPerEdge[ midLen_i->second ] = 2;
3645 // split longest into 3 parts
3646 nbSplitPerEdge[ maxLen_i->second ] = 3;
3648 // split longest into halves
3649 nbSplitPerEdge[ maxLen_i->second ] = 2;
3653 else // **************************** Unite faces
3655 int nbExraFaces = nbSides - 4; // nb of faces to fuse
3656 for ( iE = 0; iE < nbEdges; ++iE )
3658 if ( nbUnitePerEdge[ iE ] < 0 )
3660 // look for already united faces
3661 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3663 if ( nbUnitePerEdge[ i ] > 0 ) // a side including nbUnitePerEdge[i]+1 edge
3664 nbExraFaces += nbUnitePerEdge[ i ];
3665 nbUnitePerEdge[ i ] = -1;
3667 nbUnitePerEdge[ iE ] = nbExraFaces;
3672 // Create TSideFace's
3674 list< TopoDS_Edge >::const_iterator botE = thePrism.myBottomEdges.begin();
3675 for ( iE = 0; iE < nbEdges; ++iE, ++botE )
3677 TFaceQuadStructPtr quad = thePrism.myWallQuads[ iE ].front();
3678 const int nbSplit = nbSplitPerEdge[ iE ];
3679 const int nbExraFaces = nbUnitePerEdge[ iE ] + 1;
3680 if ( nbSplit > 0 ) // split
3682 vector< double > params;
3683 splitParams( nbSplit, &myParam2ColumnMaps[ iE ], params );
3684 const bool isForward =
3685 StdMeshers_PrismAsBlock::IsForwardEdge( myHelper->GetMeshDS(),
3686 myParam2ColumnMaps[iE],
3687 *botE, SMESH_Block::ID_Fx0z );
3688 for ( int i = 0; i < nbSplit; ++i ) {
3689 double f = ( isForward ? params[ i ] : params[ nbSplit - i-1 ]);
3690 double l = ( isForward ? params[ i+1 ] : params[ nbSplit - i ]);
3691 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3692 thePrism.myWallQuads[ iE ], *botE,
3693 &myParam2ColumnMaps[ iE ], f, l );
3694 mySide->SetComponent( iSide++, comp );
3697 else if ( nbExraFaces > 1 ) // unite
3699 double u0 = 0, sumLen = 0;
3700 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3701 sumLen += edgeLength[ i ];
3703 vector< TSideFace* > components( nbExraFaces );
3704 vector< pair< double, double> > params( nbExraFaces );
3705 bool endReached = false;
3706 for ( int i = 0; i < nbExraFaces; ++i, ++botE, ++iE )
3708 if ( iE == nbEdges )
3711 botE = thePrism.myBottomEdges.begin();
3714 components[ i ] = new TSideFace( *mesh, wallFaceIds[ iSide ],
3715 thePrism.myWallQuads[ iE ], *botE,
3716 &myParam2ColumnMaps[ iE ]);
3717 double u1 = u0 + edgeLength[ iE ] / sumLen;
3718 params[ i ] = make_pair( u0 , u1 );
3721 TSideFace* comp = new TSideFace( *mesh, components, params );
3722 mySide->SetComponent( iSide++, comp );
3725 --iE; // for increment in an external loop on iE
3728 else if ( nbExraFaces < 0 ) // skip already united face
3733 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3734 thePrism.myWallQuads[ iE ], *botE,
3735 &myParam2ColumnMaps[ iE ]);
3736 mySide->SetComponent( iSide++, comp );
3741 // Fill geometry fields of SMESH_Block
3742 // ------------------------------------
3744 vector< int > botEdgeIdVec;
3745 SMESH_Block::GetFaceEdgesIDs( ID_BOT_FACE, botEdgeIdVec );
3747 bool isForward[NB_WALL_FACES] = { true, true, true, true };
3748 Adaptor2d_Curve2d* botPcurves[NB_WALL_FACES];
3749 Adaptor2d_Curve2d* topPcurves[NB_WALL_FACES];
3751 for ( int iF = 0; iF < NB_WALL_FACES; ++iF )
3753 TSideFace * sideFace = mySide->GetComponent( iF );
3755 RETURN_BAD_RESULT("NULL TSideFace");
3756 int fID = sideFace->FaceID(); // in-block ID
3758 // fill myShapeIDMap
3759 if ( sideFace->InsertSubShapes( myShapeIDMap ) != 8 &&
3760 !sideFace->IsComplex())
3761 MESSAGE( ": Warning : InsertSubShapes() < 8 on side " << iF );
3763 // side faces geometry
3764 Adaptor2d_Curve2d* pcurves[NB_WALL_FACES];
3765 if ( !sideFace->GetPCurves( pcurves ))
3766 RETURN_BAD_RESULT("TSideFace::GetPCurves() failed");
3768 SMESH_Block::TFace& tFace = myFace[ fID - ID_FirstF ];
3769 tFace.Set( fID, sideFace->Surface(), pcurves, isForward );
3771 SHOWYXZ( endl<<"F "<< iF << " id " << fID << " FRW " << sideFace->IsForward(), sideFace->Value(0,0));
3772 // edges 3D geometry
3773 vector< int > edgeIdVec;
3774 SMESH_Block::GetFaceEdgesIDs( fID, edgeIdVec );
3775 for ( int isMax = 0; isMax < 2; ++isMax ) {
3777 int eID = edgeIdVec[ isMax ];
3778 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3779 tEdge.Set( eID, sideFace->HorizCurve(isMax), true);
3780 SHOWYXZ(eID<<" HOR"<<isMax<<"(0)", sideFace->HorizCurve(isMax)->Value(0));
3781 SHOWYXZ(eID<<" HOR"<<isMax<<"(1)", sideFace->HorizCurve(isMax)->Value(1));
3784 int eID = edgeIdVec[ isMax+2 ];
3785 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3786 tEdge.Set( eID, sideFace->VertiCurve(isMax), true);
3787 SHOWYXZ(eID<<" VER"<<isMax<<"(0)", sideFace->VertiCurve(isMax)->Value(0));
3788 SHOWYXZ(eID<<" VER"<<isMax<<"(1)", sideFace->VertiCurve(isMax)->Value(1));
3791 vector< int > vertexIdVec;
3792 SMESH_Block::GetEdgeVertexIDs( eID, vertexIdVec );
3793 myPnt[ vertexIdVec[0] - ID_FirstV ] = tEdge.GetCurve()->Value(0).XYZ();
3794 myPnt[ vertexIdVec[1] - ID_FirstV ] = tEdge.GetCurve()->Value(1).XYZ();
3797 // pcurves on horizontal faces
3798 for ( iE = 0; iE < NB_WALL_FACES; ++iE ) {
3799 if ( edgeIdVec[ BOTTOM_EDGE ] == botEdgeIdVec[ iE ] ) {
3800 botPcurves[ iE ] = sideFace->HorizPCurve( false, thePrism.myBottom );
3801 topPcurves[ iE ] = sideFace->HorizPCurve( true, thePrism.myTop );
3805 //sideFace->dumpNodes( 4 ); // debug
3807 // horizontal faces geometry
3809 SMESH_Block::TFace& tFace = myFace[ ID_BOT_FACE - ID_FirstF ];
3810 tFace.Set( ID_BOT_FACE, new BRepAdaptor_Surface( thePrism.myBottom ), botPcurves, isForward );
3811 SMESH_Block::Insert( thePrism.myBottom, ID_BOT_FACE, myShapeIDMap );
3814 SMESH_Block::TFace& tFace = myFace[ ID_TOP_FACE - ID_FirstF ];
3815 tFace.Set( ID_TOP_FACE, new BRepAdaptor_Surface( thePrism.myTop ), topPcurves, isForward );
3816 SMESH_Block::Insert( thePrism.myTop, ID_TOP_FACE, myShapeIDMap );
3818 //faceGridToPythonDump( SMESH_Block::ID_Fxy0, 50 );
3819 //faceGridToPythonDump( SMESH_Block::ID_Fxy1 );
3821 // Fill map ShapeIndex to TParam2ColumnMap
3822 // ----------------------------------------
3824 list< TSideFace* > fList;
3825 list< TSideFace* >::iterator fListIt;
3826 fList.push_back( mySide );
3827 for ( fListIt = fList.begin(); fListIt != fList.end(); ++fListIt)
3829 int nb = (*fListIt)->NbComponents();
3830 for ( int i = 0; i < nb; ++i ) {
3831 if ( TSideFace* comp = (*fListIt)->GetComponent( i ))
3832 fList.push_back( comp );
3834 if ( TParam2ColumnMap* cols = (*fListIt)->GetColumns()) {
3835 // columns for a base edge
3836 int id = MeshDS()->ShapeToIndex( (*fListIt)->BaseEdge() );
3837 bool isForward = (*fListIt)->IsForward();
3838 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3840 // columns for vertices
3841 const SMDS_MeshNode* n0 = cols->begin()->second.front();
3842 id = n0->getshapeId();
3843 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3845 const SMDS_MeshNode* n1 = cols->rbegin()->second.front();
3846 id = n1->getshapeId();
3847 myShapeIndex2ColumnMap[ id ] = make_pair( cols, !isForward );
3851 // #define SHOWYXZ(msg, xyz) { gp_Pnt p(xyz); cout << msg << " ("<< p.X() << "; " <<p.Y() << "; " <<p.Z() << ") " <<endl; }
3853 // double _u[]={ 0.1, 0.1, 0.9, 0.9 };
3854 // double _v[]={ 0.1, 0.9, 0.1, 0.9 };
3855 // for ( int z = 0; z < 2; ++z )
3856 // for ( int i = 0; i < 4; ++i )
3858 // //gp_XYZ testPar(0.25, 0.25, 0), testCoord;
3859 // int iFace = (z ? ID_TOP_FACE : ID_BOT_FACE);
3860 // gp_XYZ testPar(_u[i], _v[i], z), testCoord;
3861 // if ( !FacePoint( iFace, testPar, testCoord ))
3862 // RETURN_BAD_RESULT("TEST FacePoint() FAILED");
3863 // SHOWYXZ("IN TEST PARAM" , testPar);
3864 // SHOWYXZ("OUT TEST CORD" , testCoord);
3865 // if ( !ComputeParameters( testCoord, testPar , iFace))
3866 // RETURN_BAD_RESULT("TEST ComputeParameters() FAILED");
3867 // SHOWYXZ("OUT TEST PARAM" , testPar);
3872 //================================================================================
3874 * \brief Return pointer to column of nodes
3875 * \param node - bottom node from which the returned column goes up
3876 * \retval const TNodeColumn* - the found column
3878 //================================================================================
3880 const TNodeColumn* StdMeshers_PrismAsBlock::GetNodeColumn(const SMDS_MeshNode* node) const
3882 int sID = node->getshapeId();
3884 map<int, pair< TParam2ColumnMap*, bool > >::const_iterator col_frw =
3885 myShapeIndex2ColumnMap.find( sID );
3886 if ( col_frw != myShapeIndex2ColumnMap.end() ) {
3887 const TParam2ColumnMap* cols = col_frw->second.first;
3888 TParam2ColumnIt u_col = cols->begin();
3889 for ( ; u_col != cols->end(); ++u_col )
3890 if ( u_col->second[ 0 ] == node )
3891 return & u_col->second;
3896 //=======================================================================
3897 //function : GetLayersTransformation
3898 //purpose : Return transformations to get coordinates of nodes of each layer
3899 // by nodes of the bottom. Layer is a set of nodes at a certain step
3900 // from bottom to top.
3901 // Transformation to get top node from bottom ones is computed
3902 // only if the top FACE is not meshed.
3903 //=======================================================================
3905 bool StdMeshers_PrismAsBlock::GetLayersTransformation(vector<gp_Trsf> & trsf,
3906 const Prism_3D::TPrismTopo& prism) const
3908 const bool itTopMeshed = !SubMesh( ID_BOT_FACE )->IsEmpty();
3909 const int zSize = VerticalSize();
3910 if ( zSize < 3 && !itTopMeshed ) return true;
3911 trsf.resize( zSize - 1 );
3913 // Select some node columns by which we will define coordinate system of layers
3915 vector< const TNodeColumn* > columns;
3918 list< TopoDS_Edge >::const_iterator edgeIt = prism.myBottomEdges.begin();
3919 for ( int iE = 0; iE < prism.myNbEdgesInWires.front(); ++iE, ++edgeIt )
3921 if ( SMESH_Algo::isDegenerated( *edgeIt )) continue;
3922 const TParam2ColumnMap* u2colMap =
3923 GetParam2ColumnMap( MeshDS()->ShapeToIndex( *edgeIt ), isReverse );
3924 if ( !u2colMap ) return false;
3925 double f = u2colMap->begin()->first, l = u2colMap->rbegin()->first;
3926 //isReverse = ( edgeIt->Orientation() == TopAbs_REVERSED );
3927 //if ( isReverse ) swap ( f, l ); -- u2colMap takes orientation into account
3928 const int nbCol = 5;
3929 for ( int i = 0; i < nbCol; ++i )
3931 double u = f + i/double(nbCol) * ( l - f );
3932 const TNodeColumn* col = & getColumn( u2colMap, u )->second;
3933 if ( columns.empty() || col != columns.back() )
3934 columns.push_back( col );
3939 // Find tolerance to check transformations
3944 for ( size_t i = 0; i < columns.size(); ++i )
3945 bndBox.Add( gpXYZ( columns[i]->front() ));
3946 tol2 = bndBox.SquareExtent() * 1e-5;
3949 // Compute transformations
3952 gp_Trsf fromCsZ, toCs0;
3953 gp_Ax3 cs0 = getLayerCoordSys(0, columns, xCol );
3954 //double dist0 = cs0.Location().Distance( gpXYZ( (*columns[0])[0]));
3955 toCs0.SetTransformation( cs0 );
3956 for ( int z = 1; z < zSize; ++z )
3958 gp_Ax3 csZ = getLayerCoordSys(z, columns, xCol );
3959 //double distZ = csZ.Location().Distance( gpXYZ( (*columns[0])[z]));
3960 fromCsZ.SetTransformation( csZ );
3962 gp_Trsf& t = trsf[ z-1 ];
3963 t = fromCsZ * toCs0;
3964 //t.SetScaleFactor( distZ/dist0 ); - it does not work properly, wrong base point
3966 // check a transformation
3967 for ( size_t i = 0; i < columns.size(); ++i )
3969 gp_Pnt p0 = gpXYZ( (*columns[i])[0] );
3970 gp_Pnt pz = gpXYZ( (*columns[i])[z] );
3971 t.Transforms( p0.ChangeCoord() );
3972 if ( p0.SquareDistance( pz ) > tol2 )
3975 return ( z == zSize - 1 ); // OK if fails only botton->top trsf
3982 //================================================================================
3984 * \brief Check curve orientation of a bootom edge
3985 * \param meshDS - mesh DS
3986 * \param columnsMap - node columns map of side face
3987 * \param bottomEdge - the bootom edge
3988 * \param sideFaceID - side face in-block ID
3989 * \retval bool - true if orientation coinside with in-block forward orientation
3991 //================================================================================
3993 bool StdMeshers_PrismAsBlock::IsForwardEdge(SMESHDS_Mesh* meshDS,
3994 const TParam2ColumnMap& columnsMap,
3995 const TopoDS_Edge & bottomEdge,
3996 const int sideFaceID)
3998 bool isForward = false;
3999 if ( SMESH_MesherHelper::IsClosedEdge( bottomEdge ))
4001 isForward = ( bottomEdge.Orientation() == TopAbs_FORWARD );
4005 const TNodeColumn& firstCol = columnsMap.begin()->second;
4006 const SMDS_MeshNode* bottomNode = firstCol[0];
4007 TopoDS_Shape firstVertex = SMESH_MesherHelper::GetSubShapeByNode( bottomNode, meshDS );
4008 isForward = ( firstVertex.IsSame( TopExp::FirstVertex( bottomEdge, true )));
4010 // on 2 of 4 sides first vertex is end
4011 if ( sideFaceID == ID_Fx1z || sideFaceID == ID_F0yz )
4012 isForward = !isForward;
4016 //=======================================================================
4017 //function : faceGridToPythonDump
4018 //purpose : Prints a script creating a normal grid on the prism side
4019 //=======================================================================
4021 void StdMeshers_PrismAsBlock::faceGridToPythonDump(const SMESH_Block::TShapeID face,
4025 gp_XYZ pOnF[6] = { gp_XYZ(0,0,0), gp_XYZ(0,0,1),
4026 gp_XYZ(0,0,0), gp_XYZ(0,1,0),
4027 gp_XYZ(0,0,0), gp_XYZ(1,0,0) };
4029 cout << "mesh = smesh.Mesh( 'Face " << face << "')" << endl;
4030 SMESH_Block::TFace& f = myFace[ face - ID_FirstF ];
4031 gp_XYZ params = pOnF[ face - ID_FirstF ];
4032 //const int nb = 10; // nb face rows
4033 for ( int j = 0; j <= nb; ++j )
4035 params.SetCoord( f.GetVInd(), double( j )/ nb );
4036 for ( int i = 0; i <= nb; ++i )
4038 params.SetCoord( f.GetUInd(), double( i )/ nb );
4039 gp_XYZ p = f.Point( params );
4040 gp_XY uv = f.GetUV( params );
4041 cout << "mesh.AddNode( " << p.X() << ", " << p.Y() << ", " << p.Z() << " )"
4042 << " # " << 1 + i + j * ( nb + 1 )
4043 << " ( " << i << ", " << j << " ) "
4044 << " UV( " << uv.X() << ", " << uv.Y() << " )" << endl;
4045 ShellPoint( params, p2 );
4046 double dist = ( p2 - p ).Modulus();
4048 cout << "#### dist from ShellPoint " << dist
4049 << " (" << p2.X() << ", " << p2.Y() << ", " << p2.Z() << " ) " << endl;
4052 for ( int j = 0; j < nb; ++j )
4053 for ( int i = 0; i < nb; ++i )
4055 int n = 1 + i + j * ( nb + 1 );
4056 cout << "mesh.AddFace([ "
4057 << n << ", " << n+1 << ", "
4058 << n+nb+2 << ", " << n+nb+1 << "]) " << endl;
4064 //================================================================================
4066 * \brief Constructor
4067 * \param faceID - in-block ID
4068 * \param face - geom FACE
4069 * \param baseEdge - EDGE proreply oriented in the bottom EDGE !!!
4070 * \param columnsMap - map of node columns
4071 * \param first - first normalized param
4072 * \param last - last normalized param
4074 //================================================================================
4076 StdMeshers_PrismAsBlock::TSideFace::TSideFace(SMESH_Mesh& mesh,
4078 const Prism_3D::TQuadList& quadList,
4079 const TopoDS_Edge& baseEdge,
4080 TParam2ColumnMap* columnsMap,
4084 myParamToColumnMap( columnsMap ),
4087 myParams.resize( 1 );
4088 myParams[ 0 ] = make_pair( first, last );
4089 mySurface = PSurface( new BRepAdaptor_Surface( quadList.front()->face ));
4090 myBaseEdge = baseEdge;
4091 myIsForward = StdMeshers_PrismAsBlock::IsForwardEdge( myHelper.GetMeshDS(),
4092 *myParamToColumnMap,
4094 myHelper.SetSubShape( quadList.front()->face );
4096 if ( quadList.size() > 1 ) // side is vertically composite
4098 // fill myShapeID2Surf map to enable finding a right surface by any sub-shape ID
4100 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
4102 TopTools_IndexedDataMapOfShapeListOfShape subToFaces;
4103 Prism_3D::TQuadList::const_iterator quad = quadList.begin();
4104 for ( ; quad != quadList.end(); ++quad )
4106 const TopoDS_Face& face = (*quad)->face;
4107 TopExp::MapShapesAndAncestors( face, TopAbs_VERTEX, TopAbs_FACE, subToFaces );
4108 TopExp::MapShapesAndAncestors( face, TopAbs_EDGE, TopAbs_FACE, subToFaces );
4109 myShapeID2Surf.insert( make_pair( meshDS->ShapeToIndex( face ),
4110 PSurface( new BRepAdaptor_Surface( face ))));
4112 for ( int i = 1; i <= subToFaces.Extent(); ++i )
4114 const TopoDS_Shape& sub = subToFaces.FindKey( i );
4115 TopTools_ListOfShape& faces = subToFaces( i );
4116 int subID = meshDS->ShapeToIndex( sub );
4117 int faceID = meshDS->ShapeToIndex( faces.First() );
4118 myShapeID2Surf.insert ( make_pair( subID, myShapeID2Surf[ faceID ]));
4123 //================================================================================
4125 * \brief Constructor of a complex side face
4127 //================================================================================
4129 StdMeshers_PrismAsBlock::TSideFace::
4130 TSideFace(SMESH_Mesh& mesh,
4131 const vector< TSideFace* >& components,
4132 const vector< pair< double, double> > & params)
4133 :myID( components[0] ? components[0]->myID : 0 ),
4134 myParamToColumnMap( 0 ),
4136 myIsForward( true ),
4137 myComponents( components ),
4140 if ( myID == ID_Fx1z || myID == ID_F0yz )
4142 // reverse components
4143 std::reverse( myComponents.begin(), myComponents.end() );
4144 std::reverse( myParams.begin(), myParams.end() );
4145 for ( size_t i = 0; i < myParams.size(); ++i )
4147 const double f = myParams[i].first;
4148 const double l = myParams[i].second;
4149 myParams[i] = make_pair( 1. - l, 1. - f );
4153 //================================================================================
4155 * \brief Copy constructor
4156 * \param other - other side
4158 //================================================================================
4160 StdMeshers_PrismAsBlock::TSideFace::TSideFace( const TSideFace& other ):
4161 myID ( other.myID ),
4162 myParamToColumnMap ( other.myParamToColumnMap ),
4163 mySurface ( other.mySurface ),
4164 myBaseEdge ( other.myBaseEdge ),
4165 myShapeID2Surf ( other.myShapeID2Surf ),
4166 myParams ( other.myParams ),
4167 myIsForward ( other.myIsForward ),
4168 myComponents ( other.myComponents.size() ),
4169 myHelper ( *other.myHelper.GetMesh() )
4171 for ( size_t i = 0 ; i < myComponents.size(); ++i )
4172 myComponents[ i ] = new TSideFace( *other.myComponents[ i ]);
4175 //================================================================================
4177 * \brief Deletes myComponents
4179 //================================================================================
4181 StdMeshers_PrismAsBlock::TSideFace::~TSideFace()
4183 for ( size_t i = 0 ; i < myComponents.size(); ++i )
4184 if ( myComponents[ i ] )
4185 delete myComponents[ i ];
4188 //================================================================================
4190 * \brief Return geometry of the vertical curve
4191 * \param isMax - true means curve located closer to (1,1,1) block point
4192 * \retval Adaptor3d_Curve* - curve adaptor
4194 //================================================================================
4196 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::VertiCurve(const bool isMax) const
4198 if ( !myComponents.empty() ) {
4200 return myComponents.back()->VertiCurve(isMax);
4202 return myComponents.front()->VertiCurve(isMax);
4204 double f = myParams[0].first, l = myParams[0].second;
4205 if ( !myIsForward ) std::swap( f, l );
4206 return new TVerticalEdgeAdaptor( myParamToColumnMap, isMax ? l : f );
4209 //================================================================================
4211 * \brief Return geometry of the top or bottom curve
4213 * \retval Adaptor3d_Curve* -
4215 //================================================================================
4217 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::HorizCurve(const bool isTop) const
4219 return new THorizontalEdgeAdaptor( this, isTop );
4222 //================================================================================
4224 * \brief Return pcurves
4225 * \param pcurv - array of 4 pcurves
4226 * \retval bool - is a success
4228 //================================================================================
4230 bool StdMeshers_PrismAsBlock::TSideFace::GetPCurves(Adaptor2d_Curve2d* pcurv[4]) const
4232 int iEdge[ 4 ] = { BOTTOM_EDGE, TOP_EDGE, V0_EDGE, V1_EDGE };
4234 for ( int i = 0 ; i < 4 ; ++i ) {
4235 Handle(Geom2d_Line) line;
4236 switch ( iEdge[ i ] ) {
4238 line = new Geom2d_Line( gp_Pnt2d( 0, 1 ), gp::DX2d() ); break;
4240 line = new Geom2d_Line( gp::Origin2d(), gp::DX2d() ); break;
4242 line = new Geom2d_Line( gp::Origin2d(), gp::DY2d() ); break;
4244 line = new Geom2d_Line( gp_Pnt2d( 1, 0 ), gp::DY2d() ); break;
4246 pcurv[ i ] = new Geom2dAdaptor_Curve( line, 0, 1 );
4251 //================================================================================
4253 * \brief Returns geometry of pcurve on a horizontal face
4254 * \param isTop - is top or bottom face
4255 * \param horFace - a horizontal face
4256 * \retval Adaptor2d_Curve2d* - curve adaptor
4258 //================================================================================
4261 StdMeshers_PrismAsBlock::TSideFace::HorizPCurve(const bool isTop,
4262 const TopoDS_Face& horFace) const
4264 return new TPCurveOnHorFaceAdaptor( this, isTop, horFace );
4267 //================================================================================
4269 * \brief Return a component corresponding to parameter
4270 * \param U - parameter along a horizontal size
4271 * \param localU - parameter along a horizontal size of a component
4272 * \retval TSideFace* - found component
4274 //================================================================================
4276 StdMeshers_PrismAsBlock::TSideFace*
4277 StdMeshers_PrismAsBlock::TSideFace::GetComponent(const double U,double & localU) const
4280 if ( myComponents.empty() )
4281 return const_cast<TSideFace*>( this );
4284 for ( i = 0; i < myComponents.size(); ++i )
4285 if ( U < myParams[ i ].second )
4287 if ( i >= myComponents.size() )
4288 i = myComponents.size() - 1;
4290 double f = myParams[ i ].first, l = myParams[ i ].second;
4291 localU = ( U - f ) / ( l - f );
4292 return myComponents[ i ];
4295 //================================================================================
4297 * \brief Find node columns for a parameter
4298 * \param U - parameter along a horizontal edge
4299 * \param col1 - the 1st found column
4300 * \param col2 - the 2nd found column
4301 * \retval r - normalized position of U between the found columns
4303 //================================================================================
4305 double StdMeshers_PrismAsBlock::TSideFace::GetColumns(const double U,
4306 TParam2ColumnIt & col1,
4307 TParam2ColumnIt & col2) const
4309 double u = U, r = 0;
4310 if ( !myComponents.empty() ) {
4311 TSideFace * comp = GetComponent(U,u);
4312 return comp->GetColumns( u, col1, col2 );
4317 double f = myParams[0].first, l = myParams[0].second;
4318 u = f + u * ( l - f );
4320 col1 = col2 = getColumn( myParamToColumnMap, u );
4321 if ( ++col2 == myParamToColumnMap->end() ) {
4326 double uf = col1->first;
4327 double ul = col2->first;
4328 r = ( u - uf ) / ( ul - uf );
4333 //================================================================================
4335 * \brief Return all nodes at a given height together with their normalized parameters
4336 * \param [in] Z - the height of interest
4337 * \param [out] nodes - map of parameter to node
4339 //================================================================================
4341 void StdMeshers_PrismAsBlock::
4342 TSideFace::GetNodesAtZ(const int Z,
4343 map<double, const SMDS_MeshNode* >& nodes ) const
4345 if ( !myComponents.empty() )
4348 for ( size_t i = 0; i < myComponents.size(); ++i )
4350 map<double, const SMDS_MeshNode* > nn;
4351 myComponents[i]->GetNodesAtZ( Z, nn );
4352 map<double, const SMDS_MeshNode* >::iterator u2n = nn.begin();
4353 if ( !nodes.empty() && nodes.rbegin()->second == u2n->second )
4355 const double uRange = myParams[i].second - myParams[i].first;
4356 for ( ; u2n != nn.end(); ++u2n )
4357 nodes.insert( nodes.end(), make_pair( u0 + uRange * u2n->first, u2n->second ));
4363 double f = myParams[0].first, l = myParams[0].second;
4366 const double uRange = l - f;
4367 if ( Abs( uRange ) < std::numeric_limits<double>::min() )
4369 TParam2ColumnIt u2col = getColumn( myParamToColumnMap, myParams[0].first + 1e-3 );
4370 for ( ; u2col != myParamToColumnMap->end(); ++u2col )
4371 if ( u2col->first > myParams[0].second + 1e-9 )
4374 nodes.insert( nodes.end(),
4375 make_pair( ( u2col->first - f ) / uRange, u2col->second[ Z ] ));
4379 //================================================================================
4381 * \brief Return coordinates by normalized params
4382 * \param U - horizontal param
4383 * \param V - vertical param
4384 * \retval gp_Pnt - result point
4386 //================================================================================
4388 gp_Pnt StdMeshers_PrismAsBlock::TSideFace::Value(const Standard_Real U,
4389 const Standard_Real V) const
4391 if ( !myComponents.empty() ) {
4393 TSideFace * comp = GetComponent(U,u);
4394 return comp->Value( u, V );
4397 TParam2ColumnIt u_col1, u_col2;
4398 double vR, hR = GetColumns( U, u_col1, u_col2 );
4400 const SMDS_MeshNode* nn[4];
4402 // BEGIN issue 0020680: Bad cell created by Radial prism in center of torus
4403 // Workaround for a wrongly located point returned by mySurface.Value() for
4404 // UV located near boundary of BSpline surface.
4405 // To bypass the problem, we take point from 3D curve of EDGE.
4406 // It solves pb of the bloc_fiss_new.py
4407 const double tol = 1e-3;
4408 if ( V < tol || V+tol >= 1. )
4410 nn[0] = V < tol ? u_col1->second.front() : u_col1->second.back();
4411 nn[2] = V < tol ? u_col2->second.front() : u_col2->second.back();
4419 TopoDS_Shape s = myHelper.GetSubShapeByNode( nn[0], myHelper.GetMeshDS() );
4420 if ( s.ShapeType() != TopAbs_EDGE )
4421 s = myHelper.GetSubShapeByNode( nn[2], myHelper.GetMeshDS() );
4422 if ( !s.IsNull() && s.ShapeType() == TopAbs_EDGE )
4423 edge = TopoDS::Edge( s );
4425 if ( !edge.IsNull() )
4427 double u1 = myHelper.GetNodeU( edge, nn[0], nn[2] );
4428 double u3 = myHelper.GetNodeU( edge, nn[2], nn[0] );
4429 double u = u1 * ( 1 - hR ) + u3 * hR;
4430 TopLoc_Location loc; double f,l;
4431 Handle(Geom_Curve) curve = BRep_Tool::Curve( edge,loc,f,l );
4432 return curve->Value( u ).Transformed( loc );
4435 // END issue 0020680: Bad cell created by Radial prism in center of torus
4437 vR = getRAndNodes( & u_col1->second, V, nn[0], nn[1] );
4438 vR = getRAndNodes( & u_col2->second, V, nn[2], nn[3] );
4440 if ( !myShapeID2Surf.empty() ) // side is vertically composite
4442 // find a FACE on which the 4 nodes lie
4443 TSideFace* me = (TSideFace*) this;
4444 int notFaceID1 = 0, notFaceID2 = 0;
4445 for ( int i = 0; i < 4; ++i )
4446 if ( nn[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) // node on FACE
4448 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4452 else if ( notFaceID1 == 0 ) // node on EDGE or VERTEX
4454 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4455 notFaceID1 = nn[i]->getshapeId();
4457 else if ( notFaceID1 != nn[i]->getshapeId() ) // node on other EDGE or VERTEX
4459 if ( mySurface != me->myShapeID2Surf[ nn[i]->getshapeId() ])
4460 notFaceID2 = nn[i]->getshapeId();
4462 if ( notFaceID2 ) // no nodes of FACE and nodes are on different FACEs
4464 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
4465 TopoDS_Shape face = myHelper.GetCommonAncestor( meshDS->IndexToShape( notFaceID1 ),
4466 meshDS->IndexToShape( notFaceID2 ),
4467 *myHelper.GetMesh(),
4469 if ( face.IsNull() )
4470 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() face.IsNull()");
4471 int faceID = meshDS->ShapeToIndex( face );
4472 me->mySurface = me->myShapeID2Surf[ faceID ];
4474 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() !mySurface");
4477 ((TSideFace*) this)->myHelper.SetSubShape( mySurface->Face() );
4479 gp_XY uv1 = myHelper.GetNodeUV( mySurface->Face(), nn[0], nn[2]);
4480 gp_XY uv2 = myHelper.GetNodeUV( mySurface->Face(), nn[1], nn[3]);
4481 gp_XY uv12 = uv1 * ( 1 - vR ) + uv2 * vR;
4483 gp_XY uv3 = myHelper.GetNodeUV( mySurface->Face(), nn[2], nn[0]);
4484 gp_XY uv4 = myHelper.GetNodeUV( mySurface->Face(), nn[3], nn[1]);
4485 gp_XY uv34 = uv3 * ( 1 - vR ) + uv4 * vR;
4487 gp_XY uv = uv12 * ( 1 - hR ) + uv34 * hR;
4489 gp_Pnt p = mySurface->Value( uv.X(), uv.Y() );
4494 //================================================================================
4496 * \brief Return boundary edge
4497 * \param edge - edge index
4498 * \retval TopoDS_Edge - found edge
4500 //================================================================================
4502 TopoDS_Edge StdMeshers_PrismAsBlock::TSideFace::GetEdge(const int iEdge) const
4504 if ( !myComponents.empty() ) {
4506 case V0_EDGE : return myComponents.front()->GetEdge( iEdge );
4507 case V1_EDGE : return myComponents.back() ->GetEdge( iEdge );
4508 default: return TopoDS_Edge();
4512 const SMDS_MeshNode* node = 0;
4513 SMESHDS_Mesh * meshDS = myHelper.GetMesh()->GetMeshDS();
4514 TNodeColumn* column;
4519 column = & (( ++myParamToColumnMap->begin())->second );
4520 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4521 edge = myHelper.GetSubShapeByNode ( node, meshDS );
4522 if ( edge.ShapeType() == TopAbs_VERTEX ) {
4523 column = & ( myParamToColumnMap->begin()->second );
4524 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4529 bool back = ( iEdge == V1_EDGE );
4530 if ( !myIsForward ) back = !back;
4532 column = & ( myParamToColumnMap->rbegin()->second );
4534 column = & ( myParamToColumnMap->begin()->second );
4535 if ( column->size() > 0 )
4536 edge = myHelper.GetSubShapeByNode( (*column)[ 1 ], meshDS );
4537 if ( edge.IsNull() || edge.ShapeType() == TopAbs_VERTEX )
4538 node = column->front();
4543 if ( !edge.IsNull() && edge.ShapeType() == TopAbs_EDGE )
4544 return TopoDS::Edge( edge );
4546 // find edge by 2 vertices
4547 TopoDS_Shape V1 = edge;
4548 TopoDS_Shape V2 = myHelper.GetSubShapeByNode( node, meshDS );
4549 if ( !V2.IsNull() && V2.ShapeType() == TopAbs_VERTEX && !V2.IsSame( V1 ))
4551 TopoDS_Shape ancestor = myHelper.GetCommonAncestor( V1, V2, *myHelper.GetMesh(), TopAbs_EDGE);
4552 if ( !ancestor.IsNull() )
4553 return TopoDS::Edge( ancestor );
4555 return TopoDS_Edge();
4558 //================================================================================
4560 * \brief Fill block sub-shapes
4561 * \param shapeMap - map to fill in
4562 * \retval int - nb inserted sub-shapes
4564 //================================================================================
4566 int StdMeshers_PrismAsBlock::TSideFace::InsertSubShapes(TBlockShapes& shapeMap) const
4571 vector< int > edgeIdVec;
4572 SMESH_Block::GetFaceEdgesIDs( myID, edgeIdVec );
4574 for ( int i = BOTTOM_EDGE; i <=V1_EDGE ; ++i ) {
4575 TopoDS_Edge e = GetEdge( i );
4576 if ( !e.IsNull() ) {
4577 nbInserted += SMESH_Block::Insert( e, edgeIdVec[ i ], shapeMap);
4581 // Insert corner vertices
4583 TParam2ColumnIt col1, col2 ;
4584 vector< int > vertIdVec;
4587 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V0_EDGE ], vertIdVec);
4588 GetColumns(0, col1, col2 );
4589 const SMDS_MeshNode* node0 = col1->second.front();
4590 const SMDS_MeshNode* node1 = col1->second.back();
4591 TopoDS_Shape v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4592 TopoDS_Shape v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4593 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4594 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4596 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4597 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4601 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V1_EDGE ], vertIdVec);
4602 GetColumns(1, col1, col2 );
4603 node0 = col2->second.front();
4604 node1 = col2->second.back();
4605 v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4606 v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4607 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4608 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4610 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4611 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4614 // TopoDS_Vertex V0, V1, Vcom;
4615 // TopExp::Vertices( myBaseEdge, V0, V1, true );
4616 // if ( !myIsForward ) std::swap( V0, V1 );
4618 // // bottom vertex IDs
4619 // SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ _u0 ], vertIdVec);
4620 // SMESH_Block::Insert( V0, vertIdVec[ 0 ], shapeMap);
4621 // SMESH_Block::Insert( V1, vertIdVec[ 1 ], shapeMap);
4623 // TopoDS_Edge sideEdge = GetEdge( V0_EDGE );
4624 // if ( sideEdge.IsNull() || !TopExp::CommonVertex( botEdge, sideEdge, Vcom ))
4627 // // insert one side edge
4629 // if ( Vcom.IsSame( V0 )) edgeID = edgeIdVec[ _v0 ];
4630 // else edgeID = edgeIdVec[ _v1 ];
4631 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4633 // // top vertex of the side edge
4634 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec);
4635 // TopoDS_Vertex Vtop = TopExp::FirstVertex( sideEdge );
4636 // if ( Vcom.IsSame( Vtop ))
4637 // Vtop = TopExp::LastVertex( sideEdge );
4638 // SMESH_Block::Insert( Vtop, vertIdVec[ 1 ], shapeMap);
4640 // // other side edge
4641 // sideEdge = GetEdge( V1_EDGE );
4642 // if ( sideEdge.IsNull() )
4644 // if ( edgeID = edgeIdVec[ _v1 ]) edgeID = edgeIdVec[ _v0 ];
4645 // else edgeID = edgeIdVec[ _v1 ];
4646 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4649 // TopoDS_Edge topEdge = GetEdge( TOP_EDGE );
4650 // SMESH_Block::Insert( topEdge, edgeIdVec[ _u1 ], shapeMap);
4652 // // top vertex of the other side edge
4653 // if ( !TopExp::CommonVertex( topEdge, sideEdge, Vcom ))
4655 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec );
4656 // SMESH_Block::Insert( Vcom, vertIdVec[ 1 ], shapeMap);
4661 //================================================================================
4663 * \brief Dump ids of nodes of sides
4665 //================================================================================
4667 void StdMeshers_PrismAsBlock::TSideFace::dumpNodes(int nbNodes) const
4670 cout << endl << "NODES OF FACE "; SMESH_Block::DumpShapeID( myID, cout ) << endl;
4671 THorizontalEdgeAdaptor* hSize0 = (THorizontalEdgeAdaptor*) HorizCurve(0);
4672 cout << "Horiz side 0: "; hSize0->dumpNodes(nbNodes); cout << endl;
4673 THorizontalEdgeAdaptor* hSize1 = (THorizontalEdgeAdaptor*) HorizCurve(1);
4674 cout << "Horiz side 1: "; hSize1->dumpNodes(nbNodes); cout << endl;
4675 TVerticalEdgeAdaptor* vSide0 = (TVerticalEdgeAdaptor*) VertiCurve(0);
4676 cout << "Verti side 0: "; vSide0->dumpNodes(nbNodes); cout << endl;
4677 TVerticalEdgeAdaptor* vSide1 = (TVerticalEdgeAdaptor*) VertiCurve(1);
4678 cout << "Verti side 1: "; vSide1->dumpNodes(nbNodes); cout << endl;
4679 delete hSize0; delete hSize1; delete vSide0; delete vSide1;
4683 //================================================================================
4685 * \brief Creates TVerticalEdgeAdaptor
4686 * \param columnsMap - node column map
4687 * \param parameter - normalized parameter
4689 //================================================================================
4691 StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::
4692 TVerticalEdgeAdaptor( const TParam2ColumnMap* columnsMap, const double parameter)
4694 myNodeColumn = & getColumn( columnsMap, parameter )->second;
4697 //================================================================================
4699 * \brief Return coordinates for the given normalized parameter
4700 * \param U - normalized parameter
4701 * \retval gp_Pnt - coordinates
4703 //================================================================================
4705 gp_Pnt StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::Value(const Standard_Real U) const
4707 const SMDS_MeshNode* n1;
4708 const SMDS_MeshNode* n2;
4709 double r = getRAndNodes( myNodeColumn, U, n1, n2 );
4710 return gpXYZ(n1) * ( 1 - r ) + gpXYZ(n2) * r;
4713 //================================================================================
4715 * \brief Dump ids of nodes
4717 //================================================================================
4719 void StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::dumpNodes(int nbNodes) const
4722 for ( int i = 0; i < nbNodes && i < (int)myNodeColumn->size(); ++i )
4723 cout << (*myNodeColumn)[i]->GetID() << " ";
4724 if ( nbNodes < (int) myNodeColumn->size() )
4725 cout << myNodeColumn->back()->GetID();
4729 //================================================================================
4731 * \brief Return coordinates for the given normalized parameter
4732 * \param U - normalized parameter
4733 * \retval gp_Pnt - coordinates
4735 //================================================================================
4737 gp_Pnt StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::Value(const Standard_Real U) const
4739 return mySide->TSideFace::Value( U, myV );
4742 //================================================================================
4744 * \brief Dump ids of <nbNodes> first nodes and the last one
4746 //================================================================================
4748 void StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::dumpNodes(int nbNodes) const
4751 // Not bedugged code. Last node is sometimes incorrect
4752 const TSideFace* side = mySide;
4754 if ( mySide->IsComplex() )
4755 side = mySide->GetComponent(0,u);
4757 TParam2ColumnIt col, col2;
4758 TParam2ColumnMap* u2cols = side->GetColumns();
4759 side->GetColumns( u , col, col2 );
4761 int j, i = myV ? mySide->ColumnHeight()-1 : 0;
4763 const SMDS_MeshNode* n = 0;
4764 const SMDS_MeshNode* lastN
4765 = side->IsForward() ? u2cols->rbegin()->second[ i ] : u2cols->begin()->second[ i ];
4766 for ( j = 0; j < nbNodes && n != lastN; ++j )
4768 n = col->second[ i ];
4769 cout << n->GetID() << " ";
4770 if ( side->IsForward() )
4778 if ( mySide->IsComplex() )
4779 side = mySide->GetComponent(1,u);
4781 side->GetColumns( u , col, col2 );
4782 if ( n != col->second[ i ] )
4783 cout << col->second[ i ]->GetID();
4787 //================================================================================
4789 * \brief Costructor of TPCurveOnHorFaceAdaptor fills its map of
4790 * normalized parameter to node UV on a horizontal face
4791 * \param [in] sideFace - lateral prism side
4792 * \param [in] isTop - is \a horFace top or bottom of the prism
4793 * \param [in] horFace - top or bottom face of the prism
4795 //================================================================================
4797 StdMeshers_PrismAsBlock::
4798 TPCurveOnHorFaceAdaptor::TPCurveOnHorFaceAdaptor( const TSideFace* sideFace,
4800 const TopoDS_Face& horFace)
4802 if ( sideFace && !horFace.IsNull() )
4804 //cout << "\n\t FACE " << sideFace->FaceID() << endl;
4805 const int Z = isTop ? sideFace->ColumnHeight() - 1 : 0;
4806 map<double, const SMDS_MeshNode* > u2nodes;
4807 sideFace->GetNodesAtZ( Z, u2nodes );
4808 if ( u2nodes.empty() )
4811 SMESH_MesherHelper helper( *sideFace->GetMesh() );
4812 helper.SetSubShape( horFace );
4817 Handle(Geom2d_Curve) C2d;
4819 const double tol = 10 * helper.MaxTolerance( horFace );
4820 const SMDS_MeshNode* prevNode = u2nodes.rbegin()->second;
4822 map<double, const SMDS_MeshNode* >::iterator u2n = u2nodes.begin();
4823 for ( ; u2n != u2nodes.end(); ++u2n )
4825 const SMDS_MeshNode* n = u2n->second;
4827 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_EDGE )
4829 if ( n->getshapeId() != edgeID )
4832 edgeID = n->getshapeId();
4833 TopoDS_Shape S = helper.GetSubShapeByNode( n, helper.GetMeshDS() );
4834 if ( !S.IsNull() && S.ShapeType() == TopAbs_EDGE )
4836 C2d = BRep_Tool::CurveOnSurface( TopoDS::Edge( S ), horFace, f,l );
4839 if ( !C2d.IsNull() )
4841 double u = static_cast< const SMDS_EdgePosition* >( n->GetPosition() )->GetUParameter();
4842 if ( f <= u && u <= l )
4844 uv = C2d->Value( u ).XY();
4845 okUV = helper.CheckNodeUV( horFace, n, uv, tol );
4850 uv = helper.GetNodeUV( horFace, n, prevNode, &okUV );
4852 myUVmap.insert( myUVmap.end(), make_pair( u2n->first, uv ));
4853 // cout << n->getshapeId() << " N " << n->GetID()
4854 // << " \t" << uv.X() << ", " << uv.Y() << " \t" << u2n->first << endl;
4861 //================================================================================
4863 * \brief Return UV on pcurve for the given normalized parameter
4864 * \param U - normalized parameter
4865 * \retval gp_Pnt - coordinates
4867 //================================================================================
4869 gp_Pnt2d StdMeshers_PrismAsBlock::TPCurveOnHorFaceAdaptor::Value(const Standard_Real U) const
4871 map< double, gp_XY >::const_iterator i1 = myUVmap.upper_bound( U );
4873 if ( i1 == myUVmap.end() )
4874 return myUVmap.empty() ? gp_XY(0,0) : myUVmap.rbegin()->second;
4876 if ( i1 == myUVmap.begin() )
4877 return (*i1).second;
4879 map< double, gp_XY >::const_iterator i2 = i1--;
4881 double r = ( U - i1->first ) / ( i2->first - i1->first );
4882 return i1->second * ( 1 - r ) + i2->second * r;
4885 //================================================================================
4887 * \brief Projects internal nodes using transformation found by boundary nodes
4889 //================================================================================
4891 bool StdMeshers_Sweeper::projectIntPoints(const vector< gp_XYZ >& fromBndPoints,
4892 const vector< gp_XYZ >& toBndPoints,
4893 const vector< gp_XYZ >& fromIntPoints,
4894 vector< gp_XYZ >& toIntPoints,
4896 NSProjUtils::TrsfFinder3D& trsf,
4897 vector< gp_XYZ > * bndError)
4899 // find transformation
4900 if ( trsf.IsIdentity() && !trsf.Solve( fromBndPoints, toBndPoints ))
4903 // compute internal points using the found trsf
4904 for ( size_t iP = 0; iP < fromIntPoints.size(); ++iP )
4906 toIntPoints[ iP ] = trsf.Transform( fromIntPoints[ iP ]);
4909 // compute boundary error
4912 bndError->resize( fromBndPoints.size() );
4914 for ( size_t iP = 0; iP < fromBndPoints.size(); ++iP )
4916 fromTrsf = trsf.Transform( fromBndPoints[ iP ] );
4917 (*bndError)[ iP ] = toBndPoints[ iP ] - fromTrsf;
4921 // apply boundary error
4922 if ( bndError && toIntPoints.size() == myTopBotTriangles.size() )
4924 for ( size_t iP = 0; iP < toIntPoints.size(); ++iP )
4926 const TopBotTriangles& tbTrias = myTopBotTriangles[ iP ];
4927 for ( int i = 0; i < 3; ++i ) // boundary errors at 3 triangle nodes
4929 toIntPoints[ iP ] +=
4930 ( (*bndError)[ tbTrias.myBotTriaNodes[i] ] * tbTrias.myBotBC[i] * ( 1 - r ) +
4931 (*bndError)[ tbTrias.myTopTriaNodes[i] ] * tbTrias.myTopBC[i] * ( r ));
4939 //================================================================================
4941 * \brief Create internal nodes of the prism by computing an affine transformation
4942 * from layer to layer
4944 //================================================================================
4946 bool StdMeshers_Sweeper::ComputeNodesByTrsf( const double tol,
4947 const bool allowHighBndError)
4949 const size_t zSize = myBndColumns[0]->size();
4950 const size_t zSrc = 0, zTgt = zSize-1;
4951 if ( zSize < 3 ) return true;
4953 vector< vector< gp_XYZ > > intPntsOfLayer( zSize ); // node coodinates to compute
4954 // set coordinates of src and tgt nodes
4955 for ( size_t z = 0; z < intPntsOfLayer.size(); ++z )
4956 intPntsOfLayer[ z ].resize( myIntColumns.size() );
4957 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4959 intPntsOfLayer[ zSrc ][ iP ] = intPoint( iP, zSrc );
4960 intPntsOfLayer[ zTgt ][ iP ] = intPoint( iP, zTgt );
4963 // for each internal column find boundary nodes whose error to use for correction
4964 prepareTopBotDelaunay();
4965 if ( !findDelaunayTriangles())
4968 // compute coordinates of internal nodes by projecting (transfroming) src and tgt
4969 // nodes towards the central layer
4971 vector< NSProjUtils::TrsfFinder3D > trsfOfLayer( zSize );
4972 vector< vector< gp_XYZ > > bndError( zSize );
4974 // boundary points used to compute an affine transformation from a layer to a next one
4975 vector< gp_XYZ > fromSrcBndPnts( myBndColumns.size() ), fromTgtBndPnts( myBndColumns.size() );
4976 vector< gp_XYZ > toSrcBndPnts ( myBndColumns.size() ), toTgtBndPnts ( myBndColumns.size() );
4977 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4979 fromSrcBndPnts[ iP ] = bndPoint( iP, zSrc );
4980 fromTgtBndPnts[ iP ] = bndPoint( iP, zTgt );
4983 size_t zS = zSrc + 1;
4984 size_t zT = zTgt - 1;
4985 for ( ; zS < zT; ++zS, --zT ) // vertical loop on layers
4987 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4989 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4990 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4992 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4993 intPntsOfLayer[ zS-1 ], intPntsOfLayer[ zS ],
4995 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
4997 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4998 intPntsOfLayer[ zT+1 ], intPntsOfLayer[ zT ],
5000 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
5003 // if ( zT == zTgt - 1 )
5005 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
5007 // gp_XYZ fromTrsf = trsfOfLayer [ zT+1].Transform( fromTgtBndPnts[ iP ] );
5008 // cout << "mesh.AddNode( "
5009 // << fromTrsf.X() << ", "
5010 // << fromTrsf.Y() << ", "
5011 // << fromTrsf.Z() << ") " << endl;
5013 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
5014 // cout << "mesh.AddNode( "
5015 // << intPntsOfLayer[ zT ][ iP ].X() << ", "
5016 // << intPntsOfLayer[ zT ][ iP ].Y() << ", "
5017 // << intPntsOfLayer[ zT ][ iP ].Z() << ") " << endl;
5020 fromTgtBndPnts.swap( toTgtBndPnts );
5021 fromSrcBndPnts.swap( toSrcBndPnts );
5024 // Compute two projections of internal points to the central layer
5025 // in order to evaluate an error of internal points
5027 bool centerIntErrorIsSmall;
5028 vector< gp_XYZ > centerSrcIntPnts( myIntColumns.size() );
5029 vector< gp_XYZ > centerTgtIntPnts( myIntColumns.size() );
5031 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
5033 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
5034 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
5036 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
5037 intPntsOfLayer[ zS-1 ], centerSrcIntPnts,
5039 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
5041 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
5042 intPntsOfLayer[ zT+1 ], centerTgtIntPnts,
5044 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
5047 // evaluate an error of internal points on the central layer
5048 centerIntErrorIsSmall = true;
5049 if ( zS == zT ) // odd zSize
5051 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
5052 centerIntErrorIsSmall =
5053 (centerSrcIntPnts[ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
5057 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
5058 centerIntErrorIsSmall =
5059 (intPntsOfLayer[ zS-1 ][ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
5062 // compute final points on the central layer
5063 double r = zS / ( zSize - 1.);
5066 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
5068 intPntsOfLayer[ zS ][ iP ] =
5069 ( 1 - r ) * centerSrcIntPnts[ iP ] + r * centerTgtIntPnts[ iP ];
5074 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
5076 intPntsOfLayer[ zS ][ iP ] =
5077 r * intPntsOfLayer[ zS ][ iP ] + ( 1 - r ) * centerSrcIntPnts[ iP ];
5078 intPntsOfLayer[ zT ][ iP ] =
5079 r * intPntsOfLayer[ zT ][ iP ] + ( 1 - r ) * centerTgtIntPnts[ iP ];
5083 //centerIntErrorIsSmall = true; // 3D_mesh_Extrusion_00/A3
5084 if ( !centerIntErrorIsSmall )
5086 // Compensate the central error; continue adding projection
5087 // by going from central layer to the source and target ones
5089 vector< gp_XYZ >& fromSrcIntPnts = centerSrcIntPnts;
5090 vector< gp_XYZ >& fromTgtIntPnts = centerTgtIntPnts;
5091 vector< gp_XYZ > toSrcIntPnts( myIntColumns.size() );
5092 vector< gp_XYZ > toTgtIntPnts( myIntColumns.size() );
5093 vector< gp_XYZ > srcBndError( myBndColumns.size() );
5094 vector< gp_XYZ > tgtBndError( myBndColumns.size() );
5096 fromTgtBndPnts.swap( toTgtBndPnts );
5097 fromSrcBndPnts.swap( toSrcBndPnts );
5099 for ( ++zS, --zT; zS < zTgt; ++zS, --zT ) // vertical loop on layers
5101 // invert transformation
5102 if ( !trsfOfLayer[ zS+1 ].Invert() )
5103 trsfOfLayer[ zS+1 ] = NSProjUtils::TrsfFinder3D(); // to recompute
5104 if ( !trsfOfLayer[ zT-1 ].Invert() )
5105 trsfOfLayer[ zT-1 ] = NSProjUtils::TrsfFinder3D();
5107 // project internal nodes and compute bnd error
5108 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
5110 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
5111 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
5113 projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
5114 fromSrcIntPnts, toSrcIntPnts,
5116 trsfOfLayer[ zS+1 ], & srcBndError );
5117 projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
5118 fromTgtIntPnts, toTgtIntPnts,
5120 trsfOfLayer[ zT-1 ], & tgtBndError );
5122 // if ( zS == zTgt - 1 )
5124 // cout << "mesh2 = smesh.Mesh()" << endl;
5125 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
5127 // gp_XYZ fromTrsf = trsfOfLayer [ zS+1].Transform( fromSrcBndPnts[ iP ] );
5128 // cout << "mesh2.AddNode( "
5129 // << fromTrsf.X() << ", "
5130 // << fromTrsf.Y() << ", "
5131 // << fromTrsf.Z() << ") " << endl;
5133 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
5134 // cout << "mesh2.AddNode( "
5135 // << toSrcIntPnts[ iP ].X() << ", "
5136 // << toSrcIntPnts[ iP ].Y() << ", "
5137 // << toSrcIntPnts[ iP ].Z() << ") " << endl;
5140 // sum up 2 projections
5141 r = zS / ( zSize - 1.);
5142 vector< gp_XYZ >& zSIntPnts = intPntsOfLayer[ zS ];
5143 vector< gp_XYZ >& zTIntPnts = intPntsOfLayer[ zT ];
5144 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
5146 zSIntPnts[ iP ] = r * zSIntPnts[ iP ] + ( 1 - r ) * toSrcIntPnts[ iP ];
5147 zTIntPnts[ iP ] = r * zTIntPnts[ iP ] + ( 1 - r ) * toTgtIntPnts[ iP ];
5150 fromSrcBndPnts.swap( toSrcBndPnts );
5151 fromSrcIntPnts.swap( toSrcIntPnts );
5152 fromTgtBndPnts.swap( toTgtBndPnts );
5153 fromTgtIntPnts.swap( toTgtIntPnts );
5155 } // if ( !centerIntErrorIsSmall )
5158 //cout << "centerIntErrorIsSmall = " << centerIntErrorIsSmall<< endl;
5161 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
5163 vector< const SMDS_MeshNode* > & nodeCol = *myIntColumns[ iP ];
5164 for ( size_t z = zSrc + 1; z < zTgt; ++z ) // vertical loop on layers
5166 const gp_XYZ & xyz = intPntsOfLayer[ z ][ iP ];
5167 if ( !( nodeCol[ z ] = myHelper->AddNode( xyz.X(), xyz.Y(), xyz.Z() )))
5175 //================================================================================
5177 * \brief Check if all nodes of each layers have same logical Z
5179 //================================================================================
5181 bool StdMeshers_Sweeper::CheckSameZ()
5183 myZColumns.resize( myBndColumns.size() );
5184 fillZColumn( myZColumns[0], *myBndColumns[0] );
5187 const double tol = 0.1 * 1./ myBndColumns[0]->size();
5189 // check columns based on VERTEXes
5191 vector< int > vertexIndex;
5192 vertexIndex.push_back( 0 );
5193 for ( size_t iC = 1; iC < myBndColumns.size() && sameZ; ++iC )
5195 if ( myBndColumns[iC]->front()->GetPosition()->GetDim() > 0 )
5196 continue; // not on VERTEX
5198 vertexIndex.push_back( iC );
5199 fillZColumn( myZColumns[iC], *myBndColumns[iC] );
5201 for ( size_t iZ = 0; iZ < myZColumns[0].size() && sameZ; ++iZ )
5202 sameZ = ( Abs( myZColumns[0][iZ] - myZColumns[iC][iZ]) < tol );
5205 // check columns based on EDGEs, one per EDGE
5207 for ( size_t i = 1; i < vertexIndex.size() && sameZ; ++i )
5209 if ( vertexIndex[i] - vertexIndex[i-1] < 2 )
5212 int iC = ( vertexIndex[i] + vertexIndex[i-1] ) / 2;
5213 fillZColumn( myZColumns[iC], *myBndColumns[iC] );
5215 for ( size_t iZ = 0; iZ < myZColumns[0].size() && sameZ; ++iZ )
5216 sameZ = ( Abs( myZColumns[0][iZ] - myZColumns[iC][iZ]) < tol );
5221 myZColumns.resize(1);
5225 for ( size_t iC = 1; iC < myBndColumns.size(); ++iC )
5226 fillZColumn( myZColumns[iC], *myBndColumns[iC] );
5232 //================================================================================
5234 * \brief Create internal nodes of the prism all located on straight lines with
5235 * the same distribution along the lines.
5237 //================================================================================
5239 bool StdMeshers_Sweeper::ComputeNodesOnStraightSameZ()
5241 TZColumn& z = myZColumns[0];
5243 for ( size_t i = 0; i < myIntColumns.size(); ++i )
5245 TNodeColumn& nodes = *myIntColumns[i];
5246 SMESH_NodeXYZ n0( nodes[0] ), n1( nodes.back() );
5248 for ( size_t iZ = 0; iZ < z.size(); ++iZ )
5250 gp_XYZ p = n0 * ( 1 - z[iZ] ) + n1 * z[iZ];
5251 nodes[ iZ+1 ] = myHelper->AddNode( p.X(), p.Y(), p.Z() );
5258 //================================================================================
5260 * \brief Create internal nodes of the prism all located on straight lines with
5261 * different distributions along the lines.
5263 //================================================================================
5265 bool StdMeshers_Sweeper::ComputeNodesOnStraight()
5267 prepareTopBotDelaunay();
5269 const SMDS_MeshNode *botNode, *topNode;
5270 const BRepMesh_Triangle *topTria;
5271 double botBC[3], topBC[3]; // barycentric coordinates
5272 int botTriaNodes[3], topTriaNodes[3];
5273 bool checkUV = true;
5275 int nbInternalNodes = myIntColumns.size();
5276 myBotDelaunay->InitTraversal( nbInternalNodes );
5278 while (( botNode = myBotDelaunay->NextNode( botBC, botTriaNodes )))
5280 TNodeColumn* column = myIntColumns[ myNodeID2ColID( botNode->GetID() )];
5282 // find a Delaunay triangle containing the topNode
5283 topNode = column->back();
5284 gp_XY topUV = myHelper->GetNodeUV( myTopFace, topNode, NULL, &checkUV );
5285 // get a starting triangle basing on that top and bot boundary nodes have same index
5286 topTria = myTopDelaunay->GetTriangleNear( botTriaNodes[0] );
5287 topTria = myTopDelaunay->FindTriangle( topUV, topTria, topBC, topTriaNodes );
5291 // create nodes along a line
5292 SMESH_NodeXYZ botP( botNode ), topP( topNode);
5293 for ( size_t iZ = 0; iZ < myZColumns[0].size(); ++iZ )
5295 // use barycentric coordinates as weight of Z of boundary columns
5296 double botZ = 0, topZ = 0;
5297 for ( int i = 0; i < 3; ++i )
5299 botZ += botBC[i] * myZColumns[ botTriaNodes[i] ][ iZ ];
5300 topZ += topBC[i] * myZColumns[ topTriaNodes[i] ][ iZ ];
5302 double rZ = double( iZ + 1 ) / ( myZColumns[0].size() + 1 );
5303 double z = botZ * ( 1 - rZ ) + topZ * rZ;
5304 gp_XYZ p = botP * ( 1 - z ) + topP * z;
5305 (*column)[ iZ+1 ] = myHelper->AddNode( p.X(), p.Y(), p.Z() );
5309 return myBotDelaunay->NbVisitedNodes() == nbInternalNodes;
5312 //================================================================================
5314 * \brief Compute Z of nodes of a straight column
5316 //================================================================================
5318 void StdMeshers_Sweeper::fillZColumn( TZColumn& zColumn,
5319 TNodeColumn& nodes )
5321 if ( zColumn.size() == nodes.size() - 2 )
5324 gp_Pnt p0 = SMESH_NodeXYZ( nodes[0] );
5325 gp_Vec line( p0, SMESH_NodeXYZ( nodes.back() ));
5326 double len2 = line.SquareMagnitude();
5328 zColumn.resize( nodes.size() - 2 );
5329 for ( size_t i = 0; i < zColumn.size(); ++i )
5331 gp_Vec vec( p0, SMESH_NodeXYZ( nodes[ i+1] ));
5332 zColumn[i] = ( line * vec ) / len2; // param [0,1] on the line
5336 //================================================================================
5338 * \brief Initialize *Delaunay members
5340 //================================================================================
5342 void StdMeshers_Sweeper::prepareTopBotDelaunay()
5344 UVPtStructVec botUV( myBndColumns.size() );
5345 UVPtStructVec topUV( myBndColumns.size() );
5346 for ( size_t i = 0; i < myBndColumns.size(); ++i )
5348 TNodeColumn& nodes = *myBndColumns[i];
5349 botUV[i].node = nodes[0];
5350 botUV[i].SetUV( myHelper->GetNodeUV( myBotFace, nodes[0] ));
5351 topUV[i].node = nodes.back();
5352 topUV[i].SetUV( myHelper->GetNodeUV( myTopFace, nodes.back() ));
5353 botUV[i].node->setIsMarked( true );
5356 SMESH_Mesh* mesh = myHelper->GetMesh();
5357 TSideVector botWires( 1, StdMeshers_FaceSide::New( botUV, myBotFace, dummyE, mesh ));
5358 TSideVector topWires( 1, StdMeshers_FaceSide::New( topUV, myTopFace, dummyE, mesh ));
5360 // Delaunay mesh on the FACEs.
5361 bool checkUV = false;
5362 myBotDelaunay.reset( new NSProjUtils::Delaunay( botWires, checkUV ));
5363 myTopDelaunay.reset( new NSProjUtils::Delaunay( topWires, checkUV ));
5365 if ( myHelper->GetIsQuadratic() )
5367 // mark all medium nodes of faces on botFace to avoid their treating
5368 SMESHDS_SubMesh* smDS = myHelper->GetMeshDS()->MeshElements( myBotFace );
5369 SMDS_ElemIteratorPtr eIt = smDS->GetElements();
5370 while ( eIt->more() )
5372 const SMDS_MeshElement* e = eIt->next();
5373 for ( int i = e->NbCornerNodes(), nb = e->NbNodes(); i < nb; ++i )
5374 e->GetNode( i )->setIsMarked( true );
5378 // map to get a node column by a bottom node
5379 myNodeID2ColID.Clear(/*doReleaseMemory=*/false);
5380 myNodeID2ColID.ReSize( myIntColumns.size() );
5382 // un-mark nodes to treat (internal bottom nodes) to be returned by myBotDelaunay
5383 for ( size_t i = 0; i < myIntColumns.size(); ++i )
5385 const SMDS_MeshNode* botNode = myIntColumns[i]->front();
5386 botNode->setIsMarked( false );
5387 myNodeID2ColID.Bind( botNode->GetID(), i );
5391 //================================================================================
5393 * \brief For each internal node column, find Delaunay triangles including it
5394 * and Barycentric Coordinates within the triangles. Fill in myTopBotTriangles
5396 //================================================================================
5398 bool StdMeshers_Sweeper::findDelaunayTriangles()
5400 const SMDS_MeshNode *botNode, *topNode;
5401 const BRepMesh_Triangle *topTria;
5402 TopBotTriangles tbTrias;
5403 bool checkUV = true;
5405 int nbInternalNodes = myIntColumns.size();
5406 myTopBotTriangles.resize( nbInternalNodes );
5408 myBotDelaunay->InitTraversal( nbInternalNodes );
5410 while (( botNode = myBotDelaunay->NextNode( tbTrias.myBotBC, tbTrias.myBotTriaNodes )))
5412 int colID = myNodeID2ColID( botNode->GetID() );
5413 TNodeColumn* column = myIntColumns[ colID ];
5415 // find a Delaunay triangle containing the topNode
5416 topNode = column->back();
5417 gp_XY topUV = myHelper->GetNodeUV( myTopFace, topNode, NULL, &checkUV );
5418 // get a starting triangle basing on that top and bot boundary nodes have same index
5419 topTria = myTopDelaunay->GetTriangleNear( tbTrias.myBotTriaNodes[0] );
5420 topTria = myTopDelaunay->FindTriangle( topUV, topTria,
5421 tbTrias.myTopBC, tbTrias.myTopTriaNodes );
5423 tbTrias.SetTopByBottom();
5425 myTopBotTriangles[ colID ] = tbTrias;
5428 if ( myBotDelaunay->NbVisitedNodes() < nbInternalNodes )
5431 myBotDelaunay.reset();
5432 myTopDelaunay.reset();
5433 myNodeID2ColID.Clear();
5438 //================================================================================
5440 * \brief Initialize fields
5442 //================================================================================
5444 StdMeshers_Sweeper::TopBotTriangles::TopBotTriangles()
5446 myBotBC[0] = myBotBC[1] = myBotBC[2] = myTopBC[0] = myTopBC[1] = myTopBC[2] = 0.;
5447 myBotTriaNodes[0] = myBotTriaNodes[1] = myBotTriaNodes[2] = 0;
5448 myTopTriaNodes[0] = myTopTriaNodes[1] = myTopTriaNodes[2] = 0;
5451 //================================================================================
5453 * \brief Set top data equal to bottom data
5455 //================================================================================
5457 void StdMeshers_Sweeper::TopBotTriangles::SetTopByBottom()
5459 for ( int i = 0; i < 3; ++i )
5461 myTopBC[i] = myBotBC[i];
5462 myTopTriaNodes[i] = myBotTriaNodes[0];