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>
55 #include <TopExp_Explorer.hxx>
56 #include <TopTools_ListIteratorOfListOfShape.hxx>
57 #include <TopTools_ListOfShape.hxx>
58 #include <TopTools_MapOfShape.hxx>
59 #include <TopTools_SequenceOfShape.hxx>
69 #define RETURN_BAD_RESULT(msg) { MESSAGE(")-: Error: " << msg); return false; }
70 #define gpXYZ(n) SMESH_TNodeXYZ(n)
73 #define DBGOUT(msg) //cout << msg << endl;
74 #define SHOWYXZ(msg, xyz) \
75 //{ gp_Pnt p (xyz); cout << msg << " ("<< p.X() << "; " <<p.Y() << "; " <<p.Z() << ") " <<endl; }
78 #define SHOWYXZ(msg, xyz)
81 namespace NSProjUtils = StdMeshers_ProjectionUtils;
83 typedef SMESH_Comment TCom;
85 enum { ID_BOT_FACE = SMESH_Block::ID_Fxy0,
86 ID_TOP_FACE = SMESH_Block::ID_Fxy1,
87 BOTTOM_EDGE = 0, TOP_EDGE, V0_EDGE, V1_EDGE, // edge IDs in face
88 NB_WALL_FACES = 4 }; //
92 //=======================================================================
94 * \brief Quadrangle algorithm
96 struct TQuadrangleAlgo : public StdMeshers_Quadrangle_2D
98 TQuadrangleAlgo(int studyId, SMESH_Gen* gen)
99 : StdMeshers_Quadrangle_2D( gen->GetANewId(), studyId, gen)
102 static StdMeshers_Quadrangle_2D* instance( SMESH_Algo* fatherAlgo,
103 SMESH_MesherHelper* helper=0)
105 static TQuadrangleAlgo* algo = new TQuadrangleAlgo( fatherAlgo->GetStudyId(),
106 fatherAlgo->GetGen() );
109 algo->myProxyMesh->GetMesh() != helper->GetMesh() )
110 algo->myProxyMesh.reset( new SMESH_ProxyMesh( *helper->GetMesh() ));
112 algo->myQuadList.clear();
115 algo->_quadraticMesh = helper->GetIsQuadratic();
120 //=======================================================================
122 * \brief Algorithm projecting 1D mesh
124 struct TProjction1dAlgo : public StdMeshers_Projection_1D
126 StdMeshers_ProjectionSource1D myHyp;
128 TProjction1dAlgo(int studyId, SMESH_Gen* gen)
129 : StdMeshers_Projection_1D( gen->GetANewId(), studyId, gen),
130 myHyp( gen->GetANewId(), studyId, gen)
132 StdMeshers_Projection_1D::_sourceHypo = & myHyp;
134 static TProjction1dAlgo* instance( SMESH_Algo* fatherAlgo )
136 static TProjction1dAlgo* algo = new TProjction1dAlgo( fatherAlgo->GetStudyId(),
137 fatherAlgo->GetGen() );
141 //=======================================================================
143 * \brief Algorithm projecting 2D mesh
145 struct TProjction2dAlgo : public StdMeshers_Projection_1D2D
147 StdMeshers_ProjectionSource2D myHyp;
149 TProjction2dAlgo(int studyId, SMESH_Gen* gen)
150 : StdMeshers_Projection_1D2D( gen->GetANewId(), studyId, gen),
151 myHyp( gen->GetANewId(), studyId, gen)
153 StdMeshers_Projection_2D::_sourceHypo = & myHyp;
155 static TProjction2dAlgo* instance( SMESH_Algo* fatherAlgo )
157 static TProjction2dAlgo* algo = new TProjction2dAlgo( fatherAlgo->GetStudyId(),
158 fatherAlgo->GetGen() );
161 const NSProjUtils::TNodeNodeMap& GetNodesMap()
163 return _src2tgtNodes;
165 void SetEventListener( SMESH_subMesh* tgtSubMesh )
167 NSProjUtils::SetEventListener( tgtSubMesh,
168 _sourceHypo->GetSourceFace(),
169 _sourceHypo->GetSourceMesh() );
172 //=======================================================================
174 * \brief Returns already computed EDGEs
176 void getPrecomputedEdges( SMESH_MesherHelper& theHelper,
177 const TopoDS_Shape& theShape,
178 vector< TopoDS_Edge >& theEdges)
182 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
185 TopTools_IndexedMapOfShape edges;
186 TopExp::MapShapes( theShape, TopAbs_EDGE, edges );
187 for ( int iE = 1; iE <= edges.Extent(); ++iE )
189 const TopoDS_Shape edge = edges( iE );
190 if (( ! ( sm = meshDS->MeshElements( edge ))) ||
191 ( sm->NbElements() == 0 ))
194 // there must not be FACEs meshed with triangles and sharing a computed EDGE
195 // as the precomputed EDGEs are used for propagation other to 'vertical' EDGEs
196 bool faceFound = false;
197 PShapeIteratorPtr faceIt =
198 theHelper.GetAncestors( edge, *theHelper.GetMesh(), TopAbs_FACE );
199 while ( const TopoDS_Shape* face = faceIt->next() )
201 if (( sm = meshDS->MeshElements( *face )) &&
202 ( sm->NbElements() > 0 ) &&
203 ( !theHelper.IsSameElemGeometry( sm, SMDSGeom_QUADRANGLE ) ))
209 theEdges.push_back( TopoDS::Edge( edge ));
213 //================================================================================
215 * \brief Make \a botE be the BOTTOM_SIDE of \a quad.
216 * Return false if the BOTTOM_SIDE is composite
218 //================================================================================
220 bool setBottomEdge( const TopoDS_Edge& botE,
221 FaceQuadStruct::Ptr& quad,
222 const TopoDS_Shape& face)
224 quad->side[ QUAD_TOP_SIDE ].grid->Reverse();
225 quad->side[ QUAD_LEFT_SIDE ].grid->Reverse();
227 bool isComposite = false;
228 for ( size_t i = 0; i < quad->side.size(); ++i )
230 StdMeshers_FaceSidePtr quadSide = quad->side[i];
231 for ( int iE = 0; iE < quadSide->NbEdges(); ++iE )
232 if ( botE.IsSame( quadSide->Edge( iE )))
234 if ( quadSide->NbEdges() > 1 )
235 isComposite = true; //return false;
237 i = quad->side.size(); // to quit from the outer loop
241 if ( edgeIndex != QUAD_BOTTOM_SIDE )
242 quad->shift( quad->side.size() - edgeIndex, /*keepUnitOri=*/false );
244 quad->face = TopoDS::Face( face );
249 //================================================================================
251 * \brief Return iterator pointing to node column for the given parameter
252 * \param columnsMap - node column map
253 * \param parameter - parameter
254 * \retval TParam2ColumnMap::iterator - result
256 * it returns closest left column
258 //================================================================================
260 TParam2ColumnIt getColumn( const TParam2ColumnMap* columnsMap,
261 const double parameter )
263 TParam2ColumnIt u_col = columnsMap->upper_bound( parameter );
264 if ( u_col != columnsMap->begin() )
266 return u_col; // return left column
269 //================================================================================
271 * \brief Return nodes around given parameter and a ratio
272 * \param column - node column
273 * \param param - parameter
274 * \param node1 - lower node
275 * \param node2 - upper node
276 * \retval double - ratio
278 //================================================================================
280 double getRAndNodes( const TNodeColumn* column,
282 const SMDS_MeshNode* & node1,
283 const SMDS_MeshNode* & node2)
285 if ( param >= 1.0 || column->size() == 1) {
286 node1 = node2 = column->back();
290 int i = int( param * ( column->size() - 1 ));
291 double u0 = double( i )/ double( column->size() - 1 );
292 double r = ( param - u0 ) * ( column->size() - 1 );
294 node1 = (*column)[ i ];
295 node2 = (*column)[ i + 1];
299 //================================================================================
301 * \brief Compute boundary parameters of face parts
302 * \param nbParts - nb of parts to split columns into
303 * \param columnsMap - node columns of the face to split
304 * \param params - computed parameters
306 //================================================================================
308 void splitParams( const int nbParts,
309 const TParam2ColumnMap* columnsMap,
310 vector< double > & params)
313 params.reserve( nbParts + 1 );
314 TParam2ColumnIt last_par_col = --columnsMap->end();
315 double par = columnsMap->begin()->first; // 0.
316 double parLast = last_par_col->first;
317 params.push_back( par );
318 for ( int i = 0; i < nbParts - 1; ++ i )
320 double partSize = ( parLast - par ) / double ( nbParts - i );
321 TParam2ColumnIt par_col = getColumn( columnsMap, par + partSize );
322 if ( par_col->first == par ) {
324 if ( par_col == last_par_col ) {
325 while ( i < nbParts - 1 )
326 params.push_back( par + partSize * i++ );
330 par = par_col->first;
331 params.push_back( par );
333 params.push_back( parLast ); // 1.
336 //================================================================================
338 * \brief Return coordinate system for z-th layer of nodes
340 //================================================================================
342 gp_Ax2 getLayerCoordSys(const int z,
343 const vector< const TNodeColumn* >& columns,
346 // gravity center of a layer
349 for ( size_t i = 0; i < columns.size(); ++i )
351 O += gpXYZ( (*columns[ i ])[ z ]);
352 if ( vertexCol < 0 &&
353 columns[ i ]->front()->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
360 int iPrev = columns.size()-1;
361 for ( size_t i = 0; i < columns.size(); ++i )
363 gp_Vec v1( O, gpXYZ( (*columns[ iPrev ])[ z ]));
364 gp_Vec v2( O, gpXYZ( (*columns[ i ] )[ z ]));
369 if ( vertexCol >= 0 )
371 O = gpXYZ( (*columns[ vertexCol ])[ z ]);
373 if ( xColumn < 0 || xColumn >= (int) columns.size() )
375 // select a column for X dir
377 for ( size_t i = 0; i < columns.size(); ++i )
379 double dist = ( O - gpXYZ((*columns[ i ])[ z ])).SquareModulus();
380 if ( dist > maxDist )
389 gp_Vec X( O, gpXYZ( (*columns[ xColumn ])[ z ]));
391 return gp_Ax2( O, Z, X);
394 //================================================================================
396 * \brief Removes submeshes that are or can be meshed with regular grid from given list
397 * \retval int - nb of removed submeshes
399 //================================================================================
401 int removeQuasiQuads(list< SMESH_subMesh* >& notQuadSubMesh,
402 SMESH_MesherHelper* helper,
403 StdMeshers_Quadrangle_2D* quadAlgo)
406 //SMESHDS_Mesh* mesh = notQuadSubMesh.front()->GetFather()->GetMeshDS();
407 list< SMESH_subMesh* >::iterator smIt = notQuadSubMesh.begin();
408 while ( smIt != notQuadSubMesh.end() )
410 SMESH_subMesh* faceSm = *smIt;
411 SMESHDS_SubMesh* faceSmDS = faceSm->GetSubMeshDS();
412 int nbQuads = faceSmDS ? faceSmDS->NbElements() : 0;
415 toRemove = helper->IsStructured( faceSm );
417 toRemove = ( quadAlgo->CheckNbEdges( *helper->GetMesh(),
418 faceSm->GetSubShape() ) != NULL );
419 nbRemoved += toRemove;
421 smIt = notQuadSubMesh.erase( smIt );
429 //================================================================================
431 * \brief Return and angle between two EDGEs
432 * \return double - the angle normalized so that
439 //================================================================================
441 // double normAngle(const TopoDS_Edge & E1, const TopoDS_Edge & E2, const TopoDS_Face & F)
443 // return SMESH_MesherHelper::GetAngle( E1, E2, F ) / ( 0.5 * M_PI );
446 //================================================================================
448 * Consider continuous straight EDGES as one side - mark them to unite
450 //================================================================================
452 int countNbSides( const Prism_3D::TPrismTopo & thePrism,
453 vector<int> & nbUnitePerEdge,
454 vector< double > & edgeLength)
456 int nbEdges = thePrism.myNbEdgesInWires.front(); // nb outer edges
457 int nbSides = nbEdges;
460 list< TopoDS_Edge >::const_iterator edgeIt = thePrism.myBottomEdges.begin();
461 std::advance( edgeIt, nbEdges-1 );
462 TopoDS_Edge prevE = *edgeIt;
463 // bool isPrevStraight = SMESH_Algo::IsStraight( prevE );
464 // int iPrev = nbEdges - 1;
466 // int iUnite = -1; // the first of united EDGEs
468 // analyse angles between EDGEs
470 vector< bool > isCorner( nbEdges );
471 edgeIt = thePrism.myBottomEdges.begin();
472 for ( int iE = 0; iE < nbEdges; ++iE, ++edgeIt )
474 const TopoDS_Edge& curE = *edgeIt;
475 edgeLength[ iE ] = SMESH_Algo::EdgeLength( curE );
477 // double normAngle = normAngle( prevE, curE, thePrism.myBottom );
478 // isCorner[ iE ] = false;
479 // if ( normAngle < 2.0 )
481 // if ( normAngle < 0.001 ) // straight or obtuse angle
483 // // unite EDGEs in order not to put a corner of the unit quadrangle at this VERTEX
486 // nbUnitePerEdge[ iUnite ]++;
487 // nbUnitePerEdge[ iE ] = -1;
492 // isCorner[ iE ] = true;
502 // define which of corners to put on a side of the unit quadrangle
504 // edgeIt = thePrism.myBottomEdges.begin();
505 // for ( int iE = 0; iE < nbEdges; ++iE, ++edgeIt )
507 // const TopoDS_Edge& curE = *edgeIt;
508 // edgeLength[ iE ] = SMESH_Algo::EdgeLength( curE );
510 // const bool isCurStraight = SMESH_Algo::IsStraight( curE );
511 // if ( isPrevStraight && isCurStraight && SMESH_Algo::IsContinuous( prevE, curE ))
515 // nbUnitePerEdge[ iUnite ]++;
516 // nbUnitePerEdge[ iE ] = -1;
524 // isPrevStraight = isCurStraight;
531 void pointsToPython(const std::vector<gp_XYZ>& p)
534 for ( size_t i = SMESH_Block::ID_V000; i < p.size(); ++i )
536 cout << "mesh.AddNode( " << p[i].X() << ", "<< p[i].Y() << ", "<< p[i].Z() << ") # " << i <<" " ;
537 SMESH_Block::DumpShapeID( i, cout ) << endl;
543 //=======================================================================
544 //function : StdMeshers_Prism_3D
546 //=======================================================================
548 StdMeshers_Prism_3D::StdMeshers_Prism_3D(int hypId, int studyId, SMESH_Gen* gen)
549 :SMESH_3D_Algo(hypId, studyId, gen)
552 _shapeType = (1 << TopAbs_SOLID); // 1 bit per shape type
553 _onlyUnaryInput = false; // mesh all SOLIDs at once
554 _requireDiscreteBoundary = false; // mesh FACEs and EDGEs by myself
555 _supportSubmeshes = true; // "source" FACE must be meshed by other algo
556 _neededLowerHyps[ 1 ] = true; // suppress warning on hiding a global 1D algo
557 _neededLowerHyps[ 2 ] = true; // suppress warning on hiding a global 2D algo
559 //myProjectTriangles = false;
560 mySetErrorToSM = true; // to pass an error to a sub-mesh of a current solid or not
563 //================================================================================
567 //================================================================================
569 StdMeshers_Prism_3D::~StdMeshers_Prism_3D()
571 pointsToPython( std::vector<gp_XYZ>() ); // avoid warning: pointsToPython defined but not used
574 //=======================================================================
575 //function : CheckHypothesis
577 //=======================================================================
579 bool StdMeshers_Prism_3D::CheckHypothesis(SMESH_Mesh& aMesh,
580 const TopoDS_Shape& aShape,
581 SMESH_Hypothesis::Hypothesis_Status& aStatus)
583 // Check shape geometry
585 aStatus = SMESH_Hypothesis::HYP_BAD_GEOMETRY;
587 // find not quadrangle faces
588 list< TopoDS_Shape > notQuadFaces;
589 int nbEdge, nbWire, nbFace = 0;
590 TopExp_Explorer exp( aShape, TopAbs_FACE );
591 for ( ; exp.More(); exp.Next() ) {
593 const TopoDS_Shape& face = exp.Current();
594 nbEdge = NSProjUtils::Count( face, TopAbs_EDGE, 0 );
595 nbWire = NSProjUtils::Count( face, TopAbs_WIRE, 0 );
596 if ( nbEdge!= 4 || nbWire!= 1 ) {
597 if ( !notQuadFaces.empty() ) {
598 if ( NSProjUtils::Count( notQuadFaces.back(), TopAbs_EDGE, 0 ) != nbEdge ||
599 NSProjUtils::Count( notQuadFaces.back(), TopAbs_WIRE, 0 ) != nbWire )
600 RETURN_BAD_RESULT("Different not quad faces");
602 notQuadFaces.push_back( face );
605 if ( !notQuadFaces.empty() )
607 if ( notQuadFaces.size() != 2 )
608 RETURN_BAD_RESULT("Bad nb not quad faces: " << notQuadFaces.size());
610 // check total nb faces
611 nbEdge = NSProjUtils::Count( notQuadFaces.back(), TopAbs_EDGE, 0 );
612 if ( nbFace != nbEdge + 2 )
613 RETURN_BAD_RESULT("Bad nb of faces: " << nbFace << " but must be " << nbEdge + 2);
617 aStatus = SMESH_Hypothesis::HYP_OK;
621 //=======================================================================
623 //purpose : Compute mesh on a COMPOUND of SOLIDs
624 //=======================================================================
626 bool StdMeshers_Prism_3D::Compute(SMESH_Mesh& theMesh, const TopoDS_Shape& theShape)
628 SMESH_MesherHelper helper( theMesh );
631 int nbSolids = helper.Count( theShape, TopAbs_SOLID, /*skipSame=*/false );
635 TopTools_IndexedDataMapOfShapeListOfShape faceToSolids;
636 TopExp::MapShapesAndAncestors( theShape, TopAbs_FACE, TopAbs_SOLID, faceToSolids );
638 // look for meshed FACEs ("source" FACEs) that must be prism bottoms
639 list< TopoDS_Face > meshedFaces, notQuadMeshedFaces, notQuadFaces;
640 const bool meshHasQuads = ( theMesh.NbQuadrangles() > 0 );
641 //StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this );
642 for ( int iF = 1; iF <= faceToSolids.Extent(); ++iF )
644 const TopoDS_Face& face = TopoDS::Face( faceToSolids.FindKey( iF ));
645 SMESH_subMesh* faceSM = theMesh.GetSubMesh( face );
646 if ( !faceSM->IsEmpty() )
648 if ( !meshHasQuads ||
649 !helper.IsSameElemGeometry( faceSM->GetSubMeshDS(), SMDSGeom_QUADRANGLE ) ||
650 !helper.IsStructured( faceSM )
652 notQuadMeshedFaces.push_front( face );
653 else if ( myHelper->Count( face, TopAbs_EDGE, /*ignoreSame=*/false ) != 4 )
654 meshedFaces.push_front( face );
656 meshedFaces.push_back( face );
658 // not add not quadrilateral FACE as we can't compute it
659 // else if ( !quadAlgo->CheckNbEdges( theMesh, face ))
660 // // not add not quadrilateral FACE as it can be a prism side
661 // // else if ( myHelper->Count( face, TopAbs_EDGE, /*ignoreSame=*/false ) != 4 )
663 // notQuadFaces.push_back( face );
666 // notQuadFaces are of medium priority, put them before ordinary meshed faces
667 meshedFaces.splice( meshedFaces.begin(), notQuadFaces );
668 // notQuadMeshedFaces are of highest priority, put them before notQuadFaces
669 meshedFaces.splice( meshedFaces.begin(), notQuadMeshedFaces );
671 Prism_3D::TPrismTopo prism;
673 bool selectBottom = meshedFaces.empty();
677 TopoDS_Shape solid = TopExp_Explorer( theShape, TopAbs_SOLID ).Current();
678 if ( !meshedFaces.empty() )
679 prism.myBottom = meshedFaces.front();
680 return ( initPrism( prism, solid, selectBottom ) &&
684 // find propagation chains from already computed EDGEs
685 vector< TopoDS_Edge > computedEdges;
686 getPrecomputedEdges( helper, theShape, computedEdges );
687 myPropagChains = new TopTools_IndexedMapOfShape[ computedEdges.size() + 1 ];
688 SMESHUtils::ArrayDeleter< TopTools_IndexedMapOfShape > pcDel( myPropagChains );
689 for ( size_t i = 0, nb = 0; i < computedEdges.size(); ++i )
691 StdMeshers_ProjectionUtils::GetPropagationEdge( &theMesh, TopoDS_Edge(),
692 computedEdges[i], myPropagChains + nb );
693 if ( myPropagChains[ nb ].Extent() < 2 ) // an empty map is a termination sign
694 myPropagChains[ nb ].Clear();
699 TopTools_MapOfShape meshedSolids;
700 list< Prism_3D::TPrismTopo > meshedPrism;
701 list< TopoDS_Face > suspectSourceFaces;
702 TopTools_ListIteratorOfListOfShape solidIt;
704 while ( meshedSolids.Extent() < nbSolids )
706 if ( _computeCanceled )
707 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
709 // compute prisms having avident computed source FACE
710 while ( !meshedFaces.empty() )
712 TopoDS_Face face = meshedFaces.front();
713 meshedFaces.pop_front();
714 TopTools_ListOfShape& solidList = faceToSolids.ChangeFromKey( face );
715 while ( !solidList.IsEmpty() )
717 TopoDS_Shape solid = solidList.First();
718 solidList.RemoveFirst();
719 if ( meshedSolids.Add( solid ))
722 prism.myBottom = face;
723 if ( !initPrism( prism, solid, selectBottom ) ||
727 SMESHDS_SubMesh* smDS = theMesh.GetMeshDS()->MeshElements( prism.myTop );
728 if ( !myHelper->IsSameElemGeometry( smDS, SMDSGeom_QUADRANGLE ))
730 meshedFaces.push_front( prism.myTop );
734 suspectSourceFaces.push_back( prism.myTop );
736 meshedPrism.push_back( prism );
740 if ( meshedSolids.Extent() == nbSolids )
743 // below in the loop we try to find source FACEs somehow
745 // project mesh from source FACEs of computed prisms to
746 // prisms sharing wall FACEs
747 list< Prism_3D::TPrismTopo >::iterator prismIt = meshedPrism.begin();
748 for ( ; prismIt != meshedPrism.end(); ++prismIt )
750 for ( size_t iW = 0; iW < prismIt->myWallQuads.size(); ++iW )
752 Prism_3D::TQuadList::iterator wQuad = prismIt->myWallQuads[iW].begin();
753 for ( ; wQuad != prismIt->myWallQuads[iW].end(); ++ wQuad )
755 const TopoDS_Face& wFace = (*wQuad)->face;
756 TopTools_ListOfShape& solidList = faceToSolids.ChangeFromKey( wFace );
757 solidIt.Initialize( solidList );
758 while ( solidIt.More() )
760 const TopoDS_Shape& solid = solidIt.Value();
761 if ( meshedSolids.Contains( solid )) {
762 solidList.Remove( solidIt );
763 continue; // already computed prism
765 if ( myHelper->IsBlock( solid )) {
767 continue; // too trivial
769 // find a source FACE of the SOLID: it's a FACE sharing a bottom EDGE with wFace
770 const TopoDS_Edge& wEdge = (*wQuad)->side[ QUAD_TOP_SIDE ].grid->Edge(0);
771 PShapeIteratorPtr faceIt = myHelper->GetAncestors( wEdge, *myHelper->GetMesh(),
773 while ( const TopoDS_Shape* f = faceIt->next() )
775 const TopoDS_Face& candidateF = TopoDS::Face( *f );
776 if ( candidateF.IsSame( wFace )) continue;
777 // select a source FACE: prismIt->myBottom or prismIt->myTop
778 TopoDS_Face sourceF = prismIt->myBottom;
779 for ( TopExp_Explorer v( prismIt->myTop, TopAbs_VERTEX ); v.More(); v.Next() )
780 if ( myHelper->IsSubShape( v.Current(), candidateF )) {
781 sourceF = prismIt->myTop;
785 prism.myBottom = candidateF;
786 mySetErrorToSM = false;
787 if ( !myHelper->IsSubShape( candidateF, prismIt->myShape3D ) &&
788 myHelper ->IsSubShape( candidateF, solid ) &&
789 !myHelper->GetMesh()->GetSubMesh( candidateF )->IsMeshComputed() &&
790 initPrism( prism, solid, /*selectBottom=*/false ) &&
791 !myHelper->GetMesh()->GetSubMesh( prism.myTop )->IsMeshComputed() &&
792 !myHelper->GetMesh()->GetSubMesh( prism.myBottom )->IsMeshComputed() &&
793 project2dMesh( sourceF, prism.myBottom ))
795 mySetErrorToSM = true;
796 if ( !compute( prism ))
798 SMESHDS_SubMesh* smDS = theMesh.GetMeshDS()->MeshElements( prism.myTop );
799 if ( !myHelper->IsSameElemGeometry( smDS, SMDSGeom_QUADRANGLE ))
801 meshedFaces.push_front( prism.myTop );
802 meshedFaces.push_front( prism.myBottom );
803 selectBottom = false;
805 meshedPrism.push_back( prism );
806 meshedSolids.Add( solid );
810 mySetErrorToSM = true;
812 if ( meshedSolids.Contains( solid ))
813 solidList.Remove( solidIt );
819 if ( !meshedFaces.empty() )
820 break; // to compute prisms with avident sources
823 if ( meshedFaces.empty() )
825 meshedFaces.splice( meshedFaces.end(), suspectSourceFaces );
829 // find FACEs with local 1D hyps, which has to be computed by now,
830 // or at least any computed FACEs
831 if ( meshedFaces.empty() )
834 for ( int iF = 1; iF <= faceToSolids.Extent(); ++iF )
836 const TopoDS_Face& face = TopoDS::Face( faceToSolids.FindKey( iF ));
837 const TopTools_ListOfShape& solidList = faceToSolids.FindFromKey( face );
838 if ( solidList.IsEmpty() ) continue;
839 SMESH_subMesh* faceSM = theMesh.GetSubMesh( face );
840 if ( !faceSM->IsEmpty() )
842 int nbFaces = faceSM->GetSubMeshDS()->NbElements();
843 if ( prevNbFaces < nbFaces )
845 if ( !meshedFaces.empty() ) meshedFaces.pop_back();
846 meshedFaces.push_back( face ); // lower priority
848 prevNbFaces = nbFaces;
853 bool allSubMeComputed = true;
854 SMESH_subMeshIteratorPtr smIt = faceSM->getDependsOnIterator(false,true);
855 while ( smIt->more() && allSubMeComputed )
856 allSubMeComputed = smIt->next()->IsMeshComputed();
857 if ( allSubMeComputed )
859 faceSM->ComputeStateEngine( SMESH_subMesh::COMPUTE );
860 if ( !faceSM->IsEmpty() ) {
861 meshedFaces.push_front( face ); // higher priority
866 faceSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
874 // TODO. there are other ways to find out the source FACE:
875 // propagation, topological similarity, ect.
877 // simply try to mesh all not meshed SOLIDs
878 if ( meshedFaces.empty() )
880 for ( TopExp_Explorer solid( theShape, TopAbs_SOLID ); solid.More(); solid.Next() )
882 mySetErrorToSM = false;
884 if ( !meshedSolids.Contains( solid.Current() ) &&
885 initPrism( prism, solid.Current() ))
887 mySetErrorToSM = true;
888 if ( !compute( prism ))
890 meshedFaces.push_front( prism.myTop );
891 meshedFaces.push_front( prism.myBottom );
892 meshedPrism.push_back( prism );
893 meshedSolids.Add( solid.Current() );
896 mySetErrorToSM = true;
900 if ( meshedFaces.empty() ) // set same error to 10 not-computed solids
902 SMESH_ComputeErrorPtr err = SMESH_ComputeError::New
903 ( COMPERR_BAD_INPUT_MESH, "No meshed source face found", this );
905 const int maxNbErrors = 10; // limit nb errors not to overload the Compute dialog
906 TopExp_Explorer solid( theShape, TopAbs_SOLID );
907 for ( int i = 0; ( i < maxNbErrors && solid.More() ); ++i, solid.Next() )
908 if ( !meshedSolids.Contains( solid.Current() ))
910 SMESH_subMesh* sm = theMesh.GetSubMesh( solid.Current() );
911 sm->GetComputeError() = err;
916 return error( COMPERR_OK );
919 //================================================================================
921 * \brief Find wall faces by bottom edges
923 //================================================================================
925 bool StdMeshers_Prism_3D::getWallFaces( Prism_3D::TPrismTopo & thePrism,
926 const int totalNbFaces)
928 thePrism.myWallQuads.clear();
930 SMESH_Mesh* mesh = myHelper->GetMesh();
932 StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this, myHelper );
934 TopTools_MapOfShape faceMap;
935 TopTools_IndexedDataMapOfShapeListOfShape edgeToFaces;
936 TopExp::MapShapesAndAncestors( thePrism.myShape3D,
937 TopAbs_EDGE, TopAbs_FACE, edgeToFaces );
939 // ------------------------------
940 // Get the 1st row of wall FACEs
941 // ------------------------------
943 list< TopoDS_Edge >::iterator edge = thePrism.myBottomEdges.begin();
944 std::list< int >::iterator nbE = thePrism.myNbEdgesInWires.begin();
945 std::list< int > nbQuadsPerWire;
947 while ( edge != thePrism.myBottomEdges.end() )
950 if ( SMESH_Algo::isDegenerated( *edge ))
952 edge = thePrism.myBottomEdges.erase( edge );
958 bool hasWallFace = false;
959 TopTools_ListIteratorOfListOfShape faceIt( edgeToFaces.FindFromKey( *edge ));
960 for ( ; faceIt.More(); faceIt.Next() )
962 const TopoDS_Face& face = TopoDS::Face( faceIt.Value() );
963 if ( !thePrism.myBottom.IsSame( face ))
966 Prism_3D::TQuadList quadList( 1, quadAlgo->CheckNbEdges( *mesh, face ));
967 if ( !quadList.back() )
968 return toSM( error(TCom("Side face #") << shapeID( face )
969 << " not meshable with quadrangles"));
970 bool isCompositeBase = ! setBottomEdge( *edge, quadList.back(), face );
971 if ( isCompositeBase )
973 // it's OK if all EDGEs of the bottom side belongs to the bottom FACE
974 StdMeshers_FaceSidePtr botSide = quadList.back()->side[ QUAD_BOTTOM_SIDE ];
975 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
976 if ( !myHelper->IsSubShape( botSide->Edge(iE), thePrism.myBottom ))
977 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
979 if ( faceMap.Add( face ))
980 thePrism.myWallQuads.push_back( quadList );
988 else // seam edge (IPAL53561)
990 edge = thePrism.myBottomEdges.erase( edge );
999 int nbQuadPrev = std::accumulate( nbQuadsPerWire.begin(), nbQuadsPerWire.end(), 0 );
1000 nbQuadsPerWire.push_back( thePrism.myWallQuads.size() - nbQuadPrev );
1004 // -------------------------
1005 // Find the rest wall FACEs
1006 // -------------------------
1008 // Compose a vector of indixes of right neighbour FACE for each wall FACE
1009 // that is not so evident in case of several WIREs in the bottom FACE
1010 thePrism.myRightQuadIndex.clear();
1011 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1013 thePrism.myRightQuadIndex.push_back( i+1 ); // OK for all but the last EDGE of a WIRE
1015 list< int >::iterator nbQinW = nbQuadsPerWire.begin();
1016 for ( int iLeft = 0; nbQinW != nbQuadsPerWire.end(); ++nbQinW )
1018 thePrism.myRightQuadIndex[ iLeft + *nbQinW - 1 ] = iLeft; // for the last EDGE of a WIRE
1022 while ( totalNbFaces - faceMap.Extent() > 2 )
1024 // find wall FACEs adjacent to each of wallQuads by the right side EDGE
1027 nbKnownFaces = faceMap.Extent();
1028 StdMeshers_FaceSidePtr rightSide, topSide; // sides of the quad
1029 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1031 rightSide = thePrism.myWallQuads[i].back()->side[ QUAD_RIGHT_SIDE ];
1032 for ( int iE = 0; iE < rightSide->NbEdges(); ++iE ) // rightSide can be composite
1034 const TopoDS_Edge & rightE = rightSide->Edge( iE );
1035 TopTools_ListIteratorOfListOfShape face( edgeToFaces.FindFromKey( rightE ));
1036 for ( ; face.More(); face.Next() )
1037 if ( faceMap.Add( face.Value() ))
1039 // a new wall FACE encountered, store it in thePrism.myWallQuads
1040 const int iRight = thePrism.myRightQuadIndex[i];
1041 topSide = thePrism.myWallQuads[ iRight ].back()->side[ QUAD_TOP_SIDE ];
1042 const TopoDS_Edge& newBotE = topSide->Edge(0);
1043 const TopoDS_Shape& newWallF = face.Value();
1044 thePrism.myWallQuads[ iRight ].push_back( quadAlgo->CheckNbEdges( *mesh, newWallF ));
1045 if ( !thePrism.myWallQuads[ iRight ].back() )
1046 return toSM( error(TCom("Side face #") << shapeID( newWallF ) <<
1047 " not meshable with quadrangles"));
1048 if ( ! setBottomEdge( newBotE, thePrism.myWallQuads[ iRight ].back(), newWallF ))
1049 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1053 } while ( nbKnownFaces != faceMap.Extent() );
1055 // find wall FACEs adjacent to each of thePrism.myWallQuads by the top side EDGE
1056 if ( totalNbFaces - faceMap.Extent() > 2 )
1058 const int nbFoundWalls = faceMap.Extent();
1059 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1061 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1062 const TopoDS_Edge & topE = topSide->Edge( 0 );
1063 if ( topSide->NbEdges() > 1 )
1064 return toSM( error(COMPERR_BAD_SHAPE, TCom("Side face #") <<
1065 shapeID( thePrism.myWallQuads[i].back()->face )
1066 << " has a composite top edge"));
1067 TopTools_ListIteratorOfListOfShape faceIt( edgeToFaces.FindFromKey( topE ));
1068 for ( ; faceIt.More(); faceIt.Next() )
1069 if ( faceMap.Add( faceIt.Value() ))
1071 // a new wall FACE encountered, store it in wallQuads
1072 thePrism.myWallQuads[ i ].push_back( quadAlgo->CheckNbEdges( *mesh, faceIt.Value() ));
1073 if ( !thePrism.myWallQuads[ i ].back() )
1074 return toSM( error(TCom("Side face #") << shapeID( faceIt.Value() ) <<
1075 " not meshable with quadrangles"));
1076 if ( ! setBottomEdge( topE, thePrism.myWallQuads[ i ].back(), faceIt.Value() ))
1077 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1078 if ( totalNbFaces - faceMap.Extent() == 2 )
1080 i = thePrism.myWallQuads.size(); // to quit from the outer loop
1085 if ( nbFoundWalls == faceMap.Extent() )
1086 return toSM( error("Failed to find wall faces"));
1089 } // while ( totalNbFaces - faceMap.Extent() > 2 )
1091 // ------------------
1092 // Find the top FACE
1093 // ------------------
1095 if ( thePrism.myTop.IsNull() )
1097 // now only top and bottom FACEs are not in the faceMap
1098 faceMap.Add( thePrism.myBottom );
1099 for ( TopExp_Explorer f( thePrism.myShape3D, TopAbs_FACE ); f.More(); f.Next() )
1100 if ( !faceMap.Contains( f.Current() )) {
1101 thePrism.myTop = TopoDS::Face( f.Current() );
1104 if ( thePrism.myTop.IsNull() )
1105 return toSM( error("Top face not found"));
1108 // Check that the top FACE shares all the top EDGEs
1109 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1111 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1112 const TopoDS_Edge & topE = topSide->Edge( 0 );
1113 if ( !myHelper->IsSubShape( topE, thePrism.myTop ))
1114 return toSM( error( TCom("Wrong source face: #") << shapeID( thePrism.myBottom )));
1120 //=======================================================================
1121 //function : compute
1122 //purpose : Compute mesh on a SOLID
1123 //=======================================================================
1125 bool StdMeshers_Prism_3D::compute(const Prism_3D::TPrismTopo& thePrism)
1127 myHelper->IsQuadraticSubMesh( thePrism.myShape3D );
1128 if ( _computeCanceled )
1129 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
1131 // Assure the bottom is meshed
1132 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
1133 if (( botSM->IsEmpty() ) &&
1134 ( ! botSM->GetAlgo() ||
1135 ! _gen->Compute( *botSM->GetFather(), botSM->GetSubShape(), /*shapeOnly=*/true )))
1136 return error( COMPERR_BAD_INPUT_MESH,
1137 TCom( "No mesher defined to compute the base face #")
1138 << shapeID( thePrism.myBottom ));
1140 // Make all side FACEs of thePrism meshed with quads
1141 if ( !computeWalls( thePrism ))
1144 // Analyse mesh and geometry to find all block sub-shapes and submeshes
1145 // (after fixing IPAL52499 myBlock is used as a holder of boundary nodes
1146 // and for 2D projection in hard cases where StdMeshers_Projection_2D fails;
1147 // location of internal nodes is usually computed by StdMeshers_Sweeper)
1148 if ( !myBlock.Init( myHelper, thePrism ))
1149 return toSM( error( myBlock.GetError()));
1151 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1153 int volumeID = meshDS->ShapeToIndex( thePrism.myShape3D );
1155 // Try to get gp_Trsf to get all nodes from bottom ones
1156 vector<gp_Trsf> trsf;
1157 gp_Trsf bottomToTopTrsf;
1158 // if ( !myBlock.GetLayersTransformation( trsf, thePrism ))
1160 // else if ( !trsf.empty() )
1161 // bottomToTopTrsf = trsf.back();
1163 // To compute coordinates of a node inside a block, it is necessary to know
1164 // 1. normalized parameters of the node by which
1165 // 2. coordinates of node projections on all block sub-shapes are computed
1167 // So we fill projections on vertices at once as they are same for all nodes
1168 myShapeXYZ.resize( myBlock.NbSubShapes() );
1169 for ( int iV = SMESH_Block::ID_FirstV; iV < SMESH_Block::ID_FirstE; ++iV ) {
1170 myBlock.VertexPoint( iV, myShapeXYZ[ iV ]);
1171 SHOWYXZ("V point " <<iV << " ", myShapeXYZ[ iV ]);
1174 // Projections on the top and bottom faces are taken from nodes existing
1175 // on these faces; find correspondence between bottom and top nodes
1177 myBotToColumnMap.clear();
1178 if ( !assocOrProjBottom2Top( bottomToTopTrsf, thePrism ) ) // it also fills myBotToColumnMap
1182 // Create nodes inside the block
1184 // use transformation (issue 0020680, IPAL0052499)
1185 StdMeshers_Sweeper sweeper;
1187 bool allowHighBndError;
1191 // load boundary nodes into sweeper
1193 list< TopoDS_Edge >::const_iterator edge = thePrism.myBottomEdges.begin();
1194 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
1196 int edgeID = meshDS->ShapeToIndex( *edge );
1197 TParam2ColumnMap* u2col = const_cast<TParam2ColumnMap*>
1198 ( myBlock.GetParam2ColumnMap( edgeID, dummy ));
1199 TParam2ColumnMap::iterator u2colIt = u2col->begin();
1200 for ( ; u2colIt != u2col->end(); ++u2colIt )
1201 sweeper.myBndColumns.push_back( & u2colIt->second );
1203 // load node columns inside the bottom face
1204 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1205 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1206 sweeper.myIntColumns.push_back( & bot_column->second );
1208 tol = getSweepTolerance( thePrism );
1209 allowHighBndError = !isSimpleBottom( thePrism );
1212 if ( !myUseBlock && sweeper.ComputeNodes( *myHelper, tol, allowHighBndError ))
1215 else // use block approach
1217 // loop on nodes inside the bottom face
1218 Prism_3D::TNode prevBNode;
1219 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1220 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1222 const Prism_3D::TNode& tBotNode = bot_column->first; // bottom TNode
1223 if ( tBotNode.GetPositionType() != SMDS_TOP_FACE &&
1224 myBlock.HasNodeColumn( tBotNode.myNode ))
1225 continue; // node is not inside the FACE
1227 // column nodes; middle part of the column are zero pointers
1228 TNodeColumn& column = bot_column->second;
1230 gp_XYZ botParams, topParams;
1231 if ( !tBotNode.HasParams() )
1233 // compute bottom node parameters
1234 gp_XYZ paramHint(-1,-1,-1);
1235 if ( prevBNode.IsNeighbor( tBotNode ))
1236 paramHint = prevBNode.GetParams();
1237 if ( !myBlock.ComputeParameters( tBotNode.GetCoords(), tBotNode.ChangeParams(),
1238 ID_BOT_FACE, paramHint ))
1239 return toSM( error(TCom("Can't compute normalized parameters for node ")
1240 << tBotNode.myNode->GetID() << " on the face #"
1241 << myBlock.SubMesh( ID_BOT_FACE )->GetId() ));
1242 prevBNode = tBotNode;
1244 botParams = topParams = tBotNode.GetParams();
1245 topParams.SetZ( 1 );
1247 // compute top node parameters
1248 if ( column.size() > 2 ) {
1249 gp_Pnt topCoords = gpXYZ( column.back() );
1250 if ( !myBlock.ComputeParameters( topCoords, topParams, ID_TOP_FACE, topParams ))
1251 return toSM( error(TCom("Can't compute normalized parameters ")
1252 << "for node " << column.back()->GetID()
1253 << " on the face #"<< column.back()->getshapeId() ));
1256 else // top nodes are created by projection using parameters
1258 botParams = topParams = tBotNode.GetParams();
1259 topParams.SetZ( 1 );
1262 myShapeXYZ[ ID_BOT_FACE ] = tBotNode.GetCoords();
1263 myShapeXYZ[ ID_TOP_FACE ] = gpXYZ( column.back() );
1266 TNodeColumn::iterator columnNodes = column.begin();
1267 for ( int z = 0; columnNodes != column.end(); ++columnNodes, ++z)
1269 const SMDS_MeshNode* & node = *columnNodes;
1270 if ( node ) continue; // skip bottom or top node
1272 // params of a node to create
1273 double rz = (double) z / (double) ( column.size() - 1 );
1274 gp_XYZ params = botParams * ( 1 - rz ) + topParams * rz;
1276 // set coords on all faces and nodes
1277 const int nbSideFaces = 4;
1278 int sideFaceIDs[nbSideFaces] = { SMESH_Block::ID_Fx0z,
1279 SMESH_Block::ID_Fx1z,
1280 SMESH_Block::ID_F0yz,
1281 SMESH_Block::ID_F1yz };
1282 for ( int iF = 0; iF < nbSideFaces; ++iF )
1283 if ( !setFaceAndEdgesXYZ( sideFaceIDs[ iF ], params, z ))
1286 // compute coords for a new node
1288 if ( !SMESH_Block::ShellPoint( params, myShapeXYZ, coords ))
1289 return toSM( error("Can't compute coordinates by normalized parameters"));
1291 // if ( !meshDS->MeshElements( volumeID ) ||
1292 // meshDS->MeshElements( volumeID )->NbNodes() == 0 )
1293 // pointsToPython(myShapeXYZ);
1294 SHOWYXZ("TOPFacePoint ",myShapeXYZ[ ID_TOP_FACE]);
1295 SHOWYXZ("BOT Node "<< tBotNode.myNode->GetID(),gpXYZ(tBotNode.myNode));
1296 SHOWYXZ("ShellPoint ",coords);
1299 node = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
1300 meshDS->SetNodeInVolume( node, volumeID );
1302 if ( _computeCanceled )
1305 } // loop on bottom nodes
1310 SMESHDS_SubMesh* smDS = myBlock.SubMeshDS( ID_BOT_FACE );
1311 if ( !smDS ) return toSM( error(COMPERR_BAD_INPUT_MESH, "Null submesh"));
1313 // loop on bottom mesh faces
1314 vector< const TNodeColumn* > columns;
1315 SMDS_ElemIteratorPtr faceIt = smDS->GetElements();
1316 while ( faceIt->more() )
1318 const SMDS_MeshElement* face = faceIt->next();
1319 if ( !face || face->GetType() != SMDSAbs_Face )
1322 // find node columns for each node
1323 int nbNodes = face->NbCornerNodes();
1324 columns.resize( nbNodes );
1325 for ( int i = 0; i < nbNodes; ++i )
1327 const SMDS_MeshNode* n = face->GetNode( i );
1328 columns[ i ] = NULL;
1330 if ( n->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
1331 columns[ i ] = myBlock.GetNodeColumn( n );
1333 if ( !columns[ i ] )
1335 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
1336 if ( bot_column == myBotToColumnMap.end() )
1337 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
1338 columns[ i ] = & bot_column->second;
1342 if ( !AddPrisms( columns, myHelper ))
1343 return toSM( error("Different 'vertical' discretization"));
1345 } // loop on bottom mesh faces
1348 myBotToColumnMap.clear();
1351 // update state of sub-meshes (mostly in order to erase improper errors)
1352 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( thePrism.myShape3D );
1353 SMESH_subMeshIteratorPtr smIt = sm->getDependsOnIterator(/*includeSelf=*/true);
1354 while ( smIt->more() )
1357 sm->GetComputeError().reset();
1358 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1364 //=======================================================================
1365 //function : computeWalls
1366 //purpose : Compute 2D mesh on walls FACEs of a prism
1367 //=======================================================================
1369 bool StdMeshers_Prism_3D::computeWalls(const Prism_3D::TPrismTopo& thePrism)
1371 SMESH_Mesh* mesh = myHelper->GetMesh();
1372 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1373 DBGOUT( endl << "COMPUTE Prism " << meshDS->ShapeToIndex( thePrism.myShape3D ));
1375 TProjction1dAlgo* projector1D = TProjction1dAlgo::instance( this );
1376 StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this, myHelper );
1378 // SMESH_HypoFilter hyp1dFilter( SMESH_HypoFilter::IsAlgo(),/*not=*/true);
1379 // hyp1dFilter.And( SMESH_HypoFilter::HasDim( 1 ));
1380 // hyp1dFilter.And( SMESH_HypoFilter::IsMoreLocalThan( thePrism.myShape3D, *mesh ));
1382 // Discretize equally 'vertical' EDGEs
1383 // -----------------------------------
1384 // find source FACE sides for projection: either already computed ones or
1385 // the 'most composite' ones
1386 const size_t nbWalls = thePrism.myWallQuads.size();
1387 vector< int > wgt( nbWalls, 0 ); // "weight" of a wall
1388 for ( size_t iW = 0; iW != nbWalls; ++iW )
1390 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1391 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1393 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ];
1394 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1397 const TopoDS_Edge& E = lftSide->Edge(i);
1398 if ( mesh->GetSubMesh( E )->IsMeshComputed() )
1401 wgt[ myHelper->WrapIndex( iW+1, nbWalls)] += 10;
1402 wgt[ myHelper->WrapIndex( iW-1, nbWalls)] += 10;
1404 // else if ( mesh->GetHypothesis( E, hyp1dFilter, true )) // local hypothesis!
1408 // in quadratic mesh, pass ignoreMediumNodes to quad sides
1409 if ( myHelper->GetIsQuadratic() )
1411 quad = thePrism.myWallQuads[iW].begin();
1412 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1413 for ( int i = 0; i < NB_QUAD_SIDES; ++i )
1414 (*quad)->side[ i ].grid->SetIgnoreMediumNodes( true );
1417 multimap< int, int > wgt2quad;
1418 for ( size_t iW = 0; iW != nbWalls; ++iW )
1419 wgt2quad.insert( make_pair( wgt[ iW ], iW ));
1421 // Project 'vertical' EDGEs, from left to right
1422 multimap< int, int >::reverse_iterator w2q = wgt2quad.rbegin();
1423 for ( ; w2q != wgt2quad.rend(); ++w2q )
1425 const int iW = w2q->second;
1426 const Prism_3D::TQuadList& quads = thePrism.myWallQuads[ iW ];
1427 Prism_3D::TQuadList::const_iterator quad = quads.begin();
1428 for ( ; quad != quads.end(); ++quad )
1430 StdMeshers_FaceSidePtr rgtSide = (*quad)->side[ QUAD_RIGHT_SIDE ]; // tgt
1431 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ]; // src
1432 bool swapLeftRight = ( lftSide->NbSegments( /*update=*/true ) == 0 &&
1433 rgtSide->NbSegments( /*update=*/true ) > 0 );
1434 if ( swapLeftRight )
1435 std::swap( lftSide, rgtSide );
1437 // assure that all the source (left) EDGEs are meshed
1438 int nbSrcSegments = 0;
1439 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1441 const TopoDS_Edge& srcE = lftSide->Edge(i);
1442 SMESH_subMesh* srcSM = mesh->GetSubMesh( srcE );
1443 if ( !srcSM->IsMeshComputed() ) {
1444 DBGOUT( "COMPUTE V edge " << srcSM->GetId() );
1445 TopoDS_Edge prpgSrcE = findPropagationSource( srcE );
1446 if ( !prpgSrcE.IsNull() ) {
1447 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1448 projector1D->myHyp.SetSourceEdge( prpgSrcE );
1449 projector1D->Compute( *mesh, srcE );
1450 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1453 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1454 srcSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1456 if ( !srcSM->IsMeshComputed() )
1457 return toSM( error( "Can't compute 1D mesh" ));
1459 nbSrcSegments += srcSM->GetSubMeshDS()->NbElements();
1461 // check target EDGEs
1462 int nbTgtMeshed = 0, nbTgtSegments = 0;
1463 vector< bool > isTgtEdgeComputed( rgtSide->NbEdges() );
1464 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1466 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1467 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1468 if ( !( isTgtEdgeComputed[ i ] = tgtSM->IsMeshComputed() )) {
1469 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1470 tgtSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1472 if ( tgtSM->IsMeshComputed() ) {
1474 nbTgtSegments += tgtSM->GetSubMeshDS()->NbElements();
1477 if ( rgtSide->NbEdges() == nbTgtMeshed ) // all tgt EDGEs meshed
1479 if ( nbTgtSegments != nbSrcSegments )
1481 bool badMeshRemoved = false;
1482 // remove just computed segments
1483 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1484 if ( !isTgtEdgeComputed[ i ])
1486 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1487 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1488 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1489 badMeshRemoved = true;
1492 if ( !badMeshRemoved )
1494 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1495 addBadInputElements( meshDS->MeshElements( lftSide->Edge( i )));
1496 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1497 addBadInputElements( meshDS->MeshElements( rgtSide->Edge( i )));
1498 return toSM( error( TCom("Different nb of segment on logically vertical edges #")
1499 << shapeID( lftSide->Edge(0) ) << " and #"
1500 << shapeID( rgtSide->Edge(0) ) << ": "
1501 << nbSrcSegments << " != " << nbTgtSegments ));
1504 else // if ( nbTgtSegments == nbSrcSegments )
1509 // Compute 'vertical projection'
1510 if ( nbTgtMeshed == 0 )
1512 // compute nodes on target VERTEXes
1513 const UVPtStructVec& srcNodeStr = lftSide->GetUVPtStruct();
1514 if ( srcNodeStr.size() == 0 )
1515 return toSM( error( TCom("Invalid node positions on edge #") <<
1516 shapeID( lftSide->Edge(0) )));
1517 vector< SMDS_MeshNode* > newNodes( srcNodeStr.size() );
1518 for ( int is2ndV = 0; is2ndV < 2; ++is2ndV )
1520 const TopoDS_Edge& E = rgtSide->Edge( is2ndV ? rgtSide->NbEdges()-1 : 0 );
1521 TopoDS_Vertex v = myHelper->IthVertex( is2ndV, E );
1522 mesh->GetSubMesh( v )->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1523 const SMDS_MeshNode* n = SMESH_Algo::VertexNode( v, meshDS );
1524 newNodes[ is2ndV ? 0 : newNodes.size()-1 ] = (SMDS_MeshNode*) n;
1527 // compute nodes on target EDGEs
1528 DBGOUT( "COMPUTE V edge (proj) " << shapeID( lftSide->Edge(0)));
1529 rgtSide->Reverse(); // direct it same as the lftSide
1530 myHelper->SetElementsOnShape( false ); // myHelper holds the prism shape
1531 TopoDS_Edge tgtEdge;
1532 for ( size_t iN = 1; iN < srcNodeStr.size()-1; ++iN ) // add nodes
1534 gp_Pnt p = rgtSide->Value3d ( srcNodeStr[ iN ].normParam );
1535 double u = rgtSide->Parameter( srcNodeStr[ iN ].normParam, tgtEdge );
1536 newNodes[ iN ] = meshDS->AddNode( p.X(), p.Y(), p.Z() );
1537 meshDS->SetNodeOnEdge( newNodes[ iN ], tgtEdge, u );
1539 for ( size_t iN = 1; iN < srcNodeStr.size(); ++iN ) // add segments
1541 // find an EDGE to set a new segment
1542 std::pair<int, TopAbs_ShapeEnum> id2type =
1543 myHelper->GetMediumPos( newNodes[ iN-1 ], newNodes[ iN ] );
1544 if ( id2type.second != TopAbs_EDGE )
1546 // new nodes are on different EDGEs; put one of them on VERTEX
1547 const int edgeIndex = rgtSide->EdgeIndex( srcNodeStr[ iN-1 ].normParam );
1548 const double vertexParam = rgtSide->LastParameter( edgeIndex );
1549 TopoDS_Vertex vertex = rgtSide->LastVertex( edgeIndex );
1550 const SMDS_MeshNode* vn = SMESH_Algo::VertexNode( vertex, meshDS );
1551 const gp_Pnt p = BRep_Tool::Pnt( vertex );
1552 const int isPrev = ( Abs( srcNodeStr[ iN-1 ].normParam - vertexParam ) <
1553 Abs( srcNodeStr[ iN ].normParam - vertexParam ));
1554 meshDS->UnSetNodeOnShape( newNodes[ iN-isPrev ] );
1555 meshDS->SetNodeOnVertex ( newNodes[ iN-isPrev ], vertex );
1556 meshDS->MoveNode ( newNodes[ iN-isPrev ], p.X(), p.Y(), p.Z() );
1557 id2type.first = newNodes[ iN-(1-isPrev) ]->getshapeId();
1560 SMESH_MeshEditor::TListOfListOfNodes lln( 1, list< const SMDS_MeshNode* >() );
1561 lln.back().push_back ( vn );
1562 lln.back().push_front( newNodes[ iN-isPrev ] ); // to keep
1563 SMESH_MeshEditor( mesh ).MergeNodes( lln );
1566 SMDS_MeshElement* newEdge = myHelper->AddEdge( newNodes[ iN-1 ], newNodes[ iN ] );
1567 meshDS->SetMeshElementOnShape( newEdge, id2type.first );
1569 myHelper->SetElementsOnShape( true );
1570 for ( int i = 0; i < rgtSide->NbEdges(); ++i ) // update state of sub-meshes
1572 const TopoDS_Edge& E = rgtSide->Edge( i );
1573 SMESH_subMesh* tgtSM = mesh->GetSubMesh( E );
1574 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1577 // to continue projection from the just computed side as a source
1578 if ( !swapLeftRight && rgtSide->NbEdges() > 1 && w2q->second == iW )
1580 std::pair<int,int> wgt2quadKeyVal( w2q->first + 1, thePrism.myRightQuadIndex[ iW ]);
1581 wgt2quad.insert( wgt2quadKeyVal ); // it will be skipped by ++w2q
1582 wgt2quad.insert( wgt2quadKeyVal );
1583 w2q = wgt2quad.rbegin();
1588 // HOPE assigned hypotheses are OK, so that equal nb of segments will be generated
1589 //return toSM( error("Partial projection not implemented"));
1591 } // loop on quads of a composite wall side
1592 } // loop on the ordered wall sides
1596 for ( size_t iW = 0; iW != thePrism.myWallQuads.size(); ++iW )
1598 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1599 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1601 const TopoDS_Face& face = (*quad)->face;
1602 SMESH_subMesh* fSM = mesh->GetSubMesh( face );
1603 if ( ! fSM->IsMeshComputed() )
1605 // Top EDGEs must be projections from the bottom ones
1606 // to compute stuctured quad mesh on wall FACEs
1607 // ---------------------------------------------------
1608 const TopoDS_Edge& botE = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0);
1609 const TopoDS_Edge& topE = (*quad)->side[ QUAD_TOP_SIDE ].grid->Edge(0);
1610 SMESH_subMesh* botSM = mesh->GetSubMesh( botE );
1611 SMESH_subMesh* topSM = mesh->GetSubMesh( topE );
1612 SMESH_subMesh* srcSM = botSM;
1613 SMESH_subMesh* tgtSM = topSM;
1614 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1615 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1616 if ( !srcSM->IsMeshComputed() && tgtSM->IsMeshComputed() )
1617 std::swap( srcSM, tgtSM );
1619 if ( !srcSM->IsMeshComputed() )
1621 DBGOUT( "COMPUTE H edge " << srcSM->GetId());
1622 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE ); // nodes on VERTEXes
1623 srcSM->ComputeStateEngine( SMESH_subMesh::COMPUTE ); // segments on the EDGE
1626 if ( tgtSM->IsMeshComputed() &&
1627 tgtSM->GetSubMeshDS()->NbNodes() != srcSM->GetSubMeshDS()->NbNodes() )
1629 // the top EDGE is computed differently than the bottom one,
1630 // try to clear a wrong mesh
1631 bool isAdjFaceMeshed = false;
1632 PShapeIteratorPtr fIt = myHelper->GetAncestors( tgtSM->GetSubShape(),
1633 *mesh, TopAbs_FACE );
1634 while ( const TopoDS_Shape* f = fIt->next() )
1635 if (( isAdjFaceMeshed = mesh->GetSubMesh( *f )->IsMeshComputed() ))
1637 if ( isAdjFaceMeshed )
1638 return toSM( error( TCom("Different nb of segment on logically horizontal edges #")
1639 << shapeID( botE ) << " and #"
1640 << shapeID( topE ) << ": "
1641 << tgtSM->GetSubMeshDS()->NbElements() << " != "
1642 << srcSM->GetSubMeshDS()->NbElements() ));
1643 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1645 if ( !tgtSM->IsMeshComputed() )
1647 // compute nodes on VERTEXes
1648 SMESH_subMeshIteratorPtr smIt = tgtSM->getDependsOnIterator(/*includeSelf=*/false);
1649 while ( smIt->more() )
1650 smIt->next()->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1652 DBGOUT( "COMPUTE H edge (proj) " << tgtSM->GetId());
1653 projector1D->myHyp.SetSourceEdge( TopoDS::Edge( srcSM->GetSubShape() ));
1654 projector1D->InitComputeError();
1655 bool ok = projector1D->Compute( *mesh, tgtSM->GetSubShape() );
1658 SMESH_ComputeErrorPtr err = projector1D->GetComputeError();
1659 if ( err->IsOK() ) err->myName = COMPERR_ALGO_FAILED;
1660 tgtSM->GetComputeError() = err;
1664 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1667 // Compute quad mesh on wall FACEs
1668 // -------------------------------
1670 // make all EDGES meshed
1671 fSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1672 if ( !fSM->SubMeshesComputed() )
1673 return toSM( error( COMPERR_BAD_INPUT_MESH,
1674 "Not all edges have valid algorithm and hypothesis"));
1676 quadAlgo->InitComputeError();
1677 DBGOUT( "COMPUTE Quad face " << fSM->GetId());
1678 bool ok = quadAlgo->Compute( *mesh, face );
1679 fSM->GetComputeError() = quadAlgo->GetComputeError();
1682 fSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1684 if ( myHelper->GetIsQuadratic() )
1686 // fill myHelper with medium nodes built by quadAlgo
1687 SMDS_ElemIteratorPtr fIt = fSM->GetSubMeshDS()->GetElements();
1688 while ( fIt->more() )
1689 myHelper->AddTLinks( dynamic_cast<const SMDS_MeshFace*>( fIt->next() ));
1697 //=======================================================================
1699 * \brief Returns a source EDGE of propagation to a given EDGE
1701 //=======================================================================
1703 TopoDS_Edge StdMeshers_Prism_3D::findPropagationSource( const TopoDS_Edge& E )
1705 if ( myPropagChains )
1706 for ( size_t i = 0; !myPropagChains[i].IsEmpty(); ++i )
1707 if ( myPropagChains[i].Contains( E ))
1708 return TopoDS::Edge( myPropagChains[i].FindKey( 1 ));
1710 return TopoDS_Edge();
1713 //=======================================================================
1714 //function : Evaluate
1716 //=======================================================================
1718 bool StdMeshers_Prism_3D::Evaluate(SMESH_Mesh& theMesh,
1719 const TopoDS_Shape& theShape,
1720 MapShapeNbElems& aResMap)
1722 if ( theShape.ShapeType() == TopAbs_COMPOUND )
1725 for ( TopoDS_Iterator it( theShape ); it.More(); it.Next() )
1726 ok &= Evaluate( theMesh, it.Value(), aResMap );
1729 SMESH_MesherHelper helper( theMesh );
1731 myHelper->SetSubShape( theShape );
1733 // find face contains only triangles
1734 vector < SMESH_subMesh * >meshFaces;
1735 TopTools_SequenceOfShape aFaces;
1736 int NumBase = 0, i = 0, NbQFs = 0;
1737 for (TopExp_Explorer exp(theShape, TopAbs_FACE); exp.More(); exp.Next()) {
1739 aFaces.Append(exp.Current());
1740 SMESH_subMesh *aSubMesh = theMesh.GetSubMesh(exp.Current());
1741 meshFaces.push_back(aSubMesh);
1742 MapShapeNbElemsItr anIt = aResMap.find(meshFaces[i-1]);
1743 if( anIt==aResMap.end() )
1744 return toSM( error( "Submesh can not be evaluated"));
1746 std::vector<int> aVec = (*anIt).second;
1747 int nbtri = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1748 int nbqua = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1749 if( nbtri==0 && nbqua>0 ) {
1758 std::vector<int> aResVec(SMDSEntity_Last);
1759 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1760 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1761 aResMap.insert(std::make_pair(sm,aResVec));
1762 return toSM( error( "Submesh can not be evaluated" ));
1765 if(NumBase==0) NumBase = 1; // only quads => set 1 faces as base
1767 // find number of 1d elems for base face
1769 TopTools_MapOfShape Edges1;
1770 for (TopExp_Explorer exp(aFaces.Value(NumBase), TopAbs_EDGE); exp.More(); exp.Next()) {
1771 Edges1.Add(exp.Current());
1772 SMESH_subMesh *sm = theMesh.GetSubMesh(exp.Current());
1774 MapShapeNbElemsItr anIt = aResMap.find(sm);
1775 if( anIt == aResMap.end() ) continue;
1776 std::vector<int> aVec = (*anIt).second;
1777 nb1d += Max(aVec[SMDSEntity_Edge],aVec[SMDSEntity_Quad_Edge]);
1780 // find face opposite to base face
1782 for(i=1; i<=6; i++) {
1783 if(i==NumBase) continue;
1784 bool IsOpposite = true;
1785 for(TopExp_Explorer exp(aFaces.Value(i), TopAbs_EDGE); exp.More(); exp.Next()) {
1786 if( Edges1.Contains(exp.Current()) ) {
1796 // find number of 2d elems on side faces
1798 for(i=1; i<=6; i++) {
1799 if( i==OppNum || i==NumBase ) continue;
1800 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[i-1] );
1801 if( anIt == aResMap.end() ) continue;
1802 std::vector<int> aVec = (*anIt).second;
1803 nb2d += Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1806 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[NumBase-1] );
1807 std::vector<int> aVec = (*anIt).second;
1808 bool IsQuadratic = (aVec[SMDSEntity_Quad_Triangle]>aVec[SMDSEntity_Triangle]) ||
1809 (aVec[SMDSEntity_Quad_Quadrangle]>aVec[SMDSEntity_Quadrangle]);
1810 int nb2d_face0_3 = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1811 int nb2d_face0_4 = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1812 int nb0d_face0 = aVec[SMDSEntity_Node];
1813 int nb1d_face0_int = ( nb2d_face0_3*3 + nb2d_face0_4*4 - nb1d ) / 2;
1815 std::vector<int> aResVec(SMDSEntity_Last);
1816 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1818 aResVec[SMDSEntity_Quad_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
1819 aResVec[SMDSEntity_Quad_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
1820 aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
1823 aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
1824 aResVec[SMDSEntity_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
1825 aResVec[SMDSEntity_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
1827 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1828 aResMap.insert(std::make_pair(sm,aResVec));
1833 //================================================================================
1835 * \brief Create prisms
1836 * \param columns - columns of nodes generated from nodes of a mesh face
1837 * \param helper - helper initialized by mesh and shape to add prisms to
1839 //================================================================================
1841 bool StdMeshers_Prism_3D::AddPrisms( vector<const TNodeColumn*> & columns,
1842 SMESH_MesherHelper* helper)
1844 size_t nbNodes = columns.size();
1845 size_t nbZ = columns[0]->size();
1846 if ( nbZ < 2 ) return false;
1847 for ( size_t i = 1; i < nbNodes; ++i )
1848 if ( columns[i]->size() != nbZ )
1851 // find out orientation
1852 bool isForward = true;
1853 SMDS_VolumeTool vTool;
1855 switch ( nbNodes ) {
1857 SMDS_VolumeOfNodes tmpPenta ( (*columns[0])[z-1], // bottom
1860 (*columns[0])[z], // top
1863 vTool.Set( &tmpPenta );
1864 isForward = vTool.IsForward();
1868 SMDS_VolumeOfNodes tmpHex( (*columns[0])[z-1], (*columns[1])[z-1], // bottom
1869 (*columns[2])[z-1], (*columns[3])[z-1],
1870 (*columns[0])[z], (*columns[1])[z], // top
1871 (*columns[2])[z], (*columns[3])[z] );
1872 vTool.Set( &tmpHex );
1873 isForward = vTool.IsForward();
1877 const int di = (nbNodes+1) / 3;
1878 SMDS_VolumeOfNodes tmpVol ( (*columns[0] )[z-1],
1879 (*columns[di] )[z-1],
1880 (*columns[2*di])[z-1],
1883 (*columns[2*di])[z] );
1884 vTool.Set( &tmpVol );
1885 isForward = vTool.IsForward();
1888 // vertical loop on columns
1890 helper->SetElementsOnShape( true );
1892 switch ( nbNodes ) {
1894 case 3: { // ---------- pentahedra
1895 const int i1 = isForward ? 1 : 2;
1896 const int i2 = isForward ? 2 : 1;
1897 for ( z = 1; z < nbZ; ++z )
1898 helper->AddVolume( (*columns[0 ])[z-1], // bottom
1899 (*columns[i1])[z-1],
1900 (*columns[i2])[z-1],
1901 (*columns[0 ])[z], // top
1903 (*columns[i2])[z] );
1906 case 4: { // ---------- hexahedra
1907 const int i1 = isForward ? 1 : 3;
1908 const int i3 = isForward ? 3 : 1;
1909 for ( z = 1; z < nbZ; ++z )
1910 helper->AddVolume( (*columns[0])[z-1], (*columns[i1])[z-1], // bottom
1911 (*columns[2])[z-1], (*columns[i3])[z-1],
1912 (*columns[0])[z], (*columns[i1])[z], // top
1913 (*columns[2])[z], (*columns[i3])[z] );
1916 case 6: { // ---------- octahedra
1917 const int iBase1 = isForward ? -1 : 0;
1918 const int iBase2 = isForward ? 0 :-1;
1919 for ( z = 1; z < nbZ; ++z )
1920 helper->AddVolume( (*columns[0])[z+iBase1], (*columns[1])[z+iBase1], // bottom or top
1921 (*columns[2])[z+iBase1], (*columns[3])[z+iBase1],
1922 (*columns[4])[z+iBase1], (*columns[5])[z+iBase1],
1923 (*columns[0])[z+iBase2], (*columns[1])[z+iBase2], // top or bottom
1924 (*columns[2])[z+iBase2], (*columns[3])[z+iBase2],
1925 (*columns[4])[z+iBase2], (*columns[5])[z+iBase2] );
1928 default: // ---------- polyhedra
1929 vector<int> quantities( 2 + nbNodes, 4 );
1930 quantities[0] = quantities[1] = nbNodes;
1931 columns.resize( nbNodes + 1 );
1932 columns[ nbNodes ] = columns[ 0 ];
1933 const int i1 = isForward ? 1 : 3;
1934 const int i3 = isForward ? 3 : 1;
1935 const int iBase1 = isForward ? -1 : 0;
1936 const int iBase2 = isForward ? 0 :-1;
1937 vector<const SMDS_MeshNode*> nodes( 2*nbNodes + 4*nbNodes);
1938 for ( z = 1; z < nbZ; ++z )
1940 for ( size_t i = 0; i < nbNodes; ++i ) {
1941 nodes[ i ] = (*columns[ i ])[z+iBase1]; // bottom or top
1942 nodes[ 2*nbNodes-i-1 ] = (*columns[ i ])[z+iBase2]; // top or bottom
1944 int di = 2*nbNodes + 4*i;
1945 nodes[ di+0 ] = (*columns[i ])[z ];
1946 nodes[ di+i1] = (*columns[i+1])[z ];
1947 nodes[ di+2 ] = (*columns[i+1])[z-1];
1948 nodes[ di+i3] = (*columns[i ])[z-1];
1950 helper->AddPolyhedralVolume( nodes, quantities );
1953 } // switch ( nbNodes )
1958 //================================================================================
1960 * \brief Find correspondence between bottom and top nodes
1961 * If elements on the bottom and top faces are topologically different,
1962 * and projection is possible and allowed, perform the projection
1963 * \retval bool - is a success or not
1965 //================================================================================
1967 bool StdMeshers_Prism_3D::assocOrProjBottom2Top( const gp_Trsf & bottomToTopTrsf,
1968 const Prism_3D::TPrismTopo& thePrism)
1970 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
1971 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
1973 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
1974 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
1976 if ( !botSMDS || botSMDS->NbElements() == 0 )
1978 _gen->Compute( *myHelper->GetMesh(), botSM->GetSubShape(), /*aShapeOnly=*/true );
1979 botSMDS = botSM->GetSubMeshDS();
1980 if ( !botSMDS || botSMDS->NbElements() == 0 )
1981 return toSM( error(TCom("No elements on face #") << botSM->GetId() ));
1984 bool needProject = !topSM->IsMeshComputed();
1985 if ( !needProject &&
1986 (botSMDS->NbElements() != topSMDS->NbElements() ||
1987 botSMDS->NbNodes() != topSMDS->NbNodes()))
1989 MESSAGE("nb elem bot " << botSMDS->NbElements() <<
1990 " top " << ( topSMDS ? topSMDS->NbElements() : 0 ));
1991 MESSAGE("nb node bot " << botSMDS->NbNodes() <<
1992 " top " << ( topSMDS ? topSMDS->NbNodes() : 0 ));
1993 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
1994 <<" and #"<< topSM->GetId() << " seems different" ));
1997 if ( 0/*needProject && !myProjectTriangles*/ )
1998 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
1999 <<" and #"<< topSM->GetId() << " seems different" ));
2000 ///RETURN_BAD_RESULT("Need to project but not allowed");
2002 NSProjUtils::TNodeNodeMap n2nMap;
2003 const NSProjUtils::TNodeNodeMap* n2nMapPtr = & n2nMap;
2006 if ( !projectBottomToTop( bottomToTopTrsf, thePrism ))
2008 n2nMapPtr = & TProjction2dAlgo::instance( this )->GetNodesMap();
2011 if ( !n2nMapPtr || (int) n2nMapPtr->size() < botSMDS->NbNodes() )
2013 // associate top and bottom faces
2014 NSProjUtils::TShapeShapeMap shape2ShapeMap;
2015 const bool sameTopo =
2016 NSProjUtils::FindSubShapeAssociation( thePrism.myBottom, myHelper->GetMesh(),
2017 thePrism.myTop, myHelper->GetMesh(),
2020 for ( size_t iQ = 0; iQ < thePrism.myWallQuads.size(); ++iQ )
2022 const Prism_3D::TQuadList& quadList = thePrism.myWallQuads[iQ];
2023 StdMeshers_FaceSidePtr botSide = quadList.front()->side[ QUAD_BOTTOM_SIDE ];
2024 StdMeshers_FaceSidePtr topSide = quadList.back ()->side[ QUAD_TOP_SIDE ];
2025 if ( botSide->NbEdges() == topSide->NbEdges() )
2027 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
2029 NSProjUtils::InsertAssociation( botSide->Edge( iE ),
2030 topSide->Edge( iE ), shape2ShapeMap );
2031 NSProjUtils::InsertAssociation( myHelper->IthVertex( 0, botSide->Edge( iE )),
2032 myHelper->IthVertex( 0, topSide->Edge( iE )),
2038 TopoDS_Vertex vb, vt;
2039 StdMeshers_FaceSidePtr sideB, sideT;
2040 vb = myHelper->IthVertex( 0, botSide->Edge( 0 ));
2041 vt = myHelper->IthVertex( 0, topSide->Edge( 0 ));
2042 sideB = quadList.front()->side[ QUAD_LEFT_SIDE ];
2043 sideT = quadList.back ()->side[ QUAD_LEFT_SIDE ];
2044 if ( vb.IsSame( sideB->FirstVertex() ) &&
2045 vt.IsSame( sideT->LastVertex() ))
2047 NSProjUtils::InsertAssociation( botSide->Edge( 0 ),
2048 topSide->Edge( 0 ), shape2ShapeMap );
2049 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2051 vb = myHelper->IthVertex( 1, botSide->Edge( botSide->NbEdges()-1 ));
2052 vt = myHelper->IthVertex( 1, topSide->Edge( topSide->NbEdges()-1 ));
2053 sideB = quadList.front()->side[ QUAD_RIGHT_SIDE ];
2054 sideT = quadList.back ()->side[ QUAD_RIGHT_SIDE ];
2055 if ( vb.IsSame( sideB->FirstVertex() ) &&
2056 vt.IsSame( sideT->LastVertex() ))
2058 NSProjUtils::InsertAssociation( botSide->Edge( botSide->NbEdges()-1 ),
2059 topSide->Edge( topSide->NbEdges()-1 ),
2061 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2066 // Find matching nodes of top and bottom faces
2067 n2nMapPtr = & n2nMap;
2068 if ( ! NSProjUtils::FindMatchingNodesOnFaces( thePrism.myBottom, myHelper->GetMesh(),
2069 thePrism.myTop, myHelper->GetMesh(),
2070 shape2ShapeMap, n2nMap ))
2073 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
2074 <<" and #"<< topSM->GetId() << " seems different" ));
2076 return toSM( error(TCom("Topology of faces #") << botSM->GetId()
2077 <<" and #"<< topSM->GetId() << " seems different" ));
2081 // Fill myBotToColumnMap
2083 int zSize = myBlock.VerticalSize();
2084 TNodeNodeMap::const_iterator bN_tN = n2nMapPtr->begin();
2085 for ( ; bN_tN != n2nMapPtr->end(); ++bN_tN )
2087 const SMDS_MeshNode* botNode = bN_tN->first;
2088 const SMDS_MeshNode* topNode = bN_tN->second;
2089 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE &&
2090 myBlock.HasNodeColumn( botNode ))
2091 continue; // wall columns are contained in myBlock
2092 // create node column
2093 Prism_3D::TNode bN( botNode );
2094 TNode2ColumnMap::iterator bN_col =
2095 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2096 TNodeColumn & column = bN_col->second;
2097 column.resize( zSize );
2098 column.front() = botNode;
2099 column.back() = topNode;
2104 //================================================================================
2106 * \brief Remove faces from the top face and re-create them by projection from the bottom
2107 * \retval bool - a success or not
2109 //================================================================================
2111 bool StdMeshers_Prism_3D::projectBottomToTop( const gp_Trsf & bottomToTopTrsf,
2112 const Prism_3D::TPrismTopo& thePrism )
2114 if ( project2dMesh( thePrism.myBottom, thePrism.myTop ))
2118 NSProjUtils::TNodeNodeMap& n2nMap =
2119 (NSProjUtils::TNodeNodeMap&) TProjction2dAlgo::instance( this )->GetNodesMap();
2124 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2125 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
2126 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
2128 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
2129 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
2131 if ( topSMDS && topSMDS->NbElements() > 0 )
2133 //topSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2134 for ( SMDS_ElemIteratorPtr eIt = topSMDS->GetElements(); eIt->more(); )
2135 meshDS->RemoveFreeElement( eIt->next(), topSMDS, /*fromGroups=*/false );
2136 for ( SMDS_NodeIteratorPtr nIt = topSMDS->GetNodes(); nIt->more(); )
2137 meshDS->RemoveFreeNode( nIt->next(), topSMDS, /*fromGroups=*/false );
2140 const TopoDS_Face& botFace = thePrism.myBottom; // oriented within
2141 const TopoDS_Face& topFace = thePrism.myTop; // the 3D SHAPE
2142 int topFaceID = meshDS->ShapeToIndex( thePrism.myTop );
2144 SMESH_MesherHelper botHelper( *myHelper->GetMesh() );
2145 botHelper.SetSubShape( botFace );
2146 botHelper.ToFixNodeParameters( true );
2148 SMESH_MesherHelper topHelper( *myHelper->GetMesh() );
2149 topHelper.SetSubShape( topFace );
2150 topHelper.ToFixNodeParameters( true );
2151 double distXYZ[4], fixTol = 10 * topHelper.MaxTolerance( topFace );
2153 // Fill myBotToColumnMap
2155 int zSize = myBlock.VerticalSize();
2156 Prism_3D::TNode prevTNode;
2157 SMDS_NodeIteratorPtr nIt = botSMDS->GetNodes();
2158 while ( nIt->more() )
2160 const SMDS_MeshNode* botNode = nIt->next();
2161 const SMDS_MeshNode* topNode = 0;
2162 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
2163 continue; // strange
2165 Prism_3D::TNode bN( botNode );
2166 if ( bottomToTopTrsf.Form() == gp_Identity )
2168 // compute bottom node params
2169 gp_XYZ paramHint(-1,-1,-1);
2170 if ( prevTNode.IsNeighbor( bN ))
2172 paramHint = prevTNode.GetParams();
2173 // double tol = 1e-2 * ( prevTNode.GetCoords() - bN.GetCoords() ).Modulus();
2174 // myBlock.SetTolerance( Min( myBlock.GetTolerance(), tol ));
2176 if ( !myBlock.ComputeParameters( bN.GetCoords(), bN.ChangeParams(),
2177 ID_BOT_FACE, paramHint ))
2178 return toSM( error(TCom("Can't compute normalized parameters for node ")
2179 << botNode->GetID() << " on the face #"<< botSM->GetId() ));
2181 // compute top node coords
2182 gp_XYZ topXYZ; gp_XY topUV;
2183 if ( !myBlock.FacePoint( ID_TOP_FACE, bN.GetParams(), topXYZ ) ||
2184 !myBlock.FaceUV ( ID_TOP_FACE, bN.GetParams(), topUV ))
2185 return toSM( error(TCom("Can't compute coordinates "
2186 "by normalized parameters on the face #")<< topSM->GetId() ));
2187 topNode = meshDS->AddNode( topXYZ.X(),topXYZ.Y(),topXYZ.Z() );
2188 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2190 else // use bottomToTopTrsf
2192 gp_XYZ coords = bN.GetCoords();
2193 bottomToTopTrsf.Transforms( coords );
2194 topNode = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
2195 gp_XY topUV = botHelper.GetNodeUV( botFace, botNode, 0, &checkUV );
2196 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2198 if ( topHelper.CheckNodeUV( topFace, topNode, topUV, fixTol, /*force=*/false, distXYZ ) &&
2199 distXYZ[0] > fixTol && distXYZ[0] < fixTol * 1e+3 )
2200 meshDS->MoveNode( topNode, distXYZ[1], distXYZ[2], distXYZ[3] ); // transform can be inaccurate
2202 // create node column
2203 TNode2ColumnMap::iterator bN_col =
2204 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2205 TNodeColumn & column = bN_col->second;
2206 column.resize( zSize );
2207 column.front() = botNode;
2208 column.back() = topNode;
2210 n2nMap.insert( n2nMap.end(), make_pair( botNode, topNode ));
2212 if ( _computeCanceled )
2213 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
2218 const bool oldSetElemsOnShape = myHelper->SetElementsOnShape( false );
2220 // care of orientation;
2221 // if the bottom faces is orienetd OK then top faces must be reversed
2222 bool reverseTop = true;
2223 if ( myHelper->NbAncestors( botFace, *myBlock.Mesh(), TopAbs_SOLID ) > 1 )
2224 reverseTop = ! myHelper->IsReversedSubMesh( botFace );
2225 int iFrw, iRev, *iPtr = &( reverseTop ? iRev : iFrw );
2227 // loop on bottom mesh faces
2228 SMDS_ElemIteratorPtr faceIt = botSMDS->GetElements();
2229 vector< const SMDS_MeshNode* > nodes;
2230 while ( faceIt->more() )
2232 const SMDS_MeshElement* face = faceIt->next();
2233 if ( !face || face->GetType() != SMDSAbs_Face )
2236 // find top node in columns for each bottom node
2237 int nbNodes = face->NbCornerNodes();
2238 nodes.resize( nbNodes );
2239 for ( iFrw = 0, iRev = nbNodes-1; iFrw < nbNodes; ++iFrw, --iRev )
2241 const SMDS_MeshNode* n = face->GetNode( *iPtr );
2242 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) {
2243 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
2244 if ( bot_column == myBotToColumnMap.end() )
2245 return toSM( error(TCom("No nodes found above node ") << n->GetID() ));
2246 nodes[ iFrw ] = bot_column->second.back();
2249 const TNodeColumn* column = myBlock.GetNodeColumn( n );
2251 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
2252 nodes[ iFrw ] = column->back();
2255 SMDS_MeshElement* newFace = 0;
2256 switch ( nbNodes ) {
2259 newFace = myHelper->AddFace(nodes[0], nodes[1], nodes[2]);
2263 newFace = myHelper->AddFace( nodes[0], nodes[1], nodes[2], nodes[3] );
2267 newFace = meshDS->AddPolygonalFace( nodes );
2270 meshDS->SetMeshElementOnShape( newFace, topFaceID );
2273 myHelper->SetElementsOnShape( oldSetElemsOnShape );
2275 // Check the projected mesh
2277 if ( thePrism.myNbEdgesInWires.size() > 1 && // there are holes
2278 topHelper.IsDistorted2D( topSM, /*checkUV=*/false ))
2280 SMESH_MeshEditor editor( topHelper.GetMesh() );
2282 // smooth in 2D or 3D?
2283 TopLoc_Location loc;
2284 Handle(Geom_Surface) surface = BRep_Tool::Surface( topFace, loc );
2285 bool isPlanar = GeomLib_IsPlanarSurface( surface ).IsPlanar();
2287 set<const SMDS_MeshNode*> fixedNodes;
2288 TIDSortedElemSet faces;
2289 for ( faceIt = topSMDS->GetElements(); faceIt->more(); )
2290 faces.insert( faces.end(), faceIt->next() );
2293 for ( int isCentroidal = 0; isCentroidal < 2; ++isCentroidal )
2295 SMESH_MeshEditor::SmoothMethod algo =
2296 isCentroidal ? SMESH_MeshEditor::CENTROIDAL : SMESH_MeshEditor::LAPLACIAN;
2298 int nbAttempts = isCentroidal ? 1 : 10;
2299 for ( int iAttemp = 0; iAttemp < nbAttempts; ++iAttemp )
2301 TIDSortedElemSet workFaces = faces;
2304 editor.Smooth( workFaces, fixedNodes, algo, /*nbIterations=*/ 10,
2305 /*theTgtAspectRatio=*/1.0, /*the2D=*/!isPlanar);
2307 if (( isOk = !topHelper.IsDistorted2D( topSM, /*checkUV=*/true )) &&
2313 return toSM( error( TCom("Projection from face #") << botSM->GetId()
2314 << " to face #" << topSM->GetId()
2315 << " failed: inverted elements created"));
2318 TProjction2dAlgo::instance( this )->SetEventListener( topSM );
2323 //=======================================================================
2324 //function : getSweepTolerance
2325 //purpose : Compute tolerance to pass to StdMeshers_Sweeper
2326 //=======================================================================
2328 double StdMeshers_Prism_3D::getSweepTolerance( const Prism_3D::TPrismTopo& thePrism )
2330 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2331 SMESHDS_SubMesh * sm[2] = { meshDS->MeshElements( thePrism.myBottom ),
2332 meshDS->MeshElements( thePrism.myTop ) };
2333 double minDist = 1e100;
2335 vector< SMESH_TNodeXYZ > nodes;
2336 for ( int iSM = 0; iSM < 2; ++iSM )
2338 if ( !sm[ iSM ]) continue;
2340 SMDS_ElemIteratorPtr fIt = sm[ iSM ]->GetElements();
2341 while ( fIt->more() )
2343 const SMDS_MeshElement* face = fIt->next();
2344 const int nbNodes = face->NbCornerNodes();
2345 SMDS_ElemIteratorPtr nIt = face->nodesIterator();
2347 nodes.resize( nbNodes + 1 );
2348 for ( int iN = 0; iN < nbNodes; ++iN )
2349 nodes[ iN ] = nIt->next();
2350 nodes.back() = nodes[0];
2354 for ( int iN = 0; iN < nbNodes; ++iN )
2356 if ( nodes[ iN ]._node->GetPosition()->GetDim() < 2 &&
2357 nodes[ iN+1 ]._node->GetPosition()->GetDim() < 2 )
2359 // it's a boundary link; measure distance of other
2360 // nodes to this link
2361 gp_XYZ linkDir = nodes[ iN ] - nodes[ iN+1 ];
2362 double linkLen = linkDir.Modulus();
2363 bool isDegen = ( linkLen < numeric_limits<double>::min() );
2364 if ( !isDegen ) linkDir /= linkLen;
2365 for ( int iN2 = 0; iN2 < nbNodes; ++iN2 ) // loop on other nodes
2367 if ( nodes[ iN2 ] == nodes[ iN ] ||
2368 nodes[ iN2 ] == nodes[ iN+1 ]) continue;
2371 dist2 = ( nodes[ iN ] - nodes[ iN2 ]).SquareModulus();
2375 dist2 = linkDir.CrossSquareMagnitude( nodes[ iN ] - nodes[ iN2 ]);
2377 if ( dist2 > numeric_limits<double>::min() )
2378 minDist = Min ( minDist, dist2 );
2381 // measure length link
2382 else if ( nodes[ iN ]._node < nodes[ iN+1 ]._node ) // not to measure same link twice
2384 dist2 = ( nodes[ iN ] - nodes[ iN+1 ]).SquareModulus();
2385 if ( dist2 > numeric_limits<double>::min() )
2386 minDist = Min ( minDist, dist2 );
2391 return 0.1 * Sqrt ( minDist );
2394 //=======================================================================
2395 //function : isSimpleQuad
2396 //purpose : check if the bottom FACE is meshable with nice qudrangles,
2397 // if so the block aproach can work rather fast.
2398 // This is a temporary mean caused by problems in StdMeshers_Sweeper
2399 //=======================================================================
2401 bool StdMeshers_Prism_3D::isSimpleBottom( const Prism_3D::TPrismTopo& thePrism )
2403 if ( thePrism.myBottomEdges.size() != 4 )
2406 // analyse angles between edges
2407 double nbConcaveAng = 0, nbConvexAng = 0;
2408 TopoDS_Face reverseBottom = TopoDS::Face( thePrism.myBottom.Reversed() ); // see initPrism()
2409 TopoDS_Vertex commonV;
2410 const list< TopoDS_Edge >& botEdges = thePrism.myBottomEdges;
2411 list< TopoDS_Edge >::const_iterator edge = botEdges.begin();
2412 while ( edge != botEdges.end() )
2414 if ( SMESH_Algo::isDegenerated( *edge ))
2416 TopoDS_Edge e1 = *edge++;
2417 TopoDS_Edge e2 = ( edge == botEdges.end() ? botEdges.front() : *edge );
2418 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2420 e2 = botEdges.front();
2421 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2424 double angle = myHelper->GetAngle( e1, e2, reverseBottom, commonV );
2425 if ( angle < -5 * M_PI/180 )
2426 if ( ++nbConcaveAng > 1 )
2428 if ( angle > 85 * M_PI/180 )
2429 if ( ++nbConvexAng > 4 )
2435 //=======================================================================
2436 //function : project2dMesh
2437 //purpose : Project mesh faces from a source FACE of one prism (theSrcFace)
2438 // to a source FACE of another prism (theTgtFace)
2439 //=======================================================================
2441 bool StdMeshers_Prism_3D::project2dMesh(const TopoDS_Face& theSrcFace,
2442 const TopoDS_Face& theTgtFace)
2444 TProjction2dAlgo* projector2D = TProjction2dAlgo::instance( this );
2445 projector2D->myHyp.SetSourceFace( theSrcFace );
2446 bool ok = projector2D->Compute( *myHelper->GetMesh(), theTgtFace );
2448 SMESH_subMesh* tgtSM = myHelper->GetMesh()->GetSubMesh( theTgtFace );
2449 if ( !ok && tgtSM->GetSubMeshDS() ) {
2450 //tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2451 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2452 SMESHDS_SubMesh* tgtSMDS = tgtSM->GetSubMeshDS();
2453 for ( SMDS_ElemIteratorPtr eIt = tgtSMDS->GetElements(); eIt->more(); )
2454 meshDS->RemoveFreeElement( eIt->next(), tgtSMDS, /*fromGroups=*/false );
2455 for ( SMDS_NodeIteratorPtr nIt = tgtSMDS->GetNodes(); nIt->more(); )
2456 meshDS->RemoveFreeNode( nIt->next(), tgtSMDS, /*fromGroups=*/false );
2458 tgtSM->ComputeStateEngine ( SMESH_subMesh::CHECK_COMPUTE_STATE );
2459 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
2461 projector2D->SetEventListener( tgtSM );
2466 //================================================================================
2468 * \brief Set projection coordinates of a node to a face and it's sub-shapes
2469 * \param faceID - the face given by in-block ID
2470 * \param params - node normalized parameters
2471 * \retval bool - is a success
2473 //================================================================================
2475 bool StdMeshers_Prism_3D::setFaceAndEdgesXYZ( const int faceID, const gp_XYZ& params, int z )
2477 // find base and top edges of the face
2478 enum { BASE = 0, TOP, LEFT, RIGHT };
2479 vector< int > edgeVec; // 0-base, 1-top
2480 SMESH_Block::GetFaceEdgesIDs( faceID, edgeVec );
2482 myBlock.EdgePoint( edgeVec[ BASE ], params, myShapeXYZ[ edgeVec[ BASE ]]);
2483 myBlock.EdgePoint( edgeVec[ TOP ], params, myShapeXYZ[ edgeVec[ TOP ]]);
2485 SHOWYXZ("\nparams ", params);
2486 SHOWYXZ("TOP is " <<edgeVec[ TOP ], myShapeXYZ[ edgeVec[ TOP]]);
2487 SHOWYXZ("BASE is "<<edgeVec[ BASE], myShapeXYZ[ edgeVec[ BASE]]);
2489 if ( faceID == SMESH_Block::ID_Fx0z || faceID == SMESH_Block::ID_Fx1z )
2491 myBlock.EdgePoint( edgeVec[ LEFT ], params, myShapeXYZ[ edgeVec[ LEFT ]]);
2492 myBlock.EdgePoint( edgeVec[ RIGHT ], params, myShapeXYZ[ edgeVec[ RIGHT ]]);
2494 SHOWYXZ("VER "<<edgeVec[ LEFT], myShapeXYZ[ edgeVec[ LEFT]]);
2495 SHOWYXZ("VER "<<edgeVec[ RIGHT], myShapeXYZ[ edgeVec[ RIGHT]]);
2497 myBlock.FacePoint( faceID, params, myShapeXYZ[ faceID ]);
2498 SHOWYXZ("FacePoint "<<faceID, myShapeXYZ[ faceID]);
2503 //=======================================================================
2505 //purpose : If (!isOK), sets the error to a sub-mesh of a current SOLID
2506 //=======================================================================
2508 bool StdMeshers_Prism_3D::toSM( bool isOK )
2510 if ( mySetErrorToSM &&
2513 !myHelper->GetSubShape().IsNull() &&
2514 myHelper->GetSubShape().ShapeType() == TopAbs_SOLID)
2516 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( myHelper->GetSubShape() );
2517 sm->GetComputeError() = this->GetComputeError();
2518 // clear error in order not to return it twice
2519 _error = COMPERR_OK;
2525 //=======================================================================
2526 //function : shapeID
2527 //purpose : Return index of a shape
2528 //=======================================================================
2530 int StdMeshers_Prism_3D::shapeID( const TopoDS_Shape& S )
2532 if ( S.IsNull() ) return 0;
2533 if ( !myHelper ) return -3;
2534 return myHelper->GetMeshDS()->ShapeToIndex( S );
2537 namespace // utils used by StdMeshers_Prism_3D::IsApplicable()
2539 struct EdgeWithNeighbors
2542 int _iBase; /* index in a WIRE with non-base EDGEs excluded */
2543 int _iL, _iR; /* used to connect edges in a base FACE */
2544 bool _isBase; /* is used in a base FACE */
2545 EdgeWithNeighbors(const TopoDS_Edge& E, int iE, int nbE, int shift, bool isBase ):
2546 _edge( E ), _iBase( iE + shift ),
2547 _iL( SMESH_MesherHelper::WrapIndex( iE-1, Max( 1, nbE )) + shift ),
2548 _iR( SMESH_MesherHelper::WrapIndex( iE+1, Max( 1, nbE )) + shift ),
2552 EdgeWithNeighbors() {}
2553 bool IsInternal() const { return !_edge.IsNull() && _edge.Orientation() == TopAbs_INTERNAL; }
2555 // PrismSide contains all FACEs linking a bottom EDGE with a top one.
2558 TopoDS_Face _face; // a currently treated upper FACE
2559 TopTools_IndexedMapOfShape *_faces; // all FACEs (pointer because of a private copy constructor)
2560 TopoDS_Edge _topEdge; // a current top EDGE
2561 vector< EdgeWithNeighbors >*_edges; // all EDGEs of _face
2562 int _iBotEdge; // index of _topEdge within _edges
2563 vector< bool > _isCheckedEdge; // mark EDGEs whose two owner FACEs found
2564 int _nbCheckedEdges; // nb of EDGEs whose location is defined
2565 PrismSide *_leftSide; // neighbor sides
2566 PrismSide *_rightSide;
2567 bool _isInternal; // whether this side raises from an INTERNAL EDGE
2568 void SetExcluded() { _leftSide = _rightSide = NULL; }
2569 bool IsExcluded() const { return !_leftSide; }
2570 const TopoDS_Edge& Edge( int i ) const
2572 return (*_edges)[ i ]._edge;
2574 int FindEdge( const TopoDS_Edge& E ) const
2576 for ( size_t i = 0; i < _edges->size(); ++i )
2577 if ( E.IsSame( Edge( i ))) return i;
2580 bool IsSideFace( const TopoDS_Shape& face, const bool checkNeighbors ) const
2582 if ( _faces->Contains( face )) // avoid returning true for a prism top FACE
2583 return ( !_face.IsNull() || !( face.IsSame( _faces->FindKey( _faces->Extent() ))));
2585 if ( checkNeighbors )
2586 return (( _leftSide && _leftSide->IsSideFace ( face, false )) ||
2587 ( _rightSide && _rightSide->IsSideFace( face, false )));
2592 //--------------------------------------------------------------------------------
2594 * \brief Return another faces sharing an edge
2596 const TopoDS_Face & getAnotherFace( const TopoDS_Face& face,
2597 const TopoDS_Edge& edge,
2598 TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge)
2600 TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edge ));
2601 for ( ; faceIt.More(); faceIt.Next() )
2602 if ( !face.IsSame( faceIt.Value() ))
2603 return TopoDS::Face( faceIt.Value() );
2607 //--------------------------------------------------------------------------------
2609 * \brief Return ordered edges of a face
2611 bool getEdges( const TopoDS_Face& face,
2612 vector< EdgeWithNeighbors > & edges,
2613 TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge,
2614 const bool noHolesAllowed)
2616 TopoDS_Face f = face;
2617 if ( f.Orientation() != TopAbs_FORWARD &&
2618 f.Orientation() != TopAbs_REVERSED )
2619 f.Orientation( TopAbs_FORWARD );
2620 list< TopoDS_Edge > ee;
2621 list< int > nbEdgesInWires;
2622 int nbW = SMESH_Block::GetOrderedEdges( f, ee, nbEdgesInWires );
2623 if ( nbW > 1 && noHolesAllowed )
2626 int iE, nbTot = 0, nbBase, iBase;
2627 list< TopoDS_Edge >::iterator e = ee.begin();
2628 list< int >::iterator nbE = nbEdgesInWires.begin();
2629 for ( ; nbE != nbEdgesInWires.end(); ++nbE )
2630 for ( iE = 0; iE < *nbE; ++e, ++iE )
2631 if ( SMESH_Algo::isDegenerated( *e )) // degenerated EDGE is never used
2633 e = --ee.erase( e );
2641 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2644 isBase.resize( *nbE );
2645 list< TopoDS_Edge >::iterator eIt = e;
2646 for ( iE = 0; iE < *nbE; ++eIt, ++iE )
2648 isBase[ iE ] = ( getAnotherFace( face, *eIt, facesOfEdge ) != face );
2649 nbBase += isBase[ iE ];
2651 for ( iBase = 0, iE = 0; iE < *nbE; ++e, ++iE )
2653 edges.push_back( EdgeWithNeighbors( *e, iBase, nbBase, nbTot, isBase[ iE ] ));
2654 iBase += isBase[ iE ];
2661 // IPAL53099. Set correct neighbors to INTERNAL EDGEs, which can be connected to
2662 // EDGEs of the outer WIRE but this fact can't be detected by their order.
2665 int iFirst = 0, iLast;
2666 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2668 iLast = iFirst + *nbE - 1;
2669 TopoDS_Vertex vv[2] = { SMESH_MesherHelper::IthVertex( 0, edges[ iFirst ]._edge ),
2670 SMESH_MesherHelper::IthVertex( 1, edges[ iLast ]._edge ) };
2671 bool isConnectOk = ( vv[0].IsSame( vv[1] ));
2674 edges[ iFirst ]._iL = edges[ iFirst ]._iBase; // connect to self
2675 edges[ iLast ]._iR = edges[ iLast ]._iBase;
2677 // look for an EDGE of the outer WIREs connected to vv
2678 TopoDS_Vertex v0, v1;
2679 for ( iE = 0; iE < iFirst; ++iE )
2681 v0 = SMESH_MesherHelper::IthVertex( 0, edges[ iE ]._edge );
2682 v1 = SMESH_MesherHelper::IthVertex( 1, edges[ iE ]._edge );
2683 if ( vv[0].IsSame( v0 ) || vv[0].IsSame( v1 ))
2684 edges[ iFirst ]._iL = edges[ iE ]._iBase;
2685 if ( vv[1].IsSame( v0 ) || vv[1].IsSame( v1 ))
2686 edges[ iLast ]._iR = edges[ iE ]._iBase;
2692 return edges.size();
2695 //--------------------------------------------------------------------------------
2697 * \brief Return number of faces sharing given edges
2699 // int nbAdjacentFaces( const std::vector< EdgeWithNeighbors >& edges,
2700 // const TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge )
2702 // TopTools_MapOfShape adjFaces;
2704 // for ( size_t i = 0; i < edges.size(); ++i )
2706 // TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edges[i]._edge ));
2707 // for ( ; faceIt.More(); faceIt.Next() )
2708 // adjFaces.Add( faceIt.Value() );
2710 // return adjFaces.Extent();
2714 //================================================================================
2716 * \brief Return true if the algorithm can mesh this shape
2717 * \param [in] aShape - shape to check
2718 * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
2719 * else, returns OK if at least one shape is OK
2721 //================================================================================
2723 bool StdMeshers_Prism_3D::IsApplicable(const TopoDS_Shape & shape, bool toCheckAll)
2725 TopExp_Explorer sExp( shape, TopAbs_SOLID );
2729 for ( ; sExp.More(); sExp.Next() )
2733 TopExp_Explorer shExp( sExp.Current(), TopAbs_SHELL );
2734 while ( shExp.More() ) {
2735 shell = shExp.Current();
2737 if ( shExp.More() && BRep_Tool::IsClosed( shExp.Current() ))
2740 if ( shell.IsNull() ) {
2741 if ( toCheckAll ) return false;
2745 TopTools_IndexedMapOfShape allFaces;
2746 TopExp::MapShapes( sExp.Current(), TopAbs_FACE, allFaces );
2747 if ( allFaces.Extent() < 3 ) {
2748 if ( toCheckAll ) return false;
2752 if ( allFaces.Extent() == 6 )
2754 TopTools_IndexedMapOfOrientedShape map;
2755 bool isBox = SMESH_Block::FindBlockShapes( TopoDS::Shell( shell ),
2756 TopoDS_Vertex(), TopoDS_Vertex(), map );
2758 if ( !toCheckAll ) return true;
2763 TopTools_IndexedMapOfShape allShapes; // usage: allShapes.FindIndex( s )
2764 TopExp::MapShapes( shape, allShapes );
2767 TopTools_IndexedDataMapOfShapeListOfShape facesOfEdge;
2768 TopTools_ListIteratorOfListOfShape faceIt;
2769 TopExp::MapShapesAndAncestors( sExp.Current(), TopAbs_EDGE, TopAbs_FACE , facesOfEdge );
2770 if ( facesOfEdge.IsEmpty() ) {
2771 if ( toCheckAll ) return false;
2775 typedef vector< EdgeWithNeighbors > TEdgeWithNeighborsVec;
2776 vector< TEdgeWithNeighborsVec > faceEdgesVec( allFaces.Extent() + 1 );
2777 const size_t nbEdgesMax = facesOfEdge.Extent() * 2; // there can be seam EDGEs
2778 TopTools_IndexedMapOfShape* facesOfSide = new TopTools_IndexedMapOfShape[ nbEdgesMax ];
2779 SMESHUtils::ArrayDeleter<TopTools_IndexedMapOfShape> delFacesOfSide( facesOfSide );
2781 // try to use each face as a bottom one
2782 bool prismDetected = false;
2783 vector< PrismSide > sides;
2784 for ( int iF = 1; iF < allFaces.Extent() && !prismDetected; ++iF )
2786 const TopoDS_Face& botF = TopoDS::Face( allFaces( iF ));
2788 TEdgeWithNeighborsVec& botEdges = faceEdgesVec[ iF ];
2789 if ( botEdges.empty() )
2790 if ( !getEdges( botF, botEdges, facesOfEdge, /*noHoles=*/false ))
2794 for ( size_t iS = 0; iS < botEdges.size(); ++iS )
2795 nbBase += botEdges[ iS ]._isBase;
2797 if ( allFaces.Extent()-1 <= nbBase )
2798 continue; // all faces are adjacent to botF - no top FACE
2800 // init data of side FACEs
2802 sides.resize( nbBase );
2804 for ( size_t iE = 0; iE < botEdges.size(); ++iE )
2806 if ( !botEdges[ iE ]._isBase )
2808 sides[ iS ]._topEdge = botEdges[ iE ]._edge;
2809 sides[ iS ]._face = botF;
2810 sides[ iS ]._leftSide = & sides[ botEdges[ iE ]._iR ];
2811 sides[ iS ]._rightSide = & sides[ botEdges[ iE ]._iL ];
2812 sides[ iS ]._isInternal = botEdges[ iE ].IsInternal();
2813 sides[ iS ]._faces = & facesOfSide[ iS ];
2814 sides[ iS ]._faces->Clear();
2818 bool isOK = true; // ok for a current botF
2819 bool isAdvanced = true; // is new data found in a current loop
2820 int nbFoundSideFaces = 0;
2821 for ( int iLoop = 0; isOK && isAdvanced; ++iLoop )
2824 for ( size_t iS = 0; iS < sides.size() && isOK; ++iS )
2826 PrismSide& side = sides[ iS ];
2827 if ( side._face.IsNull() )
2828 continue; // probably the prism top face is the last of side._faces
2830 if ( side._topEdge.IsNull() )
2832 // find vertical EDGEs --- EGDEs shared with neighbor side FACEs
2833 for ( int is2nd = 0; is2nd < 2 && isOK; ++is2nd ) // 2 adjacent neighbors
2835 int di = is2nd ? 1 : -1;
2836 const PrismSide* adjSide = is2nd ? side._rightSide : side._leftSide;
2837 for ( size_t i = 1; i < side._edges->size(); ++i )
2839 int iE = SMESH_MesherHelper::WrapIndex( i*di + side._iBotEdge, side._edges->size());
2840 if ( side._isCheckedEdge[ iE ] ) continue;
2841 const TopoDS_Edge& vertE = side.Edge( iE );
2842 const TopoDS_Shape& neighborF = getAnotherFace( side._face, vertE, facesOfEdge );
2843 bool isEdgeShared = (( adjSide->IsSideFace( neighborF, side._isInternal )) ||
2844 ( adjSide == &side && neighborF.IsSame( side._face )) );
2845 if ( isEdgeShared ) // vertE is shared with adjSide
2848 side._isCheckedEdge[ iE ] = true;
2849 side._nbCheckedEdges++;
2850 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
2851 if ( nbNotCheckedE == 1 )
2856 if ( i == 1 && iLoop == 0 ) isOK = false;
2862 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
2863 if ( nbNotCheckedE == 1 )
2865 vector<bool>::iterator ii = std::find( side._isCheckedEdge.begin(),
2866 side._isCheckedEdge.end(), false );
2867 if ( ii != side._isCheckedEdge.end() )
2869 size_t iE = std::distance( side._isCheckedEdge.begin(), ii );
2870 side._topEdge = side.Edge( iE );
2873 isOK = ( nbNotCheckedE >= 1 );
2875 else //if ( !side._topEdge.IsNull() )
2877 // get a next face of a side
2878 const TopoDS_Shape& f = getAnotherFace( side._face, side._topEdge, facesOfEdge );
2879 side._faces->Add( f );
2881 if ( f.IsSame( side._face ) || // _topEdge is a seam
2882 SMESH_MesherHelper::Count( f, TopAbs_WIRE, false ) != 1 )
2886 else if ( side._leftSide != & side && // not closed side face
2887 side._leftSide->_faces->Contains( f ))
2889 stop = true; // probably f is the prism top face
2890 side._leftSide->_face.Nullify();
2891 side._leftSide->_topEdge.Nullify();
2893 else if ( side._rightSide != & side &&
2894 side._rightSide->_faces->Contains( f ))
2896 stop = true; // probably f is the prism top face
2897 side._rightSide->_face.Nullify();
2898 side._rightSide->_topEdge.Nullify();
2902 side._face.Nullify();
2903 side._topEdge.Nullify();
2906 side._face = TopoDS::Face( f );
2907 int faceID = allFaces.FindIndex( side._face );
2908 side._edges = & faceEdgesVec[ faceID ];
2909 if ( side._edges->empty() )
2910 if ( !getEdges( side._face, * side._edges, facesOfEdge, /*noHoles=*/true ))
2912 const int nbE = side._edges->size();
2917 side._iBotEdge = side.FindEdge( side._topEdge );
2918 side._isCheckedEdge.clear();
2919 side._isCheckedEdge.resize( nbE, false );
2920 side._isCheckedEdge[ side._iBotEdge ] = true;
2921 side._nbCheckedEdges = 1; // bottom EDGE is known
2923 else // probably a triangular top face found
2925 side._face.Nullify();
2927 side._topEdge.Nullify();
2928 isOK = ( !side._edges->empty() || side._faces->Extent() > 1 );
2930 } //if ( !side._topEdge.IsNull() )
2932 } // loop on prism sides
2934 if ( nbFoundSideFaces > allFaces.Extent() )
2938 if ( iLoop > allFaces.Extent() * 10 )
2942 cerr << "BUG: infinite loop in StdMeshers_Prism_3D::IsApplicable()" << endl;
2945 } // while isAdvanced
2947 if ( isOK && sides[0]._faces->Extent() > 1 )
2949 const int nbFaces = sides[0]._faces->Extent();
2950 if ( botEdges.size() == 1 ) // cylinder
2952 prismDetected = ( nbFaces == allFaces.Extent()-1 );
2956 const TopoDS_Shape& topFace = sides[0]._faces->FindKey( nbFaces );
2958 for ( iS = 1; iS < sides.size(); ++iS )
2959 if ( ! sides[ iS ]._faces->Contains( topFace ))
2961 prismDetected = ( iS == sides.size() );
2964 } // loop on allFaces
2966 if ( !prismDetected && toCheckAll ) return false;
2967 if ( prismDetected && !toCheckAll ) return true;
2976 //================================================================================
2978 * \brief Return true if this node and other one belong to one face
2980 //================================================================================
2982 bool Prism_3D::TNode::IsNeighbor( const Prism_3D::TNode& other ) const
2984 if ( !other.myNode || !myNode ) return false;
2986 SMDS_ElemIteratorPtr fIt = other.myNode->GetInverseElementIterator(SMDSAbs_Face);
2987 while ( fIt->more() )
2988 if ( fIt->next()->GetNodeIndex( myNode ) >= 0 )
2993 //================================================================================
2995 * \brief Prism initialization
2997 //================================================================================
2999 void TPrismTopo::Clear()
3001 myShape3D.Nullify();
3004 myWallQuads.clear();
3005 myBottomEdges.clear();
3006 myNbEdgesInWires.clear();
3007 myWallQuads.clear();
3010 //================================================================================
3012 * \brief Set upside-down
3014 //================================================================================
3016 void TPrismTopo::SetUpsideDown()
3018 std::swap( myBottom, myTop );
3019 myBottomEdges.clear();
3020 std::reverse( myBottomEdges.begin(), myBottomEdges.end() );
3021 for ( size_t i = 0; i < myWallQuads.size(); ++i )
3023 myWallQuads[i].reverse();
3024 TQuadList::iterator q = myWallQuads[i].begin();
3025 for ( ; q != myWallQuads[i].end(); ++q )
3027 (*q)->shift( 2, /*keepUnitOri=*/true );
3029 myBottomEdges.push_back( myWallQuads[i].front()->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0) );
3033 } // namespace Prism_3D
3035 //================================================================================
3037 * \brief Constructor. Initialization is needed
3039 //================================================================================
3041 StdMeshers_PrismAsBlock::StdMeshers_PrismAsBlock()
3046 StdMeshers_PrismAsBlock::~StdMeshers_PrismAsBlock()
3050 void StdMeshers_PrismAsBlock::Clear()
3053 myShapeIDMap.Clear();
3057 delete mySide; mySide = 0;
3059 myParam2ColumnMaps.clear();
3060 myShapeIndex2ColumnMap.clear();
3063 //=======================================================================
3064 //function : initPrism
3065 //purpose : Analyse shape geometry and mesh.
3066 // If there are triangles on one of faces, it becomes 'bottom'.
3067 // thePrism.myBottom can be already set up.
3068 //=======================================================================
3070 bool StdMeshers_Prism_3D::initPrism(Prism_3D::TPrismTopo& thePrism,
3071 const TopoDS_Shape& theShape3D,
3072 const bool selectBottom)
3074 myHelper->SetSubShape( theShape3D );
3076 SMESH_subMesh* mainSubMesh = myHelper->GetMesh()->GetSubMeshContaining( theShape3D );
3077 if ( !mainSubMesh ) return toSM( error(COMPERR_BAD_INPUT_MESH,"Null submesh of shape3D"));
3079 // detect not-quad FACE sub-meshes of the 3D SHAPE
3080 list< SMESH_subMesh* > notQuadGeomSubMesh;
3081 list< SMESH_subMesh* > notQuadElemSubMesh;
3082 list< SMESH_subMesh* > meshedSubMesh;
3085 SMESH_subMeshIteratorPtr smIt = mainSubMesh->getDependsOnIterator(false,true);
3086 while ( smIt->more() )
3088 SMESH_subMesh* sm = smIt->next();
3089 const TopoDS_Shape& face = sm->GetSubShape();
3090 if ( face.ShapeType() > TopAbs_FACE ) break;
3091 else if ( face.ShapeType() < TopAbs_FACE ) continue;
3094 // is quadrangle FACE?
3095 list< TopoDS_Edge > orderedEdges;
3096 list< int > nbEdgesInWires;
3097 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( face ), orderedEdges,
3099 if ( nbWires != 1 || nbEdgesInWires.front() != 4 )
3100 notQuadGeomSubMesh.push_back( sm );
3102 // look for a not structured sub-mesh
3103 if ( !sm->IsEmpty() )
3105 meshedSubMesh.push_back( sm );
3106 if ( !myHelper->IsSameElemGeometry( sm->GetSubMeshDS(), SMDSGeom_QUADRANGLE ) ||
3107 !myHelper->IsStructured ( sm ))
3108 notQuadElemSubMesh.push_back( sm );
3112 int nbNotQuadMeshed = notQuadElemSubMesh.size();
3113 int nbNotQuad = notQuadGeomSubMesh.size();
3114 bool hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3117 if ( nbNotQuadMeshed > 2 )
3119 return toSM( error(COMPERR_BAD_INPUT_MESH,
3120 TCom("More than 2 faces with not quadrangle elements: ")
3121 <<nbNotQuadMeshed));
3123 if ( nbNotQuad > 2 || !thePrism.myBottom.IsNull() )
3125 // Issue 0020843 - one of side FACEs is quasi-quadrilateral (not 4 EDGEs).
3126 // Remove from notQuadGeomSubMesh faces meshed with regular grid
3127 int nbQuasiQuads = removeQuasiQuads( notQuadGeomSubMesh, myHelper,
3128 TQuadrangleAlgo::instance(this,myHelper) );
3129 nbNotQuad -= nbQuasiQuads;
3130 if ( nbNotQuad > 2 )
3131 return toSM( error(COMPERR_BAD_SHAPE,
3132 TCom("More than 2 not quadrilateral faces: ") <<nbNotQuad));
3133 hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3136 // Analyse mesh and topology of FACEs: choose the bottom sub-mesh.
3137 // If there are not quadrangle FACEs, they are top and bottom ones.
3138 // Not quadrangle FACEs must be only on top and bottom.
3140 SMESH_subMesh * botSM = 0;
3141 SMESH_subMesh * topSM = 0;
3143 if ( hasNotQuad ) // can choose a bottom FACE
3145 if ( nbNotQuadMeshed > 0 ) botSM = notQuadElemSubMesh.front();
3146 else botSM = notQuadGeomSubMesh.front();
3147 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.back();
3148 else if ( nbNotQuad > 1 ) topSM = notQuadGeomSubMesh.back();
3150 if ( topSM == botSM ) {
3151 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.front();
3152 else topSM = notQuadGeomSubMesh.front();
3155 // detect mesh triangles on wall FACEs
3156 if ( nbNotQuad == 2 && nbNotQuadMeshed > 0 ) {
3158 if ( nbNotQuadMeshed == 1 )
3159 ok = ( find( notQuadGeomSubMesh.begin(),
3160 notQuadGeomSubMesh.end(), botSM ) != notQuadGeomSubMesh.end() );
3162 ok = ( notQuadGeomSubMesh == notQuadElemSubMesh );
3164 return toSM( error(COMPERR_BAD_INPUT_MESH,
3165 "Side face meshed with not quadrangle elements"));
3169 thePrism.myNotQuadOnTop = ( nbNotQuadMeshed > 1 );
3171 // use thePrism.myBottom
3172 if ( !thePrism.myBottom.IsNull() )
3174 if ( botSM ) { // <-- not quad geom or mesh on botSM
3175 if ( ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3176 std::swap( botSM, topSM );
3177 if ( !botSM || ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3178 if ( !selectBottom )
3179 return toSM( error( COMPERR_BAD_INPUT_MESH,
3180 "Incompatible non-structured sub-meshes"));
3181 std::swap( botSM, topSM );
3182 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3186 else if ( !selectBottom ) {
3187 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3190 if ( !botSM ) // find a proper bottom
3192 bool savedSetErrorToSM = mySetErrorToSM;
3193 mySetErrorToSM = false; // ingore errors in initPrism()
3195 // search among meshed FACEs
3196 list< SMESH_subMesh* >::iterator sm = meshedSubMesh.begin();
3197 for ( ; !botSM && sm != meshedSubMesh.end(); ++sm )
3201 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3202 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3205 // search among all FACEs
3206 for ( TopExp_Explorer f( theShape3D, TopAbs_FACE ); !botSM && f.More(); f.Next() )
3208 int minNbFaces = 2 + myHelper->Count( f.Current(), TopAbs_EDGE, false);
3209 if ( nbFaces < minNbFaces) continue;
3211 thePrism.myBottom = TopoDS::Face( f.Current() );
3212 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3213 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3216 mySetErrorToSM = savedSetErrorToSM;
3217 return botSM ? true : toSM( error( COMPERR_BAD_SHAPE ));
3220 // find vertex 000 - the one with smallest coordinates (for easy DEBUG :-)
3222 double minVal = DBL_MAX, minX = 0, val;
3223 for ( TopExp_Explorer exp( botSM->GetSubShape(), TopAbs_VERTEX );
3224 exp.More(); exp.Next() )
3226 const TopoDS_Vertex& v = TopoDS::Vertex( exp.Current() );
3227 gp_Pnt P = BRep_Tool::Pnt( v );
3228 val = P.X() + P.Y() + P.Z();
3229 if ( val < minVal || ( val == minVal && P.X() < minX )) {
3236 thePrism.myShape3D = theShape3D;
3237 if ( thePrism.myBottom.IsNull() )
3238 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3239 thePrism.myBottom.Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myBottom ));
3240 thePrism.myTop. Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myTop ));
3242 // Get ordered bottom edges
3243 TopoDS_Face reverseBottom = // to have order of top EDGEs as in the top FACE
3244 TopoDS::Face( thePrism.myBottom.Reversed() );
3245 SMESH_Block::GetOrderedEdges( reverseBottom,
3246 thePrism.myBottomEdges,
3247 thePrism.myNbEdgesInWires, V000 );
3249 // Get Wall faces corresponding to the ordered bottom edges and the top FACE
3250 if ( !getWallFaces( thePrism, nbFaces )) // it also sets thePrism.myTop
3251 return false; //toSM( error(COMPERR_BAD_SHAPE, "Can't find side faces"));
3255 if ( !thePrism.myTop.IsSame( topSM->GetSubShape() ))
3257 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3258 "Non-quadrilateral faces are not opposite"));
3260 // check that the found top and bottom FACEs are opposite
3261 list< TopoDS_Edge >::iterator edge = thePrism.myBottomEdges.begin();
3262 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
3263 if ( myHelper->IsSubShape( *edge, thePrism.myTop ))
3265 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3266 "Non-quadrilateral faces are not opposite"));
3269 if ( thePrism.myBottomEdges.size() > thePrism.myWallQuads.size() )
3271 // composite bottom sides => set thePrism upside-down
3272 thePrism.SetUpsideDown();
3278 //================================================================================
3280 * \brief Initialization.
3281 * \param helper - helper loaded with mesh and 3D shape
3282 * \param thePrism - a prism data
3283 * \retval bool - false if a mesh or a shape are KO
3285 //================================================================================
3287 bool StdMeshers_PrismAsBlock::Init(SMESH_MesherHelper* helper,
3288 const Prism_3D::TPrismTopo& thePrism)
3291 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3292 SMESH_Mesh* mesh = myHelper->GetMesh();
3295 delete mySide; mySide = 0;
3297 vector< TSideFace* > sideFaces( NB_WALL_FACES, 0 );
3298 vector< pair< double, double> > params( NB_WALL_FACES );
3299 mySide = new TSideFace( *mesh, sideFaces, params );
3302 SMESH_Block::init();
3303 myShapeIDMap.Clear();
3304 myShapeIndex2ColumnMap.clear();
3306 int wallFaceIds[ NB_WALL_FACES ] = { // to walk around a block
3307 SMESH_Block::ID_Fx0z, SMESH_Block::ID_F1yz,
3308 SMESH_Block::ID_Fx1z, SMESH_Block::ID_F0yz
3311 myError = SMESH_ComputeError::New();
3313 myNotQuadOnTop = thePrism.myNotQuadOnTop;
3315 // Find columns of wall nodes and calculate edges' lengths
3316 // --------------------------------------------------------
3318 myParam2ColumnMaps.clear();
3319 myParam2ColumnMaps.resize( thePrism.myBottomEdges.size() ); // total nb edges
3321 size_t iE, nbEdges = thePrism.myNbEdgesInWires.front(); // nb outer edges
3322 vector< double > edgeLength( nbEdges );
3323 multimap< double, int > len2edgeMap;
3325 // for each EDGE: either split into several parts, or join with several next EDGEs
3326 vector<int> nbSplitPerEdge( nbEdges, 0 );
3327 vector<int> nbUnitePerEdge( nbEdges, 0 ); // -1 means "joined to a previous"
3329 // consider continuous straight EDGEs as one side
3330 const int nbSides = countNbSides( thePrism, nbUnitePerEdge, edgeLength );
3332 list< TopoDS_Edge >::const_iterator edgeIt = thePrism.myBottomEdges.begin();
3333 for ( iE = 0; iE < nbEdges; ++iE, ++edgeIt )
3335 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3337 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3338 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3340 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3341 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3342 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3343 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3345 SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3346 SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3347 SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3349 if ( nbSides < NB_WALL_FACES ) // fill map used to split faces
3350 len2edgeMap.insert( make_pair( edgeLength[ iE ], iE )); // sort edges by length
3352 // Load columns of internal edges (forming holes)
3353 // and fill map ShapeIndex to TParam2ColumnMap for them
3354 for ( ; edgeIt != thePrism.myBottomEdges.end() ; ++edgeIt, ++iE )
3356 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3358 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3359 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3361 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3362 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3363 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3364 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3366 if ( !faceColumns.empty() && (int)faceColumns.begin()->second.size() != VerticalSize() )
3367 return error(COMPERR_BAD_INPUT_MESH, "Different 'vertical' discretization");
3370 int id = MeshDS()->ShapeToIndex( *edgeIt );
3371 bool isForward = true; // meaningless for intenal wires
3372 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3373 // columns for vertices
3375 const SMDS_MeshNode* n0 = faceColumns.begin()->second.front();
3376 id = n0->getshapeId();
3377 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3379 const SMDS_MeshNode* n1 = faceColumns.rbegin()->second.front();
3380 id = n1->getshapeId();
3381 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3383 // SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3384 // SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3385 // SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3388 // Create 4 wall faces of a block
3389 // -------------------------------
3391 if ( nbSides <= NB_WALL_FACES ) // ************* Split faces if necessary
3393 if ( nbSides != NB_WALL_FACES ) // define how to split
3395 if ( len2edgeMap.size() != nbEdges )
3396 RETURN_BAD_RESULT("Uniqueness of edge lengths not assured");
3398 multimap< double, int >::reverse_iterator maxLen_i = len2edgeMap.rbegin();
3399 multimap< double, int >::reverse_iterator midLen_i = ++len2edgeMap.rbegin();
3401 double maxLen = maxLen_i->first;
3402 double midLen = ( len2edgeMap.size() == 1 ) ? 0 : midLen_i->first;
3403 switch ( nbEdges ) {
3404 case 1: // 0-th edge is split into 4 parts
3405 nbSplitPerEdge[ 0 ] = 4;
3407 case 2: // either the longest edge is split into 3 parts, or both edges into halves
3408 if ( maxLen / 3 > midLen / 2 ) {
3409 nbSplitPerEdge[ maxLen_i->second ] = 3;
3412 nbSplitPerEdge[ maxLen_i->second ] = 2;
3413 nbSplitPerEdge[ midLen_i->second ] = 2;
3418 // split longest into 3 parts
3419 nbSplitPerEdge[ maxLen_i->second ] = 3;
3421 // split longest into halves
3422 nbSplitPerEdge[ maxLen_i->second ] = 2;
3426 else // **************************** Unite faces
3428 int nbExraFaces = nbSides - 4; // nb of faces to fuse
3429 for ( iE = 0; iE < nbEdges; ++iE )
3431 if ( nbUnitePerEdge[ iE ] < 0 )
3433 // look for already united faces
3434 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3436 if ( nbUnitePerEdge[ i ] > 0 ) // a side including nbUnitePerEdge[i]+1 edge
3437 nbExraFaces += nbUnitePerEdge[ i ];
3438 nbUnitePerEdge[ i ] = -1;
3440 nbUnitePerEdge[ iE ] = nbExraFaces;
3445 // Create TSideFace's
3447 list< TopoDS_Edge >::const_iterator botE = thePrism.myBottomEdges.begin();
3448 for ( iE = 0; iE < nbEdges; ++iE, ++botE )
3450 TFaceQuadStructPtr quad = thePrism.myWallQuads[ iE ].front();
3451 const int nbSplit = nbSplitPerEdge[ iE ];
3452 const int nbExraFaces = nbUnitePerEdge[ iE ] + 1;
3453 if ( nbSplit > 0 ) // split
3455 vector< double > params;
3456 splitParams( nbSplit, &myParam2ColumnMaps[ iE ], params );
3457 const bool isForward =
3458 StdMeshers_PrismAsBlock::IsForwardEdge( myHelper->GetMeshDS(),
3459 myParam2ColumnMaps[iE],
3460 *botE, SMESH_Block::ID_Fx0z );
3461 for ( int i = 0; i < nbSplit; ++i ) {
3462 double f = ( isForward ? params[ i ] : params[ nbSplit - i-1 ]);
3463 double l = ( isForward ? params[ i+1 ] : params[ nbSplit - i ]);
3464 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3465 thePrism.myWallQuads[ iE ], *botE,
3466 &myParam2ColumnMaps[ iE ], f, l );
3467 mySide->SetComponent( iSide++, comp );
3470 else if ( nbExraFaces > 1 ) // unite
3472 double u0 = 0, sumLen = 0;
3473 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3474 sumLen += edgeLength[ i ];
3476 vector< TSideFace* > components( nbExraFaces );
3477 vector< pair< double, double> > params( nbExraFaces );
3478 bool endReached = false;
3479 for ( int i = 0; i < nbExraFaces; ++i, ++botE, ++iE )
3481 if ( iE == nbEdges )
3484 botE = thePrism.myBottomEdges.begin();
3487 components[ i ] = new TSideFace( *mesh, wallFaceIds[ iSide ],
3488 thePrism.myWallQuads[ iE ], *botE,
3489 &myParam2ColumnMaps[ iE ]);
3490 double u1 = u0 + edgeLength[ iE ] / sumLen;
3491 params[ i ] = make_pair( u0 , u1 );
3494 TSideFace* comp = new TSideFace( *mesh, components, params );
3495 mySide->SetComponent( iSide++, comp );
3498 --iE; // for increment in an external loop on iE
3501 else if ( nbExraFaces < 0 ) // skip already united face
3506 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3507 thePrism.myWallQuads[ iE ], *botE,
3508 &myParam2ColumnMaps[ iE ]);
3509 mySide->SetComponent( iSide++, comp );
3514 // Fill geometry fields of SMESH_Block
3515 // ------------------------------------
3517 vector< int > botEdgeIdVec;
3518 SMESH_Block::GetFaceEdgesIDs( ID_BOT_FACE, botEdgeIdVec );
3520 bool isForward[NB_WALL_FACES] = { true, true, true, true };
3521 Adaptor2d_Curve2d* botPcurves[NB_WALL_FACES];
3522 Adaptor2d_Curve2d* topPcurves[NB_WALL_FACES];
3524 for ( int iF = 0; iF < NB_WALL_FACES; ++iF )
3526 TSideFace * sideFace = mySide->GetComponent( iF );
3528 RETURN_BAD_RESULT("NULL TSideFace");
3529 int fID = sideFace->FaceID(); // in-block ID
3531 // fill myShapeIDMap
3532 if ( sideFace->InsertSubShapes( myShapeIDMap ) != 8 &&
3533 !sideFace->IsComplex())
3534 MESSAGE( ": Warning : InsertSubShapes() < 8 on side " << iF );
3536 // side faces geometry
3537 Adaptor2d_Curve2d* pcurves[NB_WALL_FACES];
3538 if ( !sideFace->GetPCurves( pcurves ))
3539 RETURN_BAD_RESULT("TSideFace::GetPCurves() failed");
3541 SMESH_Block::TFace& tFace = myFace[ fID - ID_FirstF ];
3542 tFace.Set( fID, sideFace->Surface(), pcurves, isForward );
3544 SHOWYXZ( endl<<"F "<< iF << " id " << fID << " FRW " << sideFace->IsForward(), sideFace->Value(0,0));
3545 // edges 3D geometry
3546 vector< int > edgeIdVec;
3547 SMESH_Block::GetFaceEdgesIDs( fID, edgeIdVec );
3548 for ( int isMax = 0; isMax < 2; ++isMax ) {
3550 int eID = edgeIdVec[ isMax ];
3551 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3552 tEdge.Set( eID, sideFace->HorizCurve(isMax), true);
3553 SHOWYXZ(eID<<" HOR"<<isMax<<"(0)", sideFace->HorizCurve(isMax)->Value(0));
3554 SHOWYXZ(eID<<" HOR"<<isMax<<"(1)", sideFace->HorizCurve(isMax)->Value(1));
3557 int eID = edgeIdVec[ isMax+2 ];
3558 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3559 tEdge.Set( eID, sideFace->VertiCurve(isMax), true);
3560 SHOWYXZ(eID<<" VER"<<isMax<<"(0)", sideFace->VertiCurve(isMax)->Value(0));
3561 SHOWYXZ(eID<<" VER"<<isMax<<"(1)", sideFace->VertiCurve(isMax)->Value(1));
3564 vector< int > vertexIdVec;
3565 SMESH_Block::GetEdgeVertexIDs( eID, vertexIdVec );
3566 myPnt[ vertexIdVec[0] - ID_FirstV ] = tEdge.GetCurve()->Value(0).XYZ();
3567 myPnt[ vertexIdVec[1] - ID_FirstV ] = tEdge.GetCurve()->Value(1).XYZ();
3570 // pcurves on horizontal faces
3571 for ( iE = 0; iE < NB_WALL_FACES; ++iE ) {
3572 if ( edgeIdVec[ BOTTOM_EDGE ] == botEdgeIdVec[ iE ] ) {
3573 botPcurves[ iE ] = sideFace->HorizPCurve( false, thePrism.myBottom );
3574 topPcurves[ iE ] = sideFace->HorizPCurve( true, thePrism.myTop );
3578 //sideFace->dumpNodes( 4 ); // debug
3580 // horizontal faces geometry
3582 SMESH_Block::TFace& tFace = myFace[ ID_BOT_FACE - ID_FirstF ];
3583 tFace.Set( ID_BOT_FACE, new BRepAdaptor_Surface( thePrism.myBottom ), botPcurves, isForward );
3584 SMESH_Block::Insert( thePrism.myBottom, ID_BOT_FACE, myShapeIDMap );
3587 SMESH_Block::TFace& tFace = myFace[ ID_TOP_FACE - ID_FirstF ];
3588 tFace.Set( ID_TOP_FACE, new BRepAdaptor_Surface( thePrism.myTop ), topPcurves, isForward );
3589 SMESH_Block::Insert( thePrism.myTop, ID_TOP_FACE, myShapeIDMap );
3591 //faceGridToPythonDump( SMESH_Block::ID_Fxy0, 50 );
3592 //faceGridToPythonDump( SMESH_Block::ID_Fxy1 );
3594 // Fill map ShapeIndex to TParam2ColumnMap
3595 // ----------------------------------------
3597 list< TSideFace* > fList;
3598 list< TSideFace* >::iterator fListIt;
3599 fList.push_back( mySide );
3600 for ( fListIt = fList.begin(); fListIt != fList.end(); ++fListIt)
3602 int nb = (*fListIt)->NbComponents();
3603 for ( int i = 0; i < nb; ++i ) {
3604 if ( TSideFace* comp = (*fListIt)->GetComponent( i ))
3605 fList.push_back( comp );
3607 if ( TParam2ColumnMap* cols = (*fListIt)->GetColumns()) {
3608 // columns for a base edge
3609 int id = MeshDS()->ShapeToIndex( (*fListIt)->BaseEdge() );
3610 bool isForward = (*fListIt)->IsForward();
3611 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3613 // columns for vertices
3614 const SMDS_MeshNode* n0 = cols->begin()->second.front();
3615 id = n0->getshapeId();
3616 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3618 const SMDS_MeshNode* n1 = cols->rbegin()->second.front();
3619 id = n1->getshapeId();
3620 myShapeIndex2ColumnMap[ id ] = make_pair( cols, !isForward );
3624 // #define SHOWYXZ(msg, xyz) { gp_Pnt p(xyz); cout << msg << " ("<< p.X() << "; " <<p.Y() << "; " <<p.Z() << ") " <<endl; }
3626 // double _u[]={ 0.1, 0.1, 0.9, 0.9 };
3627 // double _v[]={ 0.1, 0.9, 0.1, 0.9 };
3628 // for ( int z = 0; z < 2; ++z )
3629 // for ( int i = 0; i < 4; ++i )
3631 // //gp_XYZ testPar(0.25, 0.25, 0), testCoord;
3632 // int iFace = (z ? ID_TOP_FACE : ID_BOT_FACE);
3633 // gp_XYZ testPar(_u[i], _v[i], z), testCoord;
3634 // if ( !FacePoint( iFace, testPar, testCoord ))
3635 // RETURN_BAD_RESULT("TEST FacePoint() FAILED");
3636 // SHOWYXZ("IN TEST PARAM" , testPar);
3637 // SHOWYXZ("OUT TEST CORD" , testCoord);
3638 // if ( !ComputeParameters( testCoord, testPar , iFace))
3639 // RETURN_BAD_RESULT("TEST ComputeParameters() FAILED");
3640 // SHOWYXZ("OUT TEST PARAM" , testPar);
3645 //================================================================================
3647 * \brief Return pointer to column of nodes
3648 * \param node - bottom node from which the returned column goes up
3649 * \retval const TNodeColumn* - the found column
3651 //================================================================================
3653 const TNodeColumn* StdMeshers_PrismAsBlock::GetNodeColumn(const SMDS_MeshNode* node) const
3655 int sID = node->getshapeId();
3657 map<int, pair< TParam2ColumnMap*, bool > >::const_iterator col_frw =
3658 myShapeIndex2ColumnMap.find( sID );
3659 if ( col_frw != myShapeIndex2ColumnMap.end() ) {
3660 const TParam2ColumnMap* cols = col_frw->second.first;
3661 TParam2ColumnIt u_col = cols->begin();
3662 for ( ; u_col != cols->end(); ++u_col )
3663 if ( u_col->second[ 0 ] == node )
3664 return & u_col->second;
3669 //=======================================================================
3670 //function : GetLayersTransformation
3671 //purpose : Return transformations to get coordinates of nodes of each layer
3672 // by nodes of the bottom. Layer is a set of nodes at a certain step
3673 // from bottom to top.
3674 // Transformation to get top node from bottom ones is computed
3675 // only if the top FACE is not meshed.
3676 //=======================================================================
3678 bool StdMeshers_PrismAsBlock::GetLayersTransformation(vector<gp_Trsf> & trsf,
3679 const Prism_3D::TPrismTopo& prism) const
3681 const bool itTopMeshed = !SubMesh( ID_BOT_FACE )->IsEmpty();
3682 const int zSize = VerticalSize();
3683 if ( zSize < 3 && !itTopMeshed ) return true;
3684 trsf.resize( zSize - 1 );
3686 // Select some node columns by which we will define coordinate system of layers
3688 vector< const TNodeColumn* > columns;
3691 list< TopoDS_Edge >::const_iterator edgeIt = prism.myBottomEdges.begin();
3692 for ( int iE = 0; iE < prism.myNbEdgesInWires.front(); ++iE, ++edgeIt )
3694 if ( SMESH_Algo::isDegenerated( *edgeIt )) continue;
3695 const TParam2ColumnMap* u2colMap =
3696 GetParam2ColumnMap( MeshDS()->ShapeToIndex( *edgeIt ), isReverse );
3697 if ( !u2colMap ) return false;
3698 double f = u2colMap->begin()->first, l = u2colMap->rbegin()->first;
3699 //isReverse = ( edgeIt->Orientation() == TopAbs_REVERSED );
3700 //if ( isReverse ) swap ( f, l ); -- u2colMap takes orientation into account
3701 const int nbCol = 5;
3702 for ( int i = 0; i < nbCol; ++i )
3704 double u = f + i/double(nbCol) * ( l - f );
3705 const TNodeColumn* col = & getColumn( u2colMap, u )->second;
3706 if ( columns.empty() || col != columns.back() )
3707 columns.push_back( col );
3712 // Find tolerance to check transformations
3717 for ( size_t i = 0; i < columns.size(); ++i )
3718 bndBox.Add( gpXYZ( columns[i]->front() ));
3719 tol2 = bndBox.SquareExtent() * 1e-5;
3722 // Compute transformations
3725 gp_Trsf fromCsZ, toCs0;
3726 gp_Ax3 cs0 = getLayerCoordSys(0, columns, xCol );
3727 //double dist0 = cs0.Location().Distance( gpXYZ( (*columns[0])[0]));
3728 toCs0.SetTransformation( cs0 );
3729 for ( int z = 1; z < zSize; ++z )
3731 gp_Ax3 csZ = getLayerCoordSys(z, columns, xCol );
3732 //double distZ = csZ.Location().Distance( gpXYZ( (*columns[0])[z]));
3733 fromCsZ.SetTransformation( csZ );
3735 gp_Trsf& t = trsf[ z-1 ];
3736 t = fromCsZ * toCs0;
3737 //t.SetScaleFactor( distZ/dist0 ); - it does not work properly, wrong base point
3739 // check a transformation
3740 for ( size_t i = 0; i < columns.size(); ++i )
3742 gp_Pnt p0 = gpXYZ( (*columns[i])[0] );
3743 gp_Pnt pz = gpXYZ( (*columns[i])[z] );
3744 t.Transforms( p0.ChangeCoord() );
3745 if ( p0.SquareDistance( pz ) > tol2 )
3748 return ( z == zSize - 1 ); // OK if fails only botton->top trsf
3755 //================================================================================
3757 * \brief Check curve orientation of a bootom edge
3758 * \param meshDS - mesh DS
3759 * \param columnsMap - node columns map of side face
3760 * \param bottomEdge - the bootom edge
3761 * \param sideFaceID - side face in-block ID
3762 * \retval bool - true if orientation coinside with in-block forward orientation
3764 //================================================================================
3766 bool StdMeshers_PrismAsBlock::IsForwardEdge(SMESHDS_Mesh* meshDS,
3767 const TParam2ColumnMap& columnsMap,
3768 const TopoDS_Edge & bottomEdge,
3769 const int sideFaceID)
3771 bool isForward = false;
3772 if ( SMESH_MesherHelper::IsClosedEdge( bottomEdge ))
3774 isForward = ( bottomEdge.Orientation() == TopAbs_FORWARD );
3778 const TNodeColumn& firstCol = columnsMap.begin()->second;
3779 const SMDS_MeshNode* bottomNode = firstCol[0];
3780 TopoDS_Shape firstVertex = SMESH_MesherHelper::GetSubShapeByNode( bottomNode, meshDS );
3781 isForward = ( firstVertex.IsSame( TopExp::FirstVertex( bottomEdge, true )));
3783 // on 2 of 4 sides first vertex is end
3784 if ( sideFaceID == ID_Fx1z || sideFaceID == ID_F0yz )
3785 isForward = !isForward;
3789 //=======================================================================
3790 //function : faceGridToPythonDump
3791 //purpose : Prints a script creating a normal grid on the prism side
3792 //=======================================================================
3794 void StdMeshers_PrismAsBlock::faceGridToPythonDump(const SMESH_Block::TShapeID face,
3798 gp_XYZ pOnF[6] = { gp_XYZ(0,0,0), gp_XYZ(0,0,1),
3799 gp_XYZ(0,0,0), gp_XYZ(0,1,0),
3800 gp_XYZ(0,0,0), gp_XYZ(1,0,0) };
3802 cout << "mesh = smesh.Mesh( 'Face " << face << "')" << endl;
3803 SMESH_Block::TFace& f = myFace[ face - ID_FirstF ];
3804 gp_XYZ params = pOnF[ face - ID_FirstF ];
3805 //const int nb = 10; // nb face rows
3806 for ( int j = 0; j <= nb; ++j )
3808 params.SetCoord( f.GetVInd(), double( j )/ nb );
3809 for ( int i = 0; i <= nb; ++i )
3811 params.SetCoord( f.GetUInd(), double( i )/ nb );
3812 gp_XYZ p = f.Point( params );
3813 gp_XY uv = f.GetUV( params );
3814 cout << "mesh.AddNode( " << p.X() << ", " << p.Y() << ", " << p.Z() << " )"
3815 << " # " << 1 + i + j * ( nb + 1 )
3816 << " ( " << i << ", " << j << " ) "
3817 << " UV( " << uv.X() << ", " << uv.Y() << " )" << endl;
3818 ShellPoint( params, p2 );
3819 double dist = ( p2 - p ).Modulus();
3821 cout << "#### dist from ShellPoint " << dist
3822 << " (" << p2.X() << ", " << p2.Y() << ", " << p2.Z() << " ) " << endl;
3825 for ( int j = 0; j < nb; ++j )
3826 for ( int i = 0; i < nb; ++i )
3828 int n = 1 + i + j * ( nb + 1 );
3829 cout << "mesh.AddFace([ "
3830 << n << ", " << n+1 << ", "
3831 << n+nb+2 << ", " << n+nb+1 << "]) " << endl;
3837 //================================================================================
3839 * \brief Constructor
3840 * \param faceID - in-block ID
3841 * \param face - geom FACE
3842 * \param baseEdge - EDGE proreply oriented in the bottom EDGE !!!
3843 * \param columnsMap - map of node columns
3844 * \param first - first normalized param
3845 * \param last - last normalized param
3847 //================================================================================
3849 StdMeshers_PrismAsBlock::TSideFace::TSideFace(SMESH_Mesh& mesh,
3851 const Prism_3D::TQuadList& quadList,
3852 const TopoDS_Edge& baseEdge,
3853 TParam2ColumnMap* columnsMap,
3857 myParamToColumnMap( columnsMap ),
3860 myParams.resize( 1 );
3861 myParams[ 0 ] = make_pair( first, last );
3862 mySurface = PSurface( new BRepAdaptor_Surface( quadList.front()->face ));
3863 myBaseEdge = baseEdge;
3864 myIsForward = StdMeshers_PrismAsBlock::IsForwardEdge( myHelper.GetMeshDS(),
3865 *myParamToColumnMap,
3867 myHelper.SetSubShape( quadList.front()->face );
3869 if ( quadList.size() > 1 ) // side is vertically composite
3871 // fill myShapeID2Surf map to enable finding a right surface by any sub-shape ID
3873 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
3875 TopTools_IndexedDataMapOfShapeListOfShape subToFaces;
3876 Prism_3D::TQuadList::const_iterator quad = quadList.begin();
3877 for ( ; quad != quadList.end(); ++quad )
3879 const TopoDS_Face& face = (*quad)->face;
3880 TopExp::MapShapesAndAncestors( face, TopAbs_VERTEX, TopAbs_FACE, subToFaces );
3881 TopExp::MapShapesAndAncestors( face, TopAbs_EDGE, TopAbs_FACE, subToFaces );
3882 myShapeID2Surf.insert( make_pair( meshDS->ShapeToIndex( face ),
3883 PSurface( new BRepAdaptor_Surface( face ))));
3885 for ( int i = 1; i <= subToFaces.Extent(); ++i )
3887 const TopoDS_Shape& sub = subToFaces.FindKey( i );
3888 TopTools_ListOfShape& faces = subToFaces( i );
3889 int subID = meshDS->ShapeToIndex( sub );
3890 int faceID = meshDS->ShapeToIndex( faces.First() );
3891 myShapeID2Surf.insert ( make_pair( subID, myShapeID2Surf[ faceID ]));
3896 //================================================================================
3898 * \brief Constructor of a complex side face
3900 //================================================================================
3902 StdMeshers_PrismAsBlock::TSideFace::
3903 TSideFace(SMESH_Mesh& mesh,
3904 const vector< TSideFace* >& components,
3905 const vector< pair< double, double> > & params)
3906 :myID( components[0] ? components[0]->myID : 0 ),
3907 myParamToColumnMap( 0 ),
3909 myIsForward( true ),
3910 myComponents( components ),
3913 if ( myID == ID_Fx1z || myID == ID_F0yz )
3915 // reverse components
3916 std::reverse( myComponents.begin(), myComponents.end() );
3917 std::reverse( myParams.begin(), myParams.end() );
3918 for ( size_t i = 0; i < myParams.size(); ++i )
3920 const double f = myParams[i].first;
3921 const double l = myParams[i].second;
3922 myParams[i] = make_pair( 1. - l, 1. - f );
3926 //================================================================================
3928 * \brief Copy constructor
3929 * \param other - other side
3931 //================================================================================
3933 StdMeshers_PrismAsBlock::TSideFace::TSideFace( const TSideFace& other ):
3934 myID ( other.myID ),
3935 myParamToColumnMap ( other.myParamToColumnMap ),
3936 mySurface ( other.mySurface ),
3937 myBaseEdge ( other.myBaseEdge ),
3938 myShapeID2Surf ( other.myShapeID2Surf ),
3939 myParams ( other.myParams ),
3940 myIsForward ( other.myIsForward ),
3941 myComponents ( other.myComponents.size() ),
3942 myHelper ( *other.myHelper.GetMesh() )
3944 for ( size_t i = 0 ; i < myComponents.size(); ++i )
3945 myComponents[ i ] = new TSideFace( *other.myComponents[ i ]);
3948 //================================================================================
3950 * \brief Deletes myComponents
3952 //================================================================================
3954 StdMeshers_PrismAsBlock::TSideFace::~TSideFace()
3956 for ( size_t i = 0 ; i < myComponents.size(); ++i )
3957 if ( myComponents[ i ] )
3958 delete myComponents[ i ];
3961 //================================================================================
3963 * \brief Return geometry of the vertical curve
3964 * \param isMax - true means curve located closer to (1,1,1) block point
3965 * \retval Adaptor3d_Curve* - curve adaptor
3967 //================================================================================
3969 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::VertiCurve(const bool isMax) const
3971 if ( !myComponents.empty() ) {
3973 return myComponents.back()->VertiCurve(isMax);
3975 return myComponents.front()->VertiCurve(isMax);
3977 double f = myParams[0].first, l = myParams[0].second;
3978 if ( !myIsForward ) std::swap( f, l );
3979 return new TVerticalEdgeAdaptor( myParamToColumnMap, isMax ? l : f );
3982 //================================================================================
3984 * \brief Return geometry of the top or bottom curve
3986 * \retval Adaptor3d_Curve* -
3988 //================================================================================
3990 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::HorizCurve(const bool isTop) const
3992 return new THorizontalEdgeAdaptor( this, isTop );
3995 //================================================================================
3997 * \brief Return pcurves
3998 * \param pcurv - array of 4 pcurves
3999 * \retval bool - is a success
4001 //================================================================================
4003 bool StdMeshers_PrismAsBlock::TSideFace::GetPCurves(Adaptor2d_Curve2d* pcurv[4]) const
4005 int iEdge[ 4 ] = { BOTTOM_EDGE, TOP_EDGE, V0_EDGE, V1_EDGE };
4007 for ( int i = 0 ; i < 4 ; ++i ) {
4008 Handle(Geom2d_Line) line;
4009 switch ( iEdge[ i ] ) {
4011 line = new Geom2d_Line( gp_Pnt2d( 0, 1 ), gp::DX2d() ); break;
4013 line = new Geom2d_Line( gp::Origin2d(), gp::DX2d() ); break;
4015 line = new Geom2d_Line( gp::Origin2d(), gp::DY2d() ); break;
4017 line = new Geom2d_Line( gp_Pnt2d( 1, 0 ), gp::DY2d() ); break;
4019 pcurv[ i ] = new Geom2dAdaptor_Curve( line, 0, 1 );
4024 //================================================================================
4026 * \brief Returns geometry of pcurve on a horizontal face
4027 * \param isTop - is top or bottom face
4028 * \param horFace - a horizontal face
4029 * \retval Adaptor2d_Curve2d* - curve adaptor
4031 //================================================================================
4034 StdMeshers_PrismAsBlock::TSideFace::HorizPCurve(const bool isTop,
4035 const TopoDS_Face& horFace) const
4037 return new TPCurveOnHorFaceAdaptor( this, isTop, horFace );
4040 //================================================================================
4042 * \brief Return a component corresponding to parameter
4043 * \param U - parameter along a horizontal size
4044 * \param localU - parameter along a horizontal size of a component
4045 * \retval TSideFace* - found component
4047 //================================================================================
4049 StdMeshers_PrismAsBlock::TSideFace*
4050 StdMeshers_PrismAsBlock::TSideFace::GetComponent(const double U,double & localU) const
4053 if ( myComponents.empty() )
4054 return const_cast<TSideFace*>( this );
4057 for ( i = 0; i < myComponents.size(); ++i )
4058 if ( U < myParams[ i ].second )
4060 if ( i >= myComponents.size() )
4061 i = myComponents.size() - 1;
4063 double f = myParams[ i ].first, l = myParams[ i ].second;
4064 localU = ( U - f ) / ( l - f );
4065 return myComponents[ i ];
4068 //================================================================================
4070 * \brief Find node columns for a parameter
4071 * \param U - parameter along a horizontal edge
4072 * \param col1 - the 1st found column
4073 * \param col2 - the 2nd found column
4074 * \retval r - normalized position of U between the found columns
4076 //================================================================================
4078 double StdMeshers_PrismAsBlock::TSideFace::GetColumns(const double U,
4079 TParam2ColumnIt & col1,
4080 TParam2ColumnIt & col2) const
4082 double u = U, r = 0;
4083 if ( !myComponents.empty() ) {
4084 TSideFace * comp = GetComponent(U,u);
4085 return comp->GetColumns( u, col1, col2 );
4090 double f = myParams[0].first, l = myParams[0].second;
4091 u = f + u * ( l - f );
4093 col1 = col2 = getColumn( myParamToColumnMap, u );
4094 if ( ++col2 == myParamToColumnMap->end() ) {
4099 double uf = col1->first;
4100 double ul = col2->first;
4101 r = ( u - uf ) / ( ul - uf );
4106 //================================================================================
4108 * \brief Return all nodes at a given height together with their normalized parameters
4109 * \param [in] Z - the height of interest
4110 * \param [out] nodes - map of parameter to node
4112 //================================================================================
4114 void StdMeshers_PrismAsBlock::
4115 TSideFace::GetNodesAtZ(const int Z,
4116 map<double, const SMDS_MeshNode* >& nodes ) const
4118 if ( !myComponents.empty() )
4121 for ( size_t i = 0; i < myComponents.size(); ++i )
4123 map<double, const SMDS_MeshNode* > nn;
4124 myComponents[i]->GetNodesAtZ( Z, nn );
4125 map<double, const SMDS_MeshNode* >::iterator u2n = nn.begin();
4126 if ( !nodes.empty() && nodes.rbegin()->second == u2n->second )
4128 const double uRange = myParams[i].second - myParams[i].first;
4129 for ( ; u2n != nn.end(); ++u2n )
4130 nodes.insert( nodes.end(), make_pair( u0 + uRange * u2n->first, u2n->second ));
4136 double f = myParams[0].first, l = myParams[0].second;
4139 const double uRange = l - f;
4140 if ( Abs( uRange ) < std::numeric_limits<double>::min() )
4142 TParam2ColumnIt u2col = getColumn( myParamToColumnMap, myParams[0].first + 1e-3 );
4143 for ( ; u2col != myParamToColumnMap->end(); ++u2col )
4144 if ( u2col->first > myParams[0].second + 1e-9 )
4147 nodes.insert( nodes.end(),
4148 make_pair( ( u2col->first - f ) / uRange, u2col->second[ Z ] ));
4152 //================================================================================
4154 * \brief Return coordinates by normalized params
4155 * \param U - horizontal param
4156 * \param V - vertical param
4157 * \retval gp_Pnt - result point
4159 //================================================================================
4161 gp_Pnt StdMeshers_PrismAsBlock::TSideFace::Value(const Standard_Real U,
4162 const Standard_Real V) const
4164 if ( !myComponents.empty() ) {
4166 TSideFace * comp = GetComponent(U,u);
4167 return comp->Value( u, V );
4170 TParam2ColumnIt u_col1, u_col2;
4171 double vR, hR = GetColumns( U, u_col1, u_col2 );
4173 const SMDS_MeshNode* nn[4];
4175 // BEGIN issue 0020680: Bad cell created by Radial prism in center of torus
4176 // Workaround for a wrongly located point returned by mySurface.Value() for
4177 // UV located near boundary of BSpline surface.
4178 // To bypass the problem, we take point from 3D curve of EDGE.
4179 // It solves pb of the bloc_fiss_new.py
4180 const double tol = 1e-3;
4181 if ( V < tol || V+tol >= 1. )
4183 nn[0] = V < tol ? u_col1->second.front() : u_col1->second.back();
4184 nn[2] = V < tol ? u_col2->second.front() : u_col2->second.back();
4192 TopoDS_Shape s = myHelper.GetSubShapeByNode( nn[0], myHelper.GetMeshDS() );
4193 if ( s.ShapeType() != TopAbs_EDGE )
4194 s = myHelper.GetSubShapeByNode( nn[2], myHelper.GetMeshDS() );
4195 if ( !s.IsNull() && s.ShapeType() == TopAbs_EDGE )
4196 edge = TopoDS::Edge( s );
4198 if ( !edge.IsNull() )
4200 double u1 = myHelper.GetNodeU( edge, nn[0], nn[2] );
4201 double u3 = myHelper.GetNodeU( edge, nn[2], nn[0] );
4202 double u = u1 * ( 1 - hR ) + u3 * hR;
4203 TopLoc_Location loc; double f,l;
4204 Handle(Geom_Curve) curve = BRep_Tool::Curve( edge,loc,f,l );
4205 return curve->Value( u ).Transformed( loc );
4208 // END issue 0020680: Bad cell created by Radial prism in center of torus
4210 vR = getRAndNodes( & u_col1->second, V, nn[0], nn[1] );
4211 vR = getRAndNodes( & u_col2->second, V, nn[2], nn[3] );
4213 if ( !myShapeID2Surf.empty() ) // side is vertically composite
4215 // find a FACE on which the 4 nodes lie
4216 TSideFace* me = (TSideFace*) this;
4217 int notFaceID1 = 0, notFaceID2 = 0;
4218 for ( int i = 0; i < 4; ++i )
4219 if ( nn[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) // node on FACE
4221 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4225 else if ( notFaceID1 == 0 ) // node on EDGE or VERTEX
4227 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4228 notFaceID1 = nn[i]->getshapeId();
4230 else if ( notFaceID1 != nn[i]->getshapeId() ) // node on other EDGE or VERTEX
4232 if ( mySurface != me->myShapeID2Surf[ nn[i]->getshapeId() ])
4233 notFaceID2 = nn[i]->getshapeId();
4235 if ( notFaceID2 ) // no nodes of FACE and nodes are on different FACEs
4237 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
4238 TopoDS_Shape face = myHelper.GetCommonAncestor( meshDS->IndexToShape( notFaceID1 ),
4239 meshDS->IndexToShape( notFaceID2 ),
4240 *myHelper.GetMesh(),
4242 if ( face.IsNull() )
4243 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() face.IsNull()");
4244 int faceID = meshDS->ShapeToIndex( face );
4245 me->mySurface = me->myShapeID2Surf[ faceID ];
4247 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() !mySurface");
4250 ((TSideFace*) this)->myHelper.SetSubShape( mySurface->Face() );
4252 gp_XY uv1 = myHelper.GetNodeUV( mySurface->Face(), nn[0], nn[2]);
4253 gp_XY uv2 = myHelper.GetNodeUV( mySurface->Face(), nn[1], nn[3]);
4254 gp_XY uv12 = uv1 * ( 1 - vR ) + uv2 * vR;
4256 gp_XY uv3 = myHelper.GetNodeUV( mySurface->Face(), nn[2], nn[0]);
4257 gp_XY uv4 = myHelper.GetNodeUV( mySurface->Face(), nn[3], nn[1]);
4258 gp_XY uv34 = uv3 * ( 1 - vR ) + uv4 * vR;
4260 gp_XY uv = uv12 * ( 1 - hR ) + uv34 * hR;
4262 gp_Pnt p = mySurface->Value( uv.X(), uv.Y() );
4267 //================================================================================
4269 * \brief Return boundary edge
4270 * \param edge - edge index
4271 * \retval TopoDS_Edge - found edge
4273 //================================================================================
4275 TopoDS_Edge StdMeshers_PrismAsBlock::TSideFace::GetEdge(const int iEdge) const
4277 if ( !myComponents.empty() ) {
4279 case V0_EDGE : return myComponents.front()->GetEdge( iEdge );
4280 case V1_EDGE : return myComponents.back() ->GetEdge( iEdge );
4281 default: return TopoDS_Edge();
4285 const SMDS_MeshNode* node = 0;
4286 SMESHDS_Mesh * meshDS = myHelper.GetMesh()->GetMeshDS();
4287 TNodeColumn* column;
4292 column = & (( ++myParamToColumnMap->begin())->second );
4293 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4294 edge = myHelper.GetSubShapeByNode ( node, meshDS );
4295 if ( edge.ShapeType() == TopAbs_VERTEX ) {
4296 column = & ( myParamToColumnMap->begin()->second );
4297 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4302 bool back = ( iEdge == V1_EDGE );
4303 if ( !myIsForward ) back = !back;
4305 column = & ( myParamToColumnMap->rbegin()->second );
4307 column = & ( myParamToColumnMap->begin()->second );
4308 if ( column->size() > 0 )
4309 edge = myHelper.GetSubShapeByNode( (*column)[ 1 ], meshDS );
4310 if ( edge.IsNull() || edge.ShapeType() == TopAbs_VERTEX )
4311 node = column->front();
4316 if ( !edge.IsNull() && edge.ShapeType() == TopAbs_EDGE )
4317 return TopoDS::Edge( edge );
4319 // find edge by 2 vertices
4320 TopoDS_Shape V1 = edge;
4321 TopoDS_Shape V2 = myHelper.GetSubShapeByNode( node, meshDS );
4322 if ( !V2.IsNull() && V2.ShapeType() == TopAbs_VERTEX && !V2.IsSame( V1 ))
4324 TopoDS_Shape ancestor = myHelper.GetCommonAncestor( V1, V2, *myHelper.GetMesh(), TopAbs_EDGE);
4325 if ( !ancestor.IsNull() )
4326 return TopoDS::Edge( ancestor );
4328 return TopoDS_Edge();
4331 //================================================================================
4333 * \brief Fill block sub-shapes
4334 * \param shapeMap - map to fill in
4335 * \retval int - nb inserted sub-shapes
4337 //================================================================================
4339 int StdMeshers_PrismAsBlock::TSideFace::InsertSubShapes(TBlockShapes& shapeMap) const
4344 vector< int > edgeIdVec;
4345 SMESH_Block::GetFaceEdgesIDs( myID, edgeIdVec );
4347 for ( int i = BOTTOM_EDGE; i <=V1_EDGE ; ++i ) {
4348 TopoDS_Edge e = GetEdge( i );
4349 if ( !e.IsNull() ) {
4350 nbInserted += SMESH_Block::Insert( e, edgeIdVec[ i ], shapeMap);
4354 // Insert corner vertices
4356 TParam2ColumnIt col1, col2 ;
4357 vector< int > vertIdVec;
4360 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V0_EDGE ], vertIdVec);
4361 GetColumns(0, col1, col2 );
4362 const SMDS_MeshNode* node0 = col1->second.front();
4363 const SMDS_MeshNode* node1 = col1->second.back();
4364 TopoDS_Shape v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4365 TopoDS_Shape v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4366 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4367 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4369 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4370 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4374 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V1_EDGE ], vertIdVec);
4375 GetColumns(1, col1, col2 );
4376 node0 = col2->second.front();
4377 node1 = col2->second.back();
4378 v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4379 v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4380 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4381 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4383 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4384 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4387 // TopoDS_Vertex V0, V1, Vcom;
4388 // TopExp::Vertices( myBaseEdge, V0, V1, true );
4389 // if ( !myIsForward ) std::swap( V0, V1 );
4391 // // bottom vertex IDs
4392 // SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ _u0 ], vertIdVec);
4393 // SMESH_Block::Insert( V0, vertIdVec[ 0 ], shapeMap);
4394 // SMESH_Block::Insert( V1, vertIdVec[ 1 ], shapeMap);
4396 // TopoDS_Edge sideEdge = GetEdge( V0_EDGE );
4397 // if ( sideEdge.IsNull() || !TopExp::CommonVertex( botEdge, sideEdge, Vcom ))
4400 // // insert one side edge
4402 // if ( Vcom.IsSame( V0 )) edgeID = edgeIdVec[ _v0 ];
4403 // else edgeID = edgeIdVec[ _v1 ];
4404 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4406 // // top vertex of the side edge
4407 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec);
4408 // TopoDS_Vertex Vtop = TopExp::FirstVertex( sideEdge );
4409 // if ( Vcom.IsSame( Vtop ))
4410 // Vtop = TopExp::LastVertex( sideEdge );
4411 // SMESH_Block::Insert( Vtop, vertIdVec[ 1 ], shapeMap);
4413 // // other side edge
4414 // sideEdge = GetEdge( V1_EDGE );
4415 // if ( sideEdge.IsNull() )
4417 // if ( edgeID = edgeIdVec[ _v1 ]) edgeID = edgeIdVec[ _v0 ];
4418 // else edgeID = edgeIdVec[ _v1 ];
4419 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4422 // TopoDS_Edge topEdge = GetEdge( TOP_EDGE );
4423 // SMESH_Block::Insert( topEdge, edgeIdVec[ _u1 ], shapeMap);
4425 // // top vertex of the other side edge
4426 // if ( !TopExp::CommonVertex( topEdge, sideEdge, Vcom ))
4428 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec );
4429 // SMESH_Block::Insert( Vcom, vertIdVec[ 1 ], shapeMap);
4434 //================================================================================
4436 * \brief Dump ids of nodes of sides
4438 //================================================================================
4440 void StdMeshers_PrismAsBlock::TSideFace::dumpNodes(int nbNodes) const
4443 cout << endl << "NODES OF FACE "; SMESH_Block::DumpShapeID( myID, cout ) << endl;
4444 THorizontalEdgeAdaptor* hSize0 = (THorizontalEdgeAdaptor*) HorizCurve(0);
4445 cout << "Horiz side 0: "; hSize0->dumpNodes(nbNodes); cout << endl;
4446 THorizontalEdgeAdaptor* hSize1 = (THorizontalEdgeAdaptor*) HorizCurve(1);
4447 cout << "Horiz side 1: "; hSize1->dumpNodes(nbNodes); cout << endl;
4448 TVerticalEdgeAdaptor* vSide0 = (TVerticalEdgeAdaptor*) VertiCurve(0);
4449 cout << "Verti side 0: "; vSide0->dumpNodes(nbNodes); cout << endl;
4450 TVerticalEdgeAdaptor* vSide1 = (TVerticalEdgeAdaptor*) VertiCurve(1);
4451 cout << "Verti side 1: "; vSide1->dumpNodes(nbNodes); cout << endl;
4452 delete hSize0; delete hSize1; delete vSide0; delete vSide1;
4456 //================================================================================
4458 * \brief Creates TVerticalEdgeAdaptor
4459 * \param columnsMap - node column map
4460 * \param parameter - normalized parameter
4462 //================================================================================
4464 StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::
4465 TVerticalEdgeAdaptor( const TParam2ColumnMap* columnsMap, const double parameter)
4467 myNodeColumn = & getColumn( columnsMap, parameter )->second;
4470 //================================================================================
4472 * \brief Return coordinates for the given normalized parameter
4473 * \param U - normalized parameter
4474 * \retval gp_Pnt - coordinates
4476 //================================================================================
4478 gp_Pnt StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::Value(const Standard_Real U) const
4480 const SMDS_MeshNode* n1;
4481 const SMDS_MeshNode* n2;
4482 double r = getRAndNodes( myNodeColumn, U, n1, n2 );
4483 return gpXYZ(n1) * ( 1 - r ) + gpXYZ(n2) * r;
4486 //================================================================================
4488 * \brief Dump ids of nodes
4490 //================================================================================
4492 void StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::dumpNodes(int nbNodes) const
4495 for ( int i = 0; i < nbNodes && i < (int)myNodeColumn->size(); ++i )
4496 cout << (*myNodeColumn)[i]->GetID() << " ";
4497 if ( nbNodes < (int) myNodeColumn->size() )
4498 cout << myNodeColumn->back()->GetID();
4502 //================================================================================
4504 * \brief Return coordinates for the given normalized parameter
4505 * \param U - normalized parameter
4506 * \retval gp_Pnt - coordinates
4508 //================================================================================
4510 gp_Pnt StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::Value(const Standard_Real U) const
4512 return mySide->TSideFace::Value( U, myV );
4515 //================================================================================
4517 * \brief Dump ids of <nbNodes> first nodes and the last one
4519 //================================================================================
4521 void StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::dumpNodes(int nbNodes) const
4524 // Not bedugged code. Last node is sometimes incorrect
4525 const TSideFace* side = mySide;
4527 if ( mySide->IsComplex() )
4528 side = mySide->GetComponent(0,u);
4530 TParam2ColumnIt col, col2;
4531 TParam2ColumnMap* u2cols = side->GetColumns();
4532 side->GetColumns( u , col, col2 );
4534 int j, i = myV ? mySide->ColumnHeight()-1 : 0;
4536 const SMDS_MeshNode* n = 0;
4537 const SMDS_MeshNode* lastN
4538 = side->IsForward() ? u2cols->rbegin()->second[ i ] : u2cols->begin()->second[ i ];
4539 for ( j = 0; j < nbNodes && n != lastN; ++j )
4541 n = col->second[ i ];
4542 cout << n->GetID() << " ";
4543 if ( side->IsForward() )
4551 if ( mySide->IsComplex() )
4552 side = mySide->GetComponent(1,u);
4554 side->GetColumns( u , col, col2 );
4555 if ( n != col->second[ i ] )
4556 cout << col->second[ i ]->GetID();
4560 //================================================================================
4562 * \brief Costructor of TPCurveOnHorFaceAdaptor fills its map of
4563 * normalized parameter to node UV on a horizontal face
4564 * \param [in] sideFace - lateral prism side
4565 * \param [in] isTop - is \a horFace top or bottom of the prism
4566 * \param [in] horFace - top or bottom face of the prism
4568 //================================================================================
4570 StdMeshers_PrismAsBlock::
4571 TPCurveOnHorFaceAdaptor::TPCurveOnHorFaceAdaptor( const TSideFace* sideFace,
4573 const TopoDS_Face& horFace)
4575 if ( sideFace && !horFace.IsNull() )
4577 //cout << "\n\t FACE " << sideFace->FaceID() << endl;
4578 const int Z = isTop ? sideFace->ColumnHeight() - 1 : 0;
4579 map<double, const SMDS_MeshNode* > u2nodes;
4580 sideFace->GetNodesAtZ( Z, u2nodes );
4581 if ( u2nodes.empty() )
4584 SMESH_MesherHelper helper( *sideFace->GetMesh() );
4585 helper.SetSubShape( horFace );
4590 Handle(Geom2d_Curve) C2d;
4592 const double tol = 10 * helper.MaxTolerance( horFace );
4593 const SMDS_MeshNode* prevNode = u2nodes.rbegin()->second;
4595 map<double, const SMDS_MeshNode* >::iterator u2n = u2nodes.begin();
4596 for ( ; u2n != u2nodes.end(); ++u2n )
4598 const SMDS_MeshNode* n = u2n->second;
4600 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_EDGE )
4602 if ( n->getshapeId() != edgeID )
4605 edgeID = n->getshapeId();
4606 TopoDS_Shape S = helper.GetSubShapeByNode( n, helper.GetMeshDS() );
4607 if ( !S.IsNull() && S.ShapeType() == TopAbs_EDGE )
4609 C2d = BRep_Tool::CurveOnSurface( TopoDS::Edge( S ), horFace, f,l );
4612 if ( !C2d.IsNull() )
4614 double u = static_cast< const SMDS_EdgePosition* >( n->GetPosition() )->GetUParameter();
4615 if ( f <= u && u <= l )
4617 uv = C2d->Value( u ).XY();
4618 okUV = helper.CheckNodeUV( horFace, n, uv, tol );
4623 uv = helper.GetNodeUV( horFace, n, prevNode, &okUV );
4625 myUVmap.insert( myUVmap.end(), make_pair( u2n->first, uv ));
4626 // cout << n->getshapeId() << " N " << n->GetID()
4627 // << " \t" << uv.X() << ", " << uv.Y() << " \t" << u2n->first << endl;
4634 //================================================================================
4636 * \brief Return UV on pcurve for the given normalized parameter
4637 * \param U - normalized parameter
4638 * \retval gp_Pnt - coordinates
4640 //================================================================================
4642 gp_Pnt2d StdMeshers_PrismAsBlock::TPCurveOnHorFaceAdaptor::Value(const Standard_Real U) const
4644 map< double, gp_XY >::const_iterator i1 = myUVmap.upper_bound( U );
4646 if ( i1 == myUVmap.end() )
4647 return myUVmap.empty() ? gp_XY(0,0) : myUVmap.rbegin()->second;
4649 if ( i1 == myUVmap.begin() )
4650 return (*i1).second;
4652 map< double, gp_XY >::const_iterator i2 = i1--;
4654 double r = ( U - i1->first ) / ( i2->first - i1->first );
4655 return i1->second * ( 1 - r ) + i2->second * r;
4658 //================================================================================
4660 * \brief Projects internal nodes using transformation found by boundary nodes
4662 //================================================================================
4664 bool StdMeshers_Sweeper::projectIntPoints(const vector< gp_XYZ >& fromBndPoints,
4665 const vector< gp_XYZ >& toBndPoints,
4666 const vector< gp_XYZ >& fromIntPoints,
4667 vector< gp_XYZ >& toIntPoints,
4668 NSProjUtils::TrsfFinder3D& trsf,
4669 vector< gp_XYZ > * bndError)
4671 // find transformation
4672 if ( trsf.IsIdentity() && !trsf.Solve( fromBndPoints, toBndPoints ))
4675 // compute internal points using the found trsf
4676 for ( size_t iP = 0; iP < fromIntPoints.size(); ++iP )
4678 toIntPoints[ iP ] = trsf.Transform( fromIntPoints[ iP ]);
4681 // compute boundary error
4684 bndError->resize( fromBndPoints.size() );
4686 for ( size_t iP = 0; iP < fromBndPoints.size(); ++iP )
4688 fromTrsf = trsf.Transform( fromBndPoints[ iP ] );
4689 (*bndError)[ iP ] = toBndPoints[ iP ] - fromTrsf;
4695 //================================================================================
4697 * \brief Add boundary error to ineternal points
4699 //================================================================================
4701 void StdMeshers_Sweeper::applyBoundaryError(const vector< gp_XYZ >& bndPoints,
4702 const vector< gp_XYZ >& bndError1,
4703 const vector< gp_XYZ >& bndError2,
4705 vector< gp_XYZ >& intPoints,
4706 vector< double >& int2BndDist)
4708 // fix each internal point
4709 const double eps = 1e-100;
4710 for ( size_t iP = 0; iP < intPoints.size(); ++iP )
4712 gp_XYZ & intPnt = intPoints[ iP ];
4714 // compute distance from intPnt to each boundary node
4715 double int2BndDistSum = 0;
4716 for ( size_t iBnd = 0; iBnd < bndPoints.size(); ++iBnd )
4718 int2BndDist[ iBnd ] = 1 / (( intPnt - bndPoints[ iBnd ]).SquareModulus() + eps );
4719 int2BndDistSum += int2BndDist[ iBnd ];
4723 for ( size_t iBnd = 0; iBnd < bndPoints.size(); ++iBnd )
4725 intPnt += bndError1[ iBnd ] * ( 1 - r ) * int2BndDist[ iBnd ] / int2BndDistSum;
4726 intPnt += bndError2[ iBnd ] * r * int2BndDist[ iBnd ] / int2BndDistSum;
4731 //================================================================================
4733 * \brief Creates internal nodes of the prism
4735 //================================================================================
4737 bool StdMeshers_Sweeper::ComputeNodes( SMESH_MesherHelper& helper,
4739 const bool allowHighBndError)
4741 const size_t zSize = myBndColumns[0]->size();
4742 const size_t zSrc = 0, zTgt = zSize-1;
4743 if ( zSize < 3 ) return true;
4745 vector< vector< gp_XYZ > > intPntsOfLayer( zSize ); // node coodinates to compute
4746 // set coordinates of src and tgt nodes
4747 for ( size_t z = 0; z < intPntsOfLayer.size(); ++z )
4748 intPntsOfLayer[ z ].resize( myIntColumns.size() );
4749 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4751 intPntsOfLayer[ zSrc ][ iP ] = intPoint( iP, zSrc );
4752 intPntsOfLayer[ zTgt ][ iP ] = intPoint( iP, zTgt );
4755 // compute coordinates of internal nodes by projecting (transfroming) src and tgt
4756 // nodes towards the central layer
4758 vector< NSProjUtils::TrsfFinder3D > trsfOfLayer( zSize );
4759 vector< vector< gp_XYZ > > bndError( zSize );
4761 // boundary points used to compute an affine transformation from a layer to a next one
4762 vector< gp_XYZ > fromSrcBndPnts( myBndColumns.size() ), fromTgtBndPnts( myBndColumns.size() );
4763 vector< gp_XYZ > toSrcBndPnts ( myBndColumns.size() ), toTgtBndPnts ( myBndColumns.size() );
4764 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4766 fromSrcBndPnts[ iP ] = bndPoint( iP, zSrc );
4767 fromTgtBndPnts[ iP ] = bndPoint( iP, zTgt );
4770 size_t zS = zSrc + 1;
4771 size_t zT = zTgt - 1;
4772 for ( ; zS < zT; ++zS, --zT ) // vertical loop on layers
4774 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4776 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4777 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4779 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4780 intPntsOfLayer[ zS-1 ], intPntsOfLayer[ zS ],
4781 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
4783 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4784 intPntsOfLayer[ zT+1 ], intPntsOfLayer[ zT ],
4785 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
4788 // if ( zT == zTgt - 1 )
4790 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4792 // gp_XYZ fromTrsf = trsfOfLayer [ zT+1].Transform( fromTgtBndPnts[ iP ] );
4793 // cout << "mesh.AddNode( "
4794 // << fromTrsf.X() << ", "
4795 // << fromTrsf.Y() << ", "
4796 // << fromTrsf.Z() << ") " << endl;
4798 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4799 // cout << "mesh.AddNode( "
4800 // << intPntsOfLayer[ zT ][ iP ].X() << ", "
4801 // << intPntsOfLayer[ zT ][ iP ].Y() << ", "
4802 // << intPntsOfLayer[ zT ][ iP ].Z() << ") " << endl;
4805 fromTgtBndPnts.swap( toTgtBndPnts );
4806 fromSrcBndPnts.swap( toSrcBndPnts );
4809 // Compute two projections of internal points to the central layer
4810 // in order to evaluate an error of internal points
4812 bool centerIntErrorIsSmall;
4813 vector< gp_XYZ > centerSrcIntPnts( myIntColumns.size() );
4814 vector< gp_XYZ > centerTgtIntPnts( myIntColumns.size() );
4816 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4818 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4819 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4821 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4822 intPntsOfLayer[ zS-1 ], centerSrcIntPnts,
4823 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
4825 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4826 intPntsOfLayer[ zT+1 ], centerTgtIntPnts,
4827 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
4830 // evaluate an error of internal points on the central layer
4831 centerIntErrorIsSmall = true;
4832 if ( zS == zT ) // odd zSize
4834 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
4835 centerIntErrorIsSmall =
4836 (centerSrcIntPnts[ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
4840 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
4841 centerIntErrorIsSmall =
4842 (intPntsOfLayer[ zS-1 ][ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
4845 // Evaluate an error of boundary points
4847 bool bndErrorIsSmall = true;
4848 for ( size_t iP = 0; ( iP < myBndColumns.size() && bndErrorIsSmall ); ++iP )
4850 double sumError = 0;
4851 for ( size_t z = 1; z < zS; ++z ) // loop on layers
4852 sumError += ( bndError[ z-1 ][ iP ].Modulus() +
4853 bndError[ zSize-z ][ iP ].Modulus() );
4855 bndErrorIsSmall = ( sumError < tol );
4858 if ( !bndErrorIsSmall && !allowHighBndError )
4861 // compute final points on the central layer
4862 std::vector< double > int2BndDist( myBndColumns.size() ); // work array of applyBoundaryError()
4863 double r = zS / ( zSize - 1.);
4866 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4868 intPntsOfLayer[ zS ][ iP ] =
4869 ( 1 - r ) * centerSrcIntPnts[ iP ] + r * centerTgtIntPnts[ iP ];
4871 if ( !bndErrorIsSmall )
4873 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS+1 ], r,
4874 intPntsOfLayer[ zS ], int2BndDist );
4879 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4881 intPntsOfLayer[ zS ][ iP ] =
4882 r * intPntsOfLayer[ zS ][ iP ] + ( 1 - r ) * centerSrcIntPnts[ iP ];
4883 intPntsOfLayer[ zT ][ iP ] =
4884 r * intPntsOfLayer[ zT ][ iP ] + ( 1 - r ) * centerTgtIntPnts[ iP ];
4886 if ( !bndErrorIsSmall )
4888 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS+1 ], r,
4889 intPntsOfLayer[ zS ], int2BndDist );
4890 applyBoundaryError( toTgtBndPnts, bndError[ zT+1 ], bndError[ zT-1 ], r,
4891 intPntsOfLayer[ zT ], int2BndDist );
4895 centerIntErrorIsSmall = true; // 3D_mesh_Extrusion_00/A3
4896 bndErrorIsSmall = true;
4897 if ( !centerIntErrorIsSmall )
4899 // Compensate the central error; continue adding projection
4900 // by going from central layer to the source and target ones
4902 vector< gp_XYZ >& fromSrcIntPnts = centerSrcIntPnts;
4903 vector< gp_XYZ >& fromTgtIntPnts = centerTgtIntPnts;
4904 vector< gp_XYZ > toSrcIntPnts( myIntColumns.size() );
4905 vector< gp_XYZ > toTgtIntPnts( myIntColumns.size() );
4906 vector< gp_XYZ > srcBndError( myBndColumns.size() );
4907 vector< gp_XYZ > tgtBndError( myBndColumns.size() );
4909 fromTgtBndPnts.swap( toTgtBndPnts );
4910 fromSrcBndPnts.swap( toSrcBndPnts );
4912 for ( ++zS, --zT; zS < zTgt; ++zS, --zT ) // vertical loop on layers
4914 // invert transformation
4915 if ( !trsfOfLayer[ zS+1 ].Invert() )
4916 trsfOfLayer[ zS+1 ] = NSProjUtils::TrsfFinder3D(); // to recompute
4917 if ( !trsfOfLayer[ zT-1 ].Invert() )
4918 trsfOfLayer[ zT-1 ] = NSProjUtils::TrsfFinder3D();
4920 // project internal nodes and compute bnd error
4921 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4923 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4924 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4926 projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4927 fromSrcIntPnts, toSrcIntPnts,
4928 trsfOfLayer[ zS+1 ], & srcBndError );
4929 projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4930 fromTgtIntPnts, toTgtIntPnts,
4931 trsfOfLayer[ zT-1 ], & tgtBndError );
4933 // if ( zS == zTgt - 1 )
4935 // cout << "mesh2 = smesh.Mesh()" << endl;
4936 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4938 // gp_XYZ fromTrsf = trsfOfLayer [ zS+1].Transform( fromSrcBndPnts[ iP ] );
4939 // cout << "mesh2.AddNode( "
4940 // << fromTrsf.X() << ", "
4941 // << fromTrsf.Y() << ", "
4942 // << fromTrsf.Z() << ") " << endl;
4944 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4945 // cout << "mesh2.AddNode( "
4946 // << toSrcIntPnts[ iP ].X() << ", "
4947 // << toSrcIntPnts[ iP ].Y() << ", "
4948 // << toSrcIntPnts[ iP ].Z() << ") " << endl;
4951 // sum up 2 projections
4952 r = zS / ( zSize - 1.);
4953 vector< gp_XYZ >& zSIntPnts = intPntsOfLayer[ zS ];
4954 vector< gp_XYZ >& zTIntPnts = intPntsOfLayer[ zT ];
4955 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4957 zSIntPnts[ iP ] = r * zSIntPnts[ iP ] + ( 1 - r ) * toSrcIntPnts[ iP ];
4958 zTIntPnts[ iP ] = r * zTIntPnts[ iP ] + ( 1 - r ) * toTgtIntPnts[ iP ];
4961 // compensate bnd error
4962 if ( !bndErrorIsSmall )
4964 applyBoundaryError( toSrcBndPnts, srcBndError, bndError[ zS+1 ], r,
4965 intPntsOfLayer[ zS ], int2BndDist );
4966 applyBoundaryError( toTgtBndPnts, tgtBndError, bndError[ zT-1 ], r,
4967 intPntsOfLayer[ zT ], int2BndDist );
4970 fromSrcBndPnts.swap( toSrcBndPnts );
4971 fromSrcIntPnts.swap( toSrcIntPnts );
4972 fromTgtBndPnts.swap( toTgtBndPnts );
4973 fromTgtIntPnts.swap( toTgtIntPnts );
4975 } // if ( !centerIntErrorIsSmall )
4977 else if ( !bndErrorIsSmall )
4981 for ( ; zS < zT; ++zS, --zT ) // vertical loop on layers
4983 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4985 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4986 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4988 // compensate bnd error
4989 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS-1 ], 0.5,
4990 intPntsOfLayer[ zS ], int2BndDist );
4991 applyBoundaryError( toTgtBndPnts, bndError[ zT+1 ], bndError[ zT+1 ], 0.5,
4992 intPntsOfLayer[ zT ], int2BndDist );
4996 // cout << "centerIntErrorIsSmall = " << centerIntErrorIsSmall<< endl;
4997 // cout << "bndErrorIsSmall = " << bndErrorIsSmall<< endl;
5000 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
5002 vector< const SMDS_MeshNode* > & nodeCol = *myIntColumns[ iP ];
5003 for ( size_t z = zSrc + 1; z < zTgt; ++z ) // vertical loop on layers
5005 const gp_XYZ & xyz = intPntsOfLayer[ z ][ iP ];
5006 if ( !( nodeCol[ z ] = helper.AddNode( xyz.X(), xyz.Y(), xyz.Z() )))