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;
948 while ( edge != thePrism.myBottomEdges.end() )
951 if ( BRep_Tool::Curve( *edge, f,l ).IsNull() )
953 edge = thePrism.myBottomEdges.erase( edge );
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 ))
965 Prism_3D::TQuadList quadList( 1, quadAlgo->CheckNbEdges( *mesh, face ));
966 if ( !quadList.back() )
967 return toSM( error(TCom("Side face #") << shapeID( face )
968 << " not meshable with quadrangles"));
969 bool isCompositeBase = ! setBottomEdge( *edge, quadList.back(), face );
970 if ( isCompositeBase )
972 // it's OK if all EDGEs of the bottom side belongs to the bottom FACE
973 StdMeshers_FaceSidePtr botSide = quadList.back()->side[ QUAD_BOTTOM_SIDE ];
974 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
975 if ( !myHelper->IsSubShape( botSide->Edge(iE), thePrism.myBottom ))
976 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
978 if ( faceMap.Add( face ))
979 thePrism.myWallQuads.push_back( quadList );
989 int nbQuadPrev = std::accumulate( nbQuadsPerWire.begin(), nbQuadsPerWire.end(), 0 );
990 nbQuadsPerWire.push_back( thePrism.myWallQuads.size() - nbQuadPrev );
994 // -------------------------
995 // Find the rest wall FACEs
996 // -------------------------
998 // Compose a vector of indixes of right neighbour FACE for each wall FACE
999 // that is not so evident in case of several WIREs in the bottom FACE
1000 thePrism.myRightQuadIndex.clear();
1001 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1003 thePrism.myRightQuadIndex.push_back( i+1 ); // OK for all but the last EDGE of a WIRE
1005 list< int >::iterator nbQinW = nbQuadsPerWire.begin();
1006 for ( int iLeft = 0; nbQinW != nbQuadsPerWire.end(); ++nbQinW )
1008 thePrism.myRightQuadIndex[ iLeft + *nbQinW - 1 ] = iLeft; // for the last EDGE of a WIRE
1012 while ( totalNbFaces - faceMap.Extent() > 2 )
1014 // find wall FACEs adjacent to each of wallQuads by the right side EDGE
1017 nbKnownFaces = faceMap.Extent();
1018 StdMeshers_FaceSidePtr rightSide, topSide; // sides of the quad
1019 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1021 rightSide = thePrism.myWallQuads[i].back()->side[ QUAD_RIGHT_SIDE ];
1022 for ( int iE = 0; iE < rightSide->NbEdges(); ++iE ) // rightSide can be composite
1024 const TopoDS_Edge & rightE = rightSide->Edge( iE );
1025 TopTools_ListIteratorOfListOfShape face( edgeToFaces.FindFromKey( rightE ));
1026 for ( ; face.More(); face.Next() )
1027 if ( faceMap.Add( face.Value() ))
1029 // a new wall FACE encountered, store it in thePrism.myWallQuads
1030 const int iRight = thePrism.myRightQuadIndex[i];
1031 topSide = thePrism.myWallQuads[ iRight ].back()->side[ QUAD_TOP_SIDE ];
1032 const TopoDS_Edge& newBotE = topSide->Edge(0);
1033 const TopoDS_Shape& newWallF = face.Value();
1034 thePrism.myWallQuads[ iRight ].push_back( quadAlgo->CheckNbEdges( *mesh, newWallF ));
1035 if ( !thePrism.myWallQuads[ iRight ].back() )
1036 return toSM( error(TCom("Side face #") << shapeID( newWallF ) <<
1037 " not meshable with quadrangles"));
1038 if ( ! setBottomEdge( newBotE, thePrism.myWallQuads[ iRight ].back(), newWallF ))
1039 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1043 } while ( nbKnownFaces != faceMap.Extent() );
1045 // find wall FACEs adjacent to each of thePrism.myWallQuads by the top side EDGE
1046 if ( totalNbFaces - faceMap.Extent() > 2 )
1048 const int nbFoundWalls = faceMap.Extent();
1049 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1051 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1052 const TopoDS_Edge & topE = topSide->Edge( 0 );
1053 if ( topSide->NbEdges() > 1 )
1054 return toSM( error(COMPERR_BAD_SHAPE, TCom("Side face #") <<
1055 shapeID( thePrism.myWallQuads[i].back()->face )
1056 << " has a composite top edge"));
1057 TopTools_ListIteratorOfListOfShape faceIt( edgeToFaces.FindFromKey( topE ));
1058 for ( ; faceIt.More(); faceIt.Next() )
1059 if ( faceMap.Add( faceIt.Value() ))
1061 // a new wall FACE encountered, store it in wallQuads
1062 thePrism.myWallQuads[ i ].push_back( quadAlgo->CheckNbEdges( *mesh, faceIt.Value() ));
1063 if ( !thePrism.myWallQuads[ i ].back() )
1064 return toSM( error(TCom("Side face #") << shapeID( faceIt.Value() ) <<
1065 " not meshable with quadrangles"));
1066 if ( ! setBottomEdge( topE, thePrism.myWallQuads[ i ].back(), faceIt.Value() ))
1067 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1068 if ( totalNbFaces - faceMap.Extent() == 2 )
1070 i = thePrism.myWallQuads.size(); // to quit from the outer loop
1075 if ( nbFoundWalls == faceMap.Extent() )
1076 return toSM( error("Failed to find wall faces"));
1079 } // while ( totalNbFaces - faceMap.Extent() > 2 )
1081 // ------------------
1082 // Find the top FACE
1083 // ------------------
1085 if ( thePrism.myTop.IsNull() )
1087 // now only top and bottom FACEs are not in the faceMap
1088 faceMap.Add( thePrism.myBottom );
1089 for ( TopExp_Explorer f( thePrism.myShape3D, TopAbs_FACE ); f.More(); f.Next() )
1090 if ( !faceMap.Contains( f.Current() )) {
1091 thePrism.myTop = TopoDS::Face( f.Current() );
1094 if ( thePrism.myTop.IsNull() )
1095 return toSM( error("Top face not found"));
1098 // Check that the top FACE shares all the top EDGEs
1099 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1101 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1102 const TopoDS_Edge & topE = topSide->Edge( 0 );
1103 if ( !myHelper->IsSubShape( topE, thePrism.myTop ))
1104 return toSM( error( TCom("Wrong source face: #") << shapeID( thePrism.myBottom )));
1110 //=======================================================================
1111 //function : compute
1112 //purpose : Compute mesh on a SOLID
1113 //=======================================================================
1115 bool StdMeshers_Prism_3D::compute(const Prism_3D::TPrismTopo& thePrism)
1117 myHelper->IsQuadraticSubMesh( thePrism.myShape3D );
1118 if ( _computeCanceled )
1119 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
1121 // Assure the bottom is meshed
1122 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
1123 if (( botSM->IsEmpty() ) &&
1124 ( ! botSM->GetAlgo() ||
1125 ! _gen->Compute( *botSM->GetFather(), botSM->GetSubShape(), /*shapeOnly=*/true )))
1126 return error( COMPERR_BAD_INPUT_MESH,
1127 TCom( "No mesher defined to compute the base face #")
1128 << shapeID( thePrism.myBottom ));
1130 // Make all side FACEs of thePrism meshed with quads
1131 if ( !computeWalls( thePrism ))
1134 // Analyse mesh and geometry to find all block sub-shapes and submeshes
1135 // (after fixing IPAL52499 myBlock is used as a holder of boundary nodes
1136 // and for 2D projection in hard cases where StdMeshers_Projection_2D fails;
1137 // location of internal nodes is usually computed by StdMeshers_Sweeper)
1138 if ( !myBlock.Init( myHelper, thePrism ))
1139 return toSM( error( myBlock.GetError()));
1141 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1143 int volumeID = meshDS->ShapeToIndex( thePrism.myShape3D );
1145 // Try to get gp_Trsf to get all nodes from bottom ones
1146 vector<gp_Trsf> trsf;
1147 gp_Trsf bottomToTopTrsf;
1148 // if ( !myBlock.GetLayersTransformation( trsf, thePrism ))
1150 // else if ( !trsf.empty() )
1151 // bottomToTopTrsf = trsf.back();
1153 // To compute coordinates of a node inside a block, it is necessary to know
1154 // 1. normalized parameters of the node by which
1155 // 2. coordinates of node projections on all block sub-shapes are computed
1157 // So we fill projections on vertices at once as they are same for all nodes
1158 myShapeXYZ.resize( myBlock.NbSubShapes() );
1159 for ( int iV = SMESH_Block::ID_FirstV; iV < SMESH_Block::ID_FirstE; ++iV ) {
1160 myBlock.VertexPoint( iV, myShapeXYZ[ iV ]);
1161 SHOWYXZ("V point " <<iV << " ", myShapeXYZ[ iV ]);
1164 // Projections on the top and bottom faces are taken from nodes existing
1165 // on these faces; find correspondence between bottom and top nodes
1167 myBotToColumnMap.clear();
1168 if ( !assocOrProjBottom2Top( bottomToTopTrsf, thePrism ) ) // it also fills myBotToColumnMap
1172 // Create nodes inside the block
1174 // use transformation (issue 0020680, IPAL0052499)
1175 StdMeshers_Sweeper sweeper;
1177 bool allowHighBndError;
1181 // load boundary nodes into sweeper
1183 list< TopoDS_Edge >::const_iterator edge = thePrism.myBottomEdges.begin();
1184 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
1186 int edgeID = meshDS->ShapeToIndex( *edge );
1187 TParam2ColumnMap* u2col = const_cast<TParam2ColumnMap*>
1188 ( myBlock.GetParam2ColumnMap( edgeID, dummy ));
1189 TParam2ColumnMap::iterator u2colIt = u2col->begin();
1190 for ( ; u2colIt != u2col->end(); ++u2colIt )
1191 sweeper.myBndColumns.push_back( & u2colIt->second );
1193 // load node columns inside the bottom face
1194 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1195 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1196 sweeper.myIntColumns.push_back( & bot_column->second );
1198 tol = getSweepTolerance( thePrism );
1199 allowHighBndError = !isSimpleBottom( thePrism );
1202 if ( !myUseBlock && sweeper.ComputeNodes( *myHelper, tol, allowHighBndError ))
1205 else // use block approach
1207 // loop on nodes inside the bottom face
1208 Prism_3D::TNode prevBNode;
1209 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1210 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1212 const Prism_3D::TNode& tBotNode = bot_column->first; // bottom TNode
1213 if ( tBotNode.GetPositionType() != SMDS_TOP_FACE )
1214 continue; // node is not inside the FACE
1216 // column nodes; middle part of the column are zero pointers
1217 TNodeColumn& column = bot_column->second;
1219 gp_XYZ botParams, topParams;
1220 if ( !tBotNode.HasParams() )
1222 // compute bottom node parameters
1223 gp_XYZ paramHint(-1,-1,-1);
1224 if ( prevBNode.IsNeighbor( tBotNode ))
1225 paramHint = prevBNode.GetParams();
1226 if ( !myBlock.ComputeParameters( tBotNode.GetCoords(), tBotNode.ChangeParams(),
1227 ID_BOT_FACE, paramHint ))
1228 return toSM( error(TCom("Can't compute normalized parameters for node ")
1229 << tBotNode.myNode->GetID() << " on the face #"
1230 << myBlock.SubMesh( ID_BOT_FACE )->GetId() ));
1231 prevBNode = tBotNode;
1233 botParams = topParams = tBotNode.GetParams();
1234 topParams.SetZ( 1 );
1236 // compute top node parameters
1237 if ( column.size() > 2 ) {
1238 gp_Pnt topCoords = gpXYZ( column.back() );
1239 if ( !myBlock.ComputeParameters( topCoords, topParams, ID_TOP_FACE, topParams ))
1240 return toSM( error(TCom("Can't compute normalized parameters ")
1241 << "for node " << column.back()->GetID()
1242 << " on the face #"<< column.back()->getshapeId() ));
1245 else // top nodes are created by projection using parameters
1247 botParams = topParams = tBotNode.GetParams();
1248 topParams.SetZ( 1 );
1251 myShapeXYZ[ ID_BOT_FACE ] = tBotNode.GetCoords();
1252 myShapeXYZ[ ID_TOP_FACE ] = gpXYZ( column.back() );
1255 TNodeColumn::iterator columnNodes = column.begin();
1256 for ( int z = 0; columnNodes != column.end(); ++columnNodes, ++z)
1258 const SMDS_MeshNode* & node = *columnNodes;
1259 if ( node ) continue; // skip bottom or top node
1261 // params of a node to create
1262 double rz = (double) z / (double) ( column.size() - 1 );
1263 gp_XYZ params = botParams * ( 1 - rz ) + topParams * rz;
1265 // set coords on all faces and nodes
1266 const int nbSideFaces = 4;
1267 int sideFaceIDs[nbSideFaces] = { SMESH_Block::ID_Fx0z,
1268 SMESH_Block::ID_Fx1z,
1269 SMESH_Block::ID_F0yz,
1270 SMESH_Block::ID_F1yz };
1271 for ( int iF = 0; iF < nbSideFaces; ++iF )
1272 if ( !setFaceAndEdgesXYZ( sideFaceIDs[ iF ], params, z ))
1275 // compute coords for a new node
1277 if ( !SMESH_Block::ShellPoint( params, myShapeXYZ, coords ))
1278 return toSM( error("Can't compute coordinates by normalized parameters"));
1280 // if ( !meshDS->MeshElements( volumeID ) ||
1281 // meshDS->MeshElements( volumeID )->NbNodes() == 0 )
1282 // pointsToPython(myShapeXYZ);
1283 SHOWYXZ("TOPFacePoint ",myShapeXYZ[ ID_TOP_FACE]);
1284 SHOWYXZ("BOT Node "<< tBotNode.myNode->GetID(),gpXYZ(tBotNode.myNode));
1285 SHOWYXZ("ShellPoint ",coords);
1288 node = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
1289 meshDS->SetNodeInVolume( node, volumeID );
1291 if ( _computeCanceled )
1294 } // loop on bottom nodes
1299 SMESHDS_SubMesh* smDS = myBlock.SubMeshDS( ID_BOT_FACE );
1300 if ( !smDS ) return toSM( error(COMPERR_BAD_INPUT_MESH, "Null submesh"));
1302 // loop on bottom mesh faces
1303 vector< const TNodeColumn* > columns;
1304 SMDS_ElemIteratorPtr faceIt = smDS->GetElements();
1305 while ( faceIt->more() )
1307 const SMDS_MeshElement* face = faceIt->next();
1308 if ( !face || face->GetType() != SMDSAbs_Face )
1311 // find node columns for each node
1312 int nbNodes = face->NbCornerNodes();
1313 columns.resize( nbNodes );
1314 for ( int i = 0; i < nbNodes; ++i )
1316 const SMDS_MeshNode* n = face->GetNode( i );
1317 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) {
1318 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
1319 if ( bot_column == myBotToColumnMap.end() )
1320 return toSM( error(TCom("No nodes found above node ") << n->GetID() ));
1321 columns[ i ] = & bot_column->second;
1324 columns[ i ] = myBlock.GetNodeColumn( n );
1325 if ( !columns[ i ] )
1326 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
1330 if ( !AddPrisms( columns, myHelper ))
1331 return toSM( error("Different 'vertical' discretization"));
1333 } // loop on bottom mesh faces
1336 myBotToColumnMap.clear();
1339 // update state of sub-meshes (mostly in order to erase improper errors)
1340 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( thePrism.myShape3D );
1341 SMESH_subMeshIteratorPtr smIt = sm->getDependsOnIterator(/*includeSelf=*/true);
1342 while ( smIt->more() )
1345 sm->GetComputeError().reset();
1346 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1352 //=======================================================================
1353 //function : computeWalls
1354 //purpose : Compute 2D mesh on walls FACEs of a prism
1355 //=======================================================================
1357 bool StdMeshers_Prism_3D::computeWalls(const Prism_3D::TPrismTopo& thePrism)
1359 SMESH_Mesh* mesh = myHelper->GetMesh();
1360 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1361 DBGOUT( endl << "COMPUTE Prism " << meshDS->ShapeToIndex( thePrism.myShape3D ));
1363 TProjction1dAlgo* projector1D = TProjction1dAlgo::instance( this );
1364 StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this, myHelper );
1366 // SMESH_HypoFilter hyp1dFilter( SMESH_HypoFilter::IsAlgo(),/*not=*/true);
1367 // hyp1dFilter.And( SMESH_HypoFilter::HasDim( 1 ));
1368 // hyp1dFilter.And( SMESH_HypoFilter::IsMoreLocalThan( thePrism.myShape3D, *mesh ));
1370 // Discretize equally 'vertical' EDGEs
1371 // -----------------------------------
1372 // find source FACE sides for projection: either already computed ones or
1373 // the 'most composite' ones
1374 const size_t nbWalls = thePrism.myWallQuads.size();
1375 vector< int > wgt( nbWalls, 0 ); // "weight" of a wall
1376 for ( size_t iW = 0; iW != nbWalls; ++iW )
1378 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1379 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1381 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ];
1382 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1385 const TopoDS_Edge& E = lftSide->Edge(i);
1386 if ( mesh->GetSubMesh( E )->IsMeshComputed() )
1389 wgt[ myHelper->WrapIndex( iW+1, nbWalls)] += 10;
1390 wgt[ myHelper->WrapIndex( iW-1, nbWalls)] += 10;
1392 // else if ( mesh->GetHypothesis( E, hyp1dFilter, true )) // local hypothesis!
1396 // in quadratic mesh, pass ignoreMediumNodes to quad sides
1397 if ( myHelper->GetIsQuadratic() )
1399 quad = thePrism.myWallQuads[iW].begin();
1400 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1401 for ( int i = 0; i < NB_QUAD_SIDES; ++i )
1402 (*quad)->side[ i ].grid->SetIgnoreMediumNodes( true );
1405 multimap< int, int > wgt2quad;
1406 for ( size_t iW = 0; iW != nbWalls; ++iW )
1407 wgt2quad.insert( make_pair( wgt[ iW ], iW ));
1409 // Project 'vertical' EDGEs, from left to right
1410 multimap< int, int >::reverse_iterator w2q = wgt2quad.rbegin();
1411 for ( ; w2q != wgt2quad.rend(); ++w2q )
1413 const int iW = w2q->second;
1414 const Prism_3D::TQuadList& quads = thePrism.myWallQuads[ iW ];
1415 Prism_3D::TQuadList::const_iterator quad = quads.begin();
1416 for ( ; quad != quads.end(); ++quad )
1418 StdMeshers_FaceSidePtr rgtSide = (*quad)->side[ QUAD_RIGHT_SIDE ]; // tgt
1419 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ]; // src
1420 bool swapLeftRight = ( lftSide->NbSegments( /*update=*/true ) == 0 &&
1421 rgtSide->NbSegments( /*update=*/true ) > 0 );
1422 if ( swapLeftRight )
1423 std::swap( lftSide, rgtSide );
1425 // assure that all the source (left) EDGEs are meshed
1426 int nbSrcSegments = 0;
1427 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1429 const TopoDS_Edge& srcE = lftSide->Edge(i);
1430 SMESH_subMesh* srcSM = mesh->GetSubMesh( srcE );
1431 if ( !srcSM->IsMeshComputed() ) {
1432 DBGOUT( "COMPUTE V edge " << srcSM->GetId() );
1433 TopoDS_Edge prpgSrcE = findPropagationSource( srcE );
1434 if ( !prpgSrcE.IsNull() ) {
1435 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1436 projector1D->myHyp.SetSourceEdge( prpgSrcE );
1437 projector1D->Compute( *mesh, srcE );
1438 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1441 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1442 srcSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1444 if ( !srcSM->IsMeshComputed() )
1445 return toSM( error( "Can't compute 1D mesh" ));
1447 nbSrcSegments += srcSM->GetSubMeshDS()->NbElements();
1449 // check target EDGEs
1450 int nbTgtMeshed = 0, nbTgtSegments = 0;
1451 vector< bool > isTgtEdgeComputed( rgtSide->NbEdges() );
1452 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1454 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1455 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1456 if ( !( isTgtEdgeComputed[ i ] = tgtSM->IsMeshComputed() )) {
1457 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1458 tgtSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1460 if ( tgtSM->IsMeshComputed() ) {
1462 nbTgtSegments += tgtSM->GetSubMeshDS()->NbElements();
1465 if ( rgtSide->NbEdges() == nbTgtMeshed ) // all tgt EDGEs meshed
1467 if ( nbTgtSegments != nbSrcSegments )
1469 bool badMeshRemoved = false;
1470 // remove just computed segments
1471 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1472 if ( !isTgtEdgeComputed[ i ])
1474 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1475 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1476 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1477 badMeshRemoved = true;
1480 if ( !badMeshRemoved )
1482 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1483 addBadInputElements( meshDS->MeshElements( lftSide->Edge( i )));
1484 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1485 addBadInputElements( meshDS->MeshElements( rgtSide->Edge( i )));
1486 return toSM( error( TCom("Different nb of segment on logically vertical edges #")
1487 << shapeID( lftSide->Edge(0) ) << " and #"
1488 << shapeID( rgtSide->Edge(0) ) << ": "
1489 << nbSrcSegments << " != " << nbTgtSegments ));
1492 else // if ( nbTgtSegments == nbSrcSegments )
1497 // Compute 'vertical projection'
1498 if ( nbTgtMeshed == 0 )
1500 // compute nodes on target VERTEXes
1501 const UVPtStructVec& srcNodeStr = lftSide->GetUVPtStruct();
1502 if ( srcNodeStr.size() == 0 )
1503 return toSM( error( TCom("Invalid node positions on edge #") <<
1504 shapeID( lftSide->Edge(0) )));
1505 vector< SMDS_MeshNode* > newNodes( srcNodeStr.size() );
1506 for ( int is2ndV = 0; is2ndV < 2; ++is2ndV )
1508 const TopoDS_Edge& E = rgtSide->Edge( is2ndV ? rgtSide->NbEdges()-1 : 0 );
1509 TopoDS_Vertex v = myHelper->IthVertex( is2ndV, E );
1510 mesh->GetSubMesh( v )->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1511 const SMDS_MeshNode* n = SMESH_Algo::VertexNode( v, meshDS );
1512 newNodes[ is2ndV ? 0 : newNodes.size()-1 ] = (SMDS_MeshNode*) n;
1515 // compute nodes on target EDGEs
1516 DBGOUT( "COMPUTE V edge (proj) " << shapeID( lftSide->Edge(0)));
1517 rgtSide->Reverse(); // direct it same as the lftSide
1518 myHelper->SetElementsOnShape( false ); // myHelper holds the prism shape
1519 TopoDS_Edge tgtEdge;
1520 for ( size_t iN = 1; iN < srcNodeStr.size()-1; ++iN ) // add nodes
1522 gp_Pnt p = rgtSide->Value3d ( srcNodeStr[ iN ].normParam );
1523 double u = rgtSide->Parameter( srcNodeStr[ iN ].normParam, tgtEdge );
1524 newNodes[ iN ] = meshDS->AddNode( p.X(), p.Y(), p.Z() );
1525 meshDS->SetNodeOnEdge( newNodes[ iN ], tgtEdge, u );
1527 for ( size_t iN = 1; iN < srcNodeStr.size(); ++iN ) // add segments
1529 // find an EDGE to set a new segment
1530 std::pair<int, TopAbs_ShapeEnum> id2type =
1531 myHelper->GetMediumPos( newNodes[ iN-1 ], newNodes[ iN ] );
1532 if ( id2type.second != TopAbs_EDGE )
1534 // new nodes are on different EDGEs; put one of them on VERTEX
1535 const int edgeIndex = rgtSide->EdgeIndex( srcNodeStr[ iN-1 ].normParam );
1536 const double vertexParam = rgtSide->LastParameter( edgeIndex );
1537 TopoDS_Vertex vertex = rgtSide->LastVertex( edgeIndex );
1538 const SMDS_MeshNode* vn = SMESH_Algo::VertexNode( vertex, meshDS );
1539 const gp_Pnt p = BRep_Tool::Pnt( vertex );
1540 const int isPrev = ( Abs( srcNodeStr[ iN-1 ].normParam - vertexParam ) <
1541 Abs( srcNodeStr[ iN ].normParam - vertexParam ));
1542 meshDS->UnSetNodeOnShape( newNodes[ iN-isPrev ] );
1543 meshDS->SetNodeOnVertex ( newNodes[ iN-isPrev ], vertex );
1544 meshDS->MoveNode ( newNodes[ iN-isPrev ], p.X(), p.Y(), p.Z() );
1545 id2type.first = newNodes[ iN-(1-isPrev) ]->getshapeId();
1548 SMESH_MeshEditor::TListOfListOfNodes lln( 1, list< const SMDS_MeshNode* >() );
1549 lln.back().push_back ( vn );
1550 lln.back().push_front( newNodes[ iN-isPrev ] ); // to keep
1551 SMESH_MeshEditor( mesh ).MergeNodes( lln );
1554 SMDS_MeshElement* newEdge = myHelper->AddEdge( newNodes[ iN-1 ], newNodes[ iN ] );
1555 meshDS->SetMeshElementOnShape( newEdge, id2type.first );
1557 myHelper->SetElementsOnShape( true );
1558 for ( int i = 0; i < rgtSide->NbEdges(); ++i ) // update state of sub-meshes
1560 const TopoDS_Edge& E = rgtSide->Edge( i );
1561 SMESH_subMesh* tgtSM = mesh->GetSubMesh( E );
1562 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1565 // to continue projection from the just computed side as a source
1566 if ( !swapLeftRight && rgtSide->NbEdges() > 1 && w2q->second == iW )
1568 std::pair<int,int> wgt2quadKeyVal( w2q->first + 1, thePrism.myRightQuadIndex[ iW ]);
1569 wgt2quad.insert( wgt2quadKeyVal ); // it will be skipped by ++w2q
1570 wgt2quad.insert( wgt2quadKeyVal );
1571 w2q = wgt2quad.rbegin();
1576 // HOPE assigned hypotheses are OK, so that equal nb of segments will be generated
1577 //return toSM( error("Partial projection not implemented"));
1579 } // loop on quads of a composite wall side
1580 } // loop on the ordered wall sides
1584 for ( size_t iW = 0; iW != thePrism.myWallQuads.size(); ++iW )
1586 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1587 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1589 const TopoDS_Face& face = (*quad)->face;
1590 SMESH_subMesh* fSM = mesh->GetSubMesh( face );
1591 if ( ! fSM->IsMeshComputed() )
1593 // Top EDGEs must be projections from the bottom ones
1594 // to compute stuctured quad mesh on wall FACEs
1595 // ---------------------------------------------------
1596 const TopoDS_Edge& botE = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0);
1597 const TopoDS_Edge& topE = (*quad)->side[ QUAD_TOP_SIDE ].grid->Edge(0);
1598 SMESH_subMesh* botSM = mesh->GetSubMesh( botE );
1599 SMESH_subMesh* topSM = mesh->GetSubMesh( topE );
1600 SMESH_subMesh* srcSM = botSM;
1601 SMESH_subMesh* tgtSM = topSM;
1602 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1603 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1604 if ( !srcSM->IsMeshComputed() && tgtSM->IsMeshComputed() )
1605 std::swap( srcSM, tgtSM );
1607 if ( !srcSM->IsMeshComputed() )
1609 DBGOUT( "COMPUTE H edge " << srcSM->GetId());
1610 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE ); // nodes on VERTEXes
1611 srcSM->ComputeStateEngine( SMESH_subMesh::COMPUTE ); // segments on the EDGE
1614 if ( tgtSM->IsMeshComputed() &&
1615 tgtSM->GetSubMeshDS()->NbNodes() != srcSM->GetSubMeshDS()->NbNodes() )
1617 // the top EDGE is computed differently than the bottom one,
1618 // try to clear a wrong mesh
1619 bool isAdjFaceMeshed = false;
1620 PShapeIteratorPtr fIt = myHelper->GetAncestors( tgtSM->GetSubShape(),
1621 *mesh, TopAbs_FACE );
1622 while ( const TopoDS_Shape* f = fIt->next() )
1623 if (( isAdjFaceMeshed = mesh->GetSubMesh( *f )->IsMeshComputed() ))
1625 if ( isAdjFaceMeshed )
1626 return toSM( error( TCom("Different nb of segment on logically horizontal edges #")
1627 << shapeID( botE ) << " and #"
1628 << shapeID( topE ) << ": "
1629 << tgtSM->GetSubMeshDS()->NbElements() << " != "
1630 << srcSM->GetSubMeshDS()->NbElements() ));
1631 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1633 if ( !tgtSM->IsMeshComputed() )
1635 // compute nodes on VERTEXes
1636 SMESH_subMeshIteratorPtr smIt = tgtSM->getDependsOnIterator(/*includeSelf=*/false);
1637 while ( smIt->more() )
1638 smIt->next()->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1640 DBGOUT( "COMPUTE H edge (proj) " << tgtSM->GetId());
1641 projector1D->myHyp.SetSourceEdge( TopoDS::Edge( srcSM->GetSubShape() ));
1642 projector1D->InitComputeError();
1643 bool ok = projector1D->Compute( *mesh, tgtSM->GetSubShape() );
1646 SMESH_ComputeErrorPtr err = projector1D->GetComputeError();
1647 if ( err->IsOK() ) err->myName = COMPERR_ALGO_FAILED;
1648 tgtSM->GetComputeError() = err;
1652 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1655 // Compute quad mesh on wall FACEs
1656 // -------------------------------
1658 // make all EDGES meshed
1659 fSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1660 if ( !fSM->SubMeshesComputed() )
1661 return toSM( error( COMPERR_BAD_INPUT_MESH,
1662 "Not all edges have valid algorithm and hypothesis"));
1664 quadAlgo->InitComputeError();
1665 DBGOUT( "COMPUTE Quad face " << fSM->GetId());
1666 bool ok = quadAlgo->Compute( *mesh, face );
1667 fSM->GetComputeError() = quadAlgo->GetComputeError();
1670 fSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1672 if ( myHelper->GetIsQuadratic() )
1674 // fill myHelper with medium nodes built by quadAlgo
1675 SMDS_ElemIteratorPtr fIt = fSM->GetSubMeshDS()->GetElements();
1676 while ( fIt->more() )
1677 myHelper->AddTLinks( dynamic_cast<const SMDS_MeshFace*>( fIt->next() ));
1685 //=======================================================================
1687 * \brief Returns a source EDGE of propagation to a given EDGE
1689 //=======================================================================
1691 TopoDS_Edge StdMeshers_Prism_3D::findPropagationSource( const TopoDS_Edge& E )
1693 if ( myPropagChains )
1694 for ( size_t i = 0; !myPropagChains[i].IsEmpty(); ++i )
1695 if ( myPropagChains[i].Contains( E ))
1696 return TopoDS::Edge( myPropagChains[i].FindKey( 1 ));
1698 return TopoDS_Edge();
1701 //=======================================================================
1702 //function : Evaluate
1704 //=======================================================================
1706 bool StdMeshers_Prism_3D::Evaluate(SMESH_Mesh& theMesh,
1707 const TopoDS_Shape& theShape,
1708 MapShapeNbElems& aResMap)
1710 if ( theShape.ShapeType() == TopAbs_COMPOUND )
1713 for ( TopoDS_Iterator it( theShape ); it.More(); it.Next() )
1714 ok &= Evaluate( theMesh, it.Value(), aResMap );
1717 SMESH_MesherHelper helper( theMesh );
1719 myHelper->SetSubShape( theShape );
1721 // find face contains only triangles
1722 vector < SMESH_subMesh * >meshFaces;
1723 TopTools_SequenceOfShape aFaces;
1724 int NumBase = 0, i = 0, NbQFs = 0;
1725 for (TopExp_Explorer exp(theShape, TopAbs_FACE); exp.More(); exp.Next()) {
1727 aFaces.Append(exp.Current());
1728 SMESH_subMesh *aSubMesh = theMesh.GetSubMesh(exp.Current());
1729 meshFaces.push_back(aSubMesh);
1730 MapShapeNbElemsItr anIt = aResMap.find(meshFaces[i-1]);
1731 if( anIt==aResMap.end() )
1732 return toSM( error( "Submesh can not be evaluated"));
1734 std::vector<int> aVec = (*anIt).second;
1735 int nbtri = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1736 int nbqua = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1737 if( nbtri==0 && nbqua>0 ) {
1746 std::vector<int> aResVec(SMDSEntity_Last);
1747 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1748 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1749 aResMap.insert(std::make_pair(sm,aResVec));
1750 return toSM( error( "Submesh can not be evaluated" ));
1753 if(NumBase==0) NumBase = 1; // only quads => set 1 faces as base
1755 // find number of 1d elems for base face
1757 TopTools_MapOfShape Edges1;
1758 for (TopExp_Explorer exp(aFaces.Value(NumBase), TopAbs_EDGE); exp.More(); exp.Next()) {
1759 Edges1.Add(exp.Current());
1760 SMESH_subMesh *sm = theMesh.GetSubMesh(exp.Current());
1762 MapShapeNbElemsItr anIt = aResMap.find(sm);
1763 if( anIt == aResMap.end() ) continue;
1764 std::vector<int> aVec = (*anIt).second;
1765 nb1d += Max(aVec[SMDSEntity_Edge],aVec[SMDSEntity_Quad_Edge]);
1768 // find face opposite to base face
1770 for(i=1; i<=6; i++) {
1771 if(i==NumBase) continue;
1772 bool IsOpposite = true;
1773 for(TopExp_Explorer exp(aFaces.Value(i), TopAbs_EDGE); exp.More(); exp.Next()) {
1774 if( Edges1.Contains(exp.Current()) ) {
1784 // find number of 2d elems on side faces
1786 for(i=1; i<=6; i++) {
1787 if( i==OppNum || i==NumBase ) continue;
1788 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[i-1] );
1789 if( anIt == aResMap.end() ) continue;
1790 std::vector<int> aVec = (*anIt).second;
1791 nb2d += Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1794 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[NumBase-1] );
1795 std::vector<int> aVec = (*anIt).second;
1796 bool IsQuadratic = (aVec[SMDSEntity_Quad_Triangle]>aVec[SMDSEntity_Triangle]) ||
1797 (aVec[SMDSEntity_Quad_Quadrangle]>aVec[SMDSEntity_Quadrangle]);
1798 int nb2d_face0_3 = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1799 int nb2d_face0_4 = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1800 int nb0d_face0 = aVec[SMDSEntity_Node];
1801 int nb1d_face0_int = ( nb2d_face0_3*3 + nb2d_face0_4*4 - nb1d ) / 2;
1803 std::vector<int> aResVec(SMDSEntity_Last);
1804 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1806 aResVec[SMDSEntity_Quad_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
1807 aResVec[SMDSEntity_Quad_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
1808 aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
1811 aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
1812 aResVec[SMDSEntity_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
1813 aResVec[SMDSEntity_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
1815 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1816 aResMap.insert(std::make_pair(sm,aResVec));
1821 //================================================================================
1823 * \brief Create prisms
1824 * \param columns - columns of nodes generated from nodes of a mesh face
1825 * \param helper - helper initialized by mesh and shape to add prisms to
1827 //================================================================================
1829 bool StdMeshers_Prism_3D::AddPrisms( vector<const TNodeColumn*> & columns,
1830 SMESH_MesherHelper* helper)
1832 size_t nbNodes = columns.size();
1833 size_t nbZ = columns[0]->size();
1834 if ( nbZ < 2 ) return false;
1835 for ( size_t i = 1; i < nbNodes; ++i )
1836 if ( columns[i]->size() != nbZ )
1839 // find out orientation
1840 bool isForward = true;
1841 SMDS_VolumeTool vTool;
1843 switch ( nbNodes ) {
1845 SMDS_VolumeOfNodes tmpPenta ( (*columns[0])[z-1], // bottom
1848 (*columns[0])[z], // top
1851 vTool.Set( &tmpPenta );
1852 isForward = vTool.IsForward();
1856 SMDS_VolumeOfNodes tmpHex( (*columns[0])[z-1], (*columns[1])[z-1], // bottom
1857 (*columns[2])[z-1], (*columns[3])[z-1],
1858 (*columns[0])[z], (*columns[1])[z], // top
1859 (*columns[2])[z], (*columns[3])[z] );
1860 vTool.Set( &tmpHex );
1861 isForward = vTool.IsForward();
1865 const int di = (nbNodes+1) / 3;
1866 SMDS_VolumeOfNodes tmpVol ( (*columns[0] )[z-1],
1867 (*columns[di] )[z-1],
1868 (*columns[2*di])[z-1],
1871 (*columns[2*di])[z] );
1872 vTool.Set( &tmpVol );
1873 isForward = vTool.IsForward();
1876 // vertical loop on columns
1878 helper->SetElementsOnShape( true );
1880 switch ( nbNodes ) {
1882 case 3: { // ---------- pentahedra
1883 const int i1 = isForward ? 1 : 2;
1884 const int i2 = isForward ? 2 : 1;
1885 for ( z = 1; z < nbZ; ++z )
1886 helper->AddVolume( (*columns[0 ])[z-1], // bottom
1887 (*columns[i1])[z-1],
1888 (*columns[i2])[z-1],
1889 (*columns[0 ])[z], // top
1891 (*columns[i2])[z] );
1894 case 4: { // ---------- hexahedra
1895 const int i1 = isForward ? 1 : 3;
1896 const int i3 = isForward ? 3 : 1;
1897 for ( z = 1; z < nbZ; ++z )
1898 helper->AddVolume( (*columns[0])[z-1], (*columns[i1])[z-1], // bottom
1899 (*columns[2])[z-1], (*columns[i3])[z-1],
1900 (*columns[0])[z], (*columns[i1])[z], // top
1901 (*columns[2])[z], (*columns[i3])[z] );
1904 case 6: { // ---------- octahedra
1905 const int iBase1 = isForward ? -1 : 0;
1906 const int iBase2 = isForward ? 0 :-1;
1907 for ( z = 1; z < nbZ; ++z )
1908 helper->AddVolume( (*columns[0])[z+iBase1], (*columns[1])[z+iBase1], // bottom or top
1909 (*columns[2])[z+iBase1], (*columns[3])[z+iBase1],
1910 (*columns[4])[z+iBase1], (*columns[5])[z+iBase1],
1911 (*columns[0])[z+iBase2], (*columns[1])[z+iBase2], // top or bottom
1912 (*columns[2])[z+iBase2], (*columns[3])[z+iBase2],
1913 (*columns[4])[z+iBase2], (*columns[5])[z+iBase2] );
1916 default: // ---------- polyhedra
1917 vector<int> quantities( 2 + nbNodes, 4 );
1918 quantities[0] = quantities[1] = nbNodes;
1919 columns.resize( nbNodes + 1 );
1920 columns[ nbNodes ] = columns[ 0 ];
1921 const int i1 = isForward ? 1 : 3;
1922 const int i3 = isForward ? 3 : 1;
1923 const int iBase1 = isForward ? -1 : 0;
1924 const int iBase2 = isForward ? 0 :-1;
1925 vector<const SMDS_MeshNode*> nodes( 2*nbNodes + 4*nbNodes);
1926 for ( z = 1; z < nbZ; ++z )
1928 for ( size_t i = 0; i < nbNodes; ++i ) {
1929 nodes[ i ] = (*columns[ i ])[z+iBase1]; // bottom or top
1930 nodes[ 2*nbNodes-i-1 ] = (*columns[ i ])[z+iBase2]; // top or bottom
1932 int di = 2*nbNodes + 4*i;
1933 nodes[ di+0 ] = (*columns[i ])[z ];
1934 nodes[ di+i1] = (*columns[i+1])[z ];
1935 nodes[ di+2 ] = (*columns[i+1])[z-1];
1936 nodes[ di+i3] = (*columns[i ])[z-1];
1938 helper->AddPolyhedralVolume( nodes, quantities );
1941 } // switch ( nbNodes )
1946 //================================================================================
1948 * \brief Find correspondence between bottom and top nodes
1949 * If elements on the bottom and top faces are topologically different,
1950 * and projection is possible and allowed, perform the projection
1951 * \retval bool - is a success or not
1953 //================================================================================
1955 bool StdMeshers_Prism_3D::assocOrProjBottom2Top( const gp_Trsf & bottomToTopTrsf,
1956 const Prism_3D::TPrismTopo& thePrism)
1958 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
1959 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
1961 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
1962 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
1964 if ( !botSMDS || botSMDS->NbElements() == 0 )
1966 _gen->Compute( *myHelper->GetMesh(), botSM->GetSubShape(), /*aShapeOnly=*/true );
1967 botSMDS = botSM->GetSubMeshDS();
1968 if ( !botSMDS || botSMDS->NbElements() == 0 )
1969 return toSM( error(TCom("No elements on face #") << botSM->GetId() ));
1972 bool needProject = !topSM->IsMeshComputed();
1973 if ( !needProject &&
1974 (botSMDS->NbElements() != topSMDS->NbElements() ||
1975 botSMDS->NbNodes() != topSMDS->NbNodes()))
1977 MESSAGE("nb elem bot " << botSMDS->NbElements() <<
1978 " top " << ( topSMDS ? topSMDS->NbElements() : 0 ));
1979 MESSAGE("nb node bot " << botSMDS->NbNodes() <<
1980 " top " << ( topSMDS ? topSMDS->NbNodes() : 0 ));
1981 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
1982 <<" and #"<< topSM->GetId() << " seems different" ));
1985 if ( 0/*needProject && !myProjectTriangles*/ )
1986 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
1987 <<" and #"<< topSM->GetId() << " seems different" ));
1988 ///RETURN_BAD_RESULT("Need to project but not allowed");
1990 NSProjUtils::TNodeNodeMap n2nMap;
1991 const NSProjUtils::TNodeNodeMap* n2nMapPtr = & n2nMap;
1994 if ( !projectBottomToTop( bottomToTopTrsf, thePrism ))
1996 n2nMapPtr = & TProjction2dAlgo::instance( this )->GetNodesMap();
1999 if ( !n2nMapPtr || (int) n2nMapPtr->size() < botSMDS->NbNodes() )
2001 // associate top and bottom faces
2002 NSProjUtils::TShapeShapeMap shape2ShapeMap;
2003 const bool sameTopo =
2004 NSProjUtils::FindSubShapeAssociation( thePrism.myBottom, myHelper->GetMesh(),
2005 thePrism.myTop, myHelper->GetMesh(),
2008 for ( size_t iQ = 0; iQ < thePrism.myWallQuads.size(); ++iQ )
2010 const Prism_3D::TQuadList& quadList = thePrism.myWallQuads[iQ];
2011 StdMeshers_FaceSidePtr botSide = quadList.front()->side[ QUAD_BOTTOM_SIDE ];
2012 StdMeshers_FaceSidePtr topSide = quadList.back ()->side[ QUAD_TOP_SIDE ];
2013 if ( botSide->NbEdges() == topSide->NbEdges() )
2015 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
2017 NSProjUtils::InsertAssociation( botSide->Edge( iE ),
2018 topSide->Edge( iE ), shape2ShapeMap );
2019 NSProjUtils::InsertAssociation( myHelper->IthVertex( 0, botSide->Edge( iE )),
2020 myHelper->IthVertex( 0, topSide->Edge( iE )),
2026 TopoDS_Vertex vb, vt;
2027 StdMeshers_FaceSidePtr sideB, sideT;
2028 vb = myHelper->IthVertex( 0, botSide->Edge( 0 ));
2029 vt = myHelper->IthVertex( 0, topSide->Edge( 0 ));
2030 sideB = quadList.front()->side[ QUAD_LEFT_SIDE ];
2031 sideT = quadList.back ()->side[ QUAD_LEFT_SIDE ];
2032 if ( vb.IsSame( sideB->FirstVertex() ) &&
2033 vt.IsSame( sideT->LastVertex() ))
2035 NSProjUtils::InsertAssociation( botSide->Edge( 0 ),
2036 topSide->Edge( 0 ), shape2ShapeMap );
2037 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2039 vb = myHelper->IthVertex( 1, botSide->Edge( botSide->NbEdges()-1 ));
2040 vt = myHelper->IthVertex( 1, topSide->Edge( topSide->NbEdges()-1 ));
2041 sideB = quadList.front()->side[ QUAD_RIGHT_SIDE ];
2042 sideT = quadList.back ()->side[ QUAD_RIGHT_SIDE ];
2043 if ( vb.IsSame( sideB->FirstVertex() ) &&
2044 vt.IsSame( sideT->LastVertex() ))
2046 NSProjUtils::InsertAssociation( botSide->Edge( botSide->NbEdges()-1 ),
2047 topSide->Edge( topSide->NbEdges()-1 ),
2049 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2054 // Find matching nodes of top and bottom faces
2055 n2nMapPtr = & n2nMap;
2056 if ( ! NSProjUtils::FindMatchingNodesOnFaces( thePrism.myBottom, myHelper->GetMesh(),
2057 thePrism.myTop, myHelper->GetMesh(),
2058 shape2ShapeMap, n2nMap ))
2061 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
2062 <<" and #"<< topSM->GetId() << " seems different" ));
2064 return toSM( error(TCom("Topology of faces #") << botSM->GetId()
2065 <<" and #"<< topSM->GetId() << " seems different" ));
2069 // Fill myBotToColumnMap
2071 int zSize = myBlock.VerticalSize();
2072 TNodeNodeMap::const_iterator bN_tN = n2nMapPtr->begin();
2073 for ( ; bN_tN != n2nMapPtr->end(); ++bN_tN )
2075 const SMDS_MeshNode* botNode = bN_tN->first;
2076 const SMDS_MeshNode* topNode = bN_tN->second;
2077 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
2078 continue; // wall columns are contained in myBlock
2079 // create node column
2080 Prism_3D::TNode bN( botNode );
2081 TNode2ColumnMap::iterator bN_col =
2082 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2083 TNodeColumn & column = bN_col->second;
2084 column.resize( zSize );
2085 column.front() = botNode;
2086 column.back() = topNode;
2091 //================================================================================
2093 * \brief Remove faces from the top face and re-create them by projection from the bottom
2094 * \retval bool - a success or not
2096 //================================================================================
2098 bool StdMeshers_Prism_3D::projectBottomToTop( const gp_Trsf & bottomToTopTrsf,
2099 const Prism_3D::TPrismTopo& thePrism )
2101 if ( project2dMesh( thePrism.myBottom, thePrism.myTop ))
2105 NSProjUtils::TNodeNodeMap& n2nMap =
2106 (NSProjUtils::TNodeNodeMap&) TProjction2dAlgo::instance( this )->GetNodesMap();
2111 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2112 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
2113 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
2115 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
2116 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
2118 if ( topSMDS && topSMDS->NbElements() > 0 )
2120 //topSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2121 for ( SMDS_ElemIteratorPtr eIt = topSMDS->GetElements(); eIt->more(); )
2122 meshDS->RemoveFreeElement( eIt->next(), topSMDS, /*fromGroups=*/false );
2123 for ( SMDS_NodeIteratorPtr nIt = topSMDS->GetNodes(); nIt->more(); )
2124 meshDS->RemoveFreeNode( nIt->next(), topSMDS, /*fromGroups=*/false );
2127 const TopoDS_Face& botFace = thePrism.myBottom; // oriented within
2128 const TopoDS_Face& topFace = thePrism.myTop; // the 3D SHAPE
2129 int topFaceID = meshDS->ShapeToIndex( thePrism.myTop );
2131 SMESH_MesherHelper botHelper( *myHelper->GetMesh() );
2132 botHelper.SetSubShape( botFace );
2133 botHelper.ToFixNodeParameters( true );
2135 SMESH_MesherHelper topHelper( *myHelper->GetMesh() );
2136 topHelper.SetSubShape( topFace );
2137 topHelper.ToFixNodeParameters( true );
2138 double distXYZ[4], fixTol = 10 * topHelper.MaxTolerance( topFace );
2140 // Fill myBotToColumnMap
2142 int zSize = myBlock.VerticalSize();
2143 Prism_3D::TNode prevTNode;
2144 SMDS_NodeIteratorPtr nIt = botSMDS->GetNodes();
2145 while ( nIt->more() )
2147 const SMDS_MeshNode* botNode = nIt->next();
2148 const SMDS_MeshNode* topNode = 0;
2149 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
2150 continue; // strange
2152 Prism_3D::TNode bN( botNode );
2153 if ( bottomToTopTrsf.Form() == gp_Identity )
2155 // compute bottom node params
2156 gp_XYZ paramHint(-1,-1,-1);
2157 if ( prevTNode.IsNeighbor( bN ))
2159 paramHint = prevTNode.GetParams();
2160 // double tol = 1e-2 * ( prevTNode.GetCoords() - bN.GetCoords() ).Modulus();
2161 // myBlock.SetTolerance( Min( myBlock.GetTolerance(), tol ));
2163 if ( !myBlock.ComputeParameters( bN.GetCoords(), bN.ChangeParams(),
2164 ID_BOT_FACE, paramHint ))
2165 return toSM( error(TCom("Can't compute normalized parameters for node ")
2166 << botNode->GetID() << " on the face #"<< botSM->GetId() ));
2168 // compute top node coords
2169 gp_XYZ topXYZ; gp_XY topUV;
2170 if ( !myBlock.FacePoint( ID_TOP_FACE, bN.GetParams(), topXYZ ) ||
2171 !myBlock.FaceUV ( ID_TOP_FACE, bN.GetParams(), topUV ))
2172 return toSM( error(TCom("Can't compute coordinates "
2173 "by normalized parameters on the face #")<< topSM->GetId() ));
2174 topNode = meshDS->AddNode( topXYZ.X(),topXYZ.Y(),topXYZ.Z() );
2175 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2177 else // use bottomToTopTrsf
2179 gp_XYZ coords = bN.GetCoords();
2180 bottomToTopTrsf.Transforms( coords );
2181 topNode = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
2182 gp_XY topUV = botHelper.GetNodeUV( botFace, botNode, 0, &checkUV );
2183 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2185 if ( topHelper.CheckNodeUV( topFace, topNode, topUV, fixTol, /*force=*/false, distXYZ ) &&
2186 distXYZ[0] > fixTol && distXYZ[0] < fixTol * 1e+3 )
2187 meshDS->MoveNode( topNode, distXYZ[1], distXYZ[2], distXYZ[3] ); // transform can be inaccurate
2189 // create node column
2190 TNode2ColumnMap::iterator bN_col =
2191 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2192 TNodeColumn & column = bN_col->second;
2193 column.resize( zSize );
2194 column.front() = botNode;
2195 column.back() = topNode;
2197 n2nMap.insert( n2nMap.end(), make_pair( botNode, topNode ));
2199 if ( _computeCanceled )
2200 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
2205 const bool oldSetElemsOnShape = myHelper->SetElementsOnShape( false );
2207 // care of orientation;
2208 // if the bottom faces is orienetd OK then top faces must be reversed
2209 bool reverseTop = true;
2210 if ( myHelper->NbAncestors( botFace, *myBlock.Mesh(), TopAbs_SOLID ) > 1 )
2211 reverseTop = ! myHelper->IsReversedSubMesh( botFace );
2212 int iFrw, iRev, *iPtr = &( reverseTop ? iRev : iFrw );
2214 // loop on bottom mesh faces
2215 SMDS_ElemIteratorPtr faceIt = botSMDS->GetElements();
2216 vector< const SMDS_MeshNode* > nodes;
2217 while ( faceIt->more() )
2219 const SMDS_MeshElement* face = faceIt->next();
2220 if ( !face || face->GetType() != SMDSAbs_Face )
2223 // find top node in columns for each bottom node
2224 int nbNodes = face->NbCornerNodes();
2225 nodes.resize( nbNodes );
2226 for ( iFrw = 0, iRev = nbNodes-1; iFrw < nbNodes; ++iFrw, --iRev )
2228 const SMDS_MeshNode* n = face->GetNode( *iPtr );
2229 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) {
2230 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
2231 if ( bot_column == myBotToColumnMap.end() )
2232 return toSM( error(TCom("No nodes found above node ") << n->GetID() ));
2233 nodes[ iFrw ] = bot_column->second.back();
2236 const TNodeColumn* column = myBlock.GetNodeColumn( n );
2238 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
2239 nodes[ iFrw ] = column->back();
2242 SMDS_MeshElement* newFace = 0;
2243 switch ( nbNodes ) {
2246 newFace = myHelper->AddFace(nodes[0], nodes[1], nodes[2]);
2250 newFace = myHelper->AddFace( nodes[0], nodes[1], nodes[2], nodes[3] );
2254 newFace = meshDS->AddPolygonalFace( nodes );
2257 meshDS->SetMeshElementOnShape( newFace, topFaceID );
2260 myHelper->SetElementsOnShape( oldSetElemsOnShape );
2262 // Check the projected mesh
2264 if ( thePrism.myNbEdgesInWires.size() > 1 && // there are holes
2265 topHelper.IsDistorted2D( topSM, /*checkUV=*/false ))
2267 SMESH_MeshEditor editor( topHelper.GetMesh() );
2269 // smooth in 2D or 3D?
2270 TopLoc_Location loc;
2271 Handle(Geom_Surface) surface = BRep_Tool::Surface( topFace, loc );
2272 bool isPlanar = GeomLib_IsPlanarSurface( surface ).IsPlanar();
2274 set<const SMDS_MeshNode*> fixedNodes;
2275 TIDSortedElemSet faces;
2276 for ( faceIt = topSMDS->GetElements(); faceIt->more(); )
2277 faces.insert( faces.end(), faceIt->next() );
2280 for ( int isCentroidal = 0; isCentroidal < 2; ++isCentroidal )
2282 SMESH_MeshEditor::SmoothMethod algo =
2283 isCentroidal ? SMESH_MeshEditor::CENTROIDAL : SMESH_MeshEditor::LAPLACIAN;
2285 int nbAttempts = isCentroidal ? 1 : 10;
2286 for ( int iAttemp = 0; iAttemp < nbAttempts; ++iAttemp )
2288 TIDSortedElemSet workFaces = faces;
2291 editor.Smooth( workFaces, fixedNodes, algo, /*nbIterations=*/ 10,
2292 /*theTgtAspectRatio=*/1.0, /*the2D=*/!isPlanar);
2294 if (( isOk = !topHelper.IsDistorted2D( topSM, /*checkUV=*/true )) &&
2300 return toSM( error( TCom("Projection from face #") << botSM->GetId()
2301 << " to face #" << topSM->GetId()
2302 << " failed: inverted elements created"));
2305 TProjction2dAlgo::instance( this )->SetEventListener( topSM );
2310 //=======================================================================
2311 //function : getSweepTolerance
2312 //purpose : Compute tolerance to pass to StdMeshers_Sweeper
2313 //=======================================================================
2315 double StdMeshers_Prism_3D::getSweepTolerance( const Prism_3D::TPrismTopo& thePrism )
2317 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2318 SMESHDS_SubMesh * sm[2] = { meshDS->MeshElements( thePrism.myBottom ),
2319 meshDS->MeshElements( thePrism.myTop ) };
2320 double minDist = 1e100;
2322 vector< SMESH_TNodeXYZ > nodes;
2323 for ( int iSM = 0; iSM < 2; ++iSM )
2325 if ( !sm[ iSM ]) continue;
2327 SMDS_ElemIteratorPtr fIt = sm[ iSM ]->GetElements();
2328 while ( fIt->more() )
2330 const SMDS_MeshElement* face = fIt->next();
2331 const int nbNodes = face->NbCornerNodes();
2332 SMDS_ElemIteratorPtr nIt = face->nodesIterator();
2334 nodes.resize( nbNodes + 1 );
2335 for ( int iN = 0; iN < nbNodes; ++iN )
2336 nodes[ iN ] = nIt->next();
2337 nodes.back() = nodes[0];
2341 for ( int iN = 0; iN < nbNodes; ++iN )
2343 if ( nodes[ iN ]._node->GetPosition()->GetDim() < 2 &&
2344 nodes[ iN+1 ]._node->GetPosition()->GetDim() < 2 )
2346 // it's a boundary link; measure distance of other
2347 // nodes to this link
2348 gp_XYZ linkDir = nodes[ iN ] - nodes[ iN+1 ];
2349 double linkLen = linkDir.Modulus();
2350 bool isDegen = ( linkLen < numeric_limits<double>::min() );
2351 if ( !isDegen ) linkDir /= linkLen;
2352 for ( int iN2 = 0; iN2 < nbNodes; ++iN2 ) // loop on other nodes
2354 if ( nodes[ iN2 ] == nodes[ iN ] ||
2355 nodes[ iN2 ] == nodes[ iN+1 ]) continue;
2358 dist2 = ( nodes[ iN ] - nodes[ iN2 ]).SquareModulus();
2362 dist2 = linkDir.CrossSquareMagnitude( nodes[ iN ] - nodes[ iN2 ]);
2364 if ( dist2 > numeric_limits<double>::min() )
2365 minDist = Min ( minDist, dist2 );
2368 // measure length link
2369 else if ( nodes[ iN ]._node < nodes[ iN+1 ]._node ) // not to measure same link twice
2371 dist2 = ( nodes[ iN ] - nodes[ iN+1 ]).SquareModulus();
2372 if ( dist2 > numeric_limits<double>::min() )
2373 minDist = Min ( minDist, dist2 );
2378 return 0.1 * Sqrt ( minDist );
2381 //=======================================================================
2382 //function : isSimpleQuad
2383 //purpose : check if the bottom FACE is meshable with nice qudrangles,
2384 // if so the block aproach can work rather fast.
2385 // This is a temporary mean caused by problems in StdMeshers_Sweeper
2386 //=======================================================================
2388 bool StdMeshers_Prism_3D::isSimpleBottom( const Prism_3D::TPrismTopo& thePrism )
2390 // analyse angles between edges
2391 double nbConcaveAng = 0, nbConvexAng = 0;
2392 TopoDS_Face reverseBottom = TopoDS::Face( thePrism.myBottom.Reversed() ); // see initPrism()
2393 TopoDS_Vertex commonV;
2394 const list< TopoDS_Edge >& botEdges = thePrism.myBottomEdges;
2395 list< TopoDS_Edge >::const_iterator edge = botEdges.begin();
2396 while ( edge != botEdges.end() )
2398 if ( SMESH_Algo::isDegenerated( *edge ))
2400 TopoDS_Edge e1 = *edge++;
2401 TopoDS_Edge e2 = ( edge == botEdges.end() ? botEdges.front() : *edge );
2402 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2404 e2 = botEdges.front();
2405 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2408 double angle = myHelper->GetAngle( e1, e2, reverseBottom, commonV );
2409 if ( angle < -5 * M_PI/180 )
2410 if ( ++nbConcaveAng > 1 )
2412 if ( angle > 85 * M_PI/180 )
2413 if ( ++nbConvexAng > 4 )
2419 //=======================================================================
2420 //function : project2dMesh
2421 //purpose : Project mesh faces from a source FACE of one prism (theSrcFace)
2422 // to a source FACE of another prism (theTgtFace)
2423 //=======================================================================
2425 bool StdMeshers_Prism_3D::project2dMesh(const TopoDS_Face& theSrcFace,
2426 const TopoDS_Face& theTgtFace)
2428 TProjction2dAlgo* projector2D = TProjction2dAlgo::instance( this );
2429 projector2D->myHyp.SetSourceFace( theSrcFace );
2430 bool ok = projector2D->Compute( *myHelper->GetMesh(), theTgtFace );
2432 SMESH_subMesh* tgtSM = myHelper->GetMesh()->GetSubMesh( theTgtFace );
2433 if ( !ok && tgtSM->GetSubMeshDS() ) {
2434 //tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2435 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2436 SMESHDS_SubMesh* tgtSMDS = tgtSM->GetSubMeshDS();
2437 for ( SMDS_ElemIteratorPtr eIt = tgtSMDS->GetElements(); eIt->more(); )
2438 meshDS->RemoveFreeElement( eIt->next(), tgtSMDS, /*fromGroups=*/false );
2439 for ( SMDS_NodeIteratorPtr nIt = tgtSMDS->GetNodes(); nIt->more(); )
2440 meshDS->RemoveFreeNode( nIt->next(), tgtSMDS, /*fromGroups=*/false );
2442 tgtSM->ComputeStateEngine ( SMESH_subMesh::CHECK_COMPUTE_STATE );
2443 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
2445 projector2D->SetEventListener( tgtSM );
2450 //================================================================================
2452 * \brief Set projection coordinates of a node to a face and it's sub-shapes
2453 * \param faceID - the face given by in-block ID
2454 * \param params - node normalized parameters
2455 * \retval bool - is a success
2457 //================================================================================
2459 bool StdMeshers_Prism_3D::setFaceAndEdgesXYZ( const int faceID, const gp_XYZ& params, int z )
2461 // find base and top edges of the face
2462 enum { BASE = 0, TOP, LEFT, RIGHT };
2463 vector< int > edgeVec; // 0-base, 1-top
2464 SMESH_Block::GetFaceEdgesIDs( faceID, edgeVec );
2466 myBlock.EdgePoint( edgeVec[ BASE ], params, myShapeXYZ[ edgeVec[ BASE ]]);
2467 myBlock.EdgePoint( edgeVec[ TOP ], params, myShapeXYZ[ edgeVec[ TOP ]]);
2469 SHOWYXZ("\nparams ", params);
2470 SHOWYXZ("TOP is " <<edgeVec[ TOP ], myShapeXYZ[ edgeVec[ TOP]]);
2471 SHOWYXZ("BASE is "<<edgeVec[ BASE], myShapeXYZ[ edgeVec[ BASE]]);
2473 if ( faceID == SMESH_Block::ID_Fx0z || faceID == SMESH_Block::ID_Fx1z )
2475 myBlock.EdgePoint( edgeVec[ LEFT ], params, myShapeXYZ[ edgeVec[ LEFT ]]);
2476 myBlock.EdgePoint( edgeVec[ RIGHT ], params, myShapeXYZ[ edgeVec[ RIGHT ]]);
2478 SHOWYXZ("VER "<<edgeVec[ LEFT], myShapeXYZ[ edgeVec[ LEFT]]);
2479 SHOWYXZ("VER "<<edgeVec[ RIGHT], myShapeXYZ[ edgeVec[ RIGHT]]);
2481 myBlock.FacePoint( faceID, params, myShapeXYZ[ faceID ]);
2482 SHOWYXZ("FacePoint "<<faceID, myShapeXYZ[ faceID]);
2487 //=======================================================================
2489 //purpose : If (!isOK), sets the error to a sub-mesh of a current SOLID
2490 //=======================================================================
2492 bool StdMeshers_Prism_3D::toSM( bool isOK )
2494 if ( mySetErrorToSM &&
2497 !myHelper->GetSubShape().IsNull() &&
2498 myHelper->GetSubShape().ShapeType() == TopAbs_SOLID)
2500 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( myHelper->GetSubShape() );
2501 sm->GetComputeError() = this->GetComputeError();
2502 // clear error in order not to return it twice
2503 _error = COMPERR_OK;
2509 //=======================================================================
2510 //function : shapeID
2511 //purpose : Return index of a shape
2512 //=======================================================================
2514 int StdMeshers_Prism_3D::shapeID( const TopoDS_Shape& S )
2516 if ( S.IsNull() ) return 0;
2517 if ( !myHelper ) return -3;
2518 return myHelper->GetMeshDS()->ShapeToIndex( S );
2521 namespace // utils used by StdMeshers_Prism_3D::IsApplicable()
2523 struct EdgeWithNeighbors
2527 EdgeWithNeighbors(const TopoDS_Edge& E, int iE, int nbE, int shift = 0 ):
2529 _iL( SMESH_MesherHelper::WrapIndex( iE-1, nbE ) + shift ),
2530 _iR( SMESH_MesherHelper::WrapIndex( iE+1, nbE ) + shift )
2532 //_edge.Orientation( TopAbs_FORWARD ); // for operator==() to work
2534 EdgeWithNeighbors() {}
2535 bool IsInternal() const { return !_edge.IsNull() && _edge.Orientation() == TopAbs_INTERNAL; }
2537 // PrismSide contains all FACEs linking a bottom EDGE with a top one.
2540 TopoDS_Face _face; // a currently treated upper FACE
2541 TopTools_IndexedMapOfShape *_faces; // all FACEs (pointer because of a private copy constructor)
2542 TopoDS_Edge _topEdge; // a current top EDGE
2543 vector< EdgeWithNeighbors >*_edges; // all EDGEs of _face
2544 int _iBotEdge; // index of _topEdge within _edges
2545 vector< bool > _isCheckedEdge; // mark EDGEs whose two owner FACEs found
2546 int _nbCheckedEdges; // nb of EDGEs whose location is defined
2547 PrismSide *_leftSide; // neighbor sides
2548 PrismSide *_rightSide;
2549 bool _isInternal; // whether this side raises from an INTERNAL EDGE
2550 void SetExcluded() { _leftSide = _rightSide = NULL; }
2551 bool IsExcluded() const { return !_leftSide; }
2552 const TopoDS_Edge& Edge( int i ) const
2554 return (*_edges)[ i ]._edge;
2556 int FindEdge( const TopoDS_Edge& E ) const
2558 for ( size_t i = 0; i < _edges->size(); ++i )
2559 if ( E.IsSame( Edge( i ))) return i;
2562 bool IsSideFace( const TopoDS_Shape& face, const bool checkNeighbors ) const
2564 if ( _faces->Contains( face )) // avoid returning true for a prism top FACE
2565 return ( !_face.IsNull() || !( face.IsSame( _faces->FindKey( _faces->Extent() ))));
2567 if ( checkNeighbors )
2568 return (( _leftSide && _leftSide->IsSideFace ( face, false )) ||
2569 ( _rightSide && _rightSide->IsSideFace( face, false )));
2574 //--------------------------------------------------------------------------------
2576 * \brief Return ordered edges of a face
2578 bool getEdges( const TopoDS_Face& face,
2579 vector< EdgeWithNeighbors > & edges,
2580 const bool noHolesAllowed)
2582 TopoDS_Face f = face;
2583 if ( f.Orientation() != TopAbs_FORWARD &&
2584 f.Orientation() != TopAbs_REVERSED )
2585 f.Orientation( TopAbs_FORWARD );
2586 list< TopoDS_Edge > ee;
2587 list< int > nbEdgesInWires;
2588 int nbW = SMESH_Block::GetOrderedEdges( f, ee, nbEdgesInWires );
2589 if ( nbW > 1 && noHolesAllowed )
2593 list< TopoDS_Edge >::iterator e = ee.begin();
2594 list< int >::iterator nbE = nbEdgesInWires.begin();
2595 for ( ; nbE != nbEdgesInWires.end(); ++nbE )
2596 for ( iE = 0; iE < *nbE; ++e, ++iE )
2597 if ( SMESH_Algo::isDegenerated( *e ))
2599 e = --ee.erase( e );
2606 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2608 for ( iE = 0; iE < *nbE; ++e, ++iE )
2609 edges.push_back( EdgeWithNeighbors( *e, iE, *nbE, nbTot ));
2613 // IPAL53099. Set correct neighbors to INTERNAL EDGEs, which can be connected to
2614 // EDGEs of the outer WIRE but this fact can't be detected by their order.
2617 int iFirst = 0, iLast;
2618 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2620 iLast = iFirst + *nbE - 1;
2621 TopoDS_Vertex vv[2] = { SMESH_MesherHelper::IthVertex( 0, edges[ iFirst ]._edge ),
2622 SMESH_MesherHelper::IthVertex( 1, edges[ iLast ]._edge ) };
2623 bool isConnectOk = ( vv[0].IsSame( vv[1] ));
2626 // look for an EDGE of the outer WIRE connected to vv
2627 TopoDS_Vertex v0, v1;
2628 for ( iE = 0; iE < nbEdgesInWires.front(); ++iE )
2630 v0 = SMESH_MesherHelper::IthVertex( 0, edges[ iE ]._edge );
2631 v1 = SMESH_MesherHelper::IthVertex( 1, edges[ iE ]._edge );
2632 if ( vv[0].IsSame( v0 ) || vv[0].IsSame( v1 ))
2633 edges[ iFirst ]._iL = iE;
2634 if ( vv[1].IsSame( v0 ) || vv[1].IsSame( v1 ))
2635 edges[ iLast ]._iR = iE;
2641 return edges.size();
2643 //--------------------------------------------------------------------------------
2645 * \brief Return another faces sharing an edge
2647 const TopoDS_Face & getAnotherFace( const TopoDS_Face& face,
2648 const TopoDS_Edge& edge,
2649 TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge)
2651 TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edge ));
2652 for ( ; faceIt.More(); faceIt.Next() )
2653 if ( !face.IsSame( faceIt.Value() ))
2654 return TopoDS::Face( faceIt.Value() );
2658 //--------------------------------------------------------------------------------
2660 * \brief Return number of faces sharing given edges
2662 // int nbAdjacentFaces( const std::vector< EdgeWithNeighbors >& edges,
2663 // const TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge )
2665 // TopTools_MapOfShape adjFaces;
2667 // for ( size_t i = 0; i < edges.size(); ++i )
2669 // TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edges[i]._edge ));
2670 // for ( ; faceIt.More(); faceIt.Next() )
2671 // adjFaces.Add( faceIt.Value() );
2673 // return adjFaces.Extent();
2677 //================================================================================
2679 * \brief Return true if the algorithm can mesh this shape
2680 * \param [in] aShape - shape to check
2681 * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
2682 * else, returns OK if at least one shape is OK
2684 //================================================================================
2686 bool StdMeshers_Prism_3D::IsApplicable(const TopoDS_Shape & shape, bool toCheckAll)
2688 TopExp_Explorer sExp( shape, TopAbs_SOLID );
2692 for ( ; sExp.More(); sExp.Next() )
2696 TopExp_Explorer shExp( sExp.Current(), TopAbs_SHELL );
2697 if ( shExp.More() ) {
2698 shell = shExp.Current();
2703 if ( shell.IsNull() ) {
2704 if ( toCheckAll ) return false;
2708 TopTools_IndexedMapOfShape allFaces;
2709 TopExp::MapShapes( shell, TopAbs_FACE, allFaces );
2710 if ( allFaces.Extent() < 3 ) {
2711 if ( toCheckAll ) return false;
2715 if ( allFaces.Extent() == 6 )
2717 TopTools_IndexedMapOfOrientedShape map;
2718 bool isBox = SMESH_Block::FindBlockShapes( TopoDS::Shell( shell ),
2719 TopoDS_Vertex(), TopoDS_Vertex(), map );
2721 if ( !toCheckAll ) return true;
2726 TopTools_IndexedMapOfShape allShapes;
2727 TopExp::MapShapes( shape, allShapes );
2730 TopTools_IndexedDataMapOfShapeListOfShape facesOfEdge;
2731 TopTools_ListIteratorOfListOfShape faceIt;
2732 TopExp::MapShapesAndAncestors( sExp.Current(), TopAbs_EDGE, TopAbs_FACE , facesOfEdge );
2733 if ( facesOfEdge.IsEmpty() ) {
2734 if ( toCheckAll ) return false;
2738 typedef vector< EdgeWithNeighbors > TEdgeWithNeighborsVec;
2739 vector< TEdgeWithNeighborsVec > faceEdgesVec( allFaces.Extent() + 1 );
2740 const size_t nbEdgesMax = facesOfEdge.Extent() * 2; // there can be seam EDGEs
2741 TopTools_IndexedMapOfShape* facesOfSide = new TopTools_IndexedMapOfShape[ nbEdgesMax ];
2742 SMESHUtils::ArrayDeleter<TopTools_IndexedMapOfShape> delFacesOfSide( facesOfSide );
2744 // try to use each face as a bottom one
2745 bool prismDetected = false;
2746 vector< PrismSide > sides;
2747 for ( int iF = 1; iF < allFaces.Extent() && !prismDetected; ++iF )
2749 const TopoDS_Face& botF = TopoDS::Face( allFaces( iF ));
2751 TEdgeWithNeighborsVec& botEdges = faceEdgesVec[ iF ];
2752 if ( botEdges.empty() )
2753 if ( !getEdges( botF, botEdges, /*noHoles=*/false ))
2755 if ( allFaces.Extent()-1 <= (int) botEdges.size() )
2756 continue; // all faces are adjacent to botF - no top FACE
2758 // init data of side FACEs
2760 sides.resize( botEdges.size() );
2761 for ( size_t iS = 0; iS < botEdges.size(); ++iS )
2763 sides[ iS ]._topEdge = botEdges[ iS ]._edge;
2764 sides[ iS ]._face = botF;
2765 sides[ iS ]._leftSide = & sides[ botEdges[ iS ]._iR ];
2766 sides[ iS ]._rightSide = & sides[ botEdges[ iS ]._iL ];
2767 sides[ iS ]._isInternal = botEdges[ iS ].IsInternal();
2768 sides[ iS ]._faces = & facesOfSide[ iS ];
2769 sides[ iS ]._faces->Clear();
2772 bool isOK = true; // ok for a current botF
2773 bool isAdvanced = true; // is new data found in a current loop
2774 int nbFoundSideFaces = 0;
2775 for ( int iLoop = 0; isOK && isAdvanced; ++iLoop )
2778 for ( size_t iS = 0; iS < sides.size() && isOK; ++iS )
2780 PrismSide& side = sides[ iS ];
2781 if ( side._face.IsNull() )
2782 continue; // probably the prism top face is the last of side._faces
2784 if ( side._topEdge.IsNull() )
2786 // find vertical EDGEs --- EGDEs shared with neighbor side FACEs
2787 for ( int is2nd = 0; is2nd < 2 && isOK; ++is2nd ) // 2 adjacent neighbors
2789 int di = is2nd ? 1 : -1;
2790 const PrismSide* adjSide = is2nd ? side._rightSide : side._leftSide;
2791 for ( size_t i = 1; i < side._edges->size(); ++i )
2793 int iE = SMESH_MesherHelper::WrapIndex( i*di + side._iBotEdge, side._edges->size());
2794 if ( side._isCheckedEdge[ iE ] ) continue;
2795 const TopoDS_Edge& vertE = side.Edge( iE );
2796 const TopoDS_Shape& neighborF = getAnotherFace( side._face, vertE, facesOfEdge );
2797 bool isEdgeShared = (( adjSide->IsSideFace( neighborF, side._isInternal )) ||
2798 ( adjSide == &side && neighborF.IsSame( side._face )) );
2799 if ( isEdgeShared ) // vertE is shared with adjSide
2802 side._isCheckedEdge[ iE ] = true;
2803 side._nbCheckedEdges++;
2804 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
2805 if ( nbNotCheckedE == 1 )
2810 if ( i == 1 && iLoop == 0 ) isOK = false;
2816 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
2817 if ( nbNotCheckedE == 1 )
2819 vector<bool>::iterator ii = std::find( side._isCheckedEdge.begin(),
2820 side._isCheckedEdge.end(), false );
2821 if ( ii != side._isCheckedEdge.end() )
2823 size_t iE = std::distance( side._isCheckedEdge.begin(), ii );
2824 side._topEdge = side.Edge( iE );
2827 isOK = ( nbNotCheckedE >= 1 );
2829 else //if ( !side._topEdge.IsNull() )
2831 // get a next face of a side
2832 const TopoDS_Shape& f = getAnotherFace( side._face, side._topEdge, facesOfEdge );
2833 side._faces->Add( f );
2835 if ( f.IsSame( side._face ) || // _topEdge is a seam
2836 SMESH_MesherHelper::Count( f, TopAbs_WIRE, false ) != 1 )
2840 else if ( side._leftSide != & side && // not closed side face
2841 side._leftSide->_faces->Contains( f ))
2843 stop = true; // probably f is the prism top face
2844 side._leftSide->_face.Nullify();
2845 side._leftSide->_topEdge.Nullify();
2847 else if ( side._rightSide != & side &&
2848 side._rightSide->_faces->Contains( f ))
2850 stop = true; // probably f is the prism top face
2851 side._rightSide->_face.Nullify();
2852 side._rightSide->_topEdge.Nullify();
2856 side._face.Nullify();
2857 side._topEdge.Nullify();
2860 side._face = TopoDS::Face( f );
2861 int faceID = allFaces.FindIndex( side._face );
2862 side._edges = & faceEdgesVec[ faceID ];
2863 if ( side._edges->empty() )
2864 if ( !getEdges( side._face, * side._edges, /*noHoles=*/true ))
2866 const int nbE = side._edges->size();
2871 side._iBotEdge = side.FindEdge( side._topEdge );
2872 side._isCheckedEdge.clear();
2873 side._isCheckedEdge.resize( nbE, false );
2874 side._isCheckedEdge[ side._iBotEdge ] = true;
2875 side._nbCheckedEdges = 1; // bottom EDGE is known
2877 else // probably a triangular top face found
2879 side._face.Nullify();
2881 side._topEdge.Nullify();
2882 isOK = ( !side._edges->empty() || side._faces->Extent() > 1 );
2884 } //if ( !side._topEdge.IsNull() )
2886 } // loop on prism sides
2888 if ( nbFoundSideFaces > allFaces.Extent() )
2892 if ( iLoop > allFaces.Extent() * 10 )
2896 cerr << "BUG: infinite loop in StdMeshers_Prism_3D::IsApplicable()" << endl;
2899 } // while isAdvanced
2901 if ( isOK && sides[0]._faces->Extent() > 1 )
2903 const int nbFaces = sides[0]._faces->Extent();
2904 if ( botEdges.size() == 1 ) // cylinder
2906 prismDetected = ( nbFaces == allFaces.Extent()-1 );
2910 const TopoDS_Shape& topFace = sides[0]._faces->FindKey( nbFaces );
2912 for ( iS = 1; iS < sides.size(); ++iS )
2913 if ( ! sides[ iS ]._faces->Contains( topFace ))
2915 prismDetected = ( iS == sides.size() );
2918 } // loop on allFaces
2920 if ( !prismDetected && toCheckAll ) return false;
2921 if ( prismDetected && !toCheckAll ) return true;
2930 //================================================================================
2932 * \brief Return true if this node and other one belong to one face
2934 //================================================================================
2936 bool Prism_3D::TNode::IsNeighbor( const Prism_3D::TNode& other ) const
2938 if ( !other.myNode || !myNode ) return false;
2940 SMDS_ElemIteratorPtr fIt = other.myNode->GetInverseElementIterator(SMDSAbs_Face);
2941 while ( fIt->more() )
2942 if ( fIt->next()->GetNodeIndex( myNode ) >= 0 )
2947 //================================================================================
2949 * \brief Prism initialization
2951 //================================================================================
2953 void TPrismTopo::Clear()
2955 myShape3D.Nullify();
2958 myWallQuads.clear();
2959 myBottomEdges.clear();
2960 myNbEdgesInWires.clear();
2961 myWallQuads.clear();
2964 //================================================================================
2966 * \brief Set upside-down
2968 //================================================================================
2970 void TPrismTopo::SetUpsideDown()
2972 std::swap( myBottom, myTop );
2973 myBottomEdges.clear();
2974 std::reverse( myBottomEdges.begin(), myBottomEdges.end() );
2975 for ( size_t i = 0; i < myWallQuads.size(); ++i )
2977 myWallQuads[i].reverse();
2978 TQuadList::iterator q = myWallQuads[i].begin();
2979 for ( ; q != myWallQuads[i].end(); ++q )
2981 (*q)->shift( 2, /*keepUnitOri=*/true );
2983 myBottomEdges.push_back( myWallQuads[i].front()->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0) );
2987 } // namespace Prism_3D
2989 //================================================================================
2991 * \brief Constructor. Initialization is needed
2993 //================================================================================
2995 StdMeshers_PrismAsBlock::StdMeshers_PrismAsBlock()
3000 StdMeshers_PrismAsBlock::~StdMeshers_PrismAsBlock()
3004 void StdMeshers_PrismAsBlock::Clear()
3007 myShapeIDMap.Clear();
3011 delete mySide; mySide = 0;
3013 myParam2ColumnMaps.clear();
3014 myShapeIndex2ColumnMap.clear();
3017 //=======================================================================
3018 //function : initPrism
3019 //purpose : Analyse shape geometry and mesh.
3020 // If there are triangles on one of faces, it becomes 'bottom'.
3021 // thePrism.myBottom can be already set up.
3022 //=======================================================================
3024 bool StdMeshers_Prism_3D::initPrism(Prism_3D::TPrismTopo& thePrism,
3025 const TopoDS_Shape& theShape3D,
3026 const bool selectBottom)
3028 myHelper->SetSubShape( theShape3D );
3030 SMESH_subMesh* mainSubMesh = myHelper->GetMesh()->GetSubMeshContaining( theShape3D );
3031 if ( !mainSubMesh ) return toSM( error(COMPERR_BAD_INPUT_MESH,"Null submesh of shape3D"));
3033 // detect not-quad FACE sub-meshes of the 3D SHAPE
3034 list< SMESH_subMesh* > notQuadGeomSubMesh;
3035 list< SMESH_subMesh* > notQuadElemSubMesh;
3036 list< SMESH_subMesh* > meshedSubMesh;
3039 SMESH_subMeshIteratorPtr smIt = mainSubMesh->getDependsOnIterator(false,true);
3040 while ( smIt->more() )
3042 SMESH_subMesh* sm = smIt->next();
3043 const TopoDS_Shape& face = sm->GetSubShape();
3044 if ( face.ShapeType() > TopAbs_FACE ) break;
3045 else if ( face.ShapeType() < TopAbs_FACE ) continue;
3048 // is quadrangle FACE?
3049 list< TopoDS_Edge > orderedEdges;
3050 list< int > nbEdgesInWires;
3051 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( face ), orderedEdges,
3053 if ( nbWires != 1 || nbEdgesInWires.front() != 4 )
3054 notQuadGeomSubMesh.push_back( sm );
3056 // look for a not structured sub-mesh
3057 if ( !sm->IsEmpty() )
3059 meshedSubMesh.push_back( sm );
3060 if ( !myHelper->IsSameElemGeometry( sm->GetSubMeshDS(), SMDSGeom_QUADRANGLE ) ||
3061 !myHelper->IsStructured ( sm ))
3062 notQuadElemSubMesh.push_back( sm );
3066 int nbNotQuadMeshed = notQuadElemSubMesh.size();
3067 int nbNotQuad = notQuadGeomSubMesh.size();
3068 bool hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3071 if ( nbNotQuadMeshed > 2 )
3073 return toSM( error(COMPERR_BAD_INPUT_MESH,
3074 TCom("More than 2 faces with not quadrangle elements: ")
3075 <<nbNotQuadMeshed));
3077 if ( nbNotQuad > 2 || !thePrism.myBottom.IsNull() )
3079 // Issue 0020843 - one of side FACEs is quasi-quadrilateral (not 4 EDGEs).
3080 // Remove from notQuadGeomSubMesh faces meshed with regular grid
3081 int nbQuasiQuads = removeQuasiQuads( notQuadGeomSubMesh, myHelper,
3082 TQuadrangleAlgo::instance(this,myHelper) );
3083 nbNotQuad -= nbQuasiQuads;
3084 if ( nbNotQuad > 2 )
3085 return toSM( error(COMPERR_BAD_SHAPE,
3086 TCom("More than 2 not quadrilateral faces: ") <<nbNotQuad));
3087 hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3090 // Analyse mesh and topology of FACEs: choose the bottom sub-mesh.
3091 // If there are not quadrangle FACEs, they are top and bottom ones.
3092 // Not quadrangle FACEs must be only on top and bottom.
3094 SMESH_subMesh * botSM = 0;
3095 SMESH_subMesh * topSM = 0;
3097 if ( hasNotQuad ) // can choose a bottom FACE
3099 if ( nbNotQuadMeshed > 0 ) botSM = notQuadElemSubMesh.front();
3100 else botSM = notQuadGeomSubMesh.front();
3101 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.back();
3102 else if ( nbNotQuad > 1 ) topSM = notQuadGeomSubMesh.back();
3104 if ( topSM == botSM ) {
3105 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.front();
3106 else topSM = notQuadGeomSubMesh.front();
3109 // detect mesh triangles on wall FACEs
3110 if ( nbNotQuad == 2 && nbNotQuadMeshed > 0 ) {
3112 if ( nbNotQuadMeshed == 1 )
3113 ok = ( find( notQuadGeomSubMesh.begin(),
3114 notQuadGeomSubMesh.end(), botSM ) != notQuadGeomSubMesh.end() );
3116 ok = ( notQuadGeomSubMesh == notQuadElemSubMesh );
3118 return toSM( error(COMPERR_BAD_INPUT_MESH,
3119 "Side face meshed with not quadrangle elements"));
3123 thePrism.myNotQuadOnTop = ( nbNotQuadMeshed > 1 );
3125 // use thePrism.myBottom
3126 if ( !thePrism.myBottom.IsNull() )
3128 if ( botSM ) { // <-- not quad geom or mesh on botSM
3129 if ( ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3130 std::swap( botSM, topSM );
3131 if ( !botSM || ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3132 if ( !selectBottom )
3133 return toSM( error( COMPERR_BAD_INPUT_MESH,
3134 "Incompatible non-structured sub-meshes"));
3135 std::swap( botSM, topSM );
3136 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3140 else if ( !selectBottom ) {
3141 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3144 if ( !botSM ) // find a proper bottom
3146 bool savedSetErrorToSM = mySetErrorToSM;
3147 mySetErrorToSM = false; // ingore errors in initPrism()
3149 // search among meshed FACEs
3150 list< SMESH_subMesh* >::iterator sm = meshedSubMesh.begin();
3151 for ( ; !botSM && sm != meshedSubMesh.end(); ++sm )
3155 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3156 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3159 // search among all FACEs
3160 for ( TopExp_Explorer f( theShape3D, TopAbs_FACE ); !botSM && f.More(); f.Next() )
3162 int minNbFaces = 2 + myHelper->Count( f.Current(), TopAbs_EDGE, false);
3163 if ( nbFaces < minNbFaces) continue;
3165 thePrism.myBottom = TopoDS::Face( f.Current() );
3166 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3167 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3170 mySetErrorToSM = savedSetErrorToSM;
3171 return botSM ? true : toSM( error( COMPERR_BAD_SHAPE ));
3174 // find vertex 000 - the one with smallest coordinates (for easy DEBUG :-)
3176 double minVal = DBL_MAX, minX = 0, val;
3177 for ( TopExp_Explorer exp( botSM->GetSubShape(), TopAbs_VERTEX );
3178 exp.More(); exp.Next() )
3180 const TopoDS_Vertex& v = TopoDS::Vertex( exp.Current() );
3181 gp_Pnt P = BRep_Tool::Pnt( v );
3182 val = P.X() + P.Y() + P.Z();
3183 if ( val < minVal || ( val == minVal && P.X() < minX )) {
3190 thePrism.myShape3D = theShape3D;
3191 if ( thePrism.myBottom.IsNull() )
3192 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3193 thePrism.myBottom.Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myBottom ));
3194 thePrism.myTop. Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myTop ));
3196 // Get ordered bottom edges
3197 TopoDS_Face reverseBottom = // to have order of top EDGEs as in the top FACE
3198 TopoDS::Face( thePrism.myBottom.Reversed() );
3199 SMESH_Block::GetOrderedEdges( reverseBottom,
3200 thePrism.myBottomEdges,
3201 thePrism.myNbEdgesInWires, V000 );
3203 // Get Wall faces corresponding to the ordered bottom edges and the top FACE
3204 if ( !getWallFaces( thePrism, nbFaces )) // it also sets thePrism.myTop
3205 return false; //toSM( error(COMPERR_BAD_SHAPE, "Can't find side faces"));
3209 if ( !thePrism.myTop.IsSame( topSM->GetSubShape() ))
3211 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3212 "Non-quadrilateral faces are not opposite"));
3214 // check that the found top and bottom FACEs are opposite
3215 list< TopoDS_Edge >::iterator edge = thePrism.myBottomEdges.begin();
3216 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
3217 if ( myHelper->IsSubShape( *edge, thePrism.myTop ))
3219 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3220 "Non-quadrilateral faces are not opposite"));
3223 if ( thePrism.myBottomEdges.size() > thePrism.myWallQuads.size() )
3225 // composite bottom sides => set thePrism upside-down
3226 thePrism.SetUpsideDown();
3232 //================================================================================
3234 * \brief Initialization.
3235 * \param helper - helper loaded with mesh and 3D shape
3236 * \param thePrism - a prism data
3237 * \retval bool - false if a mesh or a shape are KO
3239 //================================================================================
3241 bool StdMeshers_PrismAsBlock::Init(SMESH_MesherHelper* helper,
3242 const Prism_3D::TPrismTopo& thePrism)
3245 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3246 SMESH_Mesh* mesh = myHelper->GetMesh();
3249 delete mySide; mySide = 0;
3251 vector< TSideFace* > sideFaces( NB_WALL_FACES, 0 );
3252 vector< pair< double, double> > params( NB_WALL_FACES );
3253 mySide = new TSideFace( *mesh, sideFaces, params );
3256 SMESH_Block::init();
3257 myShapeIDMap.Clear();
3258 myShapeIndex2ColumnMap.clear();
3260 int wallFaceIds[ NB_WALL_FACES ] = { // to walk around a block
3261 SMESH_Block::ID_Fx0z, SMESH_Block::ID_F1yz,
3262 SMESH_Block::ID_Fx1z, SMESH_Block::ID_F0yz
3265 myError = SMESH_ComputeError::New();
3267 myNotQuadOnTop = thePrism.myNotQuadOnTop;
3269 // Find columns of wall nodes and calculate edges' lengths
3270 // --------------------------------------------------------
3272 myParam2ColumnMaps.clear();
3273 myParam2ColumnMaps.resize( thePrism.myBottomEdges.size() ); // total nb edges
3275 size_t iE, nbEdges = thePrism.myNbEdgesInWires.front(); // nb outer edges
3276 vector< double > edgeLength( nbEdges );
3277 multimap< double, int > len2edgeMap;
3279 // for each EDGE: either split into several parts, or join with several next EDGEs
3280 vector<int> nbSplitPerEdge( nbEdges, 0 );
3281 vector<int> nbUnitePerEdge( nbEdges, 0 ); // -1 means "joined to a previous"
3283 // consider continuous straight EDGEs as one side
3284 const int nbSides = countNbSides( thePrism, nbUnitePerEdge, edgeLength );
3286 list< TopoDS_Edge >::const_iterator edgeIt = thePrism.myBottomEdges.begin();
3287 for ( iE = 0; iE < nbEdges; ++iE, ++edgeIt )
3289 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3291 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3292 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3294 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3295 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3296 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3297 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3299 SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3300 SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3301 SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3303 if ( nbSides < NB_WALL_FACES ) // fill map used to split faces
3304 len2edgeMap.insert( make_pair( edgeLength[ iE ], iE )); // sort edges by length
3306 // Load columns of internal edges (forming holes)
3307 // and fill map ShapeIndex to TParam2ColumnMap for them
3308 for ( ; edgeIt != thePrism.myBottomEdges.end() ; ++edgeIt, ++iE )
3310 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3312 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3313 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3315 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3316 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3317 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3318 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3320 if ( !faceColumns.empty() && (int)faceColumns.begin()->second.size() != VerticalSize() )
3321 return error(COMPERR_BAD_INPUT_MESH, "Different 'vertical' discretization");
3324 int id = MeshDS()->ShapeToIndex( *edgeIt );
3325 bool isForward = true; // meaningless for intenal wires
3326 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3327 // columns for vertices
3329 const SMDS_MeshNode* n0 = faceColumns.begin()->second.front();
3330 id = n0->getshapeId();
3331 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3333 const SMDS_MeshNode* n1 = faceColumns.rbegin()->second.front();
3334 id = n1->getshapeId();
3335 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3337 // SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3338 // SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3339 // SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3342 // Create 4 wall faces of a block
3343 // -------------------------------
3345 if ( nbSides <= NB_WALL_FACES ) // ************* Split faces if necessary
3347 if ( nbSides != NB_WALL_FACES ) // define how to split
3349 if ( len2edgeMap.size() != nbEdges )
3350 RETURN_BAD_RESULT("Uniqueness of edge lengths not assured");
3352 multimap< double, int >::reverse_iterator maxLen_i = len2edgeMap.rbegin();
3353 multimap< double, int >::reverse_iterator midLen_i = ++len2edgeMap.rbegin();
3355 double maxLen = maxLen_i->first;
3356 double midLen = ( len2edgeMap.size() == 1 ) ? 0 : midLen_i->first;
3357 switch ( nbEdges ) {
3358 case 1: // 0-th edge is split into 4 parts
3359 nbSplitPerEdge[ 0 ] = 4;
3361 case 2: // either the longest edge is split into 3 parts, or both edges into halves
3362 if ( maxLen / 3 > midLen / 2 ) {
3363 nbSplitPerEdge[ maxLen_i->second ] = 3;
3366 nbSplitPerEdge[ maxLen_i->second ] = 2;
3367 nbSplitPerEdge[ midLen_i->second ] = 2;
3372 // split longest into 3 parts
3373 nbSplitPerEdge[ maxLen_i->second ] = 3;
3375 // split longest into halves
3376 nbSplitPerEdge[ maxLen_i->second ] = 2;
3380 else // **************************** Unite faces
3382 int nbExraFaces = nbSides - 4; // nb of faces to fuse
3383 for ( iE = 0; iE < nbEdges; ++iE )
3385 if ( nbUnitePerEdge[ iE ] < 0 )
3387 // look for already united faces
3388 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3390 if ( nbUnitePerEdge[ i ] > 0 ) // a side including nbUnitePerEdge[i]+1 edge
3391 nbExraFaces += nbUnitePerEdge[ i ];
3392 nbUnitePerEdge[ i ] = -1;
3394 nbUnitePerEdge[ iE ] = nbExraFaces;
3399 // Create TSideFace's
3401 list< TopoDS_Edge >::const_iterator botE = thePrism.myBottomEdges.begin();
3402 for ( iE = 0; iE < nbEdges; ++iE, ++botE )
3404 TFaceQuadStructPtr quad = thePrism.myWallQuads[ iE ].front();
3405 const int nbSplit = nbSplitPerEdge[ iE ];
3406 const int nbExraFaces = nbUnitePerEdge[ iE ] + 1;
3407 if ( nbSplit > 0 ) // split
3409 vector< double > params;
3410 splitParams( nbSplit, &myParam2ColumnMaps[ iE ], params );
3411 const bool isForward =
3412 StdMeshers_PrismAsBlock::IsForwardEdge( myHelper->GetMeshDS(),
3413 myParam2ColumnMaps[iE],
3414 *botE, SMESH_Block::ID_Fx0z );
3415 for ( int i = 0; i < nbSplit; ++i ) {
3416 double f = ( isForward ? params[ i ] : params[ nbSplit - i-1 ]);
3417 double l = ( isForward ? params[ i+1 ] : params[ nbSplit - i ]);
3418 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3419 thePrism.myWallQuads[ iE ], *botE,
3420 &myParam2ColumnMaps[ iE ], f, l );
3421 mySide->SetComponent( iSide++, comp );
3424 else if ( nbExraFaces > 1 ) // unite
3426 double u0 = 0, sumLen = 0;
3427 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3428 sumLen += edgeLength[ i ];
3430 vector< TSideFace* > components( nbExraFaces );
3431 vector< pair< double, double> > params( nbExraFaces );
3432 bool endReached = false;
3433 for ( int i = 0; i < nbExraFaces; ++i, ++botE, ++iE )
3435 if ( iE == nbEdges )
3438 botE = thePrism.myBottomEdges.begin();
3441 components[ i ] = new TSideFace( *mesh, wallFaceIds[ iSide ],
3442 thePrism.myWallQuads[ iE ], *botE,
3443 &myParam2ColumnMaps[ iE ]);
3444 double u1 = u0 + edgeLength[ iE ] / sumLen;
3445 params[ i ] = make_pair( u0 , u1 );
3448 TSideFace* comp = new TSideFace( *mesh, components, params );
3449 mySide->SetComponent( iSide++, comp );
3452 --iE; // for increment in an external loop on iE
3455 else if ( nbExraFaces < 0 ) // skip already united face
3460 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3461 thePrism.myWallQuads[ iE ], *botE,
3462 &myParam2ColumnMaps[ iE ]);
3463 mySide->SetComponent( iSide++, comp );
3468 // Fill geometry fields of SMESH_Block
3469 // ------------------------------------
3471 vector< int > botEdgeIdVec;
3472 SMESH_Block::GetFaceEdgesIDs( ID_BOT_FACE, botEdgeIdVec );
3474 bool isForward[NB_WALL_FACES] = { true, true, true, true };
3475 Adaptor2d_Curve2d* botPcurves[NB_WALL_FACES];
3476 Adaptor2d_Curve2d* topPcurves[NB_WALL_FACES];
3478 for ( int iF = 0; iF < NB_WALL_FACES; ++iF )
3480 TSideFace * sideFace = mySide->GetComponent( iF );
3482 RETURN_BAD_RESULT("NULL TSideFace");
3483 int fID = sideFace->FaceID(); // in-block ID
3485 // fill myShapeIDMap
3486 if ( sideFace->InsertSubShapes( myShapeIDMap ) != 8 &&
3487 !sideFace->IsComplex())
3488 MESSAGE( ": Warning : InsertSubShapes() < 8 on side " << iF );
3490 // side faces geometry
3491 Adaptor2d_Curve2d* pcurves[NB_WALL_FACES];
3492 if ( !sideFace->GetPCurves( pcurves ))
3493 RETURN_BAD_RESULT("TSideFace::GetPCurves() failed");
3495 SMESH_Block::TFace& tFace = myFace[ fID - ID_FirstF ];
3496 tFace.Set( fID, sideFace->Surface(), pcurves, isForward );
3498 SHOWYXZ( endl<<"F "<< iF << " id " << fID << " FRW " << sideFace->IsForward(), sideFace->Value(0,0));
3499 // edges 3D geometry
3500 vector< int > edgeIdVec;
3501 SMESH_Block::GetFaceEdgesIDs( fID, edgeIdVec );
3502 for ( int isMax = 0; isMax < 2; ++isMax ) {
3504 int eID = edgeIdVec[ isMax ];
3505 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3506 tEdge.Set( eID, sideFace->HorizCurve(isMax), true);
3507 SHOWYXZ(eID<<" HOR"<<isMax<<"(0)", sideFace->HorizCurve(isMax)->Value(0));
3508 SHOWYXZ(eID<<" HOR"<<isMax<<"(1)", sideFace->HorizCurve(isMax)->Value(1));
3511 int eID = edgeIdVec[ isMax+2 ];
3512 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3513 tEdge.Set( eID, sideFace->VertiCurve(isMax), true);
3514 SHOWYXZ(eID<<" VER"<<isMax<<"(0)", sideFace->VertiCurve(isMax)->Value(0));
3515 SHOWYXZ(eID<<" VER"<<isMax<<"(1)", sideFace->VertiCurve(isMax)->Value(1));
3518 vector< int > vertexIdVec;
3519 SMESH_Block::GetEdgeVertexIDs( eID, vertexIdVec );
3520 myPnt[ vertexIdVec[0] - ID_FirstV ] = tEdge.GetCurve()->Value(0).XYZ();
3521 myPnt[ vertexIdVec[1] - ID_FirstV ] = tEdge.GetCurve()->Value(1).XYZ();
3524 // pcurves on horizontal faces
3525 for ( iE = 0; iE < NB_WALL_FACES; ++iE ) {
3526 if ( edgeIdVec[ BOTTOM_EDGE ] == botEdgeIdVec[ iE ] ) {
3527 botPcurves[ iE ] = sideFace->HorizPCurve( false, thePrism.myBottom );
3528 topPcurves[ iE ] = sideFace->HorizPCurve( true, thePrism.myTop );
3532 //sideFace->dumpNodes( 4 ); // debug
3534 // horizontal faces geometry
3536 SMESH_Block::TFace& tFace = myFace[ ID_BOT_FACE - ID_FirstF ];
3537 tFace.Set( ID_BOT_FACE, new BRepAdaptor_Surface( thePrism.myBottom ), botPcurves, isForward );
3538 SMESH_Block::Insert( thePrism.myBottom, ID_BOT_FACE, myShapeIDMap );
3541 SMESH_Block::TFace& tFace = myFace[ ID_TOP_FACE - ID_FirstF ];
3542 tFace.Set( ID_TOP_FACE, new BRepAdaptor_Surface( thePrism.myTop ), topPcurves, isForward );
3543 SMESH_Block::Insert( thePrism.myTop, ID_TOP_FACE, myShapeIDMap );
3545 //faceGridToPythonDump( SMESH_Block::ID_Fxy0, 50 );
3546 //faceGridToPythonDump( SMESH_Block::ID_Fxy1 );
3548 // Fill map ShapeIndex to TParam2ColumnMap
3549 // ----------------------------------------
3551 list< TSideFace* > fList;
3552 list< TSideFace* >::iterator fListIt;
3553 fList.push_back( mySide );
3554 for ( fListIt = fList.begin(); fListIt != fList.end(); ++fListIt)
3556 int nb = (*fListIt)->NbComponents();
3557 for ( int i = 0; i < nb; ++i ) {
3558 if ( TSideFace* comp = (*fListIt)->GetComponent( i ))
3559 fList.push_back( comp );
3561 if ( TParam2ColumnMap* cols = (*fListIt)->GetColumns()) {
3562 // columns for a base edge
3563 int id = MeshDS()->ShapeToIndex( (*fListIt)->BaseEdge() );
3564 bool isForward = (*fListIt)->IsForward();
3565 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3567 // columns for vertices
3568 const SMDS_MeshNode* n0 = cols->begin()->second.front();
3569 id = n0->getshapeId();
3570 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3572 const SMDS_MeshNode* n1 = cols->rbegin()->second.front();
3573 id = n1->getshapeId();
3574 myShapeIndex2ColumnMap[ id ] = make_pair( cols, !isForward );
3578 // #define SHOWYXZ(msg, xyz) { gp_Pnt p(xyz); cout << msg << " ("<< p.X() << "; " <<p.Y() << "; " <<p.Z() << ") " <<endl; }
3580 // double _u[]={ 0.1, 0.1, 0.9, 0.9 };
3581 // double _v[]={ 0.1, 0.9, 0.1, 0.9 };
3582 // for ( int z = 0; z < 2; ++z )
3583 // for ( int i = 0; i < 4; ++i )
3585 // //gp_XYZ testPar(0.25, 0.25, 0), testCoord;
3586 // int iFace = (z ? ID_TOP_FACE : ID_BOT_FACE);
3587 // gp_XYZ testPar(_u[i], _v[i], z), testCoord;
3588 // if ( !FacePoint( iFace, testPar, testCoord ))
3589 // RETURN_BAD_RESULT("TEST FacePoint() FAILED");
3590 // SHOWYXZ("IN TEST PARAM" , testPar);
3591 // SHOWYXZ("OUT TEST CORD" , testCoord);
3592 // if ( !ComputeParameters( testCoord, testPar , iFace))
3593 // RETURN_BAD_RESULT("TEST ComputeParameters() FAILED");
3594 // SHOWYXZ("OUT TEST PARAM" , testPar);
3599 //================================================================================
3601 * \brief Return pointer to column of nodes
3602 * \param node - bottom node from which the returned column goes up
3603 * \retval const TNodeColumn* - the found column
3605 //================================================================================
3607 const TNodeColumn* StdMeshers_PrismAsBlock::GetNodeColumn(const SMDS_MeshNode* node) const
3609 int sID = node->getshapeId();
3611 map<int, pair< TParam2ColumnMap*, bool > >::const_iterator col_frw =
3612 myShapeIndex2ColumnMap.find( sID );
3613 if ( col_frw != myShapeIndex2ColumnMap.end() ) {
3614 const TParam2ColumnMap* cols = col_frw->second.first;
3615 TParam2ColumnIt u_col = cols->begin();
3616 for ( ; u_col != cols->end(); ++u_col )
3617 if ( u_col->second[ 0 ] == node )
3618 return & u_col->second;
3623 //=======================================================================
3624 //function : GetLayersTransformation
3625 //purpose : Return transformations to get coordinates of nodes of each layer
3626 // by nodes of the bottom. Layer is a set of nodes at a certain step
3627 // from bottom to top.
3628 // Transformation to get top node from bottom ones is computed
3629 // only if the top FACE is not meshed.
3630 //=======================================================================
3632 bool StdMeshers_PrismAsBlock::GetLayersTransformation(vector<gp_Trsf> & trsf,
3633 const Prism_3D::TPrismTopo& prism) const
3635 const bool itTopMeshed = !SubMesh( ID_BOT_FACE )->IsEmpty();
3636 const int zSize = VerticalSize();
3637 if ( zSize < 3 && !itTopMeshed ) return true;
3638 trsf.resize( zSize - 1 );
3640 // Select some node columns by which we will define coordinate system of layers
3642 vector< const TNodeColumn* > columns;
3645 list< TopoDS_Edge >::const_iterator edgeIt = prism.myBottomEdges.begin();
3646 for ( int iE = 0; iE < prism.myNbEdgesInWires.front(); ++iE, ++edgeIt )
3648 if ( SMESH_Algo::isDegenerated( *edgeIt )) continue;
3649 const TParam2ColumnMap* u2colMap =
3650 GetParam2ColumnMap( MeshDS()->ShapeToIndex( *edgeIt ), isReverse );
3651 if ( !u2colMap ) return false;
3652 double f = u2colMap->begin()->first, l = u2colMap->rbegin()->first;
3653 //isReverse = ( edgeIt->Orientation() == TopAbs_REVERSED );
3654 //if ( isReverse ) swap ( f, l ); -- u2colMap takes orientation into account
3655 const int nbCol = 5;
3656 for ( int i = 0; i < nbCol; ++i )
3658 double u = f + i/double(nbCol) * ( l - f );
3659 const TNodeColumn* col = & getColumn( u2colMap, u )->second;
3660 if ( columns.empty() || col != columns.back() )
3661 columns.push_back( col );
3666 // Find tolerance to check transformations
3671 for ( size_t i = 0; i < columns.size(); ++i )
3672 bndBox.Add( gpXYZ( columns[i]->front() ));
3673 tol2 = bndBox.SquareExtent() * 1e-5;
3676 // Compute transformations
3679 gp_Trsf fromCsZ, toCs0;
3680 gp_Ax3 cs0 = getLayerCoordSys(0, columns, xCol );
3681 //double dist0 = cs0.Location().Distance( gpXYZ( (*columns[0])[0]));
3682 toCs0.SetTransformation( cs0 );
3683 for ( int z = 1; z < zSize; ++z )
3685 gp_Ax3 csZ = getLayerCoordSys(z, columns, xCol );
3686 //double distZ = csZ.Location().Distance( gpXYZ( (*columns[0])[z]));
3687 fromCsZ.SetTransformation( csZ );
3689 gp_Trsf& t = trsf[ z-1 ];
3690 t = fromCsZ * toCs0;
3691 //t.SetScaleFactor( distZ/dist0 ); - it does not work properly, wrong base point
3693 // check a transformation
3694 for ( size_t i = 0; i < columns.size(); ++i )
3696 gp_Pnt p0 = gpXYZ( (*columns[i])[0] );
3697 gp_Pnt pz = gpXYZ( (*columns[i])[z] );
3698 t.Transforms( p0.ChangeCoord() );
3699 if ( p0.SquareDistance( pz ) > tol2 )
3702 return ( z == zSize - 1 ); // OK if fails only botton->top trsf
3709 //================================================================================
3711 * \brief Check curve orientation of a bootom edge
3712 * \param meshDS - mesh DS
3713 * \param columnsMap - node columns map of side face
3714 * \param bottomEdge - the bootom edge
3715 * \param sideFaceID - side face in-block ID
3716 * \retval bool - true if orientation coinside with in-block forward orientation
3718 //================================================================================
3720 bool StdMeshers_PrismAsBlock::IsForwardEdge(SMESHDS_Mesh* meshDS,
3721 const TParam2ColumnMap& columnsMap,
3722 const TopoDS_Edge & bottomEdge,
3723 const int sideFaceID)
3725 bool isForward = false;
3726 if ( SMESH_MesherHelper::IsClosedEdge( bottomEdge ))
3728 isForward = ( bottomEdge.Orientation() == TopAbs_FORWARD );
3732 const TNodeColumn& firstCol = columnsMap.begin()->second;
3733 const SMDS_MeshNode* bottomNode = firstCol[0];
3734 TopoDS_Shape firstVertex = SMESH_MesherHelper::GetSubShapeByNode( bottomNode, meshDS );
3735 isForward = ( firstVertex.IsSame( TopExp::FirstVertex( bottomEdge, true )));
3737 // on 2 of 4 sides first vertex is end
3738 if ( sideFaceID == ID_Fx1z || sideFaceID == ID_F0yz )
3739 isForward = !isForward;
3743 //=======================================================================
3744 //function : faceGridToPythonDump
3745 //purpose : Prints a script creating a normal grid on the prism side
3746 //=======================================================================
3748 void StdMeshers_PrismAsBlock::faceGridToPythonDump(const SMESH_Block::TShapeID face,
3752 gp_XYZ pOnF[6] = { gp_XYZ(0,0,0), gp_XYZ(0,0,1),
3753 gp_XYZ(0,0,0), gp_XYZ(0,1,0),
3754 gp_XYZ(0,0,0), gp_XYZ(1,0,0) };
3756 cout << "mesh = smesh.Mesh( 'Face " << face << "')" << endl;
3757 SMESH_Block::TFace& f = myFace[ face - ID_FirstF ];
3758 gp_XYZ params = pOnF[ face - ID_FirstF ];
3759 //const int nb = 10; // nb face rows
3760 for ( int j = 0; j <= nb; ++j )
3762 params.SetCoord( f.GetVInd(), double( j )/ nb );
3763 for ( int i = 0; i <= nb; ++i )
3765 params.SetCoord( f.GetUInd(), double( i )/ nb );
3766 gp_XYZ p = f.Point( params );
3767 gp_XY uv = f.GetUV( params );
3768 cout << "mesh.AddNode( " << p.X() << ", " << p.Y() << ", " << p.Z() << " )"
3769 << " # " << 1 + i + j * ( nb + 1 )
3770 << " ( " << i << ", " << j << " ) "
3771 << " UV( " << uv.X() << ", " << uv.Y() << " )" << endl;
3772 ShellPoint( params, p2 );
3773 double dist = ( p2 - p ).Modulus();
3775 cout << "#### dist from ShellPoint " << dist
3776 << " (" << p2.X() << ", " << p2.Y() << ", " << p2.Z() << " ) " << endl;
3779 for ( int j = 0; j < nb; ++j )
3780 for ( int i = 0; i < nb; ++i )
3782 int n = 1 + i + j * ( nb + 1 );
3783 cout << "mesh.AddFace([ "
3784 << n << ", " << n+1 << ", "
3785 << n+nb+2 << ", " << n+nb+1 << "]) " << endl;
3791 //================================================================================
3793 * \brief Constructor
3794 * \param faceID - in-block ID
3795 * \param face - geom FACE
3796 * \param baseEdge - EDGE proreply oriented in the bottom EDGE !!!
3797 * \param columnsMap - map of node columns
3798 * \param first - first normalized param
3799 * \param last - last normalized param
3801 //================================================================================
3803 StdMeshers_PrismAsBlock::TSideFace::TSideFace(SMESH_Mesh& mesh,
3805 const Prism_3D::TQuadList& quadList,
3806 const TopoDS_Edge& baseEdge,
3807 TParam2ColumnMap* columnsMap,
3811 myParamToColumnMap( columnsMap ),
3814 myParams.resize( 1 );
3815 myParams[ 0 ] = make_pair( first, last );
3816 mySurface = PSurface( new BRepAdaptor_Surface( quadList.front()->face ));
3817 myBaseEdge = baseEdge;
3818 myIsForward = StdMeshers_PrismAsBlock::IsForwardEdge( myHelper.GetMeshDS(),
3819 *myParamToColumnMap,
3821 myHelper.SetSubShape( quadList.front()->face );
3823 if ( quadList.size() > 1 ) // side is vertically composite
3825 // fill myShapeID2Surf map to enable finding a right surface by any sub-shape ID
3827 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
3829 TopTools_IndexedDataMapOfShapeListOfShape subToFaces;
3830 Prism_3D::TQuadList::const_iterator quad = quadList.begin();
3831 for ( ; quad != quadList.end(); ++quad )
3833 const TopoDS_Face& face = (*quad)->face;
3834 TopExp::MapShapesAndAncestors( face, TopAbs_VERTEX, TopAbs_FACE, subToFaces );
3835 TopExp::MapShapesAndAncestors( face, TopAbs_EDGE, TopAbs_FACE, subToFaces );
3836 myShapeID2Surf.insert( make_pair( meshDS->ShapeToIndex( face ),
3837 PSurface( new BRepAdaptor_Surface( face ))));
3839 for ( int i = 1; i <= subToFaces.Extent(); ++i )
3841 const TopoDS_Shape& sub = subToFaces.FindKey( i );
3842 TopTools_ListOfShape& faces = subToFaces( i );
3843 int subID = meshDS->ShapeToIndex( sub );
3844 int faceID = meshDS->ShapeToIndex( faces.First() );
3845 myShapeID2Surf.insert ( make_pair( subID, myShapeID2Surf[ faceID ]));
3850 //================================================================================
3852 * \brief Constructor of a complex side face
3854 //================================================================================
3856 StdMeshers_PrismAsBlock::TSideFace::
3857 TSideFace(SMESH_Mesh& mesh,
3858 const vector< TSideFace* >& components,
3859 const vector< pair< double, double> > & params)
3860 :myID( components[0] ? components[0]->myID : 0 ),
3861 myParamToColumnMap( 0 ),
3863 myIsForward( true ),
3864 myComponents( components ),
3867 if ( myID == ID_Fx1z || myID == ID_F0yz )
3869 // reverse components
3870 std::reverse( myComponents.begin(), myComponents.end() );
3871 std::reverse( myParams.begin(), myParams.end() );
3872 for ( size_t i = 0; i < myParams.size(); ++i )
3874 const double f = myParams[i].first;
3875 const double l = myParams[i].second;
3876 myParams[i] = make_pair( 1. - l, 1. - f );
3880 //================================================================================
3882 * \brief Copy constructor
3883 * \param other - other side
3885 //================================================================================
3887 StdMeshers_PrismAsBlock::TSideFace::TSideFace( const TSideFace& other ):
3888 myID ( other.myID ),
3889 myParamToColumnMap ( other.myParamToColumnMap ),
3890 mySurface ( other.mySurface ),
3891 myBaseEdge ( other.myBaseEdge ),
3892 myShapeID2Surf ( other.myShapeID2Surf ),
3893 myParams ( other.myParams ),
3894 myIsForward ( other.myIsForward ),
3895 myComponents ( other.myComponents.size() ),
3896 myHelper ( *other.myHelper.GetMesh() )
3898 for ( size_t i = 0 ; i < myComponents.size(); ++i )
3899 myComponents[ i ] = new TSideFace( *other.myComponents[ i ]);
3902 //================================================================================
3904 * \brief Deletes myComponents
3906 //================================================================================
3908 StdMeshers_PrismAsBlock::TSideFace::~TSideFace()
3910 for ( size_t i = 0 ; i < myComponents.size(); ++i )
3911 if ( myComponents[ i ] )
3912 delete myComponents[ i ];
3915 //================================================================================
3917 * \brief Return geometry of the vertical curve
3918 * \param isMax - true means curve located closer to (1,1,1) block point
3919 * \retval Adaptor3d_Curve* - curve adaptor
3921 //================================================================================
3923 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::VertiCurve(const bool isMax) const
3925 if ( !myComponents.empty() ) {
3927 return myComponents.back()->VertiCurve(isMax);
3929 return myComponents.front()->VertiCurve(isMax);
3931 double f = myParams[0].first, l = myParams[0].second;
3932 if ( !myIsForward ) std::swap( f, l );
3933 return new TVerticalEdgeAdaptor( myParamToColumnMap, isMax ? l : f );
3936 //================================================================================
3938 * \brief Return geometry of the top or bottom curve
3940 * \retval Adaptor3d_Curve* -
3942 //================================================================================
3944 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::HorizCurve(const bool isTop) const
3946 return new THorizontalEdgeAdaptor( this, isTop );
3949 //================================================================================
3951 * \brief Return pcurves
3952 * \param pcurv - array of 4 pcurves
3953 * \retval bool - is a success
3955 //================================================================================
3957 bool StdMeshers_PrismAsBlock::TSideFace::GetPCurves(Adaptor2d_Curve2d* pcurv[4]) const
3959 int iEdge[ 4 ] = { BOTTOM_EDGE, TOP_EDGE, V0_EDGE, V1_EDGE };
3961 for ( int i = 0 ; i < 4 ; ++i ) {
3962 Handle(Geom2d_Line) line;
3963 switch ( iEdge[ i ] ) {
3965 line = new Geom2d_Line( gp_Pnt2d( 0, 1 ), gp::DX2d() ); break;
3967 line = new Geom2d_Line( gp::Origin2d(), gp::DX2d() ); break;
3969 line = new Geom2d_Line( gp::Origin2d(), gp::DY2d() ); break;
3971 line = new Geom2d_Line( gp_Pnt2d( 1, 0 ), gp::DY2d() ); break;
3973 pcurv[ i ] = new Geom2dAdaptor_Curve( line, 0, 1 );
3978 //================================================================================
3980 * \brief Returns geometry of pcurve on a horizontal face
3981 * \param isTop - is top or bottom face
3982 * \param horFace - a horizontal face
3983 * \retval Adaptor2d_Curve2d* - curve adaptor
3985 //================================================================================
3988 StdMeshers_PrismAsBlock::TSideFace::HorizPCurve(const bool isTop,
3989 const TopoDS_Face& horFace) const
3991 return new TPCurveOnHorFaceAdaptor( this, isTop, horFace );
3994 //================================================================================
3996 * \brief Return a component corresponding to parameter
3997 * \param U - parameter along a horizontal size
3998 * \param localU - parameter along a horizontal size of a component
3999 * \retval TSideFace* - found component
4001 //================================================================================
4003 StdMeshers_PrismAsBlock::TSideFace*
4004 StdMeshers_PrismAsBlock::TSideFace::GetComponent(const double U,double & localU) const
4007 if ( myComponents.empty() )
4008 return const_cast<TSideFace*>( this );
4011 for ( i = 0; i < myComponents.size(); ++i )
4012 if ( U < myParams[ i ].second )
4014 if ( i >= myComponents.size() )
4015 i = myComponents.size() - 1;
4017 double f = myParams[ i ].first, l = myParams[ i ].second;
4018 localU = ( U - f ) / ( l - f );
4019 return myComponents[ i ];
4022 //================================================================================
4024 * \brief Find node columns for a parameter
4025 * \param U - parameter along a horizontal edge
4026 * \param col1 - the 1st found column
4027 * \param col2 - the 2nd found column
4028 * \retval r - normalized position of U between the found columns
4030 //================================================================================
4032 double StdMeshers_PrismAsBlock::TSideFace::GetColumns(const double U,
4033 TParam2ColumnIt & col1,
4034 TParam2ColumnIt & col2) const
4036 double u = U, r = 0;
4037 if ( !myComponents.empty() ) {
4038 TSideFace * comp = GetComponent(U,u);
4039 return comp->GetColumns( u, col1, col2 );
4044 double f = myParams[0].first, l = myParams[0].second;
4045 u = f + u * ( l - f );
4047 col1 = col2 = getColumn( myParamToColumnMap, u );
4048 if ( ++col2 == myParamToColumnMap->end() ) {
4053 double uf = col1->first;
4054 double ul = col2->first;
4055 r = ( u - uf ) / ( ul - uf );
4060 //================================================================================
4062 * \brief Return all nodes at a given height together with their normalized parameters
4063 * \param [in] Z - the height of interest
4064 * \param [out] nodes - map of parameter to node
4066 //================================================================================
4068 void StdMeshers_PrismAsBlock::
4069 TSideFace::GetNodesAtZ(const int Z,
4070 map<double, const SMDS_MeshNode* >& nodes ) const
4072 if ( !myComponents.empty() )
4075 for ( size_t i = 0; i < myComponents.size(); ++i )
4077 map<double, const SMDS_MeshNode* > nn;
4078 myComponents[i]->GetNodesAtZ( Z, nn );
4079 map<double, const SMDS_MeshNode* >::iterator u2n = nn.begin();
4080 if ( !nodes.empty() && nodes.rbegin()->second == u2n->second )
4082 const double uRange = myParams[i].second - myParams[i].first;
4083 for ( ; u2n != nn.end(); ++u2n )
4084 nodes.insert( nodes.end(), make_pair( u0 + uRange * u2n->first, u2n->second ));
4090 double f = myParams[0].first, l = myParams[0].second;
4093 const double uRange = l - f;
4094 if ( Abs( uRange ) < std::numeric_limits<double>::min() )
4096 TParam2ColumnIt u2col = getColumn( myParamToColumnMap, myParams[0].first + 1e-3 );
4097 for ( ; u2col != myParamToColumnMap->end(); ++u2col )
4098 if ( u2col->first > myParams[0].second + 1e-9 )
4101 nodes.insert( nodes.end(),
4102 make_pair( ( u2col->first - f ) / uRange, u2col->second[ Z ] ));
4106 //================================================================================
4108 * \brief Return coordinates by normalized params
4109 * \param U - horizontal param
4110 * \param V - vertical param
4111 * \retval gp_Pnt - result point
4113 //================================================================================
4115 gp_Pnt StdMeshers_PrismAsBlock::TSideFace::Value(const Standard_Real U,
4116 const Standard_Real V) const
4118 if ( !myComponents.empty() ) {
4120 TSideFace * comp = GetComponent(U,u);
4121 return comp->Value( u, V );
4124 TParam2ColumnIt u_col1, u_col2;
4125 double vR, hR = GetColumns( U, u_col1, u_col2 );
4127 const SMDS_MeshNode* nn[4];
4129 // BEGIN issue 0020680: Bad cell created by Radial prism in center of torus
4130 // Workaround for a wrongly located point returned by mySurface.Value() for
4131 // UV located near boundary of BSpline surface.
4132 // To bypass the problem, we take point from 3D curve of EDGE.
4133 // It solves pb of the bloc_fiss_new.py
4134 const double tol = 1e-3;
4135 if ( V < tol || V+tol >= 1. )
4137 nn[0] = V < tol ? u_col1->second.front() : u_col1->second.back();
4138 nn[2] = V < tol ? u_col2->second.front() : u_col2->second.back();
4146 TopoDS_Shape s = myHelper.GetSubShapeByNode( nn[0], myHelper.GetMeshDS() );
4147 if ( s.ShapeType() != TopAbs_EDGE )
4148 s = myHelper.GetSubShapeByNode( nn[2], myHelper.GetMeshDS() );
4149 if ( !s.IsNull() && s.ShapeType() == TopAbs_EDGE )
4150 edge = TopoDS::Edge( s );
4152 if ( !edge.IsNull() )
4154 double u1 = myHelper.GetNodeU( edge, nn[0], nn[2] );
4155 double u3 = myHelper.GetNodeU( edge, nn[2], nn[0] );
4156 double u = u1 * ( 1 - hR ) + u3 * hR;
4157 TopLoc_Location loc; double f,l;
4158 Handle(Geom_Curve) curve = BRep_Tool::Curve( edge,loc,f,l );
4159 return curve->Value( u ).Transformed( loc );
4162 // END issue 0020680: Bad cell created by Radial prism in center of torus
4164 vR = getRAndNodes( & u_col1->second, V, nn[0], nn[1] );
4165 vR = getRAndNodes( & u_col2->second, V, nn[2], nn[3] );
4167 if ( !myShapeID2Surf.empty() ) // side is vertically composite
4169 // find a FACE on which the 4 nodes lie
4170 TSideFace* me = (TSideFace*) this;
4171 int notFaceID1 = 0, notFaceID2 = 0;
4172 for ( int i = 0; i < 4; ++i )
4173 if ( nn[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) // node on FACE
4175 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4179 else if ( notFaceID1 == 0 ) // node on EDGE or VERTEX
4181 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4182 notFaceID1 = nn[i]->getshapeId();
4184 else if ( notFaceID1 != nn[i]->getshapeId() ) // node on other EDGE or VERTEX
4186 if ( mySurface != me->myShapeID2Surf[ nn[i]->getshapeId() ])
4187 notFaceID2 = nn[i]->getshapeId();
4189 if ( notFaceID2 ) // no nodes of FACE and nodes are on different FACEs
4191 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
4192 TopoDS_Shape face = myHelper.GetCommonAncestor( meshDS->IndexToShape( notFaceID1 ),
4193 meshDS->IndexToShape( notFaceID2 ),
4194 *myHelper.GetMesh(),
4196 if ( face.IsNull() )
4197 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() face.IsNull()");
4198 int faceID = meshDS->ShapeToIndex( face );
4199 me->mySurface = me->myShapeID2Surf[ faceID ];
4201 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() !mySurface");
4204 ((TSideFace*) this)->myHelper.SetSubShape( mySurface->Face() );
4206 gp_XY uv1 = myHelper.GetNodeUV( mySurface->Face(), nn[0], nn[2]);
4207 gp_XY uv2 = myHelper.GetNodeUV( mySurface->Face(), nn[1], nn[3]);
4208 gp_XY uv12 = uv1 * ( 1 - vR ) + uv2 * vR;
4210 gp_XY uv3 = myHelper.GetNodeUV( mySurface->Face(), nn[2], nn[0]);
4211 gp_XY uv4 = myHelper.GetNodeUV( mySurface->Face(), nn[3], nn[1]);
4212 gp_XY uv34 = uv3 * ( 1 - vR ) + uv4 * vR;
4214 gp_XY uv = uv12 * ( 1 - hR ) + uv34 * hR;
4216 gp_Pnt p = mySurface->Value( uv.X(), uv.Y() );
4221 //================================================================================
4223 * \brief Return boundary edge
4224 * \param edge - edge index
4225 * \retval TopoDS_Edge - found edge
4227 //================================================================================
4229 TopoDS_Edge StdMeshers_PrismAsBlock::TSideFace::GetEdge(const int iEdge) const
4231 if ( !myComponents.empty() ) {
4233 case V0_EDGE : return myComponents.front()->GetEdge( iEdge );
4234 case V1_EDGE : return myComponents.back() ->GetEdge( iEdge );
4235 default: return TopoDS_Edge();
4239 const SMDS_MeshNode* node = 0;
4240 SMESHDS_Mesh * meshDS = myHelper.GetMesh()->GetMeshDS();
4241 TNodeColumn* column;
4246 column = & (( ++myParamToColumnMap->begin())->second );
4247 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4248 edge = myHelper.GetSubShapeByNode ( node, meshDS );
4249 if ( edge.ShapeType() == TopAbs_VERTEX ) {
4250 column = & ( myParamToColumnMap->begin()->second );
4251 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4256 bool back = ( iEdge == V1_EDGE );
4257 if ( !myIsForward ) back = !back;
4259 column = & ( myParamToColumnMap->rbegin()->second );
4261 column = & ( myParamToColumnMap->begin()->second );
4262 if ( column->size() > 0 )
4263 edge = myHelper.GetSubShapeByNode( (*column)[ 1 ], meshDS );
4264 if ( edge.IsNull() || edge.ShapeType() == TopAbs_VERTEX )
4265 node = column->front();
4270 if ( !edge.IsNull() && edge.ShapeType() == TopAbs_EDGE )
4271 return TopoDS::Edge( edge );
4273 // find edge by 2 vertices
4274 TopoDS_Shape V1 = edge;
4275 TopoDS_Shape V2 = myHelper.GetSubShapeByNode( node, meshDS );
4276 if ( !V2.IsNull() && V2.ShapeType() == TopAbs_VERTEX && !V2.IsSame( V1 ))
4278 TopoDS_Shape ancestor = myHelper.GetCommonAncestor( V1, V2, *myHelper.GetMesh(), TopAbs_EDGE);
4279 if ( !ancestor.IsNull() )
4280 return TopoDS::Edge( ancestor );
4282 return TopoDS_Edge();
4285 //================================================================================
4287 * \brief Fill block sub-shapes
4288 * \param shapeMap - map to fill in
4289 * \retval int - nb inserted sub-shapes
4291 //================================================================================
4293 int StdMeshers_PrismAsBlock::TSideFace::InsertSubShapes(TBlockShapes& shapeMap) const
4298 vector< int > edgeIdVec;
4299 SMESH_Block::GetFaceEdgesIDs( myID, edgeIdVec );
4301 for ( int i = BOTTOM_EDGE; i <=V1_EDGE ; ++i ) {
4302 TopoDS_Edge e = GetEdge( i );
4303 if ( !e.IsNull() ) {
4304 nbInserted += SMESH_Block::Insert( e, edgeIdVec[ i ], shapeMap);
4308 // Insert corner vertices
4310 TParam2ColumnIt col1, col2 ;
4311 vector< int > vertIdVec;
4314 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V0_EDGE ], vertIdVec);
4315 GetColumns(0, col1, col2 );
4316 const SMDS_MeshNode* node0 = col1->second.front();
4317 const SMDS_MeshNode* node1 = col1->second.back();
4318 TopoDS_Shape v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4319 TopoDS_Shape v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4320 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4321 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4323 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4324 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4328 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V1_EDGE ], vertIdVec);
4329 GetColumns(1, col1, col2 );
4330 node0 = col2->second.front();
4331 node1 = col2->second.back();
4332 v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4333 v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4334 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4335 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4337 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4338 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4341 // TopoDS_Vertex V0, V1, Vcom;
4342 // TopExp::Vertices( myBaseEdge, V0, V1, true );
4343 // if ( !myIsForward ) std::swap( V0, V1 );
4345 // // bottom vertex IDs
4346 // SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ _u0 ], vertIdVec);
4347 // SMESH_Block::Insert( V0, vertIdVec[ 0 ], shapeMap);
4348 // SMESH_Block::Insert( V1, vertIdVec[ 1 ], shapeMap);
4350 // TopoDS_Edge sideEdge = GetEdge( V0_EDGE );
4351 // if ( sideEdge.IsNull() || !TopExp::CommonVertex( botEdge, sideEdge, Vcom ))
4354 // // insert one side edge
4356 // if ( Vcom.IsSame( V0 )) edgeID = edgeIdVec[ _v0 ];
4357 // else edgeID = edgeIdVec[ _v1 ];
4358 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4360 // // top vertex of the side edge
4361 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec);
4362 // TopoDS_Vertex Vtop = TopExp::FirstVertex( sideEdge );
4363 // if ( Vcom.IsSame( Vtop ))
4364 // Vtop = TopExp::LastVertex( sideEdge );
4365 // SMESH_Block::Insert( Vtop, vertIdVec[ 1 ], shapeMap);
4367 // // other side edge
4368 // sideEdge = GetEdge( V1_EDGE );
4369 // if ( sideEdge.IsNull() )
4371 // if ( edgeID = edgeIdVec[ _v1 ]) edgeID = edgeIdVec[ _v0 ];
4372 // else edgeID = edgeIdVec[ _v1 ];
4373 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4376 // TopoDS_Edge topEdge = GetEdge( TOP_EDGE );
4377 // SMESH_Block::Insert( topEdge, edgeIdVec[ _u1 ], shapeMap);
4379 // // top vertex of the other side edge
4380 // if ( !TopExp::CommonVertex( topEdge, sideEdge, Vcom ))
4382 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec );
4383 // SMESH_Block::Insert( Vcom, vertIdVec[ 1 ], shapeMap);
4388 //================================================================================
4390 * \brief Dump ids of nodes of sides
4392 //================================================================================
4394 void StdMeshers_PrismAsBlock::TSideFace::dumpNodes(int nbNodes) const
4397 cout << endl << "NODES OF FACE "; SMESH_Block::DumpShapeID( myID, cout ) << endl;
4398 THorizontalEdgeAdaptor* hSize0 = (THorizontalEdgeAdaptor*) HorizCurve(0);
4399 cout << "Horiz side 0: "; hSize0->dumpNodes(nbNodes); cout << endl;
4400 THorizontalEdgeAdaptor* hSize1 = (THorizontalEdgeAdaptor*) HorizCurve(1);
4401 cout << "Horiz side 1: "; hSize1->dumpNodes(nbNodes); cout << endl;
4402 TVerticalEdgeAdaptor* vSide0 = (TVerticalEdgeAdaptor*) VertiCurve(0);
4403 cout << "Verti side 0: "; vSide0->dumpNodes(nbNodes); cout << endl;
4404 TVerticalEdgeAdaptor* vSide1 = (TVerticalEdgeAdaptor*) VertiCurve(1);
4405 cout << "Verti side 1: "; vSide1->dumpNodes(nbNodes); cout << endl;
4406 delete hSize0; delete hSize1; delete vSide0; delete vSide1;
4410 //================================================================================
4412 * \brief Creates TVerticalEdgeAdaptor
4413 * \param columnsMap - node column map
4414 * \param parameter - normalized parameter
4416 //================================================================================
4418 StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::
4419 TVerticalEdgeAdaptor( const TParam2ColumnMap* columnsMap, const double parameter)
4421 myNodeColumn = & getColumn( columnsMap, parameter )->second;
4424 //================================================================================
4426 * \brief Return coordinates for the given normalized parameter
4427 * \param U - normalized parameter
4428 * \retval gp_Pnt - coordinates
4430 //================================================================================
4432 gp_Pnt StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::Value(const Standard_Real U) const
4434 const SMDS_MeshNode* n1;
4435 const SMDS_MeshNode* n2;
4436 double r = getRAndNodes( myNodeColumn, U, n1, n2 );
4437 return gpXYZ(n1) * ( 1 - r ) + gpXYZ(n2) * r;
4440 //================================================================================
4442 * \brief Dump ids of nodes
4444 //================================================================================
4446 void StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::dumpNodes(int nbNodes) const
4449 for ( int i = 0; i < nbNodes && i < (int)myNodeColumn->size(); ++i )
4450 cout << (*myNodeColumn)[i]->GetID() << " ";
4451 if ( nbNodes < (int) myNodeColumn->size() )
4452 cout << myNodeColumn->back()->GetID();
4456 //================================================================================
4458 * \brief Return coordinates for the given normalized parameter
4459 * \param U - normalized parameter
4460 * \retval gp_Pnt - coordinates
4462 //================================================================================
4464 gp_Pnt StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::Value(const Standard_Real U) const
4466 return mySide->TSideFace::Value( U, myV );
4469 //================================================================================
4471 * \brief Dump ids of <nbNodes> first nodes and the last one
4473 //================================================================================
4475 void StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::dumpNodes(int nbNodes) const
4478 // Not bedugged code. Last node is sometimes incorrect
4479 const TSideFace* side = mySide;
4481 if ( mySide->IsComplex() )
4482 side = mySide->GetComponent(0,u);
4484 TParam2ColumnIt col, col2;
4485 TParam2ColumnMap* u2cols = side->GetColumns();
4486 side->GetColumns( u , col, col2 );
4488 int j, i = myV ? mySide->ColumnHeight()-1 : 0;
4490 const SMDS_MeshNode* n = 0;
4491 const SMDS_MeshNode* lastN
4492 = side->IsForward() ? u2cols->rbegin()->second[ i ] : u2cols->begin()->second[ i ];
4493 for ( j = 0; j < nbNodes && n != lastN; ++j )
4495 n = col->second[ i ];
4496 cout << n->GetID() << " ";
4497 if ( side->IsForward() )
4505 if ( mySide->IsComplex() )
4506 side = mySide->GetComponent(1,u);
4508 side->GetColumns( u , col, col2 );
4509 if ( n != col->second[ i ] )
4510 cout << col->second[ i ]->GetID();
4514 //================================================================================
4516 * \brief Costructor of TPCurveOnHorFaceAdaptor fills its map of
4517 * normalized parameter to node UV on a horizontal face
4518 * \param [in] sideFace - lateral prism side
4519 * \param [in] isTop - is \a horFace top or bottom of the prism
4520 * \param [in] horFace - top or bottom face of the prism
4522 //================================================================================
4524 StdMeshers_PrismAsBlock::
4525 TPCurveOnHorFaceAdaptor::TPCurveOnHorFaceAdaptor( const TSideFace* sideFace,
4527 const TopoDS_Face& horFace)
4529 if ( sideFace && !horFace.IsNull() )
4531 //cout << "\n\t FACE " << sideFace->FaceID() << endl;
4532 const int Z = isTop ? sideFace->ColumnHeight() - 1 : 0;
4533 map<double, const SMDS_MeshNode* > u2nodes;
4534 sideFace->GetNodesAtZ( Z, u2nodes );
4535 if ( u2nodes.empty() )
4538 SMESH_MesherHelper helper( *sideFace->GetMesh() );
4539 helper.SetSubShape( horFace );
4544 Handle(Geom2d_Curve) C2d;
4546 const double tol = 10 * helper.MaxTolerance( horFace );
4547 const SMDS_MeshNode* prevNode = u2nodes.rbegin()->second;
4549 map<double, const SMDS_MeshNode* >::iterator u2n = u2nodes.begin();
4550 for ( ; u2n != u2nodes.end(); ++u2n )
4552 const SMDS_MeshNode* n = u2n->second;
4554 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_EDGE )
4556 if ( n->getshapeId() != edgeID )
4559 edgeID = n->getshapeId();
4560 TopoDS_Shape S = helper.GetSubShapeByNode( n, helper.GetMeshDS() );
4561 if ( !S.IsNull() && S.ShapeType() == TopAbs_EDGE )
4563 C2d = BRep_Tool::CurveOnSurface( TopoDS::Edge( S ), horFace, f,l );
4566 if ( !C2d.IsNull() )
4568 double u = static_cast< const SMDS_EdgePosition* >( n->GetPosition() )->GetUParameter();
4569 if ( f <= u && u <= l )
4571 uv = C2d->Value( u ).XY();
4572 okUV = helper.CheckNodeUV( horFace, n, uv, tol );
4577 uv = helper.GetNodeUV( horFace, n, prevNode, &okUV );
4579 myUVmap.insert( myUVmap.end(), make_pair( u2n->first, uv ));
4580 // cout << n->getshapeId() << " N " << n->GetID()
4581 // << " \t" << uv.X() << ", " << uv.Y() << " \t" << u2n->first << endl;
4588 //================================================================================
4590 * \brief Return UV on pcurve for the given normalized parameter
4591 * \param U - normalized parameter
4592 * \retval gp_Pnt - coordinates
4594 //================================================================================
4596 gp_Pnt2d StdMeshers_PrismAsBlock::TPCurveOnHorFaceAdaptor::Value(const Standard_Real U) const
4598 map< double, gp_XY >::const_iterator i1 = myUVmap.upper_bound( U );
4600 if ( i1 == myUVmap.end() )
4601 return myUVmap.empty() ? gp_XY(0,0) : myUVmap.rbegin()->second;
4603 if ( i1 == myUVmap.begin() )
4604 return (*i1).second;
4606 map< double, gp_XY >::const_iterator i2 = i1--;
4608 double r = ( U - i1->first ) / ( i2->first - i1->first );
4609 return i1->second * ( 1 - r ) + i2->second * r;
4612 //================================================================================
4614 * \brief Projects internal nodes using transformation found by boundary nodes
4616 //================================================================================
4618 bool StdMeshers_Sweeper::projectIntPoints(const vector< gp_XYZ >& fromBndPoints,
4619 const vector< gp_XYZ >& toBndPoints,
4620 const vector< gp_XYZ >& fromIntPoints,
4621 vector< gp_XYZ >& toIntPoints,
4622 NSProjUtils::TrsfFinder3D& trsf,
4623 vector< gp_XYZ > * bndError)
4625 // find transformation
4626 if ( trsf.IsIdentity() && !trsf.Solve( fromBndPoints, toBndPoints ))
4629 // compute internal points using the found trsf
4630 for ( size_t iP = 0; iP < fromIntPoints.size(); ++iP )
4632 toIntPoints[ iP ] = trsf.Transform( fromIntPoints[ iP ]);
4635 // compute boundary error
4638 bndError->resize( fromBndPoints.size() );
4640 for ( size_t iP = 0; iP < fromBndPoints.size(); ++iP )
4642 fromTrsf = trsf.Transform( fromBndPoints[ iP ] );
4643 (*bndError)[ iP ] = toBndPoints[ iP ] - fromTrsf;
4649 //================================================================================
4651 * \brief Add boundary error to ineternal points
4653 //================================================================================
4655 void StdMeshers_Sweeper::applyBoundaryError(const vector< gp_XYZ >& bndPoints,
4656 const vector< gp_XYZ >& bndError1,
4657 const vector< gp_XYZ >& bndError2,
4659 vector< gp_XYZ >& intPoints,
4660 vector< double >& int2BndDist)
4662 // fix each internal point
4663 const double eps = 1e-100;
4664 for ( size_t iP = 0; iP < intPoints.size(); ++iP )
4666 gp_XYZ & intPnt = intPoints[ iP ];
4668 // compute distance from intPnt to each boundary node
4669 double int2BndDistSum = 0;
4670 for ( size_t iBnd = 0; iBnd < bndPoints.size(); ++iBnd )
4672 int2BndDist[ iBnd ] = 1 / (( intPnt - bndPoints[ iBnd ]).SquareModulus() + eps );
4673 int2BndDistSum += int2BndDist[ iBnd ];
4677 for ( size_t iBnd = 0; iBnd < bndPoints.size(); ++iBnd )
4679 intPnt += bndError1[ iBnd ] * ( 1 - r ) * int2BndDist[ iBnd ] / int2BndDistSum;
4680 intPnt += bndError2[ iBnd ] * r * int2BndDist[ iBnd ] / int2BndDistSum;
4685 //================================================================================
4687 * \brief Creates internal nodes of the prism
4689 //================================================================================
4691 bool StdMeshers_Sweeper::ComputeNodes( SMESH_MesherHelper& helper,
4693 const bool allowHighBndError)
4695 const size_t zSize = myBndColumns[0]->size();
4696 const size_t zSrc = 0, zTgt = zSize-1;
4697 if ( zSize < 3 ) return true;
4699 vector< vector< gp_XYZ > > intPntsOfLayer( zSize ); // node coodinates to compute
4700 // set coordinates of src and tgt nodes
4701 for ( size_t z = 0; z < intPntsOfLayer.size(); ++z )
4702 intPntsOfLayer[ z ].resize( myIntColumns.size() );
4703 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4705 intPntsOfLayer[ zSrc ][ iP ] = intPoint( iP, zSrc );
4706 intPntsOfLayer[ zTgt ][ iP ] = intPoint( iP, zTgt );
4709 // compute coordinates of internal nodes by projecting (transfroming) src and tgt
4710 // nodes towards the central layer
4712 vector< NSProjUtils::TrsfFinder3D > trsfOfLayer( zSize );
4713 vector< vector< gp_XYZ > > bndError( zSize );
4715 // boundary points used to compute an affine transformation from a layer to a next one
4716 vector< gp_XYZ > fromSrcBndPnts( myBndColumns.size() ), fromTgtBndPnts( myBndColumns.size() );
4717 vector< gp_XYZ > toSrcBndPnts ( myBndColumns.size() ), toTgtBndPnts ( myBndColumns.size() );
4718 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4720 fromSrcBndPnts[ iP ] = bndPoint( iP, zSrc );
4721 fromTgtBndPnts[ iP ] = bndPoint( iP, zTgt );
4724 size_t zS = zSrc + 1;
4725 size_t zT = zTgt - 1;
4726 for ( ; zS < zT; ++zS, --zT ) // vertical loop on layers
4728 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4730 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4731 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4733 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4734 intPntsOfLayer[ zS-1 ], intPntsOfLayer[ zS ],
4735 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
4737 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4738 intPntsOfLayer[ zT+1 ], intPntsOfLayer[ zT ],
4739 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
4742 // if ( zT == zTgt - 1 )
4744 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4746 // gp_XYZ fromTrsf = trsfOfLayer [ zT+1].Transform( fromTgtBndPnts[ iP ] );
4747 // cout << "mesh.AddNode( "
4748 // << fromTrsf.X() << ", "
4749 // << fromTrsf.Y() << ", "
4750 // << fromTrsf.Z() << ") " << endl;
4752 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4753 // cout << "mesh.AddNode( "
4754 // << intPntsOfLayer[ zT ][ iP ].X() << ", "
4755 // << intPntsOfLayer[ zT ][ iP ].Y() << ", "
4756 // << intPntsOfLayer[ zT ][ iP ].Z() << ") " << endl;
4759 fromTgtBndPnts.swap( toTgtBndPnts );
4760 fromSrcBndPnts.swap( toSrcBndPnts );
4763 // Compute two projections of internal points to the central layer
4764 // in order to evaluate an error of internal points
4766 bool centerIntErrorIsSmall;
4767 vector< gp_XYZ > centerSrcIntPnts( myIntColumns.size() );
4768 vector< gp_XYZ > centerTgtIntPnts( myIntColumns.size() );
4770 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4772 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4773 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4775 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4776 intPntsOfLayer[ zS-1 ], centerSrcIntPnts,
4777 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
4779 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4780 intPntsOfLayer[ zT+1 ], centerTgtIntPnts,
4781 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
4784 // evaluate an error of internal points on the central layer
4785 centerIntErrorIsSmall = true;
4786 if ( zS == zT ) // odd zSize
4788 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
4789 centerIntErrorIsSmall =
4790 (centerSrcIntPnts[ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
4794 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
4795 centerIntErrorIsSmall =
4796 (intPntsOfLayer[ zS-1 ][ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
4799 // Evaluate an error of boundary points
4801 bool bndErrorIsSmall = true;
4802 for ( size_t iP = 0; ( iP < myBndColumns.size() && bndErrorIsSmall ); ++iP )
4804 double sumError = 0;
4805 for ( size_t z = 1; z < zS; ++z ) // loop on layers
4806 sumError += ( bndError[ z-1 ][ iP ].Modulus() +
4807 bndError[ zSize-z ][ iP ].Modulus() );
4809 bndErrorIsSmall = ( sumError < tol );
4812 if ( !bndErrorIsSmall && !allowHighBndError )
4815 // compute final points on the central layer
4816 std::vector< double > int2BndDist( myBndColumns.size() ); // work array of applyBoundaryError()
4817 double r = zS / ( zSize - 1.);
4820 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4822 intPntsOfLayer[ zS ][ iP ] =
4823 ( 1 - r ) * centerSrcIntPnts[ iP ] + r * centerTgtIntPnts[ iP ];
4825 if ( !bndErrorIsSmall )
4827 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS+1 ], r,
4828 intPntsOfLayer[ zS ], int2BndDist );
4833 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4835 intPntsOfLayer[ zS ][ iP ] =
4836 r * intPntsOfLayer[ zS ][ iP ] + ( 1 - r ) * centerSrcIntPnts[ iP ];
4837 intPntsOfLayer[ zT ][ iP ] =
4838 r * intPntsOfLayer[ zT ][ iP ] + ( 1 - r ) * centerTgtIntPnts[ iP ];
4840 if ( !bndErrorIsSmall )
4842 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS+1 ], r,
4843 intPntsOfLayer[ zS ], int2BndDist );
4844 applyBoundaryError( toTgtBndPnts, bndError[ zT+1 ], bndError[ zT-1 ], r,
4845 intPntsOfLayer[ zT ], int2BndDist );
4849 //centerIntErrorIsSmall = true;
4850 //bndErrorIsSmall = true;
4851 if ( !centerIntErrorIsSmall )
4853 // Compensate the central error; continue adding projection
4854 // by going from central layer to the source and target ones
4856 vector< gp_XYZ >& fromSrcIntPnts = centerSrcIntPnts;
4857 vector< gp_XYZ >& fromTgtIntPnts = centerTgtIntPnts;
4858 vector< gp_XYZ > toSrcIntPnts( myIntColumns.size() );
4859 vector< gp_XYZ > toTgtIntPnts( myIntColumns.size() );
4860 vector< gp_XYZ > srcBndError( myBndColumns.size() );
4861 vector< gp_XYZ > tgtBndError( myBndColumns.size() );
4863 fromTgtBndPnts.swap( toTgtBndPnts );
4864 fromSrcBndPnts.swap( toSrcBndPnts );
4866 for ( ++zS, --zT; zS < zTgt; ++zS, --zT ) // vertical loop on layers
4868 // invert transformation
4869 if ( !trsfOfLayer[ zS+1 ].Invert() )
4870 trsfOfLayer[ zS+1 ] = NSProjUtils::TrsfFinder3D(); // to recompute
4871 if ( !trsfOfLayer[ zT-1 ].Invert() )
4872 trsfOfLayer[ zT-1 ] = NSProjUtils::TrsfFinder3D();
4874 // project internal nodes and compute bnd error
4875 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4877 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4878 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4880 projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4881 fromSrcIntPnts, toSrcIntPnts,
4882 trsfOfLayer[ zS+1 ], & srcBndError );
4883 projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4884 fromTgtIntPnts, toTgtIntPnts,
4885 trsfOfLayer[ zT-1 ], & tgtBndError );
4887 // if ( zS == zTgt - 1 )
4889 // cout << "mesh2 = smesh.Mesh()" << endl;
4890 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4892 // gp_XYZ fromTrsf = trsfOfLayer [ zS+1].Transform( fromSrcBndPnts[ iP ] );
4893 // cout << "mesh2.AddNode( "
4894 // << fromTrsf.X() << ", "
4895 // << fromTrsf.Y() << ", "
4896 // << fromTrsf.Z() << ") " << endl;
4898 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4899 // cout << "mesh2.AddNode( "
4900 // << toSrcIntPnts[ iP ].X() << ", "
4901 // << toSrcIntPnts[ iP ].Y() << ", "
4902 // << toSrcIntPnts[ iP ].Z() << ") " << endl;
4905 // sum up 2 projections
4906 r = zS / ( zSize - 1.);
4907 vector< gp_XYZ >& zSIntPnts = intPntsOfLayer[ zS ];
4908 vector< gp_XYZ >& zTIntPnts = intPntsOfLayer[ zT ];
4909 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4911 zSIntPnts[ iP ] = r * zSIntPnts[ iP ] + ( 1 - r ) * toSrcIntPnts[ iP ];
4912 zTIntPnts[ iP ] = r * zTIntPnts[ iP ] + ( 1 - r ) * toTgtIntPnts[ iP ];
4915 // compensate bnd error
4916 if ( !bndErrorIsSmall )
4918 applyBoundaryError( toSrcBndPnts, srcBndError, bndError[ zS+1 ], r,
4919 intPntsOfLayer[ zS ], int2BndDist );
4920 applyBoundaryError( toTgtBndPnts, tgtBndError, bndError[ zT-1 ], r,
4921 intPntsOfLayer[ zT ], int2BndDist );
4924 fromSrcBndPnts.swap( toSrcBndPnts );
4925 fromSrcIntPnts.swap( toSrcIntPnts );
4926 fromTgtBndPnts.swap( toTgtBndPnts );
4927 fromTgtIntPnts.swap( toTgtIntPnts );
4929 } // if ( !centerIntErrorIsSmall )
4931 else if ( !bndErrorIsSmall )
4935 for ( ; zS < zT; ++zS, --zT ) // vertical loop on layers
4937 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4939 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4940 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4942 // compensate bnd error
4943 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS-1 ], 0.5,
4944 intPntsOfLayer[ zS ], int2BndDist );
4945 applyBoundaryError( toTgtBndPnts, bndError[ zT+1 ], bndError[ zT+1 ], 0.5,
4946 intPntsOfLayer[ zT ], int2BndDist );
4950 // cout << "centerIntErrorIsSmall = " << centerIntErrorIsSmall<< endl;
4951 // cout << "bndErrorIsSmall = " << bndErrorIsSmall<< endl;
4954 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4956 vector< const SMDS_MeshNode* > & nodeCol = *myIntColumns[ iP ];
4957 for ( size_t z = zSrc + 1; z < zTgt; ++z ) // vertical loop on layers
4959 const gp_XYZ & xyz = intPntsOfLayer[ z ][ iP ];
4960 if ( !( nodeCol[ z ] = helper.AddNode( xyz.X(), xyz.Y(), xyz.Z() )))