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;
166 //=======================================================================
168 * \brief Returns already computed EDGEs
170 void getPrecomputedEdges( SMESH_MesherHelper& theHelper,
171 const TopoDS_Shape& theShape,
172 vector< TopoDS_Edge >& theEdges)
176 SMESHDS_Mesh* meshDS = theHelper.GetMeshDS();
179 TopTools_IndexedMapOfShape edges;
180 TopExp::MapShapes( theShape, TopAbs_EDGE, edges );
181 for ( int iE = 1; iE <= edges.Extent(); ++iE )
183 const TopoDS_Shape edge = edges( iE );
184 if (( ! ( sm = meshDS->MeshElements( edge ))) ||
185 ( sm->NbElements() == 0 ))
188 // there must not be FACEs meshed with triangles and sharing a computed EDGE
189 // as the precomputed EDGEs are used for propagation other to 'vertical' EDGEs
190 bool faceFound = false;
191 PShapeIteratorPtr faceIt =
192 theHelper.GetAncestors( edge, *theHelper.GetMesh(), TopAbs_FACE );
193 while ( const TopoDS_Shape* face = faceIt->next() )
195 if (( sm = meshDS->MeshElements( *face )) &&
196 ( sm->NbElements() > 0 ) &&
197 ( !theHelper.IsSameElemGeometry( sm, SMDSGeom_QUADRANGLE ) ))
203 theEdges.push_back( TopoDS::Edge( edge ));
207 //================================================================================
209 * \brief Make \a botE be the BOTTOM_SIDE of \a quad.
210 * Return false if the BOTTOM_SIDE is composite
212 //================================================================================
214 bool setBottomEdge( const TopoDS_Edge& botE,
215 FaceQuadStruct::Ptr& quad,
216 const TopoDS_Shape& face)
218 quad->side[ QUAD_TOP_SIDE ].grid->Reverse();
219 quad->side[ QUAD_LEFT_SIDE ].grid->Reverse();
221 bool isComposite = false;
222 for ( size_t i = 0; i < quad->side.size(); ++i )
224 StdMeshers_FaceSidePtr quadSide = quad->side[i];
225 for ( int iE = 0; iE < quadSide->NbEdges(); ++iE )
226 if ( botE.IsSame( quadSide->Edge( iE )))
228 if ( quadSide->NbEdges() > 1 )
229 isComposite = true; //return false;
231 i = quad->side.size(); // to quit from the outer loop
235 if ( edgeIndex != QUAD_BOTTOM_SIDE )
236 quad->shift( quad->side.size() - edgeIndex, /*keepUnitOri=*/false );
238 quad->face = TopoDS::Face( face );
243 //================================================================================
245 * \brief Return iterator pointing to node column for the given parameter
246 * \param columnsMap - node column map
247 * \param parameter - parameter
248 * \retval TParam2ColumnMap::iterator - result
250 * it returns closest left column
252 //================================================================================
254 TParam2ColumnIt getColumn( const TParam2ColumnMap* columnsMap,
255 const double parameter )
257 TParam2ColumnIt u_col = columnsMap->upper_bound( parameter );
258 if ( u_col != columnsMap->begin() )
260 return u_col; // return left column
263 //================================================================================
265 * \brief Return nodes around given parameter and a ratio
266 * \param column - node column
267 * \param param - parameter
268 * \param node1 - lower node
269 * \param node2 - upper node
270 * \retval double - ratio
272 //================================================================================
274 double getRAndNodes( const TNodeColumn* column,
276 const SMDS_MeshNode* & node1,
277 const SMDS_MeshNode* & node2)
279 if ( param >= 1.0 || column->size() == 1) {
280 node1 = node2 = column->back();
284 int i = int( param * ( column->size() - 1 ));
285 double u0 = double( i )/ double( column->size() - 1 );
286 double r = ( param - u0 ) * ( column->size() - 1 );
288 node1 = (*column)[ i ];
289 node2 = (*column)[ i + 1];
293 //================================================================================
295 * \brief Compute boundary parameters of face parts
296 * \param nbParts - nb of parts to split columns into
297 * \param columnsMap - node columns of the face to split
298 * \param params - computed parameters
300 //================================================================================
302 void splitParams( const int nbParts,
303 const TParam2ColumnMap* columnsMap,
304 vector< double > & params)
307 params.reserve( nbParts + 1 );
308 TParam2ColumnIt last_par_col = --columnsMap->end();
309 double par = columnsMap->begin()->first; // 0.
310 double parLast = last_par_col->first;
311 params.push_back( par );
312 for ( int i = 0; i < nbParts - 1; ++ i )
314 double partSize = ( parLast - par ) / double ( nbParts - i );
315 TParam2ColumnIt par_col = getColumn( columnsMap, par + partSize );
316 if ( par_col->first == par ) {
318 if ( par_col == last_par_col ) {
319 while ( i < nbParts - 1 )
320 params.push_back( par + partSize * i++ );
324 par = par_col->first;
325 params.push_back( par );
327 params.push_back( parLast ); // 1.
330 //================================================================================
332 * \brief Return coordinate system for z-th layer of nodes
334 //================================================================================
336 gp_Ax2 getLayerCoordSys(const int z,
337 const vector< const TNodeColumn* >& columns,
340 // gravity center of a layer
343 for ( size_t i = 0; i < columns.size(); ++i )
345 O += gpXYZ( (*columns[ i ])[ z ]);
346 if ( vertexCol < 0 &&
347 columns[ i ]->front()->GetPosition()->GetTypeOfPosition() == SMDS_TOP_VERTEX )
354 int iPrev = columns.size()-1;
355 for ( size_t i = 0; i < columns.size(); ++i )
357 gp_Vec v1( O, gpXYZ( (*columns[ iPrev ])[ z ]));
358 gp_Vec v2( O, gpXYZ( (*columns[ i ] )[ z ]));
363 if ( vertexCol >= 0 )
365 O = gpXYZ( (*columns[ vertexCol ])[ z ]);
367 if ( xColumn < 0 || xColumn >= (int) columns.size() )
369 // select a column for X dir
371 for ( size_t i = 0; i < columns.size(); ++i )
373 double dist = ( O - gpXYZ((*columns[ i ])[ z ])).SquareModulus();
374 if ( dist > maxDist )
383 gp_Vec X( O, gpXYZ( (*columns[ xColumn ])[ z ]));
385 return gp_Ax2( O, Z, X);
388 //================================================================================
390 * \brief Removes submeshes that are or can be meshed with regular grid from given list
391 * \retval int - nb of removed submeshes
393 //================================================================================
395 int removeQuasiQuads(list< SMESH_subMesh* >& notQuadSubMesh,
396 SMESH_MesherHelper* helper,
397 StdMeshers_Quadrangle_2D* quadAlgo)
400 //SMESHDS_Mesh* mesh = notQuadSubMesh.front()->GetFather()->GetMeshDS();
401 list< SMESH_subMesh* >::iterator smIt = notQuadSubMesh.begin();
402 while ( smIt != notQuadSubMesh.end() )
404 SMESH_subMesh* faceSm = *smIt;
405 SMESHDS_SubMesh* faceSmDS = faceSm->GetSubMeshDS();
406 int nbQuads = faceSmDS ? faceSmDS->NbElements() : 0;
409 toRemove = helper->IsStructured( faceSm );
411 toRemove = ( quadAlgo->CheckNbEdges( *helper->GetMesh(),
412 faceSm->GetSubShape() ) != NULL );
413 nbRemoved += toRemove;
415 smIt = notQuadSubMesh.erase( smIt );
423 //================================================================================
425 * \brief Return and angle between two EDGEs
426 * \return double - the angle normalized so that
433 //================================================================================
435 // double normAngle(const TopoDS_Edge & E1, const TopoDS_Edge & E2, const TopoDS_Face & F)
437 // return SMESH_MesherHelper::GetAngle( E1, E2, F ) / ( 0.5 * M_PI );
440 //================================================================================
442 * Consider continuous straight EDGES as one side - mark them to unite
444 //================================================================================
446 int countNbSides( const Prism_3D::TPrismTopo & thePrism,
447 vector<int> & nbUnitePerEdge,
448 vector< double > & edgeLength)
450 int nbEdges = thePrism.myNbEdgesInWires.front(); // nb outer edges
451 int nbSides = nbEdges;
454 list< TopoDS_Edge >::const_iterator edgeIt = thePrism.myBottomEdges.begin();
455 std::advance( edgeIt, nbEdges-1 );
456 TopoDS_Edge prevE = *edgeIt;
457 // bool isPrevStraight = SMESH_Algo::IsStraight( prevE );
458 // int iPrev = nbEdges - 1;
460 // int iUnite = -1; // the first of united EDGEs
462 // analyse angles between EDGEs
464 vector< bool > isCorner( nbEdges );
465 edgeIt = thePrism.myBottomEdges.begin();
466 for ( int iE = 0; iE < nbEdges; ++iE, ++edgeIt )
468 const TopoDS_Edge& curE = *edgeIt;
469 edgeLength[ iE ] = SMESH_Algo::EdgeLength( curE );
471 // double normAngle = normAngle( prevE, curE, thePrism.myBottom );
472 // isCorner[ iE ] = false;
473 // if ( normAngle < 2.0 )
475 // if ( normAngle < 0.001 ) // straight or obtuse angle
477 // // unite EDGEs in order not to put a corner of the unit quadrangle at this VERTEX
480 // nbUnitePerEdge[ iUnite ]++;
481 // nbUnitePerEdge[ iE ] = -1;
486 // isCorner[ iE ] = true;
496 // define which of corners to put on a side of the unit quadrangle
498 // edgeIt = thePrism.myBottomEdges.begin();
499 // for ( int iE = 0; iE < nbEdges; ++iE, ++edgeIt )
501 // const TopoDS_Edge& curE = *edgeIt;
502 // edgeLength[ iE ] = SMESH_Algo::EdgeLength( curE );
504 // const bool isCurStraight = SMESH_Algo::IsStraight( curE );
505 // if ( isPrevStraight && isCurStraight && SMESH_Algo::IsContinuous( prevE, curE ))
509 // nbUnitePerEdge[ iUnite ]++;
510 // nbUnitePerEdge[ iE ] = -1;
518 // isPrevStraight = isCurStraight;
525 void pointsToPython(const std::vector<gp_XYZ>& p)
528 for ( size_t i = SMESH_Block::ID_V000; i < p.size(); ++i )
530 cout << "mesh.AddNode( " << p[i].X() << ", "<< p[i].Y() << ", "<< p[i].Z() << ") # " << i <<" " ;
531 SMESH_Block::DumpShapeID( i, cout ) << endl;
537 //=======================================================================
538 //function : StdMeshers_Prism_3D
540 //=======================================================================
542 StdMeshers_Prism_3D::StdMeshers_Prism_3D(int hypId, int studyId, SMESH_Gen* gen)
543 :SMESH_3D_Algo(hypId, studyId, gen)
546 _shapeType = (1 << TopAbs_SOLID); // 1 bit per shape type
547 _onlyUnaryInput = false; // mesh all SOLIDs at once
548 _requireDiscreteBoundary = false; // mesh FACEs and EDGEs by myself
549 _supportSubmeshes = true; // "source" FACE must be meshed by other algo
550 _neededLowerHyps[ 1 ] = true; // suppress warning on hiding a global 1D algo
551 _neededLowerHyps[ 2 ] = true; // suppress warning on hiding a global 2D algo
553 //myProjectTriangles = false;
554 mySetErrorToSM = true; // to pass an error to a sub-mesh of a current solid or not
557 //================================================================================
561 //================================================================================
563 StdMeshers_Prism_3D::~StdMeshers_Prism_3D()
566 //=======================================================================
567 //function : CheckHypothesis
569 //=======================================================================
571 bool StdMeshers_Prism_3D::CheckHypothesis(SMESH_Mesh& aMesh,
572 const TopoDS_Shape& aShape,
573 SMESH_Hypothesis::Hypothesis_Status& aStatus)
575 // Check shape geometry
577 aStatus = SMESH_Hypothesis::HYP_BAD_GEOMETRY;
579 // find not quadrangle faces
580 list< TopoDS_Shape > notQuadFaces;
581 int nbEdge, nbWire, nbFace = 0;
582 TopExp_Explorer exp( aShape, TopAbs_FACE );
583 for ( ; exp.More(); exp.Next() ) {
585 const TopoDS_Shape& face = exp.Current();
586 nbEdge = NSProjUtils::Count( face, TopAbs_EDGE, 0 );
587 nbWire = NSProjUtils::Count( face, TopAbs_WIRE, 0 );
588 if ( nbEdge!= 4 || nbWire!= 1 ) {
589 if ( !notQuadFaces.empty() ) {
590 if ( NSProjUtils::Count( notQuadFaces.back(), TopAbs_EDGE, 0 ) != nbEdge ||
591 NSProjUtils::Count( notQuadFaces.back(), TopAbs_WIRE, 0 ) != nbWire )
592 RETURN_BAD_RESULT("Different not quad faces");
594 notQuadFaces.push_back( face );
597 if ( !notQuadFaces.empty() )
599 if ( notQuadFaces.size() != 2 )
600 RETURN_BAD_RESULT("Bad nb not quad faces: " << notQuadFaces.size());
602 // check total nb faces
603 nbEdge = NSProjUtils::Count( notQuadFaces.back(), TopAbs_EDGE, 0 );
604 if ( nbFace != nbEdge + 2 )
605 RETURN_BAD_RESULT("Bad nb of faces: " << nbFace << " but must be " << nbEdge + 2);
609 aStatus = SMESH_Hypothesis::HYP_OK;
613 //=======================================================================
615 //purpose : Compute mesh on a COMPOUND of SOLIDs
616 //=======================================================================
618 bool StdMeshers_Prism_3D::Compute(SMESH_Mesh& theMesh, const TopoDS_Shape& theShape)
620 SMESH_MesherHelper helper( theMesh );
623 int nbSolids = helper.Count( theShape, TopAbs_SOLID, /*skipSame=*/false );
627 TopTools_IndexedDataMapOfShapeListOfShape faceToSolids;
628 TopExp::MapShapesAndAncestors( theShape, TopAbs_FACE, TopAbs_SOLID, faceToSolids );
630 // look for meshed FACEs ("source" FACEs) that must be prism bottoms
631 list< TopoDS_Face > meshedFaces, notQuadMeshedFaces, notQuadFaces;
632 const bool meshHasQuads = ( theMesh.NbQuadrangles() > 0 );
633 //StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this );
634 for ( int iF = 1; iF <= faceToSolids.Extent(); ++iF )
636 const TopoDS_Face& face = TopoDS::Face( faceToSolids.FindKey( iF ));
637 SMESH_subMesh* faceSM = theMesh.GetSubMesh( face );
638 if ( !faceSM->IsEmpty() )
640 if ( !meshHasQuads ||
641 !helper.IsSameElemGeometry( faceSM->GetSubMeshDS(), SMDSGeom_QUADRANGLE ) ||
642 !helper.IsStructured( faceSM )
644 notQuadMeshedFaces.push_front( face );
645 else if ( myHelper->Count( face, TopAbs_EDGE, /*ignoreSame=*/false ) != 4 )
646 meshedFaces.push_front( face );
648 meshedFaces.push_back( face );
650 // not add not quadrilateral FACE as we can't compute it
651 // else if ( !quadAlgo->CheckNbEdges( theMesh, face ))
652 // // not add not quadrilateral FACE as it can be a prism side
653 // // else if ( myHelper->Count( face, TopAbs_EDGE, /*ignoreSame=*/false ) != 4 )
655 // notQuadFaces.push_back( face );
658 // notQuadFaces are of medium priority, put them before ordinary meshed faces
659 meshedFaces.splice( meshedFaces.begin(), notQuadFaces );
660 // notQuadMeshedFaces are of highest priority, put them before notQuadFaces
661 meshedFaces.splice( meshedFaces.begin(), notQuadMeshedFaces );
663 Prism_3D::TPrismTopo prism;
665 bool selectBottom = meshedFaces.empty();
669 TopoDS_Shape solid = TopExp_Explorer( theShape, TopAbs_SOLID ).Current();
670 if ( !meshedFaces.empty() )
671 prism.myBottom = meshedFaces.front();
672 return ( initPrism( prism, solid, selectBottom ) &&
676 // find propagation chains from already computed EDGEs
677 vector< TopoDS_Edge > computedEdges;
678 getPrecomputedEdges( helper, theShape, computedEdges );
679 myPropagChains = new TopTools_IndexedMapOfShape[ computedEdges.size() + 1 ];
680 SMESHUtils::ArrayDeleter< TopTools_IndexedMapOfShape > pcDel( myPropagChains );
681 for ( size_t i = 0, nb = 0; i < computedEdges.size(); ++i )
683 StdMeshers_ProjectionUtils::GetPropagationEdge( &theMesh, TopoDS_Edge(),
684 computedEdges[i], myPropagChains + nb );
685 if ( myPropagChains[ nb ].Extent() < 2 ) // an empty map is a termination sign
686 myPropagChains[ nb ].Clear();
691 TopTools_MapOfShape meshedSolids;
692 list< Prism_3D::TPrismTopo > meshedPrism;
693 list< TopoDS_Face > suspectSourceFaces;
694 TopTools_ListIteratorOfListOfShape solidIt;
696 while ( meshedSolids.Extent() < nbSolids )
698 if ( _computeCanceled )
699 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
701 // compute prisms having avident computed source FACE
702 while ( !meshedFaces.empty() )
704 TopoDS_Face face = meshedFaces.front();
705 meshedFaces.pop_front();
706 TopTools_ListOfShape& solidList = faceToSolids.ChangeFromKey( face );
707 while ( !solidList.IsEmpty() )
709 TopoDS_Shape solid = solidList.First();
710 solidList.RemoveFirst();
711 if ( meshedSolids.Add( solid ))
714 prism.myBottom = face;
715 if ( !initPrism( prism, solid, selectBottom ) ||
719 SMESHDS_SubMesh* smDS = theMesh.GetMeshDS()->MeshElements( prism.myTop );
720 if ( !myHelper->IsSameElemGeometry( smDS, SMDSGeom_QUADRANGLE ))
722 meshedFaces.push_front( prism.myTop );
726 suspectSourceFaces.push_back( prism.myTop );
728 meshedPrism.push_back( prism );
732 if ( meshedSolids.Extent() == nbSolids )
735 // below in the loop we try to find source FACEs somehow
737 // project mesh from source FACEs of computed prisms to
738 // prisms sharing wall FACEs
739 list< Prism_3D::TPrismTopo >::iterator prismIt = meshedPrism.begin();
740 for ( ; prismIt != meshedPrism.end(); ++prismIt )
742 for ( size_t iW = 0; iW < prismIt->myWallQuads.size(); ++iW )
744 Prism_3D::TQuadList::iterator wQuad = prismIt->myWallQuads[iW].begin();
745 for ( ; wQuad != prismIt->myWallQuads[iW].end(); ++ wQuad )
747 const TopoDS_Face& wFace = (*wQuad)->face;
748 TopTools_ListOfShape& solidList = faceToSolids.ChangeFromKey( wFace );
749 solidIt.Initialize( solidList );
750 while ( solidIt.More() )
752 const TopoDS_Shape& solid = solidIt.Value();
753 if ( meshedSolids.Contains( solid )) {
754 solidList.Remove( solidIt );
755 continue; // already computed prism
757 if ( myHelper->IsBlock( solid )) {
759 continue; // too trivial
761 // find a source FACE of the SOLID: it's a FACE sharing a bottom EDGE with wFace
762 const TopoDS_Edge& wEdge = (*wQuad)->side[ QUAD_TOP_SIDE ].grid->Edge(0);
763 PShapeIteratorPtr faceIt = myHelper->GetAncestors( wEdge, *myHelper->GetMesh(),
765 while ( const TopoDS_Shape* f = faceIt->next() )
767 const TopoDS_Face& candidateF = TopoDS::Face( *f );
768 if ( candidateF.IsSame( wFace )) continue;
769 // select a source FACE: prismIt->myBottom or prismIt->myTop
770 TopoDS_Face sourceF = prismIt->myBottom;
771 for ( TopExp_Explorer v( prismIt->myTop, TopAbs_VERTEX ); v.More(); v.Next() )
772 if ( myHelper->IsSubShape( v.Current(), candidateF )) {
773 sourceF = prismIt->myTop;
777 prism.myBottom = candidateF;
778 mySetErrorToSM = false;
779 if ( !myHelper->IsSubShape( candidateF, prismIt->myShape3D ) &&
780 myHelper ->IsSubShape( candidateF, solid ) &&
781 !myHelper->GetMesh()->GetSubMesh( candidateF )->IsMeshComputed() &&
782 initPrism( prism, solid, /*selectBottom=*/false ) &&
783 !myHelper->GetMesh()->GetSubMesh( prism.myTop )->IsMeshComputed() &&
784 !myHelper->GetMesh()->GetSubMesh( prism.myBottom )->IsMeshComputed() &&
785 project2dMesh( sourceF, prism.myBottom ))
787 mySetErrorToSM = true;
788 if ( !compute( prism ))
790 SMESHDS_SubMesh* smDS = theMesh.GetMeshDS()->MeshElements( prism.myTop );
791 if ( !myHelper->IsSameElemGeometry( smDS, SMDSGeom_QUADRANGLE ))
793 meshedFaces.push_front( prism.myTop );
794 meshedFaces.push_front( prism.myBottom );
795 selectBottom = false;
797 meshedPrism.push_back( prism );
798 meshedSolids.Add( solid );
802 mySetErrorToSM = true;
804 if ( meshedSolids.Contains( solid ))
805 solidList.Remove( solidIt );
811 if ( !meshedFaces.empty() )
812 break; // to compute prisms with avident sources
815 if ( meshedFaces.empty() )
817 meshedFaces.splice( meshedFaces.end(), suspectSourceFaces );
821 // find FACEs with local 1D hyps, which has to be computed by now,
822 // or at least any computed FACEs
823 if ( meshedFaces.empty() )
826 for ( int iF = 1; iF <= faceToSolids.Extent(); ++iF )
828 const TopoDS_Face& face = TopoDS::Face( faceToSolids.FindKey( iF ));
829 const TopTools_ListOfShape& solidList = faceToSolids.FindFromKey( face );
830 if ( solidList.IsEmpty() ) continue;
831 SMESH_subMesh* faceSM = theMesh.GetSubMesh( face );
832 if ( !faceSM->IsEmpty() )
834 int nbFaces = faceSM->GetSubMeshDS()->NbElements();
835 if ( prevNbFaces < nbFaces )
837 if ( !meshedFaces.empty() ) meshedFaces.pop_back();
838 meshedFaces.push_back( face ); // lower priority
840 prevNbFaces = nbFaces;
845 bool allSubMeComputed = true;
846 SMESH_subMeshIteratorPtr smIt = faceSM->getDependsOnIterator(false,true);
847 while ( smIt->more() && allSubMeComputed )
848 allSubMeComputed = smIt->next()->IsMeshComputed();
849 if ( allSubMeComputed )
851 faceSM->ComputeStateEngine( SMESH_subMesh::COMPUTE );
852 if ( !faceSM->IsEmpty() ) {
853 meshedFaces.push_front( face ); // higher priority
858 faceSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
866 // TODO. there are other ways to find out the source FACE:
867 // propagation, topological similarity, ect.
869 // simply try to mesh all not meshed SOLIDs
870 if ( meshedFaces.empty() )
872 for ( TopExp_Explorer solid( theShape, TopAbs_SOLID ); solid.More(); solid.Next() )
874 mySetErrorToSM = false;
876 if ( !meshedSolids.Contains( solid.Current() ) &&
877 initPrism( prism, solid.Current() ))
879 mySetErrorToSM = true;
880 if ( !compute( prism ))
882 meshedFaces.push_front( prism.myTop );
883 meshedFaces.push_front( prism.myBottom );
884 meshedPrism.push_back( prism );
885 meshedSolids.Add( solid.Current() );
888 mySetErrorToSM = true;
892 if ( meshedFaces.empty() ) // set same error to 10 not-computed solids
894 SMESH_ComputeErrorPtr err = SMESH_ComputeError::New
895 ( COMPERR_BAD_INPUT_MESH, "No meshed source face found", this );
897 const int maxNbErrors = 10; // limit nb errors not to overload the Compute dialog
898 TopExp_Explorer solid( theShape, TopAbs_SOLID );
899 for ( int i = 0; ( i < maxNbErrors && solid.More() ); ++i, solid.Next() )
900 if ( !meshedSolids.Contains( solid.Current() ))
902 SMESH_subMesh* sm = theMesh.GetSubMesh( solid.Current() );
903 sm->GetComputeError() = err;
908 return error( COMPERR_OK );
911 //================================================================================
913 * \brief Find wall faces by bottom edges
915 //================================================================================
917 bool StdMeshers_Prism_3D::getWallFaces( Prism_3D::TPrismTopo & thePrism,
918 const int totalNbFaces)
920 thePrism.myWallQuads.clear();
922 SMESH_Mesh* mesh = myHelper->GetMesh();
924 StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this, myHelper );
926 TopTools_MapOfShape faceMap;
927 TopTools_IndexedDataMapOfShapeListOfShape edgeToFaces;
928 TopExp::MapShapesAndAncestors( thePrism.myShape3D,
929 TopAbs_EDGE, TopAbs_FACE, edgeToFaces );
931 // ------------------------------
932 // Get the 1st row of wall FACEs
933 // ------------------------------
935 list< TopoDS_Edge >::iterator edge = thePrism.myBottomEdges.begin();
936 std::list< int >::iterator nbE = thePrism.myNbEdgesInWires.begin();
937 std::list< int > nbQuadsPerWire;
940 while ( edge != thePrism.myBottomEdges.end() )
943 if ( BRep_Tool::Curve( *edge, f,l ).IsNull() )
945 edge = thePrism.myBottomEdges.erase( edge );
951 TopTools_ListIteratorOfListOfShape faceIt( edgeToFaces.FindFromKey( *edge ));
952 for ( ; faceIt.More(); faceIt.Next() )
954 const TopoDS_Face& face = TopoDS::Face( faceIt.Value() );
955 if ( !thePrism.myBottom.IsSame( face ))
957 Prism_3D::TQuadList quadList( 1, quadAlgo->CheckNbEdges( *mesh, face ));
958 if ( !quadList.back() )
959 return toSM( error(TCom("Side face #") << shapeID( face )
960 << " not meshable with quadrangles"));
961 bool isCompositeBase = ! setBottomEdge( *edge, quadList.back(), face );
962 if ( isCompositeBase )
964 // it's OK if all EDGEs of the bottom side belongs to the bottom FACE
965 StdMeshers_FaceSidePtr botSide = quadList.back()->side[ QUAD_BOTTOM_SIDE ];
966 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
967 if ( !myHelper->IsSubShape( botSide->Edge(iE), thePrism.myBottom ))
968 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
970 if ( faceMap.Add( face ))
971 thePrism.myWallQuads.push_back( quadList );
981 int nbQuadPrev = std::accumulate( nbQuadsPerWire.begin(), nbQuadsPerWire.end(), 0 );
982 nbQuadsPerWire.push_back( thePrism.myWallQuads.size() - nbQuadPrev );
986 // -------------------------
987 // Find the rest wall FACEs
988 // -------------------------
990 // Compose a vector of indixes of right neighbour FACE for each wall FACE
991 // that is not so evident in case of several WIREs in the bottom FACE
992 thePrism.myRightQuadIndex.clear();
993 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
995 thePrism.myRightQuadIndex.push_back( i+1 ); // OK for all but the last EDGE of a WIRE
997 list< int >::iterator nbQinW = nbQuadsPerWire.begin();
998 for ( int iLeft = 0; nbQinW != nbQuadsPerWire.end(); ++nbQinW )
1000 thePrism.myRightQuadIndex[ iLeft + *nbQinW - 1 ] = iLeft; // for the last EDGE of a WIRE
1004 while ( totalNbFaces - faceMap.Extent() > 2 )
1006 // find wall FACEs adjacent to each of wallQuads by the right side EDGE
1009 nbKnownFaces = faceMap.Extent();
1010 StdMeshers_FaceSidePtr rightSide, topSide; // sides of the quad
1011 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1013 rightSide = thePrism.myWallQuads[i].back()->side[ QUAD_RIGHT_SIDE ];
1014 for ( int iE = 0; iE < rightSide->NbEdges(); ++iE ) // rightSide can be composite
1016 const TopoDS_Edge & rightE = rightSide->Edge( iE );
1017 TopTools_ListIteratorOfListOfShape face( edgeToFaces.FindFromKey( rightE ));
1018 for ( ; face.More(); face.Next() )
1019 if ( faceMap.Add( face.Value() ))
1021 // a new wall FACE encountered, store it in thePrism.myWallQuads
1022 const int iRight = thePrism.myRightQuadIndex[i];
1023 topSide = thePrism.myWallQuads[ iRight ].back()->side[ QUAD_TOP_SIDE ];
1024 const TopoDS_Edge& newBotE = topSide->Edge(0);
1025 const TopoDS_Shape& newWallF = face.Value();
1026 thePrism.myWallQuads[ iRight ].push_back( quadAlgo->CheckNbEdges( *mesh, newWallF ));
1027 if ( !thePrism.myWallQuads[ iRight ].back() )
1028 return toSM( error(TCom("Side face #") << shapeID( newWallF ) <<
1029 " not meshable with quadrangles"));
1030 if ( ! setBottomEdge( newBotE, thePrism.myWallQuads[ iRight ].back(), newWallF ))
1031 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1035 } while ( nbKnownFaces != faceMap.Extent() );
1037 // find wall FACEs adjacent to each of thePrism.myWallQuads by the top side EDGE
1038 if ( totalNbFaces - faceMap.Extent() > 2 )
1040 const int nbFoundWalls = faceMap.Extent();
1041 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1043 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1044 const TopoDS_Edge & topE = topSide->Edge( 0 );
1045 if ( topSide->NbEdges() > 1 )
1046 return toSM( error(COMPERR_BAD_SHAPE, TCom("Side face #") <<
1047 shapeID( thePrism.myWallQuads[i].back()->face )
1048 << " has a composite top edge"));
1049 TopTools_ListIteratorOfListOfShape faceIt( edgeToFaces.FindFromKey( topE ));
1050 for ( ; faceIt.More(); faceIt.Next() )
1051 if ( faceMap.Add( faceIt.Value() ))
1053 // a new wall FACE encountered, store it in wallQuads
1054 thePrism.myWallQuads[ i ].push_back( quadAlgo->CheckNbEdges( *mesh, faceIt.Value() ));
1055 if ( !thePrism.myWallQuads[ i ].back() )
1056 return toSM( error(TCom("Side face #") << shapeID( faceIt.Value() ) <<
1057 " not meshable with quadrangles"));
1058 if ( ! setBottomEdge( topE, thePrism.myWallQuads[ i ].back(), faceIt.Value() ))
1059 return toSM( error(TCom("Composite 'horizontal' edges are not supported")));
1060 if ( totalNbFaces - faceMap.Extent() == 2 )
1062 i = thePrism.myWallQuads.size(); // to quit from the outer loop
1067 if ( nbFoundWalls == faceMap.Extent() )
1068 return toSM( error("Failed to find wall faces"));
1071 } // while ( totalNbFaces - faceMap.Extent() > 2 )
1073 // ------------------
1074 // Find the top FACE
1075 // ------------------
1077 if ( thePrism.myTop.IsNull() )
1079 // now only top and bottom FACEs are not in the faceMap
1080 faceMap.Add( thePrism.myBottom );
1081 for ( TopExp_Explorer f( thePrism.myShape3D, TopAbs_FACE ); f.More(); f.Next() )
1082 if ( !faceMap.Contains( f.Current() )) {
1083 thePrism.myTop = TopoDS::Face( f.Current() );
1086 if ( thePrism.myTop.IsNull() )
1087 return toSM( error("Top face not found"));
1090 // Check that the top FACE shares all the top EDGEs
1091 for ( size_t i = 0; i < thePrism.myWallQuads.size(); ++i )
1093 StdMeshers_FaceSidePtr topSide = thePrism.myWallQuads[i].back()->side[ QUAD_TOP_SIDE ];
1094 const TopoDS_Edge & topE = topSide->Edge( 0 );
1095 if ( !myHelper->IsSubShape( topE, thePrism.myTop ))
1096 return toSM( error( TCom("Wrong source face: #") << shapeID( thePrism.myBottom )));
1102 //=======================================================================
1103 //function : compute
1104 //purpose : Compute mesh on a SOLID
1105 //=======================================================================
1107 bool StdMeshers_Prism_3D::compute(const Prism_3D::TPrismTopo& thePrism)
1109 myHelper->IsQuadraticSubMesh( thePrism.myShape3D );
1110 if ( _computeCanceled )
1111 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
1113 // Assure the bottom is meshed
1114 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
1115 if (( botSM->IsEmpty() ) &&
1116 ( ! botSM->GetAlgo() ||
1117 ! _gen->Compute( *botSM->GetFather(), botSM->GetSubShape(), /*shapeOnly=*/true )))
1118 return error( COMPERR_BAD_INPUT_MESH,
1119 TCom( "No mesher defined to compute the base face #")
1120 << shapeID( thePrism.myBottom ));
1122 // Make all side FACEs of thePrism meshed with quads
1123 if ( !computeWalls( thePrism ))
1126 // Analyse mesh and geometry to find all block sub-shapes and submeshes
1127 // (after fixing IPAL52499 myBlock is used as a holder of boundary nodes
1128 // and for 2D projection in hard cases where StdMeshers_Projection_2D fails;
1129 // location of internal nodes is usually computed by StdMeshers_Sweeper)
1130 if ( !myBlock.Init( myHelper, thePrism ))
1131 return toSM( error( myBlock.GetError()));
1133 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1135 int volumeID = meshDS->ShapeToIndex( thePrism.myShape3D );
1137 // Try to get gp_Trsf to get all nodes from bottom ones
1138 vector<gp_Trsf> trsf;
1139 gp_Trsf bottomToTopTrsf;
1140 // if ( !myBlock.GetLayersTransformation( trsf, thePrism ))
1142 // else if ( !trsf.empty() )
1143 // bottomToTopTrsf = trsf.back();
1145 // To compute coordinates of a node inside a block, it is necessary to know
1146 // 1. normalized parameters of the node by which
1147 // 2. coordinates of node projections on all block sub-shapes are computed
1149 // So we fill projections on vertices at once as they are same for all nodes
1150 myShapeXYZ.resize( myBlock.NbSubShapes() );
1151 for ( int iV = SMESH_Block::ID_FirstV; iV < SMESH_Block::ID_FirstE; ++iV ) {
1152 myBlock.VertexPoint( iV, myShapeXYZ[ iV ]);
1153 SHOWYXZ("V point " <<iV << " ", myShapeXYZ[ iV ]);
1156 // Projections on the top and bottom faces are taken from nodes existing
1157 // on these faces; find correspondence between bottom and top nodes
1159 myBotToColumnMap.clear();
1160 if ( !assocOrProjBottom2Top( bottomToTopTrsf, thePrism ) ) // it also fills myBotToColumnMap
1164 // Create nodes inside the block
1166 // use transformation (issue 0020680, IPAL0052499)
1167 StdMeshers_Sweeper sweeper;
1169 bool allowHighBndError;
1173 // load boundary nodes into sweeper
1175 list< TopoDS_Edge >::const_iterator edge = thePrism.myBottomEdges.begin();
1176 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
1178 int edgeID = meshDS->ShapeToIndex( *edge );
1179 TParam2ColumnMap* u2col = const_cast<TParam2ColumnMap*>
1180 ( myBlock.GetParam2ColumnMap( edgeID, dummy ));
1181 TParam2ColumnMap::iterator u2colIt = u2col->begin();
1182 for ( ; u2colIt != u2col->end(); ++u2colIt )
1183 sweeper.myBndColumns.push_back( & u2colIt->second );
1185 // load node columns inside the bottom face
1186 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1187 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1188 sweeper.myIntColumns.push_back( & bot_column->second );
1190 tol = getSweepTolerance( thePrism );
1191 allowHighBndError = !isSimpleBottom( thePrism );
1194 if ( !myUseBlock && sweeper.ComputeNodes( *myHelper, tol, allowHighBndError ))
1197 else // use block approach
1199 // loop on nodes inside the bottom face
1200 Prism_3D::TNode prevBNode;
1201 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.begin();
1202 for ( ; bot_column != myBotToColumnMap.end(); ++bot_column )
1204 const Prism_3D::TNode& tBotNode = bot_column->first; // bottom TNode
1205 if ( tBotNode.GetPositionType() != SMDS_TOP_FACE )
1206 continue; // node is not inside the FACE
1208 // column nodes; middle part of the column are zero pointers
1209 TNodeColumn& column = bot_column->second;
1211 gp_XYZ botParams, topParams;
1212 if ( !tBotNode.HasParams() )
1214 // compute bottom node parameters
1215 gp_XYZ paramHint(-1,-1,-1);
1216 if ( prevBNode.IsNeighbor( tBotNode ))
1217 paramHint = prevBNode.GetParams();
1218 if ( !myBlock.ComputeParameters( tBotNode.GetCoords(), tBotNode.ChangeParams(),
1219 ID_BOT_FACE, paramHint ))
1220 return toSM( error(TCom("Can't compute normalized parameters for node ")
1221 << tBotNode.myNode->GetID() << " on the face #"
1222 << myBlock.SubMesh( ID_BOT_FACE )->GetId() ));
1223 prevBNode = tBotNode;
1225 botParams = topParams = tBotNode.GetParams();
1226 topParams.SetZ( 1 );
1228 // compute top node parameters
1229 if ( column.size() > 2 ) {
1230 gp_Pnt topCoords = gpXYZ( column.back() );
1231 if ( !myBlock.ComputeParameters( topCoords, topParams, ID_TOP_FACE, topParams ))
1232 return toSM( error(TCom("Can't compute normalized parameters ")
1233 << "for node " << column.back()->GetID()
1234 << " on the face #"<< column.back()->getshapeId() ));
1237 else // top nodes are created by projection using parameters
1239 botParams = topParams = tBotNode.GetParams();
1240 topParams.SetZ( 1 );
1243 myShapeXYZ[ ID_BOT_FACE ] = tBotNode.GetCoords();
1244 myShapeXYZ[ ID_TOP_FACE ] = gpXYZ( column.back() );
1247 TNodeColumn::iterator columnNodes = column.begin();
1248 for ( int z = 0; columnNodes != column.end(); ++columnNodes, ++z)
1250 const SMDS_MeshNode* & node = *columnNodes;
1251 if ( node ) continue; // skip bottom or top node
1253 // params of a node to create
1254 double rz = (double) z / (double) ( column.size() - 1 );
1255 gp_XYZ params = botParams * ( 1 - rz ) + topParams * rz;
1257 // set coords on all faces and nodes
1258 const int nbSideFaces = 4;
1259 int sideFaceIDs[nbSideFaces] = { SMESH_Block::ID_Fx0z,
1260 SMESH_Block::ID_Fx1z,
1261 SMESH_Block::ID_F0yz,
1262 SMESH_Block::ID_F1yz };
1263 for ( int iF = 0; iF < nbSideFaces; ++iF )
1264 if ( !setFaceAndEdgesXYZ( sideFaceIDs[ iF ], params, z ))
1267 // compute coords for a new node
1269 if ( !SMESH_Block::ShellPoint( params, myShapeXYZ, coords ))
1270 return toSM( error("Can't compute coordinates by normalized parameters"));
1272 // if ( !meshDS->MeshElements( volumeID ) ||
1273 // meshDS->MeshElements( volumeID )->NbNodes() == 0 )
1274 // pointsToPython(myShapeXYZ);
1275 SHOWYXZ("TOPFacePoint ",myShapeXYZ[ ID_TOP_FACE]);
1276 SHOWYXZ("BOT Node "<< tBotNode.myNode->GetID(),gpXYZ(tBotNode.myNode));
1277 SHOWYXZ("ShellPoint ",coords);
1280 node = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
1281 meshDS->SetNodeInVolume( node, volumeID );
1283 if ( _computeCanceled )
1286 } // loop on bottom nodes
1291 SMESHDS_SubMesh* smDS = myBlock.SubMeshDS( ID_BOT_FACE );
1292 if ( !smDS ) return toSM( error(COMPERR_BAD_INPUT_MESH, "Null submesh"));
1294 // loop on bottom mesh faces
1295 vector< const TNodeColumn* > columns;
1296 SMDS_ElemIteratorPtr faceIt = smDS->GetElements();
1297 while ( faceIt->more() )
1299 const SMDS_MeshElement* face = faceIt->next();
1300 if ( !face || face->GetType() != SMDSAbs_Face )
1303 // find node columns for each node
1304 int nbNodes = face->NbCornerNodes();
1305 columns.resize( nbNodes );
1306 for ( int i = 0; i < nbNodes; ++i )
1308 const SMDS_MeshNode* n = face->GetNode( i );
1309 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) {
1310 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
1311 if ( bot_column == myBotToColumnMap.end() )
1312 return toSM( error(TCom("No nodes found above node ") << n->GetID() ));
1313 columns[ i ] = & bot_column->second;
1316 columns[ i ] = myBlock.GetNodeColumn( n );
1317 if ( !columns[ i ] )
1318 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
1322 if ( !AddPrisms( columns, myHelper ))
1323 return toSM( error("Different 'vertical' discretization"));
1325 } // loop on bottom mesh faces
1328 myBotToColumnMap.clear();
1331 // update state of sub-meshes (mostly in order to erase improper errors)
1332 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( thePrism.myShape3D );
1333 SMESH_subMeshIteratorPtr smIt = sm->getDependsOnIterator(/*includeSelf=*/true);
1334 while ( smIt->more() )
1337 sm->GetComputeError().reset();
1338 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1344 //=======================================================================
1345 //function : computeWalls
1346 //purpose : Compute 2D mesh on walls FACEs of a prism
1347 //=======================================================================
1349 bool StdMeshers_Prism_3D::computeWalls(const Prism_3D::TPrismTopo& thePrism)
1351 SMESH_Mesh* mesh = myHelper->GetMesh();
1352 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
1353 DBGOUT( endl << "COMPUTE Prism " << meshDS->ShapeToIndex( thePrism.myShape3D ));
1355 TProjction1dAlgo* projector1D = TProjction1dAlgo::instance( this );
1356 StdMeshers_Quadrangle_2D* quadAlgo = TQuadrangleAlgo::instance( this, myHelper );
1358 // SMESH_HypoFilter hyp1dFilter( SMESH_HypoFilter::IsAlgo(),/*not=*/true);
1359 // hyp1dFilter.And( SMESH_HypoFilter::HasDim( 1 ));
1360 // hyp1dFilter.And( SMESH_HypoFilter::IsMoreLocalThan( thePrism.myShape3D, *mesh ));
1362 // Discretize equally 'vertical' EDGEs
1363 // -----------------------------------
1364 // find source FACE sides for projection: either already computed ones or
1365 // the 'most composite' ones
1366 const size_t nbWalls = thePrism.myWallQuads.size();
1367 vector< int > wgt( nbWalls, 0 ); // "weight" of a wall
1368 for ( size_t iW = 0; iW != nbWalls; ++iW )
1370 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1371 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1373 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ];
1374 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1377 const TopoDS_Edge& E = lftSide->Edge(i);
1378 if ( mesh->GetSubMesh( E )->IsMeshComputed() )
1381 wgt[ myHelper->WrapIndex( iW+1, nbWalls)] += 10;
1382 wgt[ myHelper->WrapIndex( iW-1, nbWalls)] += 10;
1384 // else if ( mesh->GetHypothesis( E, hyp1dFilter, true )) // local hypothesis!
1388 // in quadratic mesh, pass ignoreMediumNodes to quad sides
1389 if ( myHelper->GetIsQuadratic() )
1391 quad = thePrism.myWallQuads[iW].begin();
1392 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1393 for ( int i = 0; i < NB_QUAD_SIDES; ++i )
1394 (*quad)->side[ i ].grid->SetIgnoreMediumNodes( true );
1397 multimap< int, int > wgt2quad;
1398 for ( size_t iW = 0; iW != nbWalls; ++iW )
1399 wgt2quad.insert( make_pair( wgt[ iW ], iW ));
1401 // Project 'vertical' EDGEs, from left to right
1402 multimap< int, int >::reverse_iterator w2q = wgt2quad.rbegin();
1403 for ( ; w2q != wgt2quad.rend(); ++w2q )
1405 const int iW = w2q->second;
1406 const Prism_3D::TQuadList& quads = thePrism.myWallQuads[ iW ];
1407 Prism_3D::TQuadList::const_iterator quad = quads.begin();
1408 for ( ; quad != quads.end(); ++quad )
1410 StdMeshers_FaceSidePtr rgtSide = (*quad)->side[ QUAD_RIGHT_SIDE ]; // tgt
1411 StdMeshers_FaceSidePtr lftSide = (*quad)->side[ QUAD_LEFT_SIDE ]; // src
1412 bool swapLeftRight = ( lftSide->NbSegments( /*update=*/true ) == 0 &&
1413 rgtSide->NbSegments( /*update=*/true ) > 0 );
1414 if ( swapLeftRight )
1415 std::swap( lftSide, rgtSide );
1417 // assure that all the source (left) EDGEs are meshed
1418 int nbSrcSegments = 0;
1419 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1421 const TopoDS_Edge& srcE = lftSide->Edge(i);
1422 SMESH_subMesh* srcSM = mesh->GetSubMesh( srcE );
1423 if ( !srcSM->IsMeshComputed() ) {
1424 DBGOUT( "COMPUTE V edge " << srcSM->GetId() );
1425 TopoDS_Edge prpgSrcE = findPropagationSource( srcE );
1426 if ( !prpgSrcE.IsNull() ) {
1427 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1428 projector1D->myHyp.SetSourceEdge( prpgSrcE );
1429 projector1D->Compute( *mesh, srcE );
1430 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1433 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1434 srcSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1436 if ( !srcSM->IsMeshComputed() )
1437 return toSM( error( "Can't compute 1D mesh" ));
1439 nbSrcSegments += srcSM->GetSubMeshDS()->NbElements();
1441 // check target EDGEs
1442 int nbTgtMeshed = 0, nbTgtSegments = 0;
1443 vector< bool > isTgtEdgeComputed( rgtSide->NbEdges() );
1444 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1446 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1447 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1448 if ( !( isTgtEdgeComputed[ i ] = tgtSM->IsMeshComputed() )) {
1449 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1450 tgtSM->ComputeStateEngine ( SMESH_subMesh::COMPUTE );
1452 if ( tgtSM->IsMeshComputed() ) {
1454 nbTgtSegments += tgtSM->GetSubMeshDS()->NbElements();
1457 if ( rgtSide->NbEdges() == nbTgtMeshed ) // all tgt EDGEs meshed
1459 if ( nbTgtSegments != nbSrcSegments )
1461 bool badMeshRemoved = false;
1462 // remove just computed segments
1463 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1464 if ( !isTgtEdgeComputed[ i ])
1466 const TopoDS_Edge& tgtE = rgtSide->Edge(i);
1467 SMESH_subMesh* tgtSM = mesh->GetSubMesh( tgtE );
1468 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1469 badMeshRemoved = true;
1472 if ( !badMeshRemoved )
1474 for ( int i = 0; i < lftSide->NbEdges(); ++i )
1475 addBadInputElements( meshDS->MeshElements( lftSide->Edge( i )));
1476 for ( int i = 0; i < rgtSide->NbEdges(); ++i )
1477 addBadInputElements( meshDS->MeshElements( rgtSide->Edge( i )));
1478 return toSM( error( TCom("Different nb of segment on logically vertical edges #")
1479 << shapeID( lftSide->Edge(0) ) << " and #"
1480 << shapeID( rgtSide->Edge(0) ) << ": "
1481 << nbSrcSegments << " != " << nbTgtSegments ));
1484 else // if ( nbTgtSegments == nbSrcSegments )
1489 // Compute 'vertical projection'
1490 if ( nbTgtMeshed == 0 )
1492 // compute nodes on target VERTEXes
1493 const UVPtStructVec& srcNodeStr = lftSide->GetUVPtStruct();
1494 if ( srcNodeStr.size() == 0 )
1495 return toSM( error( TCom("Invalid node positions on edge #") <<
1496 shapeID( lftSide->Edge(0) )));
1497 vector< SMDS_MeshNode* > newNodes( srcNodeStr.size() );
1498 for ( int is2ndV = 0; is2ndV < 2; ++is2ndV )
1500 const TopoDS_Edge& E = rgtSide->Edge( is2ndV ? rgtSide->NbEdges()-1 : 0 );
1501 TopoDS_Vertex v = myHelper->IthVertex( is2ndV, E );
1502 mesh->GetSubMesh( v )->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1503 const SMDS_MeshNode* n = SMESH_Algo::VertexNode( v, meshDS );
1504 newNodes[ is2ndV ? 0 : newNodes.size()-1 ] = (SMDS_MeshNode*) n;
1507 // compute nodes on target EDGEs
1508 DBGOUT( "COMPUTE V edge (proj) " << shapeID( lftSide->Edge(0)));
1509 rgtSide->Reverse(); // direct it same as the lftSide
1510 myHelper->SetElementsOnShape( false ); // myHelper holds the prism shape
1511 TopoDS_Edge tgtEdge;
1512 for ( size_t iN = 1; iN < srcNodeStr.size()-1; ++iN ) // add nodes
1514 gp_Pnt p = rgtSide->Value3d ( srcNodeStr[ iN ].normParam );
1515 double u = rgtSide->Parameter( srcNodeStr[ iN ].normParam, tgtEdge );
1516 newNodes[ iN ] = meshDS->AddNode( p.X(), p.Y(), p.Z() );
1517 meshDS->SetNodeOnEdge( newNodes[ iN ], tgtEdge, u );
1519 for ( size_t iN = 1; iN < srcNodeStr.size(); ++iN ) // add segments
1521 // find an EDGE to set a new segment
1522 std::pair<int, TopAbs_ShapeEnum> id2type =
1523 myHelper->GetMediumPos( newNodes[ iN-1 ], newNodes[ iN ] );
1524 if ( id2type.second != TopAbs_EDGE )
1526 // new nodes are on different EDGEs; put one of them on VERTEX
1527 const int edgeIndex = rgtSide->EdgeIndex( srcNodeStr[ iN-1 ].normParam );
1528 const double vertexParam = rgtSide->LastParameter( edgeIndex );
1529 TopoDS_Vertex vertex = rgtSide->LastVertex( edgeIndex );
1530 const SMDS_MeshNode* vn = SMESH_Algo::VertexNode( vertex, meshDS );
1531 const gp_Pnt p = BRep_Tool::Pnt( vertex );
1532 const int isPrev = ( Abs( srcNodeStr[ iN-1 ].normParam - vertexParam ) <
1533 Abs( srcNodeStr[ iN ].normParam - vertexParam ));
1534 meshDS->UnSetNodeOnShape( newNodes[ iN-isPrev ] );
1535 meshDS->SetNodeOnVertex ( newNodes[ iN-isPrev ], vertex );
1536 meshDS->MoveNode ( newNodes[ iN-isPrev ], p.X(), p.Y(), p.Z() );
1537 id2type.first = newNodes[ iN-(1-isPrev) ]->getshapeId();
1540 SMESH_MeshEditor::TListOfListOfNodes lln( 1, list< const SMDS_MeshNode* >() );
1541 lln.back().push_back ( vn );
1542 lln.back().push_front( newNodes[ iN-isPrev ] ); // to keep
1543 SMESH_MeshEditor( mesh ).MergeNodes( lln );
1546 SMDS_MeshElement* newEdge = myHelper->AddEdge( newNodes[ iN-1 ], newNodes[ iN ] );
1547 meshDS->SetMeshElementOnShape( newEdge, id2type.first );
1549 myHelper->SetElementsOnShape( true );
1550 for ( int i = 0; i < rgtSide->NbEdges(); ++i ) // update state of sub-meshes
1552 const TopoDS_Edge& E = rgtSide->Edge( i );
1553 SMESH_subMesh* tgtSM = mesh->GetSubMesh( E );
1554 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1557 // to continue projection from the just computed side as a source
1558 if ( !swapLeftRight && rgtSide->NbEdges() > 1 && w2q->second == iW )
1560 std::pair<int,int> wgt2quadKeyVal( w2q->first + 1, thePrism.myRightQuadIndex[ iW ]);
1561 wgt2quad.insert( wgt2quadKeyVal ); // it will be skipped by ++w2q
1562 wgt2quad.insert( wgt2quadKeyVal );
1563 w2q = wgt2quad.rbegin();
1568 // HOPE assigned hypotheses are OK, so that equal nb of segments will be generated
1569 //return toSM( error("Partial projection not implemented"));
1571 } // loop on quads of a composite wall side
1572 } // loop on the ordered wall sides
1576 for ( size_t iW = 0; iW != thePrism.myWallQuads.size(); ++iW )
1578 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[iW].begin();
1579 for ( ; quad != thePrism.myWallQuads[iW].end(); ++quad )
1581 const TopoDS_Face& face = (*quad)->face;
1582 SMESH_subMesh* fSM = mesh->GetSubMesh( face );
1583 if ( ! fSM->IsMeshComputed() )
1585 // Top EDGEs must be projections from the bottom ones
1586 // to compute stuctured quad mesh on wall FACEs
1587 // ---------------------------------------------------
1588 const TopoDS_Edge& botE = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0);
1589 const TopoDS_Edge& topE = (*quad)->side[ QUAD_TOP_SIDE ].grid->Edge(0);
1590 SMESH_subMesh* botSM = mesh->GetSubMesh( botE );
1591 SMESH_subMesh* topSM = mesh->GetSubMesh( topE );
1592 SMESH_subMesh* srcSM = botSM;
1593 SMESH_subMesh* tgtSM = topSM;
1594 srcSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1595 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1596 if ( !srcSM->IsMeshComputed() && tgtSM->IsMeshComputed() )
1597 std::swap( srcSM, tgtSM );
1599 if ( !srcSM->IsMeshComputed() )
1601 DBGOUT( "COMPUTE H edge " << srcSM->GetId());
1602 srcSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE ); // nodes on VERTEXes
1603 srcSM->ComputeStateEngine( SMESH_subMesh::COMPUTE ); // segments on the EDGE
1606 if ( tgtSM->IsMeshComputed() &&
1607 tgtSM->GetSubMeshDS()->NbNodes() != srcSM->GetSubMeshDS()->NbNodes() )
1609 // the top EDGE is computed differently than the bottom one,
1610 // try to clear a wrong mesh
1611 bool isAdjFaceMeshed = false;
1612 PShapeIteratorPtr fIt = myHelper->GetAncestors( tgtSM->GetSubShape(),
1613 *mesh, TopAbs_FACE );
1614 while ( const TopoDS_Shape* f = fIt->next() )
1615 if (( isAdjFaceMeshed = mesh->GetSubMesh( *f )->IsMeshComputed() ))
1617 if ( isAdjFaceMeshed )
1618 return toSM( error( TCom("Different nb of segment on logically horizontal edges #")
1619 << shapeID( botE ) << " and #"
1620 << shapeID( topE ) << ": "
1621 << tgtSM->GetSubMeshDS()->NbElements() << " != "
1622 << srcSM->GetSubMeshDS()->NbElements() ));
1623 tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN );
1625 if ( !tgtSM->IsMeshComputed() )
1627 // compute nodes on VERTEXes
1628 SMESH_subMeshIteratorPtr smIt = tgtSM->getDependsOnIterator(/*includeSelf=*/false);
1629 while ( smIt->more() )
1630 smIt->next()->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1632 DBGOUT( "COMPUTE H edge (proj) " << tgtSM->GetId());
1633 projector1D->myHyp.SetSourceEdge( TopoDS::Edge( srcSM->GetSubShape() ));
1634 projector1D->InitComputeError();
1635 bool ok = projector1D->Compute( *mesh, tgtSM->GetSubShape() );
1638 SMESH_ComputeErrorPtr err = projector1D->GetComputeError();
1639 if ( err->IsOK() ) err->myName = COMPERR_ALGO_FAILED;
1640 tgtSM->GetComputeError() = err;
1644 tgtSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1647 // Compute quad mesh on wall FACEs
1648 // -------------------------------
1650 // make all EDGES meshed
1651 fSM->ComputeSubMeshStateEngine( SMESH_subMesh::COMPUTE );
1652 if ( !fSM->SubMeshesComputed() )
1653 return toSM( error( COMPERR_BAD_INPUT_MESH,
1654 "Not all edges have valid algorithm and hypothesis"));
1656 quadAlgo->InitComputeError();
1657 DBGOUT( "COMPUTE Quad face " << fSM->GetId());
1658 bool ok = quadAlgo->Compute( *mesh, face );
1659 fSM->GetComputeError() = quadAlgo->GetComputeError();
1662 fSM->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
1664 if ( myHelper->GetIsQuadratic() )
1666 // fill myHelper with medium nodes built by quadAlgo
1667 SMDS_ElemIteratorPtr fIt = fSM->GetSubMeshDS()->GetElements();
1668 while ( fIt->more() )
1669 myHelper->AddTLinks( dynamic_cast<const SMDS_MeshFace*>( fIt->next() ));
1677 //=======================================================================
1679 * \brief Returns a source EDGE of propagation to a given EDGE
1681 //=======================================================================
1683 TopoDS_Edge StdMeshers_Prism_3D::findPropagationSource( const TopoDS_Edge& E )
1685 if ( myPropagChains )
1686 for ( size_t i = 0; !myPropagChains[i].IsEmpty(); ++i )
1687 if ( myPropagChains[i].Contains( E ))
1688 return TopoDS::Edge( myPropagChains[i].FindKey( 1 ));
1690 return TopoDS_Edge();
1693 //=======================================================================
1694 //function : Evaluate
1696 //=======================================================================
1698 bool StdMeshers_Prism_3D::Evaluate(SMESH_Mesh& theMesh,
1699 const TopoDS_Shape& theShape,
1700 MapShapeNbElems& aResMap)
1702 if ( theShape.ShapeType() == TopAbs_COMPOUND )
1705 for ( TopoDS_Iterator it( theShape ); it.More(); it.Next() )
1706 ok &= Evaluate( theMesh, it.Value(), aResMap );
1709 SMESH_MesherHelper helper( theMesh );
1711 myHelper->SetSubShape( theShape );
1713 // find face contains only triangles
1714 vector < SMESH_subMesh * >meshFaces;
1715 TopTools_SequenceOfShape aFaces;
1716 int NumBase = 0, i = 0, NbQFs = 0;
1717 for (TopExp_Explorer exp(theShape, TopAbs_FACE); exp.More(); exp.Next()) {
1719 aFaces.Append(exp.Current());
1720 SMESH_subMesh *aSubMesh = theMesh.GetSubMesh(exp.Current());
1721 meshFaces.push_back(aSubMesh);
1722 MapShapeNbElemsItr anIt = aResMap.find(meshFaces[i-1]);
1723 if( anIt==aResMap.end() )
1724 return toSM( error( "Submesh can not be evaluated"));
1726 std::vector<int> aVec = (*anIt).second;
1727 int nbtri = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1728 int nbqua = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1729 if( nbtri==0 && nbqua>0 ) {
1738 std::vector<int> aResVec(SMDSEntity_Last);
1739 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1740 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1741 aResMap.insert(std::make_pair(sm,aResVec));
1742 return toSM( error( "Submesh can not be evaluated" ));
1745 if(NumBase==0) NumBase = 1; // only quads => set 1 faces as base
1747 // find number of 1d elems for base face
1749 TopTools_MapOfShape Edges1;
1750 for (TopExp_Explorer exp(aFaces.Value(NumBase), TopAbs_EDGE); exp.More(); exp.Next()) {
1751 Edges1.Add(exp.Current());
1752 SMESH_subMesh *sm = theMesh.GetSubMesh(exp.Current());
1754 MapShapeNbElemsItr anIt = aResMap.find(sm);
1755 if( anIt == aResMap.end() ) continue;
1756 std::vector<int> aVec = (*anIt).second;
1757 nb1d += Max(aVec[SMDSEntity_Edge],aVec[SMDSEntity_Quad_Edge]);
1760 // find face opposite to base face
1762 for(i=1; i<=6; i++) {
1763 if(i==NumBase) continue;
1764 bool IsOpposite = true;
1765 for(TopExp_Explorer exp(aFaces.Value(i), TopAbs_EDGE); exp.More(); exp.Next()) {
1766 if( Edges1.Contains(exp.Current()) ) {
1776 // find number of 2d elems on side faces
1778 for(i=1; i<=6; i++) {
1779 if( i==OppNum || i==NumBase ) continue;
1780 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[i-1] );
1781 if( anIt == aResMap.end() ) continue;
1782 std::vector<int> aVec = (*anIt).second;
1783 nb2d += Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1786 MapShapeNbElemsItr anIt = aResMap.find( meshFaces[NumBase-1] );
1787 std::vector<int> aVec = (*anIt).second;
1788 bool IsQuadratic = (aVec[SMDSEntity_Quad_Triangle]>aVec[SMDSEntity_Triangle]) ||
1789 (aVec[SMDSEntity_Quad_Quadrangle]>aVec[SMDSEntity_Quadrangle]);
1790 int nb2d_face0_3 = Max(aVec[SMDSEntity_Triangle],aVec[SMDSEntity_Quad_Triangle]);
1791 int nb2d_face0_4 = Max(aVec[SMDSEntity_Quadrangle],aVec[SMDSEntity_Quad_Quadrangle]);
1792 int nb0d_face0 = aVec[SMDSEntity_Node];
1793 int nb1d_face0_int = ( nb2d_face0_3*3 + nb2d_face0_4*4 - nb1d ) / 2;
1795 std::vector<int> aResVec(SMDSEntity_Last);
1796 for(int i=SMDSEntity_Node; i<SMDSEntity_Last; i++) aResVec[i] = 0;
1798 aResVec[SMDSEntity_Quad_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
1799 aResVec[SMDSEntity_Quad_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
1800 aResVec[SMDSEntity_Node] = nb0d_face0 * ( 2*nb2d/nb1d - 1 ) - nb1d_face0_int * nb2d/nb1d;
1803 aResVec[SMDSEntity_Node] = nb0d_face0 * ( nb2d/nb1d - 1 );
1804 aResVec[SMDSEntity_Penta] = nb2d_face0_3 * ( nb2d/nb1d );
1805 aResVec[SMDSEntity_Hexa] = nb2d_face0_4 * ( nb2d/nb1d );
1807 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1808 aResMap.insert(std::make_pair(sm,aResVec));
1813 //================================================================================
1815 * \brief Create prisms
1816 * \param columns - columns of nodes generated from nodes of a mesh face
1817 * \param helper - helper initialized by mesh and shape to add prisms to
1819 //================================================================================
1821 bool StdMeshers_Prism_3D::AddPrisms( vector<const TNodeColumn*> & columns,
1822 SMESH_MesherHelper* helper)
1824 size_t nbNodes = columns.size();
1825 size_t nbZ = columns[0]->size();
1826 if ( nbZ < 2 ) return false;
1827 for ( size_t i = 1; i < nbNodes; ++i )
1828 if ( columns[i]->size() != nbZ )
1831 // find out orientation
1832 bool isForward = true;
1833 SMDS_VolumeTool vTool;
1835 switch ( nbNodes ) {
1837 SMDS_VolumeOfNodes tmpPenta ( (*columns[0])[z-1], // bottom
1840 (*columns[0])[z], // top
1843 vTool.Set( &tmpPenta );
1844 isForward = vTool.IsForward();
1848 SMDS_VolumeOfNodes tmpHex( (*columns[0])[z-1], (*columns[1])[z-1], // bottom
1849 (*columns[2])[z-1], (*columns[3])[z-1],
1850 (*columns[0])[z], (*columns[1])[z], // top
1851 (*columns[2])[z], (*columns[3])[z] );
1852 vTool.Set( &tmpHex );
1853 isForward = vTool.IsForward();
1857 const int di = (nbNodes+1) / 3;
1858 SMDS_VolumeOfNodes tmpVol ( (*columns[0] )[z-1],
1859 (*columns[di] )[z-1],
1860 (*columns[2*di])[z-1],
1863 (*columns[2*di])[z] );
1864 vTool.Set( &tmpVol );
1865 isForward = vTool.IsForward();
1868 // vertical loop on columns
1870 helper->SetElementsOnShape( true );
1872 switch ( nbNodes ) {
1874 case 3: { // ---------- pentahedra
1875 const int i1 = isForward ? 1 : 2;
1876 const int i2 = isForward ? 2 : 1;
1877 for ( z = 1; z < nbZ; ++z )
1878 helper->AddVolume( (*columns[0 ])[z-1], // bottom
1879 (*columns[i1])[z-1],
1880 (*columns[i2])[z-1],
1881 (*columns[0 ])[z], // top
1883 (*columns[i2])[z] );
1886 case 4: { // ---------- hexahedra
1887 const int i1 = isForward ? 1 : 3;
1888 const int i3 = isForward ? 3 : 1;
1889 for ( z = 1; z < nbZ; ++z )
1890 helper->AddVolume( (*columns[0])[z-1], (*columns[i1])[z-1], // bottom
1891 (*columns[2])[z-1], (*columns[i3])[z-1],
1892 (*columns[0])[z], (*columns[i1])[z], // top
1893 (*columns[2])[z], (*columns[i3])[z] );
1896 case 6: { // ---------- octahedra
1897 const int iBase1 = isForward ? -1 : 0;
1898 const int iBase2 = isForward ? 0 :-1;
1899 for ( z = 1; z < nbZ; ++z )
1900 helper->AddVolume( (*columns[0])[z+iBase1], (*columns[1])[z+iBase1], // bottom or top
1901 (*columns[2])[z+iBase1], (*columns[3])[z+iBase1],
1902 (*columns[4])[z+iBase1], (*columns[5])[z+iBase1],
1903 (*columns[0])[z+iBase2], (*columns[1])[z+iBase2], // top or bottom
1904 (*columns[2])[z+iBase2], (*columns[3])[z+iBase2],
1905 (*columns[4])[z+iBase2], (*columns[5])[z+iBase2] );
1908 default: // ---------- polyhedra
1909 vector<int> quantities( 2 + nbNodes, 4 );
1910 quantities[0] = quantities[1] = nbNodes;
1911 columns.resize( nbNodes + 1 );
1912 columns[ nbNodes ] = columns[ 0 ];
1913 const int i1 = isForward ? 1 : 3;
1914 const int i3 = isForward ? 3 : 1;
1915 const int iBase1 = isForward ? -1 : 0;
1916 const int iBase2 = isForward ? 0 :-1;
1917 vector<const SMDS_MeshNode*> nodes( 2*nbNodes + 4*nbNodes);
1918 for ( z = 1; z < nbZ; ++z )
1920 for ( size_t i = 0; i < nbNodes; ++i ) {
1921 nodes[ i ] = (*columns[ i ])[z+iBase1]; // bottom or top
1922 nodes[ 2*nbNodes-i-1 ] = (*columns[ i ])[z+iBase2]; // top or bottom
1924 int di = 2*nbNodes + 4*i;
1925 nodes[ di+0 ] = (*columns[i ])[z ];
1926 nodes[ di+i1] = (*columns[i+1])[z ];
1927 nodes[ di+2 ] = (*columns[i+1])[z-1];
1928 nodes[ di+i3] = (*columns[i ])[z-1];
1930 helper->AddPolyhedralVolume( nodes, quantities );
1933 } // switch ( nbNodes )
1938 //================================================================================
1940 * \brief Find correspondence between bottom and top nodes
1941 * If elements on the bottom and top faces are topologically different,
1942 * and projection is possible and allowed, perform the projection
1943 * \retval bool - is a success or not
1945 //================================================================================
1947 bool StdMeshers_Prism_3D::assocOrProjBottom2Top( const gp_Trsf & bottomToTopTrsf,
1948 const Prism_3D::TPrismTopo& thePrism)
1950 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
1951 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
1953 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
1954 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
1956 if ( !botSMDS || botSMDS->NbElements() == 0 )
1958 _gen->Compute( *myHelper->GetMesh(), botSM->GetSubShape(), /*aShapeOnly=*/true );
1959 botSMDS = botSM->GetSubMeshDS();
1960 if ( !botSMDS || botSMDS->NbElements() == 0 )
1961 return toSM( error(TCom("No elements on face #") << botSM->GetId() ));
1964 bool needProject = !topSM->IsMeshComputed();
1965 if ( !needProject &&
1966 (botSMDS->NbElements() != topSMDS->NbElements() ||
1967 botSMDS->NbNodes() != topSMDS->NbNodes()))
1969 MESSAGE("nb elem bot " << botSMDS->NbElements() <<
1970 " top " << ( topSMDS ? topSMDS->NbElements() : 0 ));
1971 MESSAGE("nb node bot " << botSMDS->NbNodes() <<
1972 " top " << ( topSMDS ? topSMDS->NbNodes() : 0 ));
1973 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
1974 <<" and #"<< topSM->GetId() << " seems different" ));
1977 if ( 0/*needProject && !myProjectTriangles*/ )
1978 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
1979 <<" and #"<< topSM->GetId() << " seems different" ));
1980 ///RETURN_BAD_RESULT("Need to project but not allowed");
1982 NSProjUtils::TNodeNodeMap n2nMap;
1983 const NSProjUtils::TNodeNodeMap* n2nMapPtr = & n2nMap;
1986 if ( !projectBottomToTop( bottomToTopTrsf, thePrism ))
1988 n2nMapPtr = & TProjction2dAlgo::instance( this )->GetNodesMap();
1991 if ( !n2nMapPtr || (int) n2nMapPtr->size() < botSMDS->NbNodes() )
1993 // associate top and bottom faces
1994 NSProjUtils::TShapeShapeMap shape2ShapeMap;
1995 const bool sameTopo =
1996 NSProjUtils::FindSubShapeAssociation( thePrism.myBottom, myHelper->GetMesh(),
1997 thePrism.myTop, myHelper->GetMesh(),
2000 for ( size_t iQ = 0; iQ < thePrism.myWallQuads.size(); ++iQ )
2002 const Prism_3D::TQuadList& quadList = thePrism.myWallQuads[iQ];
2003 StdMeshers_FaceSidePtr botSide = quadList.front()->side[ QUAD_BOTTOM_SIDE ];
2004 StdMeshers_FaceSidePtr topSide = quadList.back ()->side[ QUAD_TOP_SIDE ];
2005 if ( botSide->NbEdges() == topSide->NbEdges() )
2007 for ( int iE = 0; iE < botSide->NbEdges(); ++iE )
2009 NSProjUtils::InsertAssociation( botSide->Edge( iE ),
2010 topSide->Edge( iE ), shape2ShapeMap );
2011 NSProjUtils::InsertAssociation( myHelper->IthVertex( 0, botSide->Edge( iE )),
2012 myHelper->IthVertex( 0, topSide->Edge( iE )),
2018 TopoDS_Vertex vb, vt;
2019 StdMeshers_FaceSidePtr sideB, sideT;
2020 vb = myHelper->IthVertex( 0, botSide->Edge( 0 ));
2021 vt = myHelper->IthVertex( 0, topSide->Edge( 0 ));
2022 sideB = quadList.front()->side[ QUAD_LEFT_SIDE ];
2023 sideT = quadList.back ()->side[ QUAD_LEFT_SIDE ];
2024 if ( vb.IsSame( sideB->FirstVertex() ) &&
2025 vt.IsSame( sideT->LastVertex() ))
2027 NSProjUtils::InsertAssociation( botSide->Edge( 0 ),
2028 topSide->Edge( 0 ), shape2ShapeMap );
2029 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2031 vb = myHelper->IthVertex( 1, botSide->Edge( botSide->NbEdges()-1 ));
2032 vt = myHelper->IthVertex( 1, topSide->Edge( topSide->NbEdges()-1 ));
2033 sideB = quadList.front()->side[ QUAD_RIGHT_SIDE ];
2034 sideT = quadList.back ()->side[ QUAD_RIGHT_SIDE ];
2035 if ( vb.IsSame( sideB->FirstVertex() ) &&
2036 vt.IsSame( sideT->LastVertex() ))
2038 NSProjUtils::InsertAssociation( botSide->Edge( botSide->NbEdges()-1 ),
2039 topSide->Edge( topSide->NbEdges()-1 ),
2041 NSProjUtils::InsertAssociation( vb, vt, shape2ShapeMap );
2046 // Find matching nodes of top and bottom faces
2047 n2nMapPtr = & n2nMap;
2048 if ( ! NSProjUtils::FindMatchingNodesOnFaces( thePrism.myBottom, myHelper->GetMesh(),
2049 thePrism.myTop, myHelper->GetMesh(),
2050 shape2ShapeMap, n2nMap ))
2053 return toSM( error(TCom("Mesh on faces #") << botSM->GetId()
2054 <<" and #"<< topSM->GetId() << " seems different" ));
2056 return toSM( error(TCom("Topology of faces #") << botSM->GetId()
2057 <<" and #"<< topSM->GetId() << " seems different" ));
2061 // Fill myBotToColumnMap
2063 int zSize = myBlock.VerticalSize();
2064 TNodeNodeMap::const_iterator bN_tN = n2nMapPtr->begin();
2065 for ( ; bN_tN != n2nMapPtr->end(); ++bN_tN )
2067 const SMDS_MeshNode* botNode = bN_tN->first;
2068 const SMDS_MeshNode* topNode = bN_tN->second;
2069 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
2070 continue; // wall columns are contained in myBlock
2071 // create node column
2072 Prism_3D::TNode bN( botNode );
2073 TNode2ColumnMap::iterator bN_col =
2074 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2075 TNodeColumn & column = bN_col->second;
2076 column.resize( zSize );
2077 column.front() = botNode;
2078 column.back() = topNode;
2083 //================================================================================
2085 * \brief Remove faces from the top face and re-create them by projection from the bottom
2086 * \retval bool - a success or not
2088 //================================================================================
2090 bool StdMeshers_Prism_3D::projectBottomToTop( const gp_Trsf & bottomToTopTrsf,
2091 const Prism_3D::TPrismTopo& thePrism )
2093 if ( project2dMesh( thePrism.myBottom, thePrism.myTop ))
2097 NSProjUtils::TNodeNodeMap& n2nMap =
2098 (NSProjUtils::TNodeNodeMap&) TProjction2dAlgo::instance( this )->GetNodesMap();
2103 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2104 SMESH_subMesh * botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
2105 SMESH_subMesh * topSM = myHelper->GetMesh()->GetSubMesh( thePrism.myTop );
2107 SMESHDS_SubMesh * botSMDS = botSM->GetSubMeshDS();
2108 SMESHDS_SubMesh * topSMDS = topSM->GetSubMeshDS();
2110 if ( topSMDS && topSMDS->NbElements() > 0 )
2112 //topSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2113 for ( SMDS_ElemIteratorPtr eIt = topSMDS->GetElements(); eIt->more(); )
2114 meshDS->RemoveFreeElement( eIt->next(), topSMDS, /*fromGroups=*/false );
2115 for ( SMDS_NodeIteratorPtr nIt = topSMDS->GetNodes(); nIt->more(); )
2116 meshDS->RemoveFreeNode( nIt->next(), topSMDS, /*fromGroups=*/false );
2119 const TopoDS_Face& botFace = thePrism.myBottom; // oriented within
2120 const TopoDS_Face& topFace = thePrism.myTop; // the 3D SHAPE
2121 int topFaceID = meshDS->ShapeToIndex( thePrism.myTop );
2123 SMESH_MesherHelper botHelper( *myHelper->GetMesh() );
2124 botHelper.SetSubShape( botFace );
2125 botHelper.ToFixNodeParameters( true );
2127 SMESH_MesherHelper topHelper( *myHelper->GetMesh() );
2128 topHelper.SetSubShape( topFace );
2129 topHelper.ToFixNodeParameters( true );
2130 double distXYZ[4], fixTol = 10 * topHelper.MaxTolerance( topFace );
2132 // Fill myBotToColumnMap
2134 int zSize = myBlock.VerticalSize();
2135 Prism_3D::TNode prevTNode;
2136 SMDS_NodeIteratorPtr nIt = botSMDS->GetNodes();
2137 while ( nIt->more() )
2139 const SMDS_MeshNode* botNode = nIt->next();
2140 const SMDS_MeshNode* topNode = 0;
2141 if ( botNode->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE )
2142 continue; // strange
2144 Prism_3D::TNode bN( botNode );
2145 if ( bottomToTopTrsf.Form() == gp_Identity )
2147 // compute bottom node params
2148 gp_XYZ paramHint(-1,-1,-1);
2149 if ( prevTNode.IsNeighbor( bN ))
2151 paramHint = prevTNode.GetParams();
2152 // double tol = 1e-2 * ( prevTNode.GetCoords() - bN.GetCoords() ).Modulus();
2153 // myBlock.SetTolerance( Min( myBlock.GetTolerance(), tol ));
2155 if ( !myBlock.ComputeParameters( bN.GetCoords(), bN.ChangeParams(),
2156 ID_BOT_FACE, paramHint ))
2157 return toSM( error(TCom("Can't compute normalized parameters for node ")
2158 << botNode->GetID() << " on the face #"<< botSM->GetId() ));
2160 // compute top node coords
2161 gp_XYZ topXYZ; gp_XY topUV;
2162 if ( !myBlock.FacePoint( ID_TOP_FACE, bN.GetParams(), topXYZ ) ||
2163 !myBlock.FaceUV ( ID_TOP_FACE, bN.GetParams(), topUV ))
2164 return toSM( error(TCom("Can't compute coordinates "
2165 "by normalized parameters on the face #")<< topSM->GetId() ));
2166 topNode = meshDS->AddNode( topXYZ.X(),topXYZ.Y(),topXYZ.Z() );
2167 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2169 else // use bottomToTopTrsf
2171 gp_XYZ coords = bN.GetCoords();
2172 bottomToTopTrsf.Transforms( coords );
2173 topNode = meshDS->AddNode( coords.X(), coords.Y(), coords.Z() );
2174 gp_XY topUV = botHelper.GetNodeUV( botFace, botNode, 0, &checkUV );
2175 meshDS->SetNodeOnFace( topNode, topFaceID, topUV.X(), topUV.Y() );
2177 if ( topHelper.CheckNodeUV( topFace, topNode, topUV, fixTol, /*force=*/false, distXYZ ) &&
2178 distXYZ[0] > fixTol && distXYZ[0] < fixTol * 1e+3 )
2179 meshDS->MoveNode( topNode, distXYZ[1], distXYZ[2], distXYZ[3] ); // transform can be inaccurate
2181 // create node column
2182 TNode2ColumnMap::iterator bN_col =
2183 myBotToColumnMap.insert( make_pair ( bN, TNodeColumn() )).first;
2184 TNodeColumn & column = bN_col->second;
2185 column.resize( zSize );
2186 column.front() = botNode;
2187 column.back() = topNode;
2189 n2nMap.insert( n2nMap.end(), make_pair( botNode, topNode ));
2191 if ( _computeCanceled )
2192 return toSM( error( SMESH_ComputeError::New(COMPERR_CANCELED)));
2197 const bool oldSetElemsOnShape = myHelper->SetElementsOnShape( false );
2199 // care of orientation;
2200 // if the bottom faces is orienetd OK then top faces must be reversed
2201 bool reverseTop = true;
2202 if ( myHelper->NbAncestors( botFace, *myBlock.Mesh(), TopAbs_SOLID ) > 1 )
2203 reverseTop = ! myHelper->IsReversedSubMesh( botFace );
2204 int iFrw, iRev, *iPtr = &( reverseTop ? iRev : iFrw );
2206 // loop on bottom mesh faces
2207 SMDS_ElemIteratorPtr faceIt = botSMDS->GetElements();
2208 vector< const SMDS_MeshNode* > nodes;
2209 while ( faceIt->more() )
2211 const SMDS_MeshElement* face = faceIt->next();
2212 if ( !face || face->GetType() != SMDSAbs_Face )
2215 // find top node in columns for each bottom node
2216 int nbNodes = face->NbCornerNodes();
2217 nodes.resize( nbNodes );
2218 for ( iFrw = 0, iRev = nbNodes-1; iFrw < nbNodes; ++iFrw, --iRev )
2220 const SMDS_MeshNode* n = face->GetNode( *iPtr );
2221 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) {
2222 TNode2ColumnMap::iterator bot_column = myBotToColumnMap.find( n );
2223 if ( bot_column == myBotToColumnMap.end() )
2224 return toSM( error(TCom("No nodes found above node ") << n->GetID() ));
2225 nodes[ iFrw ] = bot_column->second.back();
2228 const TNodeColumn* column = myBlock.GetNodeColumn( n );
2230 return toSM( error(TCom("No side nodes found above node ") << n->GetID() ));
2231 nodes[ iFrw ] = column->back();
2234 SMDS_MeshElement* newFace = 0;
2235 switch ( nbNodes ) {
2238 newFace = myHelper->AddFace(nodes[0], nodes[1], nodes[2]);
2242 newFace = myHelper->AddFace( nodes[0], nodes[1], nodes[2], nodes[3] );
2246 newFace = meshDS->AddPolygonalFace( nodes );
2249 meshDS->SetMeshElementOnShape( newFace, topFaceID );
2252 myHelper->SetElementsOnShape( oldSetElemsOnShape );
2254 // Check the projected mesh
2256 if ( thePrism.myNbEdgesInWires.size() > 1 && // there are holes
2257 topHelper.IsDistorted2D( topSM, /*checkUV=*/false ))
2259 SMESH_MeshEditor editor( topHelper.GetMesh() );
2261 // smooth in 2D or 3D?
2262 TopLoc_Location loc;
2263 Handle(Geom_Surface) surface = BRep_Tool::Surface( topFace, loc );
2264 bool isPlanar = GeomLib_IsPlanarSurface( surface ).IsPlanar();
2266 bool isFixed = false;
2267 set<const SMDS_MeshNode*> fixedNodes;
2268 for ( int iAttemp = 0; !isFixed && iAttemp < 10; ++iAttemp )
2270 TIDSortedElemSet faces;
2271 for ( faceIt = topSMDS->GetElements(); faceIt->more(); )
2272 faces.insert( faces.end(), faceIt->next() );
2274 SMESH_MeshEditor::SmoothMethod algo =
2275 iAttemp ? SMESH_MeshEditor::CENTROIDAL : SMESH_MeshEditor::LAPLACIAN;
2278 editor.Smooth( faces, fixedNodes, algo, /*nbIterations=*/ 10,
2279 /*theTgtAspectRatio=*/1.0, /*the2D=*/!isPlanar);
2281 isFixed = !topHelper.IsDistorted2D( topSM, /*checkUV=*/true );
2284 return toSM( error( TCom("Projection from face #") << botSM->GetId()
2285 << " to face #" << topSM->GetId()
2286 << " failed: inverted elements created"));
2292 //=======================================================================
2293 //function : getSweepTolerance
2294 //purpose : Compute tolerance to pass to StdMeshers_Sweeper
2295 //=======================================================================
2297 double StdMeshers_Prism_3D::getSweepTolerance( const Prism_3D::TPrismTopo& thePrism )
2299 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2300 SMESHDS_SubMesh * sm[2] = { meshDS->MeshElements( thePrism.myBottom ),
2301 meshDS->MeshElements( thePrism.myTop ) };
2302 double minDist = 1e100;
2304 vector< SMESH_TNodeXYZ > nodes;
2305 for ( int iSM = 0; iSM < 2; ++iSM )
2307 if ( !sm[ iSM ]) continue;
2309 SMDS_ElemIteratorPtr fIt = sm[ iSM ]->GetElements();
2310 while ( fIt->more() )
2312 const SMDS_MeshElement* face = fIt->next();
2313 const int nbNodes = face->NbCornerNodes();
2314 SMDS_ElemIteratorPtr nIt = face->nodesIterator();
2316 nodes.resize( nbNodes + 1 );
2317 for ( int iN = 0; iN < nbNodes; ++iN )
2318 nodes[ iN ] = nIt->next();
2319 nodes.back() = nodes[0];
2323 for ( int iN = 0; iN < nbNodes; ++iN )
2325 if ( nodes[ iN ]._node->GetPosition()->GetDim() < 2 &&
2326 nodes[ iN+1 ]._node->GetPosition()->GetDim() < 2 )
2328 // it's a boundary link; measure distance of other
2329 // nodes to this link
2330 gp_XYZ linkDir = nodes[ iN ] - nodes[ iN+1 ];
2331 double linkLen = linkDir.Modulus();
2332 bool isDegen = ( linkLen < numeric_limits<double>::min() );
2333 if ( !isDegen ) linkDir /= linkLen;
2334 for ( int iN2 = 0; iN2 < nbNodes; ++iN2 ) // loop on other nodes
2336 if ( nodes[ iN2 ] == nodes[ iN ] ||
2337 nodes[ iN2 ] == nodes[ iN+1 ]) continue;
2340 dist2 = ( nodes[ iN ] - nodes[ iN2 ]).SquareModulus();
2344 dist2 = linkDir.CrossSquareMagnitude( nodes[ iN ] - nodes[ iN2 ]);
2346 if ( dist2 > numeric_limits<double>::min() )
2347 minDist = Min ( minDist, dist2 );
2350 // measure length link
2351 else if ( nodes[ iN ]._node < nodes[ iN+1 ]._node ) // not to measure same link twice
2353 dist2 = ( nodes[ iN ] - nodes[ iN+1 ]).SquareModulus();
2354 if ( dist2 > numeric_limits<double>::min() )
2355 minDist = Min ( minDist, dist2 );
2360 return 0.1 * Sqrt ( minDist );
2363 //=======================================================================
2364 //function : isSimpleQuad
2365 //purpose : check if the bottom FACE is meshable with nice qudrangles,
2366 // if so the block aproach can work rather fast.
2367 // This is a temporary mean caused by problems in StdMeshers_Sweeper
2368 //=======================================================================
2370 bool StdMeshers_Prism_3D::isSimpleBottom( const Prism_3D::TPrismTopo& thePrism )
2372 // analyse angles between edges
2373 double nbConcaveAng = 0, nbConvexAng = 0;
2374 TopoDS_Face reverseBottom = TopoDS::Face( thePrism.myBottom.Reversed() ); // see initPrism()
2375 TopoDS_Vertex commonV;
2376 const list< TopoDS_Edge >& botEdges = thePrism.myBottomEdges;
2377 list< TopoDS_Edge >::const_iterator edge = botEdges.begin();
2378 while ( edge != botEdges.end() )
2380 if ( SMESH_Algo::isDegenerated( *edge ))
2382 TopoDS_Edge e1 = *edge++;
2383 TopoDS_Edge e2 = ( edge == botEdges.end() ? botEdges.front() : *edge );
2384 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2386 e2 = botEdges.front();
2387 if ( ! TopExp::CommonVertex( e1, e2, commonV ))
2390 double angle = myHelper->GetAngle( e1, e2, reverseBottom, commonV );
2391 if ( angle < -5 * M_PI/180 )
2392 if ( ++nbConcaveAng > 1 )
2394 if ( angle > 85 * M_PI/180 )
2395 if ( ++nbConvexAng > 4 )
2401 //=======================================================================
2402 //function : project2dMesh
2403 //purpose : Project mesh faces from a source FACE of one prism (theSrcFace)
2404 // to a source FACE of another prism (theTgtFace)
2405 //=======================================================================
2407 bool StdMeshers_Prism_3D::project2dMesh(const TopoDS_Face& theSrcFace,
2408 const TopoDS_Face& theTgtFace)
2410 TProjction2dAlgo* projector2D = TProjction2dAlgo::instance( this );
2411 projector2D->myHyp.SetSourceFace( theSrcFace );
2412 bool ok = projector2D->Compute( *myHelper->GetMesh(), theTgtFace );
2414 SMESH_subMesh* tgtSM = myHelper->GetMesh()->GetSubMesh( theTgtFace );
2415 if ( !ok && tgtSM->GetSubMeshDS() ) {
2416 //tgtSM->ComputeStateEngine( SMESH_subMesh::CLEAN ); -- avoid propagation of events
2417 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
2418 SMESHDS_SubMesh* tgtSMDS = tgtSM->GetSubMeshDS();
2419 for ( SMDS_ElemIteratorPtr eIt = tgtSMDS->GetElements(); eIt->more(); )
2420 meshDS->RemoveFreeElement( eIt->next(), tgtSMDS, /*fromGroups=*/false );
2421 for ( SMDS_NodeIteratorPtr nIt = tgtSMDS->GetNodes(); nIt->more(); )
2422 meshDS->RemoveFreeNode( nIt->next(), tgtSMDS, /*fromGroups=*/false );
2424 tgtSM->ComputeStateEngine ( SMESH_subMesh::CHECK_COMPUTE_STATE );
2425 tgtSM->ComputeSubMeshStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
2430 //================================================================================
2432 * \brief Set projection coordinates of a node to a face and it's sub-shapes
2433 * \param faceID - the face given by in-block ID
2434 * \param params - node normalized parameters
2435 * \retval bool - is a success
2437 //================================================================================
2439 bool StdMeshers_Prism_3D::setFaceAndEdgesXYZ( const int faceID, const gp_XYZ& params, int z )
2441 // find base and top edges of the face
2442 enum { BASE = 0, TOP, LEFT, RIGHT };
2443 vector< int > edgeVec; // 0-base, 1-top
2444 SMESH_Block::GetFaceEdgesIDs( faceID, edgeVec );
2446 myBlock.EdgePoint( edgeVec[ BASE ], params, myShapeXYZ[ edgeVec[ BASE ]]);
2447 myBlock.EdgePoint( edgeVec[ TOP ], params, myShapeXYZ[ edgeVec[ TOP ]]);
2449 SHOWYXZ("\nparams ", params);
2450 SHOWYXZ("TOP is " <<edgeVec[ TOP ], myShapeXYZ[ edgeVec[ TOP]]);
2451 SHOWYXZ("BASE is "<<edgeVec[ BASE], myShapeXYZ[ edgeVec[ BASE]]);
2453 if ( faceID == SMESH_Block::ID_Fx0z || faceID == SMESH_Block::ID_Fx1z )
2455 myBlock.EdgePoint( edgeVec[ LEFT ], params, myShapeXYZ[ edgeVec[ LEFT ]]);
2456 myBlock.EdgePoint( edgeVec[ RIGHT ], params, myShapeXYZ[ edgeVec[ RIGHT ]]);
2458 SHOWYXZ("VER "<<edgeVec[ LEFT], myShapeXYZ[ edgeVec[ LEFT]]);
2459 SHOWYXZ("VER "<<edgeVec[ RIGHT], myShapeXYZ[ edgeVec[ RIGHT]]);
2461 myBlock.FacePoint( faceID, params, myShapeXYZ[ faceID ]);
2462 SHOWYXZ("FacePoint "<<faceID, myShapeXYZ[ faceID]);
2467 //=======================================================================
2469 //purpose : If (!isOK), sets the error to a sub-mesh of a current SOLID
2470 //=======================================================================
2472 bool StdMeshers_Prism_3D::toSM( bool isOK )
2474 if ( mySetErrorToSM &&
2477 !myHelper->GetSubShape().IsNull() &&
2478 myHelper->GetSubShape().ShapeType() == TopAbs_SOLID)
2480 SMESH_subMesh* sm = myHelper->GetMesh()->GetSubMesh( myHelper->GetSubShape() );
2481 sm->GetComputeError() = this->GetComputeError();
2482 // clear error in order not to return it twice
2483 _error = COMPERR_OK;
2489 //=======================================================================
2490 //function : shapeID
2491 //purpose : Return index of a shape
2492 //=======================================================================
2494 int StdMeshers_Prism_3D::shapeID( const TopoDS_Shape& S )
2496 if ( S.IsNull() ) return 0;
2497 if ( !myHelper ) return -3;
2498 return myHelper->GetMeshDS()->ShapeToIndex( S );
2501 namespace // utils used by StdMeshers_Prism_3D::IsApplicable()
2503 struct EdgeWithNeighbors
2507 EdgeWithNeighbors(const TopoDS_Edge& E, int iE, int nbE, int shift = 0 ):
2509 _iL( SMESH_MesherHelper::WrapIndex( iE-1, nbE ) + shift ),
2510 _iR( SMESH_MesherHelper::WrapIndex( iE+1, nbE ) + shift )
2512 //_edge.Orientation( TopAbs_FORWARD ); // for operator==() to work
2514 EdgeWithNeighbors() {}
2515 bool IsInternal() const { return !_edge.IsNull() && _edge.Orientation() == TopAbs_INTERNAL; }
2517 // PrismSide contains all FACEs linking a bottom EDGE with a top one.
2520 TopoDS_Face _face; // a currently treated upper FACE
2521 TopTools_IndexedMapOfShape *_faces; // all FACEs (pointer because of a private copy constructor)
2522 TopoDS_Edge _topEdge; // a current top EDGE
2523 vector< EdgeWithNeighbors >*_edges; // all EDGEs of _face
2524 int _iBotEdge; // index of _topEdge within _edges
2525 vector< bool > _isCheckedEdge; // mark EDGEs whose two owner FACEs found
2526 int _nbCheckedEdges; // nb of EDGEs whose location is defined
2527 PrismSide *_leftSide; // neighbor sides
2528 PrismSide *_rightSide;
2529 bool _isInternal; // whether this side raises from an INTERNAL EDGE
2530 void SetExcluded() { _leftSide = _rightSide = NULL; }
2531 bool IsExcluded() const { return !_leftSide; }
2532 const TopoDS_Edge& Edge( int i ) const
2534 return (*_edges)[ i ]._edge;
2536 int FindEdge( const TopoDS_Edge& E ) const
2538 for ( size_t i = 0; i < _edges->size(); ++i )
2539 if ( E.IsSame( Edge( i ))) return i;
2542 bool IsSideFace( const TopoDS_Shape& face, const bool checkNeighbors ) const
2544 if ( _faces->Contains( face )) // avoid returning true for a prism top FACE
2545 return ( !_face.IsNull() || !( face.IsSame( _faces->FindKey( _faces->Extent() ))));
2547 if ( checkNeighbors )
2548 return (( _leftSide && _leftSide->IsSideFace ( face, false )) ||
2549 ( _rightSide && _rightSide->IsSideFace( face, false )));
2554 //--------------------------------------------------------------------------------
2556 * \brief Return ordered edges of a face
2558 bool getEdges( const TopoDS_Face& face,
2559 vector< EdgeWithNeighbors > & edges,
2560 const bool noHolesAllowed)
2562 TopoDS_Face f = face;
2563 if ( f.Orientation() != TopAbs_FORWARD &&
2564 f.Orientation() != TopAbs_REVERSED )
2565 f.Orientation( TopAbs_FORWARD );
2566 list< TopoDS_Edge > ee;
2567 list< int > nbEdgesInWires;
2568 int nbW = SMESH_Block::GetOrderedEdges( f, ee, nbEdgesInWires );
2569 if ( nbW > 1 && noHolesAllowed )
2573 list< TopoDS_Edge >::iterator e = ee.begin();
2574 list< int >::iterator nbE = nbEdgesInWires.begin();
2575 for ( ; nbE != nbEdgesInWires.end(); ++nbE )
2576 for ( iE = 0; iE < *nbE; ++e, ++iE )
2577 if ( SMESH_Algo::isDegenerated( *e ))
2579 e = --ee.erase( e );
2586 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2588 for ( iE = 0; iE < *nbE; ++e, ++iE )
2589 edges.push_back( EdgeWithNeighbors( *e, iE, *nbE, nbTot ));
2593 // IPAL53099. Set correct neighbors to INTERNAL EDGEs, which can be connected to
2594 // EDGEs of the outer WIRE but this fact can't be detected by their order.
2597 int iFirst = 0, iLast;
2598 for ( nbE = nbEdgesInWires.begin(); nbE != nbEdgesInWires.end(); ++nbE )
2600 iLast = iFirst + *nbE - 1;
2601 TopoDS_Vertex vv[2] = { SMESH_MesherHelper::IthVertex( 0, edges[ iFirst ]._edge ),
2602 SMESH_MesherHelper::IthVertex( 1, edges[ iLast ]._edge ) };
2603 bool isConnectOk = ( vv[0].IsSame( vv[1] ));
2606 // look for an EDGE of the outer WIRE connected to vv
2607 TopoDS_Vertex v0, v1;
2608 for ( iE = 0; iE < nbEdgesInWires.front(); ++iE )
2610 v0 = SMESH_MesherHelper::IthVertex( 0, edges[ iE ]._edge );
2611 v1 = SMESH_MesherHelper::IthVertex( 1, edges[ iE ]._edge );
2612 if ( vv[0].IsSame( v0 ) || vv[0].IsSame( v1 ))
2613 edges[ iFirst ]._iL = iE;
2614 if ( vv[1].IsSame( v0 ) || vv[1].IsSame( v1 ))
2615 edges[ iLast ]._iR = iE;
2621 return edges.size();
2623 //--------------------------------------------------------------------------------
2625 * \brief Return another faces sharing an edge
2627 const TopoDS_Face & getAnotherFace( const TopoDS_Face& face,
2628 const TopoDS_Edge& edge,
2629 TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge)
2631 TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edge ));
2632 for ( ; faceIt.More(); faceIt.Next() )
2633 if ( !face.IsSame( faceIt.Value() ))
2634 return TopoDS::Face( faceIt.Value() );
2638 //--------------------------------------------------------------------------------
2640 * \brief Return number of faces sharing given edges
2642 int nbAdjacentFaces( const std::vector< EdgeWithNeighbors >& edges,
2643 const TopTools_IndexedDataMapOfShapeListOfShape& facesOfEdge )
2645 TopTools_MapOfShape adjFaces;
2647 for ( size_t i = 0; i < edges.size(); ++i )
2649 TopTools_ListIteratorOfListOfShape faceIt( facesOfEdge.FindFromKey( edges[i]._edge ));
2650 for ( ; faceIt.More(); faceIt.Next() )
2651 adjFaces.Add( faceIt.Value() );
2653 return adjFaces.Extent();
2657 //================================================================================
2659 * \brief Return true if the algorithm can mesh this shape
2660 * \param [in] aShape - shape to check
2661 * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
2662 * else, returns OK if at least one shape is OK
2664 //================================================================================
2666 bool StdMeshers_Prism_3D::IsApplicable(const TopoDS_Shape & shape, bool toCheckAll)
2668 TopExp_Explorer sExp( shape, TopAbs_SOLID );
2672 for ( ; sExp.More(); sExp.Next() )
2676 TopExp_Explorer shExp( sExp.Current(), TopAbs_SHELL );
2677 if ( shExp.More() ) {
2678 shell = shExp.Current();
2683 if ( shell.IsNull() ) {
2684 if ( toCheckAll ) return false;
2688 TopTools_IndexedMapOfShape allFaces;
2689 TopExp::MapShapes( shell, TopAbs_FACE, allFaces );
2690 if ( allFaces.Extent() < 3 ) {
2691 if ( toCheckAll ) return false;
2695 if ( allFaces.Extent() == 6 )
2697 TopTools_IndexedMapOfOrientedShape map;
2698 bool isBox = SMESH_Block::FindBlockShapes( TopoDS::Shell( shell ),
2699 TopoDS_Vertex(), TopoDS_Vertex(), map );
2701 if ( !toCheckAll ) return true;
2706 TopTools_IndexedMapOfShape allShapes;
2707 TopExp::MapShapes( shape, allShapes );
2710 TopTools_IndexedDataMapOfShapeListOfShape facesOfEdge;
2711 TopTools_ListIteratorOfListOfShape faceIt;
2712 TopExp::MapShapesAndAncestors( sExp.Current(), TopAbs_EDGE, TopAbs_FACE , facesOfEdge );
2713 if ( facesOfEdge.IsEmpty() ) {
2714 if ( toCheckAll ) return false;
2718 typedef vector< EdgeWithNeighbors > TEdgeWithNeighborsVec;
2719 vector< TEdgeWithNeighborsVec > faceEdgesVec( allFaces.Extent() + 1 );
2720 const size_t nbEdgesMax = facesOfEdge.Extent() * 2; // there can be seam EDGEs
2721 TopTools_IndexedMapOfShape* facesOfSide = new TopTools_IndexedMapOfShape[ nbEdgesMax ];
2722 SMESHUtils::ArrayDeleter<TopTools_IndexedMapOfShape> delFacesOfSide( facesOfSide );
2724 // try to use each face as a bottom one
2725 bool prismDetected = false;
2726 vector< PrismSide > sides;
2727 for ( int iF = 1; iF < allFaces.Extent() && !prismDetected; ++iF )
2729 const TopoDS_Face& botF = TopoDS::Face( allFaces( iF ));
2731 TEdgeWithNeighborsVec& botEdges = faceEdgesVec[ iF ];
2732 if ( botEdges.empty() )
2733 if ( !getEdges( botF, botEdges, /*noHoles=*/false ))
2735 if ( allFaces.Extent()-1 <= (int) botEdges.size() )
2736 continue; // all faces are adjacent to botF - no top FACE
2738 // init data of side FACEs
2740 sides.resize( botEdges.size() );
2741 for ( size_t iS = 0; iS < botEdges.size(); ++iS )
2743 sides[ iS ]._topEdge = botEdges[ iS ]._edge;
2744 sides[ iS ]._face = botF;
2745 sides[ iS ]._leftSide = & sides[ botEdges[ iS ]._iR ];
2746 sides[ iS ]._rightSide = & sides[ botEdges[ iS ]._iL ];
2747 sides[ iS ]._isInternal = botEdges[ iS ].IsInternal();
2748 sides[ iS ]._faces = & facesOfSide[ iS ];
2749 sides[ iS ]._faces->Clear();
2752 bool isOK = true; // ok for a current botF
2753 bool isAdvanced = true; // is new data found in a current loop
2754 int nbFoundSideFaces = 0;
2755 for ( int iLoop = 0; isOK && isAdvanced; ++iLoop )
2758 for ( size_t iS = 0; iS < sides.size() && isOK; ++iS )
2760 PrismSide& side = sides[ iS ];
2761 if ( side._face.IsNull() )
2762 continue; // probably the prism top face is the last of side._faces
2764 if ( side._topEdge.IsNull() )
2766 // find vertical EDGEs --- EGDEs shared with neighbor side FACEs
2767 for ( int is2nd = 0; is2nd < 2 && isOK; ++is2nd ) // 2 adjacent neighbors
2769 int di = is2nd ? 1 : -1;
2770 const PrismSide* adjSide = is2nd ? side._rightSide : side._leftSide;
2771 for ( size_t i = 1; i < side._edges->size(); ++i )
2773 int iE = SMESH_MesherHelper::WrapIndex( i*di + side._iBotEdge, side._edges->size());
2774 if ( side._isCheckedEdge[ iE ] ) continue;
2775 const TopoDS_Edge& vertE = side.Edge( iE );
2776 const TopoDS_Shape& neighborF = getAnotherFace( side._face, vertE, facesOfEdge );
2777 bool isEdgeShared = (( adjSide->IsSideFace( neighborF, side._isInternal )) ||
2778 ( adjSide == &side && neighborF.IsSame( side._face )) );
2779 if ( isEdgeShared ) // vertE is shared with adjSide
2782 side._isCheckedEdge[ iE ] = true;
2783 side._nbCheckedEdges++;
2784 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
2785 if ( nbNotCheckedE == 1 )
2790 if ( i == 1 && iLoop == 0 ) isOK = false;
2796 int nbNotCheckedE = side._edges->size() - side._nbCheckedEdges;
2797 if ( nbNotCheckedE == 1 )
2799 vector<bool>::iterator ii = std::find( side._isCheckedEdge.begin(),
2800 side._isCheckedEdge.end(), false );
2801 if ( ii != side._isCheckedEdge.end() )
2803 size_t iE = std::distance( side._isCheckedEdge.begin(), ii );
2804 side._topEdge = side.Edge( iE );
2807 isOK = ( nbNotCheckedE >= 1 );
2809 else //if ( !side._topEdge.IsNull() )
2811 // get a next face of a side
2812 const TopoDS_Shape& f = getAnotherFace( side._face, side._topEdge, facesOfEdge );
2813 side._faces->Add( f );
2815 if ( f.IsSame( side._face ) || // _topEdge is a seam
2816 SMESH_MesherHelper::Count( f, TopAbs_WIRE, false ) != 1 )
2820 else if ( side._leftSide != & side && // not closed side face
2821 side._leftSide->_faces->Contains( f ))
2823 stop = true; // probably f is the prism top face
2824 side._leftSide->_face.Nullify();
2825 side._leftSide->_topEdge.Nullify();
2827 else if ( side._rightSide != & side &&
2828 side._rightSide->_faces->Contains( f ))
2830 stop = true; // probably f is the prism top face
2831 side._rightSide->_face.Nullify();
2832 side._rightSide->_topEdge.Nullify();
2836 side._face.Nullify();
2837 side._topEdge.Nullify();
2840 side._face = TopoDS::Face( f );
2841 int faceID = allFaces.FindIndex( side._face );
2842 side._edges = & faceEdgesVec[ faceID ];
2843 if ( side._edges->empty() )
2844 if ( !getEdges( side._face, * side._edges, /*noHoles=*/true ))
2846 const int nbE = side._edges->size();
2851 side._iBotEdge = side.FindEdge( side._topEdge );
2852 side._isCheckedEdge.clear();
2853 side._isCheckedEdge.resize( nbE, false );
2854 side._isCheckedEdge[ side._iBotEdge ] = true;
2855 side._nbCheckedEdges = 1; // bottom EDGE is known
2857 else // probably a triangular top face found
2859 side._face.Nullify();
2861 side._topEdge.Nullify();
2862 isOK = ( !side._edges->empty() || side._faces->Extent() > 1 );
2864 } //if ( !side._topEdge.IsNull() )
2866 } // loop on prism sides
2868 if ( nbFoundSideFaces > allFaces.Extent() )
2872 if ( iLoop > allFaces.Extent() * 10 )
2876 cerr << "BUG: infinite loop in StdMeshers_Prism_3D::IsApplicable()" << endl;
2879 } // while isAdvanced
2881 if ( isOK && sides[0]._faces->Extent() > 1 )
2883 const int nbFaces = sides[0]._faces->Extent();
2884 if ( botEdges.size() == 1 ) // cylinder
2886 prismDetected = ( nbFaces == allFaces.Extent()-1 );
2890 const TopoDS_Shape& topFace = sides[0]._faces->FindKey( nbFaces );
2892 for ( iS = 1; iS < sides.size(); ++iS )
2893 if ( ! sides[ iS ]._faces->Contains( topFace ))
2895 prismDetected = ( iS == sides.size() );
2898 } // loop on allFaces
2900 if ( !prismDetected && toCheckAll ) return false;
2901 if ( prismDetected && !toCheckAll ) return true;
2910 //================================================================================
2912 * \brief Return true if this node and other one belong to one face
2914 //================================================================================
2916 bool Prism_3D::TNode::IsNeighbor( const Prism_3D::TNode& other ) const
2918 if ( !other.myNode || !myNode ) return false;
2920 SMDS_ElemIteratorPtr fIt = other.myNode->GetInverseElementIterator(SMDSAbs_Face);
2921 while ( fIt->more() )
2922 if ( fIt->next()->GetNodeIndex( myNode ) >= 0 )
2927 //================================================================================
2929 * \brief Prism initialization
2931 //================================================================================
2933 void TPrismTopo::Clear()
2935 myShape3D.Nullify();
2938 myWallQuads.clear();
2939 myBottomEdges.clear();
2940 myNbEdgesInWires.clear();
2941 myWallQuads.clear();
2944 //================================================================================
2946 * \brief Set upside-down
2948 //================================================================================
2950 void TPrismTopo::SetUpsideDown()
2952 std::swap( myBottom, myTop );
2953 myBottomEdges.clear();
2954 std::reverse( myBottomEdges.begin(), myBottomEdges.end() );
2955 for ( size_t i = 0; i < myWallQuads.size(); ++i )
2957 myWallQuads[i].reverse();
2958 TQuadList::iterator q = myWallQuads[i].begin();
2959 for ( ; q != myWallQuads[i].end(); ++q )
2961 (*q)->shift( 2, /*keepUnitOri=*/true );
2963 myBottomEdges.push_back( myWallQuads[i].front()->side[ QUAD_BOTTOM_SIDE ].grid->Edge(0) );
2967 } // namespace Prism_3D
2969 //================================================================================
2971 * \brief Constructor. Initialization is needed
2973 //================================================================================
2975 StdMeshers_PrismAsBlock::StdMeshers_PrismAsBlock()
2980 StdMeshers_PrismAsBlock::~StdMeshers_PrismAsBlock()
2984 void StdMeshers_PrismAsBlock::Clear()
2987 myShapeIDMap.Clear();
2991 delete mySide; mySide = 0;
2993 myParam2ColumnMaps.clear();
2994 myShapeIndex2ColumnMap.clear();
2997 //=======================================================================
2998 //function : initPrism
2999 //purpose : Analyse shape geometry and mesh.
3000 // If there are triangles on one of faces, it becomes 'bottom'.
3001 // thePrism.myBottom can be already set up.
3002 //=======================================================================
3004 bool StdMeshers_Prism_3D::initPrism(Prism_3D::TPrismTopo& thePrism,
3005 const TopoDS_Shape& theShape3D,
3006 const bool selectBottom)
3008 myHelper->SetSubShape( theShape3D );
3010 SMESH_subMesh* mainSubMesh = myHelper->GetMesh()->GetSubMeshContaining( theShape3D );
3011 if ( !mainSubMesh ) return toSM( error(COMPERR_BAD_INPUT_MESH,"Null submesh of shape3D"));
3013 // detect not-quad FACE sub-meshes of the 3D SHAPE
3014 list< SMESH_subMesh* > notQuadGeomSubMesh;
3015 list< SMESH_subMesh* > notQuadElemSubMesh;
3016 list< SMESH_subMesh* > meshedSubMesh;
3019 SMESH_subMesh* anyFaceSM = 0;
3020 SMESH_subMeshIteratorPtr smIt = mainSubMesh->getDependsOnIterator(false,true);
3021 while ( smIt->more() )
3023 SMESH_subMesh* sm = smIt->next();
3024 const TopoDS_Shape& face = sm->GetSubShape();
3025 if ( face.ShapeType() > TopAbs_FACE ) break;
3026 else if ( face.ShapeType() < TopAbs_FACE ) continue;
3030 // is quadrangle FACE?
3031 list< TopoDS_Edge > orderedEdges;
3032 list< int > nbEdgesInWires;
3033 int nbWires = SMESH_Block::GetOrderedEdges( TopoDS::Face( face ), orderedEdges,
3035 if ( nbWires != 1 || nbEdgesInWires.front() != 4 )
3036 notQuadGeomSubMesh.push_back( sm );
3038 // look for a not structured sub-mesh
3039 if ( !sm->IsEmpty() )
3041 meshedSubMesh.push_back( sm );
3042 if ( !myHelper->IsSameElemGeometry( sm->GetSubMeshDS(), SMDSGeom_QUADRANGLE ) ||
3043 !myHelper->IsStructured ( sm ))
3044 notQuadElemSubMesh.push_back( sm );
3048 int nbNotQuadMeshed = notQuadElemSubMesh.size();
3049 int nbNotQuad = notQuadGeomSubMesh.size();
3050 bool hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3053 if ( nbNotQuadMeshed > 2 )
3055 return toSM( error(COMPERR_BAD_INPUT_MESH,
3056 TCom("More than 2 faces with not quadrangle elements: ")
3057 <<nbNotQuadMeshed));
3059 if ( nbNotQuad > 2 || !thePrism.myBottom.IsNull() )
3061 // Issue 0020843 - one of side FACEs is quasi-quadrilateral (not 4 EDGEs).
3062 // Remove from notQuadGeomSubMesh faces meshed with regular grid
3063 int nbQuasiQuads = removeQuasiQuads( notQuadGeomSubMesh, myHelper,
3064 TQuadrangleAlgo::instance(this,myHelper) );
3065 nbNotQuad -= nbQuasiQuads;
3066 if ( nbNotQuad > 2 )
3067 return toSM( error(COMPERR_BAD_SHAPE,
3068 TCom("More than 2 not quadrilateral faces: ") <<nbNotQuad));
3069 hasNotQuad = ( nbNotQuad || nbNotQuadMeshed );
3072 // Analyse mesh and topology of FACEs: choose the bottom sub-mesh.
3073 // If there are not quadrangle FACEs, they are top and bottom ones.
3074 // Not quadrangle FACEs must be only on top and bottom.
3076 SMESH_subMesh * botSM = 0;
3077 SMESH_subMesh * topSM = 0;
3079 if ( hasNotQuad ) // can choose a bottom FACE
3081 if ( nbNotQuadMeshed > 0 ) botSM = notQuadElemSubMesh.front();
3082 else botSM = notQuadGeomSubMesh.front();
3083 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.back();
3084 else if ( nbNotQuad > 1 ) topSM = notQuadGeomSubMesh.back();
3086 if ( topSM == botSM ) {
3087 if ( nbNotQuadMeshed > 1 ) topSM = notQuadElemSubMesh.front();
3088 else topSM = notQuadGeomSubMesh.front();
3091 // detect mesh triangles on wall FACEs
3092 if ( nbNotQuad == 2 && nbNotQuadMeshed > 0 ) {
3094 if ( nbNotQuadMeshed == 1 )
3095 ok = ( find( notQuadGeomSubMesh.begin(),
3096 notQuadGeomSubMesh.end(), botSM ) != notQuadGeomSubMesh.end() );
3098 ok = ( notQuadGeomSubMesh == notQuadElemSubMesh );
3100 return toSM( error(COMPERR_BAD_INPUT_MESH,
3101 "Side face meshed with not quadrangle elements"));
3105 thePrism.myNotQuadOnTop = ( nbNotQuadMeshed > 1 );
3107 // use thePrism.myBottom
3108 if ( !thePrism.myBottom.IsNull() )
3110 if ( botSM ) { // <-- not quad geom or mesh on botSM
3111 if ( ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3112 std::swap( botSM, topSM );
3113 if ( !botSM || ! botSM->GetSubShape().IsSame( thePrism.myBottom )) {
3114 if ( !selectBottom )
3115 return toSM( error( COMPERR_BAD_INPUT_MESH,
3116 "Incompatible non-structured sub-meshes"));
3117 std::swap( botSM, topSM );
3118 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3122 else if ( !selectBottom ) {
3123 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3126 if ( !botSM ) // find a proper bottom
3128 bool savedSetErrorToSM = mySetErrorToSM;
3129 mySetErrorToSM = false; // ingore errors in initPrism()
3131 // search among meshed FACEs
3132 list< SMESH_subMesh* >::iterator sm = meshedSubMesh.begin();
3133 for ( ; !botSM && sm != meshedSubMesh.end(); ++sm )
3137 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3138 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3141 // search among all FACEs
3142 for ( TopExp_Explorer f( theShape3D, TopAbs_FACE ); !botSM && f.More(); f.Next() )
3144 int minNbFaces = 2 + myHelper->Count( f.Current(), TopAbs_EDGE, false);
3145 if ( nbFaces < minNbFaces) continue;
3147 thePrism.myBottom = TopoDS::Face( f.Current() );
3148 botSM = myHelper->GetMesh()->GetSubMesh( thePrism.myBottom );
3149 if ( !initPrism( thePrism, theShape3D, /*selectBottom=*/false ))
3152 mySetErrorToSM = savedSetErrorToSM;
3153 return botSM ? true : toSM( error( COMPERR_BAD_SHAPE ));
3156 // find vertex 000 - the one with smallest coordinates (for easy DEBUG :-)
3158 double minVal = DBL_MAX, minX = 0, val;
3159 for ( TopExp_Explorer exp( botSM->GetSubShape(), TopAbs_VERTEX );
3160 exp.More(); exp.Next() )
3162 const TopoDS_Vertex& v = TopoDS::Vertex( exp.Current() );
3163 gp_Pnt P = BRep_Tool::Pnt( v );
3164 val = P.X() + P.Y() + P.Z();
3165 if ( val < minVal || ( val == minVal && P.X() < minX )) {
3172 thePrism.myShape3D = theShape3D;
3173 if ( thePrism.myBottom.IsNull() )
3174 thePrism.myBottom = TopoDS::Face( botSM->GetSubShape() );
3175 thePrism.myBottom.Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myBottom ));
3176 thePrism.myTop. Orientation( myHelper->GetSubShapeOri( theShape3D, thePrism.myTop ));
3178 // Get ordered bottom edges
3179 TopoDS_Face reverseBottom = // to have order of top EDGEs as in the top FACE
3180 TopoDS::Face( thePrism.myBottom.Reversed() );
3181 SMESH_Block::GetOrderedEdges( reverseBottom,
3182 thePrism.myBottomEdges,
3183 thePrism.myNbEdgesInWires, V000 );
3185 // Get Wall faces corresponding to the ordered bottom edges and the top FACE
3186 if ( !getWallFaces( thePrism, nbFaces )) // it also sets thePrism.myTop
3187 return false; //toSM( error(COMPERR_BAD_SHAPE, "Can't find side faces"));
3191 if ( !thePrism.myTop.IsSame( topSM->GetSubShape() ))
3193 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3194 "Non-quadrilateral faces are not opposite"));
3196 // check that the found top and bottom FACEs are opposite
3197 list< TopoDS_Edge >::iterator edge = thePrism.myBottomEdges.begin();
3198 for ( ; edge != thePrism.myBottomEdges.end(); ++edge )
3199 if ( myHelper->IsSubShape( *edge, thePrism.myTop ))
3201 (notQuadGeomSubMesh.empty() ? COMPERR_BAD_INPUT_MESH : COMPERR_BAD_SHAPE,
3202 "Non-quadrilateral faces are not opposite"));
3205 if ( thePrism.myBottomEdges.size() > thePrism.myWallQuads.size() )
3207 // composite bottom sides => set thePrism upside-down
3208 thePrism.SetUpsideDown();
3214 //================================================================================
3216 * \brief Initialization.
3217 * \param helper - helper loaded with mesh and 3D shape
3218 * \param thePrism - a prism data
3219 * \retval bool - false if a mesh or a shape are KO
3221 //================================================================================
3223 bool StdMeshers_PrismAsBlock::Init(SMESH_MesherHelper* helper,
3224 const Prism_3D::TPrismTopo& thePrism)
3227 SMESHDS_Mesh* meshDS = myHelper->GetMeshDS();
3228 SMESH_Mesh* mesh = myHelper->GetMesh();
3231 delete mySide; mySide = 0;
3233 vector< TSideFace* > sideFaces( NB_WALL_FACES, 0 );
3234 vector< pair< double, double> > params( NB_WALL_FACES );
3235 mySide = new TSideFace( *mesh, sideFaces, params );
3238 SMESH_Block::init();
3239 myShapeIDMap.Clear();
3240 myShapeIndex2ColumnMap.clear();
3242 int wallFaceIds[ NB_WALL_FACES ] = { // to walk around a block
3243 SMESH_Block::ID_Fx0z, SMESH_Block::ID_F1yz,
3244 SMESH_Block::ID_Fx1z, SMESH_Block::ID_F0yz
3247 myError = SMESH_ComputeError::New();
3249 myNotQuadOnTop = thePrism.myNotQuadOnTop;
3251 // Find columns of wall nodes and calculate edges' lengths
3252 // --------------------------------------------------------
3254 myParam2ColumnMaps.clear();
3255 myParam2ColumnMaps.resize( thePrism.myBottomEdges.size() ); // total nb edges
3257 size_t iE, nbEdges = thePrism.myNbEdgesInWires.front(); // nb outer edges
3258 vector< double > edgeLength( nbEdges );
3259 multimap< double, int > len2edgeMap;
3261 // for each EDGE: either split into several parts, or join with several next EDGEs
3262 vector<int> nbSplitPerEdge( nbEdges, 0 );
3263 vector<int> nbUnitePerEdge( nbEdges, 0 ); // -1 means "joined to a previous"
3265 // consider continuous straight EDGEs as one side
3266 const int nbSides = countNbSides( thePrism, nbUnitePerEdge, edgeLength );
3268 list< TopoDS_Edge >::const_iterator edgeIt = thePrism.myBottomEdges.begin();
3269 for ( iE = 0; iE < nbEdges; ++iE, ++edgeIt )
3271 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3273 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3274 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3276 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3277 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3278 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3279 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3281 SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3282 SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3283 SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3285 if ( nbSides < NB_WALL_FACES ) // fill map used to split faces
3286 len2edgeMap.insert( make_pair( edgeLength[ iE ], iE )); // sort edges by length
3288 // Load columns of internal edges (forming holes)
3289 // and fill map ShapeIndex to TParam2ColumnMap for them
3290 for ( ; edgeIt != thePrism.myBottomEdges.end() ; ++edgeIt, ++iE )
3292 TParam2ColumnMap & faceColumns = myParam2ColumnMaps[ iE ];
3294 Prism_3D::TQuadList::const_iterator quad = thePrism.myWallQuads[ iE ].begin();
3295 for ( ; quad != thePrism.myWallQuads[ iE ].end(); ++quad )
3297 const TopoDS_Edge& quadBot = (*quad)->side[ QUAD_BOTTOM_SIDE ].grid->Edge( 0 );
3298 if ( !myHelper->LoadNodeColumns( faceColumns, (*quad)->face, quadBot, meshDS ))
3299 return error(COMPERR_BAD_INPUT_MESH, TCom("Can't find regular quadrangle mesh ")
3300 << "on a side face #" << MeshDS()->ShapeToIndex( (*quad)->face ));
3302 if ( !faceColumns.empty() && (int)faceColumns.begin()->second.size() != VerticalSize() )
3303 return error(COMPERR_BAD_INPUT_MESH, "Different 'vertical' discretization");
3306 int id = MeshDS()->ShapeToIndex( *edgeIt );
3307 bool isForward = true; // meaningless for intenal wires
3308 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3309 // columns for vertices
3311 const SMDS_MeshNode* n0 = faceColumns.begin()->second.front();
3312 id = n0->getshapeId();
3313 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3315 const SMDS_MeshNode* n1 = faceColumns.rbegin()->second.front();
3316 id = n1->getshapeId();
3317 myShapeIndex2ColumnMap[ id ] = make_pair( & faceColumns, isForward );
3319 // SHOWYXZ("\np1 F " <<iE, gpXYZ(faceColumns.begin()->second.front() ));
3320 // SHOWYXZ("p2 F " <<iE, gpXYZ(faceColumns.rbegin()->second.front() ));
3321 // SHOWYXZ("V First "<<iE, BRep_Tool::Pnt( TopExp::FirstVertex(*edgeIt,true )));
3324 // Create 4 wall faces of a block
3325 // -------------------------------
3327 if ( nbSides <= NB_WALL_FACES ) // ************* Split faces if necessary
3329 if ( nbSides != NB_WALL_FACES ) // define how to split
3331 if ( len2edgeMap.size() != nbEdges )
3332 RETURN_BAD_RESULT("Uniqueness of edge lengths not assured");
3334 multimap< double, int >::reverse_iterator maxLen_i = len2edgeMap.rbegin();
3335 multimap< double, int >::reverse_iterator midLen_i = ++len2edgeMap.rbegin();
3337 double maxLen = maxLen_i->first;
3338 double midLen = ( len2edgeMap.size() == 1 ) ? 0 : midLen_i->first;
3339 switch ( nbEdges ) {
3340 case 1: // 0-th edge is split into 4 parts
3341 nbSplitPerEdge[ 0 ] = 4;
3343 case 2: // either the longest edge is split into 3 parts, or both edges into halves
3344 if ( maxLen / 3 > midLen / 2 ) {
3345 nbSplitPerEdge[ maxLen_i->second ] = 3;
3348 nbSplitPerEdge[ maxLen_i->second ] = 2;
3349 nbSplitPerEdge[ midLen_i->second ] = 2;
3354 // split longest into 3 parts
3355 nbSplitPerEdge[ maxLen_i->second ] = 3;
3357 // split longest into halves
3358 nbSplitPerEdge[ maxLen_i->second ] = 2;
3362 else // **************************** Unite faces
3364 int nbExraFaces = nbSides - 4; // nb of faces to fuse
3365 for ( iE = 0; iE < nbEdges; ++iE )
3367 if ( nbUnitePerEdge[ iE ] < 0 )
3369 // look for already united faces
3370 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3372 if ( nbUnitePerEdge[ i ] > 0 ) // a side including nbUnitePerEdge[i]+1 edge
3373 nbExraFaces += nbUnitePerEdge[ i ];
3374 nbUnitePerEdge[ i ] = -1;
3376 nbUnitePerEdge[ iE ] = nbExraFaces;
3381 // Create TSideFace's
3383 list< TopoDS_Edge >::const_iterator botE = thePrism.myBottomEdges.begin();
3384 for ( iE = 0; iE < nbEdges; ++iE, ++botE )
3386 TFaceQuadStructPtr quad = thePrism.myWallQuads[ iE ].front();
3387 const int nbSplit = nbSplitPerEdge[ iE ];
3388 const int nbExraFaces = nbUnitePerEdge[ iE ] + 1;
3389 if ( nbSplit > 0 ) // split
3391 vector< double > params;
3392 splitParams( nbSplit, &myParam2ColumnMaps[ iE ], params );
3393 const bool isForward =
3394 StdMeshers_PrismAsBlock::IsForwardEdge( myHelper->GetMeshDS(),
3395 myParam2ColumnMaps[iE],
3396 *botE, SMESH_Block::ID_Fx0z );
3397 for ( int i = 0; i < nbSplit; ++i ) {
3398 double f = ( isForward ? params[ i ] : params[ nbSplit - i-1 ]);
3399 double l = ( isForward ? params[ i+1 ] : params[ nbSplit - i ]);
3400 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3401 thePrism.myWallQuads[ iE ], *botE,
3402 &myParam2ColumnMaps[ iE ], f, l );
3403 mySide->SetComponent( iSide++, comp );
3406 else if ( nbExraFaces > 1 ) // unite
3408 double u0 = 0, sumLen = 0;
3409 for ( size_t i = iE; i < iE + nbExraFaces; ++i )
3410 sumLen += edgeLength[ i ];
3412 vector< TSideFace* > components( nbExraFaces );
3413 vector< pair< double, double> > params( nbExraFaces );
3414 bool endReached = false;
3415 for ( int i = 0; i < nbExraFaces; ++i, ++botE, ++iE )
3417 if ( iE == nbEdges )
3420 botE = thePrism.myBottomEdges.begin();
3423 components[ i ] = new TSideFace( *mesh, wallFaceIds[ iSide ],
3424 thePrism.myWallQuads[ iE ], *botE,
3425 &myParam2ColumnMaps[ iE ]);
3426 double u1 = u0 + edgeLength[ iE ] / sumLen;
3427 params[ i ] = make_pair( u0 , u1 );
3430 TSideFace* comp = new TSideFace( *mesh, components, params );
3431 mySide->SetComponent( iSide++, comp );
3434 --iE; // for increment in an external loop on iE
3437 else if ( nbExraFaces < 0 ) // skip already united face
3442 TSideFace* comp = new TSideFace( *mesh, wallFaceIds[ iSide ],
3443 thePrism.myWallQuads[ iE ], *botE,
3444 &myParam2ColumnMaps[ iE ]);
3445 mySide->SetComponent( iSide++, comp );
3450 // Fill geometry fields of SMESH_Block
3451 // ------------------------------------
3453 vector< int > botEdgeIdVec;
3454 SMESH_Block::GetFaceEdgesIDs( ID_BOT_FACE, botEdgeIdVec );
3456 bool isForward[NB_WALL_FACES] = { true, true, true, true };
3457 Adaptor2d_Curve2d* botPcurves[NB_WALL_FACES];
3458 Adaptor2d_Curve2d* topPcurves[NB_WALL_FACES];
3460 for ( int iF = 0; iF < NB_WALL_FACES; ++iF )
3462 TSideFace * sideFace = mySide->GetComponent( iF );
3464 RETURN_BAD_RESULT("NULL TSideFace");
3465 int fID = sideFace->FaceID(); // in-block ID
3467 // fill myShapeIDMap
3468 if ( sideFace->InsertSubShapes( myShapeIDMap ) != 8 &&
3469 !sideFace->IsComplex())
3470 MESSAGE( ": Warning : InsertSubShapes() < 8 on side " << iF );
3472 // side faces geometry
3473 Adaptor2d_Curve2d* pcurves[NB_WALL_FACES];
3474 if ( !sideFace->GetPCurves( pcurves ))
3475 RETURN_BAD_RESULT("TSideFace::GetPCurves() failed");
3477 SMESH_Block::TFace& tFace = myFace[ fID - ID_FirstF ];
3478 tFace.Set( fID, sideFace->Surface(), pcurves, isForward );
3480 SHOWYXZ( endl<<"F "<< iF << " id " << fID << " FRW " << sideFace->IsForward(), sideFace->Value(0,0));
3481 // edges 3D geometry
3482 vector< int > edgeIdVec;
3483 SMESH_Block::GetFaceEdgesIDs( fID, edgeIdVec );
3484 for ( int isMax = 0; isMax < 2; ++isMax ) {
3486 int eID = edgeIdVec[ isMax ];
3487 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3488 tEdge.Set( eID, sideFace->HorizCurve(isMax), true);
3489 SHOWYXZ(eID<<" HOR"<<isMax<<"(0)", sideFace->HorizCurve(isMax)->Value(0));
3490 SHOWYXZ(eID<<" HOR"<<isMax<<"(1)", sideFace->HorizCurve(isMax)->Value(1));
3493 int eID = edgeIdVec[ isMax+2 ];
3494 SMESH_Block::TEdge& tEdge = myEdge[ eID - ID_FirstE ];
3495 tEdge.Set( eID, sideFace->VertiCurve(isMax), true);
3496 SHOWYXZ(eID<<" VER"<<isMax<<"(0)", sideFace->VertiCurve(isMax)->Value(0));
3497 SHOWYXZ(eID<<" VER"<<isMax<<"(1)", sideFace->VertiCurve(isMax)->Value(1));
3500 vector< int > vertexIdVec;
3501 SMESH_Block::GetEdgeVertexIDs( eID, vertexIdVec );
3502 myPnt[ vertexIdVec[0] - ID_FirstV ] = tEdge.GetCurve()->Value(0).XYZ();
3503 myPnt[ vertexIdVec[1] - ID_FirstV ] = tEdge.GetCurve()->Value(1).XYZ();
3506 // pcurves on horizontal faces
3507 for ( iE = 0; iE < NB_WALL_FACES; ++iE ) {
3508 if ( edgeIdVec[ BOTTOM_EDGE ] == botEdgeIdVec[ iE ] ) {
3509 botPcurves[ iE ] = sideFace->HorizPCurve( false, thePrism.myBottom );
3510 topPcurves[ iE ] = sideFace->HorizPCurve( true, thePrism.myTop );
3514 //sideFace->dumpNodes( 4 ); // debug
3516 // horizontal faces geometry
3518 SMESH_Block::TFace& tFace = myFace[ ID_BOT_FACE - ID_FirstF ];
3519 tFace.Set( ID_BOT_FACE, new BRepAdaptor_Surface( thePrism.myBottom ), botPcurves, isForward );
3520 SMESH_Block::Insert( thePrism.myBottom, ID_BOT_FACE, myShapeIDMap );
3523 SMESH_Block::TFace& tFace = myFace[ ID_TOP_FACE - ID_FirstF ];
3524 tFace.Set( ID_TOP_FACE, new BRepAdaptor_Surface( thePrism.myTop ), topPcurves, isForward );
3525 SMESH_Block::Insert( thePrism.myTop, ID_TOP_FACE, myShapeIDMap );
3527 //faceGridToPythonDump( SMESH_Block::ID_Fxy0, 50 );
3528 //faceGridToPythonDump( SMESH_Block::ID_Fxy1 );
3530 // Fill map ShapeIndex to TParam2ColumnMap
3531 // ----------------------------------------
3533 list< TSideFace* > fList;
3534 list< TSideFace* >::iterator fListIt;
3535 fList.push_back( mySide );
3536 for ( fListIt = fList.begin(); fListIt != fList.end(); ++fListIt)
3538 int nb = (*fListIt)->NbComponents();
3539 for ( int i = 0; i < nb; ++i ) {
3540 if ( TSideFace* comp = (*fListIt)->GetComponent( i ))
3541 fList.push_back( comp );
3543 if ( TParam2ColumnMap* cols = (*fListIt)->GetColumns()) {
3544 // columns for a base edge
3545 int id = MeshDS()->ShapeToIndex( (*fListIt)->BaseEdge() );
3546 bool isForward = (*fListIt)->IsForward();
3547 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3549 // columns for vertices
3550 const SMDS_MeshNode* n0 = cols->begin()->second.front();
3551 id = n0->getshapeId();
3552 myShapeIndex2ColumnMap[ id ] = make_pair( cols, isForward );
3554 const SMDS_MeshNode* n1 = cols->rbegin()->second.front();
3555 id = n1->getshapeId();
3556 myShapeIndex2ColumnMap[ id ] = make_pair( cols, !isForward );
3560 // #define SHOWYXZ(msg, xyz) { gp_Pnt p(xyz); cout << msg << " ("<< p.X() << "; " <<p.Y() << "; " <<p.Z() << ") " <<endl; }
3562 // double _u[]={ 0.1, 0.1, 0.9, 0.9 };
3563 // double _v[]={ 0.1, 0.9, 0.1, 0.9 };
3564 // for ( int z = 0; z < 2; ++z )
3565 // for ( int i = 0; i < 4; ++i )
3567 // //gp_XYZ testPar(0.25, 0.25, 0), testCoord;
3568 // int iFace = (z ? ID_TOP_FACE : ID_BOT_FACE);
3569 // gp_XYZ testPar(_u[i], _v[i], z), testCoord;
3570 // if ( !FacePoint( iFace, testPar, testCoord ))
3571 // RETURN_BAD_RESULT("TEST FacePoint() FAILED");
3572 // SHOWYXZ("IN TEST PARAM" , testPar);
3573 // SHOWYXZ("OUT TEST CORD" , testCoord);
3574 // if ( !ComputeParameters( testCoord, testPar , iFace))
3575 // RETURN_BAD_RESULT("TEST ComputeParameters() FAILED");
3576 // SHOWYXZ("OUT TEST PARAM" , testPar);
3581 //================================================================================
3583 * \brief Return pointer to column of nodes
3584 * \param node - bottom node from which the returned column goes up
3585 * \retval const TNodeColumn* - the found column
3587 //================================================================================
3589 const TNodeColumn* StdMeshers_PrismAsBlock::GetNodeColumn(const SMDS_MeshNode* node) const
3591 int sID = node->getshapeId();
3593 map<int, pair< TParam2ColumnMap*, bool > >::const_iterator col_frw =
3594 myShapeIndex2ColumnMap.find( sID );
3595 if ( col_frw != myShapeIndex2ColumnMap.end() ) {
3596 const TParam2ColumnMap* cols = col_frw->second.first;
3597 TParam2ColumnIt u_col = cols->begin();
3598 for ( ; u_col != cols->end(); ++u_col )
3599 if ( u_col->second[ 0 ] == node )
3600 return & u_col->second;
3605 //=======================================================================
3606 //function : GetLayersTransformation
3607 //purpose : Return transformations to get coordinates of nodes of each layer
3608 // by nodes of the bottom. Layer is a set of nodes at a certain step
3609 // from bottom to top.
3610 // Transformation to get top node from bottom ones is computed
3611 // only if the top FACE is not meshed.
3612 //=======================================================================
3614 bool StdMeshers_PrismAsBlock::GetLayersTransformation(vector<gp_Trsf> & trsf,
3615 const Prism_3D::TPrismTopo& prism) const
3617 const bool itTopMeshed = !SubMesh( ID_BOT_FACE )->IsEmpty();
3618 const int zSize = VerticalSize();
3619 if ( zSize < 3 && !itTopMeshed ) return true;
3620 trsf.resize( zSize - 1 );
3622 // Select some node columns by which we will define coordinate system of layers
3624 vector< const TNodeColumn* > columns;
3627 list< TopoDS_Edge >::const_iterator edgeIt = prism.myBottomEdges.begin();
3628 for ( int iE = 0; iE < prism.myNbEdgesInWires.front(); ++iE, ++edgeIt )
3630 if ( SMESH_Algo::isDegenerated( *edgeIt )) continue;
3631 const TParam2ColumnMap* u2colMap =
3632 GetParam2ColumnMap( MeshDS()->ShapeToIndex( *edgeIt ), isReverse );
3633 if ( !u2colMap ) return false;
3634 double f = u2colMap->begin()->first, l = u2colMap->rbegin()->first;
3635 //isReverse = ( edgeIt->Orientation() == TopAbs_REVERSED );
3636 //if ( isReverse ) swap ( f, l ); -- u2colMap takes orientation into account
3637 const int nbCol = 5;
3638 for ( int i = 0; i < nbCol; ++i )
3640 double u = f + i/double(nbCol) * ( l - f );
3641 const TNodeColumn* col = & getColumn( u2colMap, u )->second;
3642 if ( columns.empty() || col != columns.back() )
3643 columns.push_back( col );
3648 // Find tolerance to check transformations
3653 for ( size_t i = 0; i < columns.size(); ++i )
3654 bndBox.Add( gpXYZ( columns[i]->front() ));
3655 tol2 = bndBox.SquareExtent() * 1e-5;
3658 // Compute transformations
3661 gp_Trsf fromCsZ, toCs0;
3662 gp_Ax3 cs0 = getLayerCoordSys(0, columns, xCol );
3663 //double dist0 = cs0.Location().Distance( gpXYZ( (*columns[0])[0]));
3664 toCs0.SetTransformation( cs0 );
3665 for ( int z = 1; z < zSize; ++z )
3667 gp_Ax3 csZ = getLayerCoordSys(z, columns, xCol );
3668 //double distZ = csZ.Location().Distance( gpXYZ( (*columns[0])[z]));
3669 fromCsZ.SetTransformation( csZ );
3671 gp_Trsf& t = trsf[ z-1 ];
3672 t = fromCsZ * toCs0;
3673 //t.SetScaleFactor( distZ/dist0 ); - it does not work properly, wrong base point
3675 // check a transformation
3676 for ( size_t i = 0; i < columns.size(); ++i )
3678 gp_Pnt p0 = gpXYZ( (*columns[i])[0] );
3679 gp_Pnt pz = gpXYZ( (*columns[i])[z] );
3680 t.Transforms( p0.ChangeCoord() );
3681 if ( p0.SquareDistance( pz ) > tol2 )
3684 return ( z == zSize - 1 ); // OK if fails only botton->top trsf
3691 //================================================================================
3693 * \brief Check curve orientation of a bootom edge
3694 * \param meshDS - mesh DS
3695 * \param columnsMap - node columns map of side face
3696 * \param bottomEdge - the bootom edge
3697 * \param sideFaceID - side face in-block ID
3698 * \retval bool - true if orientation coinside with in-block forward orientation
3700 //================================================================================
3702 bool StdMeshers_PrismAsBlock::IsForwardEdge(SMESHDS_Mesh* meshDS,
3703 const TParam2ColumnMap& columnsMap,
3704 const TopoDS_Edge & bottomEdge,
3705 const int sideFaceID)
3707 bool isForward = false;
3708 if ( SMESH_MesherHelper::IsClosedEdge( bottomEdge ))
3710 isForward = ( bottomEdge.Orientation() == TopAbs_FORWARD );
3714 const TNodeColumn& firstCol = columnsMap.begin()->second;
3715 const SMDS_MeshNode* bottomNode = firstCol[0];
3716 TopoDS_Shape firstVertex = SMESH_MesherHelper::GetSubShapeByNode( bottomNode, meshDS );
3717 isForward = ( firstVertex.IsSame( TopExp::FirstVertex( bottomEdge, true )));
3719 // on 2 of 4 sides first vertex is end
3720 if ( sideFaceID == ID_Fx1z || sideFaceID == ID_F0yz )
3721 isForward = !isForward;
3725 //=======================================================================
3726 //function : faceGridToPythonDump
3727 //purpose : Prints a script creating a normal grid on the prism side
3728 //=======================================================================
3730 void StdMeshers_PrismAsBlock::faceGridToPythonDump(const SMESH_Block::TShapeID face,
3734 gp_XYZ pOnF[6] = { gp_XYZ(0,0,0), gp_XYZ(0,0,1),
3735 gp_XYZ(0,0,0), gp_XYZ(0,1,0),
3736 gp_XYZ(0,0,0), gp_XYZ(1,0,0) };
3738 cout << "mesh = smesh.Mesh( 'Face " << face << "')" << endl;
3739 SMESH_Block::TFace& f = myFace[ face - ID_FirstF ];
3740 gp_XYZ params = pOnF[ face - ID_FirstF ];
3741 //const int nb = 10; // nb face rows
3742 for ( int j = 0; j <= nb; ++j )
3744 params.SetCoord( f.GetVInd(), double( j )/ nb );
3745 for ( int i = 0; i <= nb; ++i )
3747 params.SetCoord( f.GetUInd(), double( i )/ nb );
3748 gp_XYZ p = f.Point( params );
3749 gp_XY uv = f.GetUV( params );
3750 cout << "mesh.AddNode( " << p.X() << ", " << p.Y() << ", " << p.Z() << " )"
3751 << " # " << 1 + i + j * ( nb + 1 )
3752 << " ( " << i << ", " << j << " ) "
3753 << " UV( " << uv.X() << ", " << uv.Y() << " )" << endl;
3754 ShellPoint( params, p2 );
3755 double dist = ( p2 - p ).Modulus();
3757 cout << "#### dist from ShellPoint " << dist
3758 << " (" << p2.X() << ", " << p2.Y() << ", " << p2.Z() << " ) " << endl;
3761 for ( int j = 0; j < nb; ++j )
3762 for ( int i = 0; i < nb; ++i )
3764 int n = 1 + i + j * ( nb + 1 );
3765 cout << "mesh.AddFace([ "
3766 << n << ", " << n+1 << ", "
3767 << n+nb+2 << ", " << n+nb+1 << "]) " << endl;
3773 //================================================================================
3775 * \brief Constructor
3776 * \param faceID - in-block ID
3777 * \param face - geom FACE
3778 * \param baseEdge - EDGE proreply oriented in the bottom EDGE !!!
3779 * \param columnsMap - map of node columns
3780 * \param first - first normalized param
3781 * \param last - last normalized param
3783 //================================================================================
3785 StdMeshers_PrismAsBlock::TSideFace::TSideFace(SMESH_Mesh& mesh,
3787 const Prism_3D::TQuadList& quadList,
3788 const TopoDS_Edge& baseEdge,
3789 TParam2ColumnMap* columnsMap,
3793 myParamToColumnMap( columnsMap ),
3796 myParams.resize( 1 );
3797 myParams[ 0 ] = make_pair( first, last );
3798 mySurface = PSurface( new BRepAdaptor_Surface( quadList.front()->face ));
3799 myBaseEdge = baseEdge;
3800 myIsForward = StdMeshers_PrismAsBlock::IsForwardEdge( myHelper.GetMeshDS(),
3801 *myParamToColumnMap,
3803 myHelper.SetSubShape( quadList.front()->face );
3805 if ( quadList.size() > 1 ) // side is vertically composite
3807 // fill myShapeID2Surf map to enable finding a right surface by any sub-shape ID
3809 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
3811 TopTools_IndexedDataMapOfShapeListOfShape subToFaces;
3812 Prism_3D::TQuadList::const_iterator quad = quadList.begin();
3813 for ( ; quad != quadList.end(); ++quad )
3815 const TopoDS_Face& face = (*quad)->face;
3816 TopExp::MapShapesAndAncestors( face, TopAbs_VERTEX, TopAbs_FACE, subToFaces );
3817 TopExp::MapShapesAndAncestors( face, TopAbs_EDGE, TopAbs_FACE, subToFaces );
3818 myShapeID2Surf.insert( make_pair( meshDS->ShapeToIndex( face ),
3819 PSurface( new BRepAdaptor_Surface( face ))));
3821 for ( int i = 1; i <= subToFaces.Extent(); ++i )
3823 const TopoDS_Shape& sub = subToFaces.FindKey( i );
3824 TopTools_ListOfShape& faces = subToFaces( i );
3825 int subID = meshDS->ShapeToIndex( sub );
3826 int faceID = meshDS->ShapeToIndex( faces.First() );
3827 myShapeID2Surf.insert ( make_pair( subID, myShapeID2Surf[ faceID ]));
3832 //================================================================================
3834 * \brief Constructor of a complex side face
3836 //================================================================================
3838 StdMeshers_PrismAsBlock::TSideFace::
3839 TSideFace(SMESH_Mesh& mesh,
3840 const vector< TSideFace* >& components,
3841 const vector< pair< double, double> > & params)
3842 :myID( components[0] ? components[0]->myID : 0 ),
3843 myParamToColumnMap( 0 ),
3845 myIsForward( true ),
3846 myComponents( components ),
3849 if ( myID == ID_Fx1z || myID == ID_F0yz )
3851 // reverse components
3852 std::reverse( myComponents.begin(), myComponents.end() );
3853 std::reverse( myParams.begin(), myParams.end() );
3854 for ( size_t i = 0; i < myParams.size(); ++i )
3856 const double f = myParams[i].first;
3857 const double l = myParams[i].second;
3858 myParams[i] = make_pair( 1. - l, 1. - f );
3862 //================================================================================
3864 * \brief Copy constructor
3865 * \param other - other side
3867 //================================================================================
3869 StdMeshers_PrismAsBlock::TSideFace::TSideFace( const TSideFace& other ):
3870 myID ( other.myID ),
3871 myParamToColumnMap ( other.myParamToColumnMap ),
3872 mySurface ( other.mySurface ),
3873 myBaseEdge ( other.myBaseEdge ),
3874 myShapeID2Surf ( other.myShapeID2Surf ),
3875 myParams ( other.myParams ),
3876 myIsForward ( other.myIsForward ),
3877 myComponents ( other.myComponents.size() ),
3878 myHelper ( *other.myHelper.GetMesh() )
3880 for ( size_t i = 0 ; i < myComponents.size(); ++i )
3881 myComponents[ i ] = new TSideFace( *other.myComponents[ i ]);
3884 //================================================================================
3886 * \brief Deletes myComponents
3888 //================================================================================
3890 StdMeshers_PrismAsBlock::TSideFace::~TSideFace()
3892 for ( size_t i = 0 ; i < myComponents.size(); ++i )
3893 if ( myComponents[ i ] )
3894 delete myComponents[ i ];
3897 //================================================================================
3899 * \brief Return geometry of the vertical curve
3900 * \param isMax - true means curve located closer to (1,1,1) block point
3901 * \retval Adaptor3d_Curve* - curve adaptor
3903 //================================================================================
3905 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::VertiCurve(const bool isMax) const
3907 if ( !myComponents.empty() ) {
3909 return myComponents.back()->VertiCurve(isMax);
3911 return myComponents.front()->VertiCurve(isMax);
3913 double f = myParams[0].first, l = myParams[0].second;
3914 if ( !myIsForward ) std::swap( f, l );
3915 return new TVerticalEdgeAdaptor( myParamToColumnMap, isMax ? l : f );
3918 //================================================================================
3920 * \brief Return geometry of the top or bottom curve
3922 * \retval Adaptor3d_Curve* -
3924 //================================================================================
3926 Adaptor3d_Curve* StdMeshers_PrismAsBlock::TSideFace::HorizCurve(const bool isTop) const
3928 return new THorizontalEdgeAdaptor( this, isTop );
3931 //================================================================================
3933 * \brief Return pcurves
3934 * \param pcurv - array of 4 pcurves
3935 * \retval bool - is a success
3937 //================================================================================
3939 bool StdMeshers_PrismAsBlock::TSideFace::GetPCurves(Adaptor2d_Curve2d* pcurv[4]) const
3941 int iEdge[ 4 ] = { BOTTOM_EDGE, TOP_EDGE, V0_EDGE, V1_EDGE };
3943 for ( int i = 0 ; i < 4 ; ++i ) {
3944 Handle(Geom2d_Line) line;
3945 switch ( iEdge[ i ] ) {
3947 line = new Geom2d_Line( gp_Pnt2d( 0, 1 ), gp::DX2d() ); break;
3949 line = new Geom2d_Line( gp::Origin2d(), gp::DX2d() ); break;
3951 line = new Geom2d_Line( gp::Origin2d(), gp::DY2d() ); break;
3953 line = new Geom2d_Line( gp_Pnt2d( 1, 0 ), gp::DY2d() ); break;
3955 pcurv[ i ] = new Geom2dAdaptor_Curve( line, 0, 1 );
3960 //================================================================================
3962 * \brief Returns geometry of pcurve on a horizontal face
3963 * \param isTop - is top or bottom face
3964 * \param horFace - a horizontal face
3965 * \retval Adaptor2d_Curve2d* - curve adaptor
3967 //================================================================================
3970 StdMeshers_PrismAsBlock::TSideFace::HorizPCurve(const bool isTop,
3971 const TopoDS_Face& horFace) const
3973 return new TPCurveOnHorFaceAdaptor( this, isTop, horFace );
3976 //================================================================================
3978 * \brief Return a component corresponding to parameter
3979 * \param U - parameter along a horizontal size
3980 * \param localU - parameter along a horizontal size of a component
3981 * \retval TSideFace* - found component
3983 //================================================================================
3985 StdMeshers_PrismAsBlock::TSideFace*
3986 StdMeshers_PrismAsBlock::TSideFace::GetComponent(const double U,double & localU) const
3989 if ( myComponents.empty() )
3990 return const_cast<TSideFace*>( this );
3993 for ( i = 0; i < myComponents.size(); ++i )
3994 if ( U < myParams[ i ].second )
3996 if ( i >= myComponents.size() )
3997 i = myComponents.size() - 1;
3999 double f = myParams[ i ].first, l = myParams[ i ].second;
4000 localU = ( U - f ) / ( l - f );
4001 return myComponents[ i ];
4004 //================================================================================
4006 * \brief Find node columns for a parameter
4007 * \param U - parameter along a horizontal edge
4008 * \param col1 - the 1st found column
4009 * \param col2 - the 2nd found column
4010 * \retval r - normalized position of U between the found columns
4012 //================================================================================
4014 double StdMeshers_PrismAsBlock::TSideFace::GetColumns(const double U,
4015 TParam2ColumnIt & col1,
4016 TParam2ColumnIt & col2) const
4018 double u = U, r = 0;
4019 if ( !myComponents.empty() ) {
4020 TSideFace * comp = GetComponent(U,u);
4021 return comp->GetColumns( u, col1, col2 );
4026 double f = myParams[0].first, l = myParams[0].second;
4027 u = f + u * ( l - f );
4029 col1 = col2 = getColumn( myParamToColumnMap, u );
4030 if ( ++col2 == myParamToColumnMap->end() ) {
4035 double uf = col1->first;
4036 double ul = col2->first;
4037 r = ( u - uf ) / ( ul - uf );
4042 //================================================================================
4044 * \brief Return all nodes at a given height together with their normalized parameters
4045 * \param [in] Z - the height of interest
4046 * \param [out] nodes - map of parameter to node
4048 //================================================================================
4050 void StdMeshers_PrismAsBlock::
4051 TSideFace::GetNodesAtZ(const int Z,
4052 map<double, const SMDS_MeshNode* >& nodes ) const
4054 if ( !myComponents.empty() )
4057 for ( size_t i = 0; i < myComponents.size(); ++i )
4059 map<double, const SMDS_MeshNode* > nn;
4060 myComponents[i]->GetNodesAtZ( Z, nn );
4061 map<double, const SMDS_MeshNode* >::iterator u2n = nn.begin();
4062 if ( !nodes.empty() && nodes.rbegin()->second == u2n->second )
4064 const double uRange = myParams[i].second - myParams[i].first;
4065 for ( ; u2n != nn.end(); ++u2n )
4066 nodes.insert( nodes.end(), make_pair( u0 + uRange * u2n->first, u2n->second ));
4072 double f = myParams[0].first, l = myParams[0].second;
4075 const double uRange = l - f;
4076 if ( Abs( uRange ) < std::numeric_limits<double>::min() )
4078 TParam2ColumnIt u2col = getColumn( myParamToColumnMap, myParams[0].first + 1e-3 );
4079 for ( ; u2col != myParamToColumnMap->end(); ++u2col )
4080 if ( u2col->first > myParams[0].second + 1e-9 )
4083 nodes.insert( nodes.end(),
4084 make_pair( ( u2col->first - f ) / uRange, u2col->second[ Z ] ));
4088 //================================================================================
4090 * \brief Return coordinates by normalized params
4091 * \param U - horizontal param
4092 * \param V - vertical param
4093 * \retval gp_Pnt - result point
4095 //================================================================================
4097 gp_Pnt StdMeshers_PrismAsBlock::TSideFace::Value(const Standard_Real U,
4098 const Standard_Real V) const
4100 if ( !myComponents.empty() ) {
4102 TSideFace * comp = GetComponent(U,u);
4103 return comp->Value( u, V );
4106 TParam2ColumnIt u_col1, u_col2;
4107 double vR, hR = GetColumns( U, u_col1, u_col2 );
4109 const SMDS_MeshNode* nn[4];
4111 // BEGIN issue 0020680: Bad cell created by Radial prism in center of torus
4112 // Workaround for a wrongly located point returned by mySurface.Value() for
4113 // UV located near boundary of BSpline surface.
4114 // To bypass the problem, we take point from 3D curve of EDGE.
4115 // It solves pb of the bloc_fiss_new.py
4116 const double tol = 1e-3;
4117 if ( V < tol || V+tol >= 1. )
4119 nn[0] = V < tol ? u_col1->second.front() : u_col1->second.back();
4120 nn[2] = V < tol ? u_col2->second.front() : u_col2->second.back();
4128 TopoDS_Shape s = myHelper.GetSubShapeByNode( nn[0], myHelper.GetMeshDS() );
4129 if ( s.ShapeType() != TopAbs_EDGE )
4130 s = myHelper.GetSubShapeByNode( nn[2], myHelper.GetMeshDS() );
4131 if ( !s.IsNull() && s.ShapeType() == TopAbs_EDGE )
4132 edge = TopoDS::Edge( s );
4134 if ( !edge.IsNull() )
4136 double u1 = myHelper.GetNodeU( edge, nn[0], nn[2] );
4137 double u3 = myHelper.GetNodeU( edge, nn[2], nn[0] );
4138 double u = u1 * ( 1 - hR ) + u3 * hR;
4139 TopLoc_Location loc; double f,l;
4140 Handle(Geom_Curve) curve = BRep_Tool::Curve( edge,loc,f,l );
4141 return curve->Value( u ).Transformed( loc );
4144 // END issue 0020680: Bad cell created by Radial prism in center of torus
4146 vR = getRAndNodes( & u_col1->second, V, nn[0], nn[1] );
4147 vR = getRAndNodes( & u_col2->second, V, nn[2], nn[3] );
4149 if ( !myShapeID2Surf.empty() ) // side is vertically composite
4151 // find a FACE on which the 4 nodes lie
4152 TSideFace* me = (TSideFace*) this;
4153 int notFaceID1 = 0, notFaceID2 = 0;
4154 for ( int i = 0; i < 4; ++i )
4155 if ( nn[i]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE ) // node on FACE
4157 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4161 else if ( notFaceID1 == 0 ) // node on EDGE or VERTEX
4163 me->mySurface = me->myShapeID2Surf[ nn[i]->getshapeId() ];
4164 notFaceID1 = nn[i]->getshapeId();
4166 else if ( notFaceID1 != nn[i]->getshapeId() ) // node on other EDGE or VERTEX
4168 if ( mySurface != me->myShapeID2Surf[ nn[i]->getshapeId() ])
4169 notFaceID2 = nn[i]->getshapeId();
4171 if ( notFaceID2 ) // no nodes of FACE and nodes are on different FACEs
4173 SMESHDS_Mesh* meshDS = myHelper.GetMeshDS();
4174 TopoDS_Shape face = myHelper.GetCommonAncestor( meshDS->IndexToShape( notFaceID1 ),
4175 meshDS->IndexToShape( notFaceID2 ),
4176 *myHelper.GetMesh(),
4178 if ( face.IsNull() )
4179 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() face.IsNull()");
4180 int faceID = meshDS->ShapeToIndex( face );
4181 me->mySurface = me->myShapeID2Surf[ faceID ];
4183 throw SALOME_Exception("StdMeshers_PrismAsBlock::TSideFace::Value() !mySurface");
4186 ((TSideFace*) this)->myHelper.SetSubShape( mySurface->Face() );
4188 gp_XY uv1 = myHelper.GetNodeUV( mySurface->Face(), nn[0], nn[2]);
4189 gp_XY uv2 = myHelper.GetNodeUV( mySurface->Face(), nn[1], nn[3]);
4190 gp_XY uv12 = uv1 * ( 1 - vR ) + uv2 * vR;
4192 gp_XY uv3 = myHelper.GetNodeUV( mySurface->Face(), nn[2], nn[0]);
4193 gp_XY uv4 = myHelper.GetNodeUV( mySurface->Face(), nn[3], nn[1]);
4194 gp_XY uv34 = uv3 * ( 1 - vR ) + uv4 * vR;
4196 gp_XY uv = uv12 * ( 1 - hR ) + uv34 * hR;
4198 gp_Pnt p = mySurface->Value( uv.X(), uv.Y() );
4203 //================================================================================
4205 * \brief Return boundary edge
4206 * \param edge - edge index
4207 * \retval TopoDS_Edge - found edge
4209 //================================================================================
4211 TopoDS_Edge StdMeshers_PrismAsBlock::TSideFace::GetEdge(const int iEdge) const
4213 if ( !myComponents.empty() ) {
4215 case V0_EDGE : return myComponents.front()->GetEdge( iEdge );
4216 case V1_EDGE : return myComponents.back() ->GetEdge( iEdge );
4217 default: return TopoDS_Edge();
4221 const SMDS_MeshNode* node = 0;
4222 SMESHDS_Mesh * meshDS = myHelper.GetMesh()->GetMeshDS();
4223 TNodeColumn* column;
4228 column = & (( ++myParamToColumnMap->begin())->second );
4229 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4230 edge = myHelper.GetSubShapeByNode ( node, meshDS );
4231 if ( edge.ShapeType() == TopAbs_VERTEX ) {
4232 column = & ( myParamToColumnMap->begin()->second );
4233 node = ( iEdge == TOP_EDGE ) ? column->back() : column->front();
4238 bool back = ( iEdge == V1_EDGE );
4239 if ( !myIsForward ) back = !back;
4241 column = & ( myParamToColumnMap->rbegin()->second );
4243 column = & ( myParamToColumnMap->begin()->second );
4244 if ( column->size() > 0 )
4245 edge = myHelper.GetSubShapeByNode( (*column)[ 1 ], meshDS );
4246 if ( edge.IsNull() || edge.ShapeType() == TopAbs_VERTEX )
4247 node = column->front();
4252 if ( !edge.IsNull() && edge.ShapeType() == TopAbs_EDGE )
4253 return TopoDS::Edge( edge );
4255 // find edge by 2 vertices
4256 TopoDS_Shape V1 = edge;
4257 TopoDS_Shape V2 = myHelper.GetSubShapeByNode( node, meshDS );
4258 if ( !V2.IsNull() && V2.ShapeType() == TopAbs_VERTEX && !V2.IsSame( V1 ))
4260 TopoDS_Shape ancestor = myHelper.GetCommonAncestor( V1, V2, *myHelper.GetMesh(), TopAbs_EDGE);
4261 if ( !ancestor.IsNull() )
4262 return TopoDS::Edge( ancestor );
4264 return TopoDS_Edge();
4267 //================================================================================
4269 * \brief Fill block sub-shapes
4270 * \param shapeMap - map to fill in
4271 * \retval int - nb inserted sub-shapes
4273 //================================================================================
4275 int StdMeshers_PrismAsBlock::TSideFace::InsertSubShapes(TBlockShapes& shapeMap) const
4280 vector< int > edgeIdVec;
4281 SMESH_Block::GetFaceEdgesIDs( myID, edgeIdVec );
4283 for ( int i = BOTTOM_EDGE; i <=V1_EDGE ; ++i ) {
4284 TopoDS_Edge e = GetEdge( i );
4285 if ( !e.IsNull() ) {
4286 nbInserted += SMESH_Block::Insert( e, edgeIdVec[ i ], shapeMap);
4290 // Insert corner vertices
4292 TParam2ColumnIt col1, col2 ;
4293 vector< int > vertIdVec;
4296 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V0_EDGE ], vertIdVec);
4297 GetColumns(0, col1, col2 );
4298 const SMDS_MeshNode* node0 = col1->second.front();
4299 const SMDS_MeshNode* node1 = col1->second.back();
4300 TopoDS_Shape v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4301 TopoDS_Shape v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4302 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4303 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4305 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4306 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4310 SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ V1_EDGE ], vertIdVec);
4311 GetColumns(1, col1, col2 );
4312 node0 = col2->second.front();
4313 node1 = col2->second.back();
4314 v0 = myHelper.GetSubShapeByNode( node0, myHelper.GetMeshDS());
4315 v1 = myHelper.GetSubShapeByNode( node1, myHelper.GetMeshDS());
4316 if ( v0.ShapeType() == TopAbs_VERTEX ) {
4317 nbInserted += SMESH_Block::Insert( v0, vertIdVec[ 0 ], shapeMap);
4319 if ( v1.ShapeType() == TopAbs_VERTEX ) {
4320 nbInserted += SMESH_Block::Insert( v1, vertIdVec[ 1 ], shapeMap);
4323 // TopoDS_Vertex V0, V1, Vcom;
4324 // TopExp::Vertices( myBaseEdge, V0, V1, true );
4325 // if ( !myIsForward ) std::swap( V0, V1 );
4327 // // bottom vertex IDs
4328 // SMESH_Block::GetEdgeVertexIDs( edgeIdVec[ _u0 ], vertIdVec);
4329 // SMESH_Block::Insert( V0, vertIdVec[ 0 ], shapeMap);
4330 // SMESH_Block::Insert( V1, vertIdVec[ 1 ], shapeMap);
4332 // TopoDS_Edge sideEdge = GetEdge( V0_EDGE );
4333 // if ( sideEdge.IsNull() || !TopExp::CommonVertex( botEdge, sideEdge, Vcom ))
4336 // // insert one side edge
4338 // if ( Vcom.IsSame( V0 )) edgeID = edgeIdVec[ _v0 ];
4339 // else edgeID = edgeIdVec[ _v1 ];
4340 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4342 // // top vertex of the side edge
4343 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec);
4344 // TopoDS_Vertex Vtop = TopExp::FirstVertex( sideEdge );
4345 // if ( Vcom.IsSame( Vtop ))
4346 // Vtop = TopExp::LastVertex( sideEdge );
4347 // SMESH_Block::Insert( Vtop, vertIdVec[ 1 ], shapeMap);
4349 // // other side edge
4350 // sideEdge = GetEdge( V1_EDGE );
4351 // if ( sideEdge.IsNull() )
4353 // if ( edgeID = edgeIdVec[ _v1 ]) edgeID = edgeIdVec[ _v0 ];
4354 // else edgeID = edgeIdVec[ _v1 ];
4355 // SMESH_Block::Insert( sideEdge, edgeID, shapeMap);
4358 // TopoDS_Edge topEdge = GetEdge( TOP_EDGE );
4359 // SMESH_Block::Insert( topEdge, edgeIdVec[ _u1 ], shapeMap);
4361 // // top vertex of the other side edge
4362 // if ( !TopExp::CommonVertex( topEdge, sideEdge, Vcom ))
4364 // SMESH_Block::GetEdgeVertexIDs( edgeID, vertIdVec );
4365 // SMESH_Block::Insert( Vcom, vertIdVec[ 1 ], shapeMap);
4370 //================================================================================
4372 * \brief Dump ids of nodes of sides
4374 //================================================================================
4376 void StdMeshers_PrismAsBlock::TSideFace::dumpNodes(int nbNodes) const
4379 cout << endl << "NODES OF FACE "; SMESH_Block::DumpShapeID( myID, cout ) << endl;
4380 THorizontalEdgeAdaptor* hSize0 = (THorizontalEdgeAdaptor*) HorizCurve(0);
4381 cout << "Horiz side 0: "; hSize0->dumpNodes(nbNodes); cout << endl;
4382 THorizontalEdgeAdaptor* hSize1 = (THorizontalEdgeAdaptor*) HorizCurve(1);
4383 cout << "Horiz side 1: "; hSize1->dumpNodes(nbNodes); cout << endl;
4384 TVerticalEdgeAdaptor* vSide0 = (TVerticalEdgeAdaptor*) VertiCurve(0);
4385 cout << "Verti side 0: "; vSide0->dumpNodes(nbNodes); cout << endl;
4386 TVerticalEdgeAdaptor* vSide1 = (TVerticalEdgeAdaptor*) VertiCurve(1);
4387 cout << "Verti side 1: "; vSide1->dumpNodes(nbNodes); cout << endl;
4388 delete hSize0; delete hSize1; delete vSide0; delete vSide1;
4392 //================================================================================
4394 * \brief Creates TVerticalEdgeAdaptor
4395 * \param columnsMap - node column map
4396 * \param parameter - normalized parameter
4398 //================================================================================
4400 StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::
4401 TVerticalEdgeAdaptor( const TParam2ColumnMap* columnsMap, const double parameter)
4403 myNodeColumn = & getColumn( columnsMap, parameter )->second;
4406 //================================================================================
4408 * \brief Return coordinates for the given normalized parameter
4409 * \param U - normalized parameter
4410 * \retval gp_Pnt - coordinates
4412 //================================================================================
4414 gp_Pnt StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::Value(const Standard_Real U) const
4416 const SMDS_MeshNode* n1;
4417 const SMDS_MeshNode* n2;
4418 double r = getRAndNodes( myNodeColumn, U, n1, n2 );
4419 return gpXYZ(n1) * ( 1 - r ) + gpXYZ(n2) * r;
4422 //================================================================================
4424 * \brief Dump ids of nodes
4426 //================================================================================
4428 void StdMeshers_PrismAsBlock::TVerticalEdgeAdaptor::dumpNodes(int nbNodes) const
4431 for ( int i = 0; i < nbNodes && i < (int)myNodeColumn->size(); ++i )
4432 cout << (*myNodeColumn)[i]->GetID() << " ";
4433 if ( nbNodes < (int) myNodeColumn->size() )
4434 cout << myNodeColumn->back()->GetID();
4438 //================================================================================
4440 * \brief Return coordinates for the given normalized parameter
4441 * \param U - normalized parameter
4442 * \retval gp_Pnt - coordinates
4444 //================================================================================
4446 gp_Pnt StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::Value(const Standard_Real U) const
4448 return mySide->TSideFace::Value( U, myV );
4451 //================================================================================
4453 * \brief Dump ids of <nbNodes> first nodes and the last one
4455 //================================================================================
4457 void StdMeshers_PrismAsBlock::THorizontalEdgeAdaptor::dumpNodes(int nbNodes) const
4460 // Not bedugged code. Last node is sometimes incorrect
4461 const TSideFace* side = mySide;
4463 if ( mySide->IsComplex() )
4464 side = mySide->GetComponent(0,u);
4466 TParam2ColumnIt col, col2;
4467 TParam2ColumnMap* u2cols = side->GetColumns();
4468 side->GetColumns( u , col, col2 );
4470 int j, i = myV ? mySide->ColumnHeight()-1 : 0;
4472 const SMDS_MeshNode* n = 0;
4473 const SMDS_MeshNode* lastN
4474 = side->IsForward() ? u2cols->rbegin()->second[ i ] : u2cols->begin()->second[ i ];
4475 for ( j = 0; j < nbNodes && n != lastN; ++j )
4477 n = col->second[ i ];
4478 cout << n->GetID() << " ";
4479 if ( side->IsForward() )
4487 if ( mySide->IsComplex() )
4488 side = mySide->GetComponent(1,u);
4490 side->GetColumns( u , col, col2 );
4491 if ( n != col->second[ i ] )
4492 cout << col->second[ i ]->GetID();
4496 //================================================================================
4498 * \brief Costructor of TPCurveOnHorFaceAdaptor fills its map of
4499 * normalized parameter to node UV on a horizontal face
4500 * \param [in] sideFace - lateral prism side
4501 * \param [in] isTop - is \a horFace top or bottom of the prism
4502 * \param [in] horFace - top or bottom face of the prism
4504 //================================================================================
4506 StdMeshers_PrismAsBlock::
4507 TPCurveOnHorFaceAdaptor::TPCurveOnHorFaceAdaptor( const TSideFace* sideFace,
4509 const TopoDS_Face& horFace)
4511 if ( sideFace && !horFace.IsNull() )
4513 //cout << "\n\t FACE " << sideFace->FaceID() << endl;
4514 const int Z = isTop ? sideFace->ColumnHeight() - 1 : 0;
4515 map<double, const SMDS_MeshNode* > u2nodes;
4516 sideFace->GetNodesAtZ( Z, u2nodes );
4517 if ( u2nodes.empty() )
4520 SMESH_MesherHelper helper( *sideFace->GetMesh() );
4521 helper.SetSubShape( horFace );
4526 Handle(Geom2d_Curve) C2d;
4528 const double tol = 10 * helper.MaxTolerance( horFace );
4529 const SMDS_MeshNode* prevNode = u2nodes.rbegin()->second;
4531 map<double, const SMDS_MeshNode* >::iterator u2n = u2nodes.begin();
4532 for ( ; u2n != u2nodes.end(); ++u2n )
4534 const SMDS_MeshNode* n = u2n->second;
4536 if ( n->GetPosition()->GetTypeOfPosition() == SMDS_TOP_EDGE )
4538 if ( n->getshapeId() != edgeID )
4541 edgeID = n->getshapeId();
4542 TopoDS_Shape S = helper.GetSubShapeByNode( n, helper.GetMeshDS() );
4543 if ( !S.IsNull() && S.ShapeType() == TopAbs_EDGE )
4545 C2d = BRep_Tool::CurveOnSurface( TopoDS::Edge( S ), horFace, f,l );
4548 if ( !C2d.IsNull() )
4550 double u = static_cast< const SMDS_EdgePosition* >( n->GetPosition() )->GetUParameter();
4551 if ( f <= u && u <= l )
4553 uv = C2d->Value( u ).XY();
4554 okUV = helper.CheckNodeUV( horFace, n, uv, tol );
4559 uv = helper.GetNodeUV( horFace, n, prevNode, &okUV );
4561 myUVmap.insert( myUVmap.end(), make_pair( u2n->first, uv ));
4562 // cout << n->getshapeId() << " N " << n->GetID()
4563 // << " \t" << uv.X() << ", " << uv.Y() << " \t" << u2n->first << endl;
4570 //================================================================================
4572 * \brief Return UV on pcurve for the given normalized parameter
4573 * \param U - normalized parameter
4574 * \retval gp_Pnt - coordinates
4576 //================================================================================
4578 gp_Pnt2d StdMeshers_PrismAsBlock::TPCurveOnHorFaceAdaptor::Value(const Standard_Real U) const
4580 map< double, gp_XY >::const_iterator i1 = myUVmap.upper_bound( U );
4582 if ( i1 == myUVmap.end() )
4583 return myUVmap.empty() ? gp_XY(0,0) : myUVmap.rbegin()->second;
4585 if ( i1 == myUVmap.begin() )
4586 return (*i1).second;
4588 map< double, gp_XY >::const_iterator i2 = i1--;
4590 double r = ( U - i1->first ) / ( i2->first - i1->first );
4591 return i1->second * ( 1 - r ) + i2->second * r;
4594 //================================================================================
4596 * \brief Projects internal nodes using transformation found by boundary nodes
4598 //================================================================================
4600 bool StdMeshers_Sweeper::projectIntPoints(const vector< gp_XYZ >& fromBndPoints,
4601 const vector< gp_XYZ >& toBndPoints,
4602 const vector< gp_XYZ >& fromIntPoints,
4603 vector< gp_XYZ >& toIntPoints,
4604 NSProjUtils::TrsfFinder3D& trsf,
4605 vector< gp_XYZ > * bndError)
4607 // find transformation
4608 if ( trsf.IsIdentity() && !trsf.Solve( fromBndPoints, toBndPoints ))
4611 // compute internal points using the found trsf
4612 for ( size_t iP = 0; iP < fromIntPoints.size(); ++iP )
4614 toIntPoints[ iP ] = trsf.Transform( fromIntPoints[ iP ]);
4617 // compute boundary error
4620 bndError->resize( fromBndPoints.size() );
4622 for ( size_t iP = 0; iP < fromBndPoints.size(); ++iP )
4624 fromTrsf = trsf.Transform( fromBndPoints[ iP ] );
4625 (*bndError)[ iP ] = toBndPoints[ iP ] - fromTrsf;
4631 //================================================================================
4633 * \brief Add boundary error to ineternal points
4635 //================================================================================
4637 void StdMeshers_Sweeper::applyBoundaryError(const vector< gp_XYZ >& bndPoints,
4638 const vector< gp_XYZ >& bndError1,
4639 const vector< gp_XYZ >& bndError2,
4641 vector< gp_XYZ >& intPoints,
4642 vector< double >& int2BndDist)
4644 // fix each internal point
4645 const double eps = 1e-100;
4646 for ( size_t iP = 0; iP < intPoints.size(); ++iP )
4648 gp_XYZ & intPnt = intPoints[ iP ];
4650 // compute distance from intPnt to each boundary node
4651 double int2BndDistSum = 0;
4652 for ( size_t iBnd = 0; iBnd < bndPoints.size(); ++iBnd )
4654 int2BndDist[ iBnd ] = 1 / (( intPnt - bndPoints[ iBnd ]).SquareModulus() + eps );
4655 int2BndDistSum += int2BndDist[ iBnd ];
4659 for ( size_t iBnd = 0; iBnd < bndPoints.size(); ++iBnd )
4661 intPnt += bndError1[ iBnd ] * ( 1 - r ) * int2BndDist[ iBnd ] / int2BndDistSum;
4662 intPnt += bndError2[ iBnd ] * r * int2BndDist[ iBnd ] / int2BndDistSum;
4667 //================================================================================
4669 * \brief Creates internal nodes of the prism
4671 //================================================================================
4673 bool StdMeshers_Sweeper::ComputeNodes( SMESH_MesherHelper& helper,
4675 const bool allowHighBndError)
4677 const size_t zSize = myBndColumns[0]->size();
4678 const size_t zSrc = 0, zTgt = zSize-1;
4679 if ( zSize < 3 ) return true;
4681 vector< vector< gp_XYZ > > intPntsOfLayer( zSize ); // node coodinates to compute
4682 // set coordinates of src and tgt nodes
4683 for ( size_t z = 0; z < intPntsOfLayer.size(); ++z )
4684 intPntsOfLayer[ z ].resize( myIntColumns.size() );
4685 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4687 intPntsOfLayer[ zSrc ][ iP ] = intPoint( iP, zSrc );
4688 intPntsOfLayer[ zTgt ][ iP ] = intPoint( iP, zTgt );
4691 // compute coordinates of internal nodes by projecting (transfroming) src and tgt
4692 // nodes towards the central layer
4694 vector< NSProjUtils::TrsfFinder3D > trsfOfLayer( zSize );
4695 vector< vector< gp_XYZ > > bndError( zSize );
4697 // boundary points used to compute an affine transformation from a layer to a next one
4698 vector< gp_XYZ > fromSrcBndPnts( myBndColumns.size() ), fromTgtBndPnts( myBndColumns.size() );
4699 vector< gp_XYZ > toSrcBndPnts ( myBndColumns.size() ), toTgtBndPnts ( myBndColumns.size() );
4700 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4702 fromSrcBndPnts[ iP ] = bndPoint( iP, zSrc );
4703 fromTgtBndPnts[ iP ] = bndPoint( iP, zTgt );
4706 size_t zS = zSrc + 1;
4707 size_t zT = zTgt - 1;
4708 for ( ; zS < zT; ++zS, --zT ) // vertical loop on layers
4710 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4712 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4713 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4715 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4716 intPntsOfLayer[ zS-1 ], intPntsOfLayer[ zS ],
4717 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
4719 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4720 intPntsOfLayer[ zT+1 ], intPntsOfLayer[ zT ],
4721 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
4724 // if ( zT == zTgt - 1 )
4726 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4728 // gp_XYZ fromTrsf = trsfOfLayer [ zT+1].Transform( fromTgtBndPnts[ iP ] );
4729 // cout << "mesh.AddNode( "
4730 // << fromTrsf.X() << ", "
4731 // << fromTrsf.Y() << ", "
4732 // << fromTrsf.Z() << ") " << endl;
4734 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4735 // cout << "mesh.AddNode( "
4736 // << intPntsOfLayer[ zT ][ iP ].X() << ", "
4737 // << intPntsOfLayer[ zT ][ iP ].Y() << ", "
4738 // << intPntsOfLayer[ zT ][ iP ].Z() << ") " << endl;
4741 fromTgtBndPnts.swap( toTgtBndPnts );
4742 fromSrcBndPnts.swap( toSrcBndPnts );
4745 // Compute two projections of internal points to the central layer
4746 // in order to evaluate an error of internal points
4748 bool centerIntErrorIsSmall;
4749 vector< gp_XYZ > centerSrcIntPnts( myIntColumns.size() );
4750 vector< gp_XYZ > centerTgtIntPnts( myIntColumns.size() );
4752 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4754 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4755 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4757 if (! projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4758 intPntsOfLayer[ zS-1 ], centerSrcIntPnts,
4759 trsfOfLayer [ zS-1 ], & bndError[ zS-1 ]))
4761 if (! projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4762 intPntsOfLayer[ zT+1 ], centerTgtIntPnts,
4763 trsfOfLayer [ zT+1 ], & bndError[ zT+1 ]))
4766 // evaluate an error of internal points on the central layer
4767 centerIntErrorIsSmall = true;
4768 if ( zS == zT ) // odd zSize
4770 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
4771 centerIntErrorIsSmall =
4772 (centerSrcIntPnts[ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
4776 for ( size_t iP = 0; ( iP < myIntColumns.size() && centerIntErrorIsSmall ); ++iP )
4777 centerIntErrorIsSmall =
4778 (intPntsOfLayer[ zS-1 ][ iP ] - centerTgtIntPnts[ iP ]).SquareModulus() < tol*tol;
4781 // Evaluate an error of boundary points
4783 bool bndErrorIsSmall = true;
4784 for ( size_t iP = 0; ( iP < myBndColumns.size() && bndErrorIsSmall ); ++iP )
4786 double sumError = 0;
4787 for ( size_t z = 1; z < zS; ++z ) // loop on layers
4788 sumError += ( bndError[ z-1 ][ iP ].Modulus() +
4789 bndError[ zSize-z ][ iP ].Modulus() );
4791 bndErrorIsSmall = ( sumError < tol );
4794 if ( !bndErrorIsSmall && !allowHighBndError )
4797 // compute final points on the central layer
4798 std::vector< double > int2BndDist( myBndColumns.size() ); // work array of applyBoundaryError()
4799 double r = zS / ( zSize - 1.);
4802 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4804 intPntsOfLayer[ zS ][ iP ] =
4805 ( 1 - r ) * centerSrcIntPnts[ iP ] + r * centerTgtIntPnts[ iP ];
4807 if ( !bndErrorIsSmall )
4809 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS+1 ], r,
4810 intPntsOfLayer[ zS ], int2BndDist );
4815 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4817 intPntsOfLayer[ zS ][ iP ] =
4818 r * intPntsOfLayer[ zS ][ iP ] + ( 1 - r ) * centerSrcIntPnts[ iP ];
4819 intPntsOfLayer[ zT ][ iP ] =
4820 r * intPntsOfLayer[ zT ][ iP ] + ( 1 - r ) * centerTgtIntPnts[ iP ];
4822 if ( !bndErrorIsSmall )
4824 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS+1 ], r,
4825 intPntsOfLayer[ zS ], int2BndDist );
4826 applyBoundaryError( toTgtBndPnts, bndError[ zT+1 ], bndError[ zT-1 ], r,
4827 intPntsOfLayer[ zT ], int2BndDist );
4831 //centerIntErrorIsSmall = true;
4832 //bndErrorIsSmall = true;
4833 if ( !centerIntErrorIsSmall )
4835 // Compensate the central error; continue adding projection
4836 // by going from central layer to the source and target ones
4838 vector< gp_XYZ >& fromSrcIntPnts = centerSrcIntPnts;
4839 vector< gp_XYZ >& fromTgtIntPnts = centerTgtIntPnts;
4840 vector< gp_XYZ > toSrcIntPnts( myIntColumns.size() );
4841 vector< gp_XYZ > toTgtIntPnts( myIntColumns.size() );
4842 vector< gp_XYZ > srcBndError( myBndColumns.size() );
4843 vector< gp_XYZ > tgtBndError( myBndColumns.size() );
4845 fromTgtBndPnts.swap( toTgtBndPnts );
4846 fromSrcBndPnts.swap( toSrcBndPnts );
4848 for ( ++zS, --zT; zS < zTgt; ++zS, --zT ) // vertical loop on layers
4850 // invert transformation
4851 if ( !trsfOfLayer[ zS+1 ].Invert() )
4852 trsfOfLayer[ zS+1 ] = NSProjUtils::TrsfFinder3D(); // to recompute
4853 if ( !trsfOfLayer[ zT-1 ].Invert() )
4854 trsfOfLayer[ zT-1 ] = NSProjUtils::TrsfFinder3D();
4856 // project internal nodes and compute bnd error
4857 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4859 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4860 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4862 projectIntPoints( fromSrcBndPnts, toSrcBndPnts,
4863 fromSrcIntPnts, toSrcIntPnts,
4864 trsfOfLayer[ zS+1 ], & srcBndError );
4865 projectIntPoints( fromTgtBndPnts, toTgtBndPnts,
4866 fromTgtIntPnts, toTgtIntPnts,
4867 trsfOfLayer[ zT-1 ], & tgtBndError );
4869 // if ( zS == zTgt - 1 )
4871 // cout << "mesh2 = smesh.Mesh()" << endl;
4872 // for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4874 // gp_XYZ fromTrsf = trsfOfLayer [ zS+1].Transform( fromSrcBndPnts[ iP ] );
4875 // cout << "mesh2.AddNode( "
4876 // << fromTrsf.X() << ", "
4877 // << fromTrsf.Y() << ", "
4878 // << fromTrsf.Z() << ") " << endl;
4880 // for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4881 // cout << "mesh2.AddNode( "
4882 // << toSrcIntPnts[ iP ].X() << ", "
4883 // << toSrcIntPnts[ iP ].Y() << ", "
4884 // << toSrcIntPnts[ iP ].Z() << ") " << endl;
4887 // sum up 2 projections
4888 r = zS / ( zSize - 1.);
4889 vector< gp_XYZ >& zSIntPnts = intPntsOfLayer[ zS ];
4890 vector< gp_XYZ >& zTIntPnts = intPntsOfLayer[ zT ];
4891 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4893 zSIntPnts[ iP ] = r * zSIntPnts[ iP ] + ( 1 - r ) * toSrcIntPnts[ iP ];
4894 zTIntPnts[ iP ] = r * zTIntPnts[ iP ] + ( 1 - r ) * toTgtIntPnts[ iP ];
4897 // compensate bnd error
4898 if ( !bndErrorIsSmall )
4900 applyBoundaryError( toSrcBndPnts, srcBndError, bndError[ zS+1 ], r,
4901 intPntsOfLayer[ zS ], int2BndDist );
4902 applyBoundaryError( toTgtBndPnts, tgtBndError, bndError[ zT-1 ], r,
4903 intPntsOfLayer[ zT ], int2BndDist );
4906 fromSrcBndPnts.swap( toSrcBndPnts );
4907 fromSrcIntPnts.swap( toSrcIntPnts );
4908 fromTgtBndPnts.swap( toTgtBndPnts );
4909 fromTgtIntPnts.swap( toTgtIntPnts );
4911 } // if ( !centerIntErrorIsSmall )
4913 else if ( !bndErrorIsSmall )
4917 for ( ; zS < zT; ++zS, --zT ) // vertical loop on layers
4919 for ( size_t iP = 0; iP < myBndColumns.size(); ++iP )
4921 toSrcBndPnts[ iP ] = bndPoint( iP, zS );
4922 toTgtBndPnts[ iP ] = bndPoint( iP, zT );
4924 // compensate bnd error
4925 applyBoundaryError( toSrcBndPnts, bndError[ zS-1 ], bndError[ zS-1 ], 0.5,
4926 intPntsOfLayer[ zS ], int2BndDist );
4927 applyBoundaryError( toTgtBndPnts, bndError[ zT+1 ], bndError[ zT+1 ], 0.5,
4928 intPntsOfLayer[ zT ], int2BndDist );
4932 // cout << "centerIntErrorIsSmall = " << centerIntErrorIsSmall<< endl;
4933 // cout << "bndErrorIsSmall = " << bndErrorIsSmall<< endl;
4936 for ( size_t iP = 0; iP < myIntColumns.size(); ++iP )
4938 vector< const SMDS_MeshNode* > & nodeCol = *myIntColumns[ iP ];
4939 for ( size_t z = zSrc + 1; z < zTgt; ++z ) // vertical loop on layers
4941 const gp_XYZ & xyz = intPntsOfLayer[ z ][ iP ];
4942 if ( !( nodeCol[ z ] = helper.AddNode( xyz.X(), xyz.Y(), xyz.Z() )))