1 // SMESH SMESH : idl implementation based on 'SMESH' unit's classes
3 // Copyright (C) 2003 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.
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
24 // File : SMESH_MeshEditor.cxx
25 // Created : Mon Apr 12 16:10:22 2004
26 // Author : Edward AGAPOV (eap)
29 #include "SMESH_MeshEditor.hxx"
31 #include "SMDS_FaceOfNodes.hxx"
32 #include "SMDS_VolumeTool.hxx"
33 #include "SMDS_EdgePosition.hxx"
34 #include "SMDS_PolyhedralVolumeOfNodes.hxx"
35 #include "SMDS_FacePosition.hxx"
36 #include "SMDS_SpacePosition.hxx"
37 #include "SMDS_QuadraticFaceOfNodes.hxx"
39 #include "SMESHDS_Group.hxx"
40 #include "SMESHDS_Mesh.hxx"
42 #include "SMESH_subMesh.hxx"
43 #include "SMESH_ControlsDef.hxx"
44 #include "SMESH_MesherHelper.hxx"
45 #include "SMESH_OctreeNode.hxx"
47 #include "utilities.h"
49 #include <TopTools_ListIteratorOfListOfShape.hxx>
50 #include <TopTools_ListOfShape.hxx>
55 #include <gp_Trsf.hxx>
61 #include <BRep_Tool.hxx>
62 #include <Geom_Curve.hxx>
63 #include <Geom_Surface.hxx>
64 #include <Geom2d_Curve.hxx>
65 #include <Extrema_GenExtPS.hxx>
66 #include <Extrema_POnSurf.hxx>
67 #include <GeomAdaptor_Surface.hxx>
69 #include <TColStd_ListOfInteger.hxx>
70 #include <TopoDS_Face.hxx>
75 #define cast2Node(elem) static_cast<const SMDS_MeshNode*>( elem )
78 using namespace SMESH::Controls;
80 typedef map<const SMDS_MeshElement*, list<const SMDS_MeshNode*> > TElemOfNodeListMap;
81 typedef map<const SMDS_MeshElement*, list<const SMDS_MeshElement*> > TElemOfElemListMap;
82 typedef map<const SMDS_MeshNode*, list<const SMDS_MeshNode*> > TNodeOfNodeListMap;
83 typedef TNodeOfNodeListMap::iterator TNodeOfNodeListMapItr;
84 //typedef map<const SMDS_MeshNode*, vector<const SMDS_MeshNode*> > TNodeOfNodeVecMap;
85 //typedef TNodeOfNodeVecMap::iterator TNodeOfNodeVecMapItr;
86 typedef map<const SMDS_MeshElement*, vector<TNodeOfNodeListMapItr> > TElemOfVecOfNnlmiMap;
87 //typedef map<const SMDS_MeshElement*, vector<TNodeOfNodeVecMapItr> > TElemOfVecOfMapNodesMap;
89 struct TNodeXYZ : public gp_XYZ {
90 TNodeXYZ( const SMDS_MeshNode* n ):gp_XYZ( n->X(), n->Y(), n->Z() ) {}
93 typedef pair< const SMDS_MeshNode*, const SMDS_MeshNode* > NLink;
96 * \brief A sorted pair of nodes
98 struct TLink: public NLink
100 TLink(const SMDS_MeshNode* n1, const SMDS_MeshNode* n2 ):NLink( n1, n2 )
101 { if ( n1->GetID() < n2->GetID() ) std::swap( first, second ); }
102 TLink(const NLink& link ):NLink( link )
103 { if ( first->GetID() < second->GetID() ) std::swap( first, second ); }
106 //=======================================================================
107 //function : SMESH_MeshEditor
109 //=======================================================================
111 SMESH_MeshEditor::SMESH_MeshEditor( SMESH_Mesh* theMesh ):
116 //=======================================================================
120 //=======================================================================
123 SMESH_MeshEditor::AddElement(const vector<const SMDS_MeshNode*> & node,
124 const SMDSAbs_ElementType type,
128 SMDS_MeshElement* e = 0;
129 int nbnode = node.size();
130 SMESHDS_Mesh* mesh = GetMeshDS();
134 if ( ID ) e = mesh->AddEdgeWithID(node[0], node[1], ID);
135 else e = mesh->AddEdge (node[0], node[1] );
136 else if ( nbnode == 3 )
137 if ( ID ) e = mesh->AddEdgeWithID(node[0], node[1], node[2], ID);
138 else e = mesh->AddEdge (node[0], node[1], node[2] );
143 if ( ID ) e = mesh->AddFaceWithID(node[0], node[1], node[2], ID);
144 else e = mesh->AddFace (node[0], node[1], node[2] );
145 else if (nbnode == 4)
146 if ( ID ) e = mesh->AddFaceWithID(node[0], node[1], node[2], node[3], ID);
147 else e = mesh->AddFace (node[0], node[1], node[2], node[3] );
148 else if (nbnode == 6)
149 if ( ID ) e = mesh->AddFaceWithID(node[0], node[1], node[2], node[3],
150 node[4], node[5], ID);
151 else e = mesh->AddFace (node[0], node[1], node[2], node[3],
153 else if (nbnode == 8)
154 if ( ID ) e = mesh->AddFaceWithID(node[0], node[1], node[2], node[3],
155 node[4], node[5], node[6], node[7], ID);
156 else e = mesh->AddFace (node[0], node[1], node[2], node[3],
157 node[4], node[5], node[6], node[7] );
159 if ( ID ) e = mesh->AddPolygonalFaceWithID(node, ID);
160 else e = mesh->AddPolygonalFace (node );
166 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3], ID);
167 else e = mesh->AddVolume (node[0], node[1], node[2], node[3] );
168 else if (nbnode == 5)
169 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3],
171 else e = mesh->AddVolume (node[0], node[1], node[2], node[3],
173 else if (nbnode == 6)
174 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3],
175 node[4], node[5], ID);
176 else e = mesh->AddVolume (node[0], node[1], node[2], node[3],
178 else if (nbnode == 8)
179 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3],
180 node[4], node[5], node[6], node[7], ID);
181 else e = mesh->AddVolume (node[0], node[1], node[2], node[3],
182 node[4], node[5], node[6], node[7] );
183 else if (nbnode == 10)
184 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3],
185 node[4], node[5], node[6], node[7],
186 node[8], node[9], ID);
187 else e = mesh->AddVolume (node[0], node[1], node[2], node[3],
188 node[4], node[5], node[6], node[7],
190 else if (nbnode == 13)
191 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3],
192 node[4], node[5], node[6], node[7],
193 node[8], node[9], node[10],node[11],
195 else e = mesh->AddVolume (node[0], node[1], node[2], node[3],
196 node[4], node[5], node[6], node[7],
197 node[8], node[9], node[10],node[11],
199 else if (nbnode == 15)
200 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3],
201 node[4], node[5], node[6], node[7],
202 node[8], node[9], node[10],node[11],
203 node[12],node[13],node[14],ID);
204 else e = mesh->AddVolume (node[0], node[1], node[2], node[3],
205 node[4], node[5], node[6], node[7],
206 node[8], node[9], node[10],node[11],
207 node[12],node[13],node[14] );
208 else if (nbnode == 20)
209 if ( ID ) e = mesh->AddVolumeWithID(node[0], node[1], node[2], node[3],
210 node[4], node[5], node[6], node[7],
211 node[8], node[9], node[10],node[11],
212 node[12],node[13],node[14],node[15],
213 node[16],node[17],node[18],node[19],ID);
214 else e = mesh->AddVolume (node[0], node[1], node[2], node[3],
215 node[4], node[5], node[6], node[7],
216 node[8], node[9], node[10],node[11],
217 node[12],node[13],node[14],node[15],
218 node[16],node[17],node[18],node[19] );
224 //=======================================================================
228 //=======================================================================
230 SMDS_MeshElement* SMESH_MeshEditor::AddElement(const vector<int> & nodeIDs,
231 const SMDSAbs_ElementType type,
235 vector<const SMDS_MeshNode*> nodes;
236 nodes.reserve( nodeIDs.size() );
237 vector<int>::const_iterator id = nodeIDs.begin();
238 while ( id != nodeIDs.end() ) {
239 if ( const SMDS_MeshNode* node = GetMeshDS()->FindNode( *id++ ))
240 nodes.push_back( node );
244 return AddElement( nodes, type, isPoly, ID );
247 //=======================================================================
249 //purpose : Remove a node or an element.
250 // Modify a compute state of sub-meshes which become empty
251 //=======================================================================
253 bool SMESH_MeshEditor::Remove (const list< int >& theIDs,
256 myLastCreatedElems.Clear();
257 myLastCreatedNodes.Clear();
259 SMESHDS_Mesh* aMesh = GetMeshDS();
260 set< SMESH_subMesh *> smmap;
262 list<int>::const_iterator it = theIDs.begin();
263 for ( ; it != theIDs.end(); it++ ) {
264 const SMDS_MeshElement * elem;
266 elem = aMesh->FindNode( *it );
268 elem = aMesh->FindElement( *it );
272 // Find sub-meshes to notify about modification
273 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
274 while ( nodeIt->more() ) {
275 const SMDS_MeshNode* node = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
276 const SMDS_PositionPtr& aPosition = node->GetPosition();
277 if ( aPosition.get() ) {
278 if ( int aShapeID = aPosition->GetShapeId() ) {
279 if ( SMESH_subMesh * sm = GetMesh()->GetSubMeshContaining( aShapeID ) )
287 aMesh->RemoveNode( static_cast< const SMDS_MeshNode* >( elem ));
289 aMesh->RemoveElement( elem );
292 // Notify sub-meshes about modification
293 if ( !smmap.empty() ) {
294 set< SMESH_subMesh *>::iterator smIt;
295 for ( smIt = smmap.begin(); smIt != smmap.end(); smIt++ )
296 (*smIt)->ComputeStateEngine( SMESH_subMesh::MESH_ENTITY_REMOVED );
299 // Check if the whole mesh becomes empty
300 if ( SMESH_subMesh * sm = GetMesh()->GetSubMeshContaining( 1 ) )
301 sm->ComputeStateEngine( SMESH_subMesh::CHECK_COMPUTE_STATE );
306 //=======================================================================
307 //function : FindShape
308 //purpose : Return an index of the shape theElem is on
309 // or zero if a shape not found
310 //=======================================================================
312 int SMESH_MeshEditor::FindShape (const SMDS_MeshElement * theElem)
314 myLastCreatedElems.Clear();
315 myLastCreatedNodes.Clear();
317 SMESHDS_Mesh * aMesh = GetMeshDS();
318 if ( aMesh->ShapeToMesh().IsNull() )
321 if ( theElem->GetType() == SMDSAbs_Node ) {
322 const SMDS_PositionPtr& aPosition =
323 static_cast<const SMDS_MeshNode*>( theElem )->GetPosition();
324 if ( aPosition.get() )
325 return aPosition->GetShapeId();
330 TopoDS_Shape aShape; // the shape a node is on
331 SMDS_ElemIteratorPtr nodeIt = theElem->nodesIterator();
332 while ( nodeIt->more() ) {
333 const SMDS_MeshNode* node = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
334 const SMDS_PositionPtr& aPosition = node->GetPosition();
335 if ( aPosition.get() ) {
336 int aShapeID = aPosition->GetShapeId();
337 SMESHDS_SubMesh * sm = aMesh->MeshElements( aShapeID );
339 if ( sm->Contains( theElem ))
341 if ( aShape.IsNull() )
342 aShape = aMesh->IndexToShape( aShapeID );
345 //MESSAGE ( "::FindShape() No SubShape for aShapeID " << aShapeID );
350 // None of nodes is on a proper shape,
351 // find the shape among ancestors of aShape on which a node is
352 if ( aShape.IsNull() ) {
353 //MESSAGE ("::FindShape() - NONE node is on shape")
356 TopTools_ListIteratorOfListOfShape ancIt( GetMesh()->GetAncestors( aShape ));
357 for ( ; ancIt.More(); ancIt.Next() ) {
358 SMESHDS_SubMesh * sm = aMesh->MeshElements( ancIt.Value() );
359 if ( sm && sm->Contains( theElem ))
360 return aMesh->ShapeToIndex( ancIt.Value() );
363 //MESSAGE ("::FindShape() - SHAPE NOT FOUND")
367 //=======================================================================
368 //function : IsMedium
370 //=======================================================================
372 bool SMESH_MeshEditor::IsMedium(const SMDS_MeshNode* node,
373 const SMDSAbs_ElementType typeToCheck)
375 bool isMedium = false;
376 SMDS_ElemIteratorPtr it = node->GetInverseElementIterator(typeToCheck);
377 while (it->more() && !isMedium ) {
378 const SMDS_MeshElement* elem = it->next();
379 isMedium = elem->IsMediumNode(node);
384 //=======================================================================
385 //function : ShiftNodesQuadTria
387 // Shift nodes in the array corresponded to quadratic triangle
388 // example: (0,1,2,3,4,5) -> (1,2,0,4,5,3)
389 //=======================================================================
390 static void ShiftNodesQuadTria(const SMDS_MeshNode* aNodes[])
392 const SMDS_MeshNode* nd1 = aNodes[0];
393 aNodes[0] = aNodes[1];
394 aNodes[1] = aNodes[2];
396 const SMDS_MeshNode* nd2 = aNodes[3];
397 aNodes[3] = aNodes[4];
398 aNodes[4] = aNodes[5];
402 //=======================================================================
403 //function : GetNodesFromTwoTria
405 // Shift nodes in the array corresponded to quadratic triangle
406 // example: (0,1,2,3,4,5) -> (1,2,0,4,5,3)
407 //=======================================================================
408 static bool GetNodesFromTwoTria(const SMDS_MeshElement * theTria1,
409 const SMDS_MeshElement * theTria2,
410 const SMDS_MeshNode* N1[],
411 const SMDS_MeshNode* N2[])
413 SMDS_ElemIteratorPtr it = theTria1->nodesIterator();
416 N1[i] = static_cast<const SMDS_MeshNode*>( it->next() );
419 if(it->more()) return false;
420 it = theTria2->nodesIterator();
423 N2[i] = static_cast<const SMDS_MeshNode*>( it->next() );
426 if(it->more()) return false;
428 int sames[3] = {-1,-1,-1};
440 if(nbsames!=2) return false;
442 ShiftNodesQuadTria(N1);
444 ShiftNodesQuadTria(N1);
447 i = sames[0] + sames[1] + sames[2];
449 ShiftNodesQuadTria(N2);
451 // now we receive following N1 and N2 (using numeration as above image)
452 // tria1 : (1 2 4 5 9 7) and tria2 : (3 4 2 8 9 6)
453 // i.e. first nodes from both arrays determ new diagonal
457 //=======================================================================
458 //function : InverseDiag
459 //purpose : Replace two neighbour triangles with ones built on the same 4 nodes
460 // but having other common link.
461 // Return False if args are improper
462 //=======================================================================
464 bool SMESH_MeshEditor::InverseDiag (const SMDS_MeshElement * theTria1,
465 const SMDS_MeshElement * theTria2 )
467 myLastCreatedElems.Clear();
468 myLastCreatedNodes.Clear();
470 if (!theTria1 || !theTria2)
473 const SMDS_FaceOfNodes* F1 = dynamic_cast<const SMDS_FaceOfNodes*>( theTria1 );
474 const SMDS_FaceOfNodes* F2 = dynamic_cast<const SMDS_FaceOfNodes*>( theTria2 );
477 // 1 +--+ A theTria1: ( 1 A B ) A->2 ( 1 2 B ) 1 +--+ A
478 // | /| theTria2: ( B A 2 ) B->1 ( 1 A 2 ) |\ |
482 // put nodes in array and find out indices of the same ones
483 const SMDS_MeshNode* aNodes [6];
484 int sameInd [] = { 0, 0, 0, 0, 0, 0 };
486 SMDS_ElemIteratorPtr it = theTria1->nodesIterator();
487 while ( it->more() ) {
488 aNodes[ i ] = static_cast<const SMDS_MeshNode*>( it->next() );
490 if ( i > 2 ) // theTria2
491 // find same node of theTria1
492 for ( int j = 0; j < 3; j++ )
493 if ( aNodes[ i ] == aNodes[ j ]) {
502 return false; // theTria1 is not a triangle
503 it = theTria2->nodesIterator();
505 if ( i == 6 && it->more() )
506 return false; // theTria2 is not a triangle
509 // find indices of 1,2 and of A,B in theTria1
510 int iA = 0, iB = 0, i1 = 0, i2 = 0;
511 for ( i = 0; i < 6; i++ ) {
512 if ( sameInd [ i ] == 0 )
519 // nodes 1 and 2 should not be the same
520 if ( aNodes[ i1 ] == aNodes[ i2 ] )
524 aNodes[ iA ] = aNodes[ i2 ];
526 aNodes[ sameInd[ iB ]] = aNodes[ i1 ];
528 //MESSAGE( theTria1 << theTria2 );
530 GetMeshDS()->ChangeElementNodes( theTria1, aNodes, 3 );
531 GetMeshDS()->ChangeElementNodes( theTria2, &aNodes[ 3 ], 3 );
533 //MESSAGE( theTria1 << theTria2 );
537 } // end if(F1 && F2)
539 // check case of quadratic faces
540 const SMDS_QuadraticFaceOfNodes* QF1 =
541 dynamic_cast<const SMDS_QuadraticFaceOfNodes*> (theTria1);
542 if(!QF1) return false;
543 const SMDS_QuadraticFaceOfNodes* QF2 =
544 dynamic_cast<const SMDS_QuadraticFaceOfNodes*> (theTria2);
545 if(!QF2) return false;
548 // 1 +--+--+ 2 theTria1: (1 2 4 5 9 7) or (2 4 1 9 7 5) or (4 1 2 7 5 9)
549 // | /| theTria2: (2 3 4 6 8 9) or (3 4 2 8 9 6) or (4 2 3 9 6 8)
557 const SMDS_MeshNode* N1 [6];
558 const SMDS_MeshNode* N2 [6];
559 if(!GetNodesFromTwoTria(theTria1,theTria2,N1,N2))
561 // now we receive following N1 and N2 (using numeration as above image)
562 // tria1 : (1 2 4 5 9 7) and tria2 : (3 4 2 8 9 6)
563 // i.e. first nodes from both arrays determ new diagonal
565 const SMDS_MeshNode* N1new [6];
566 const SMDS_MeshNode* N2new [6];
579 // replaces nodes in faces
580 GetMeshDS()->ChangeElementNodes( theTria1, N1new, 6 );
581 GetMeshDS()->ChangeElementNodes( theTria2, N2new, 6 );
586 //=======================================================================
587 //function : findTriangles
588 //purpose : find triangles sharing theNode1-theNode2 link
589 //=======================================================================
591 static bool findTriangles(const SMDS_MeshNode * theNode1,
592 const SMDS_MeshNode * theNode2,
593 const SMDS_MeshElement*& theTria1,
594 const SMDS_MeshElement*& theTria2)
596 if ( !theNode1 || !theNode2 ) return false;
598 theTria1 = theTria2 = 0;
600 set< const SMDS_MeshElement* > emap;
601 SMDS_ElemIteratorPtr it = theNode1->GetInverseElementIterator(SMDSAbs_Face);
603 const SMDS_MeshElement* elem = it->next();
604 if ( elem->NbNodes() == 3 )
607 it = theNode2->GetInverseElementIterator(SMDSAbs_Face);
609 const SMDS_MeshElement* elem = it->next();
610 if ( emap.find( elem ) != emap.end() )
612 // theTria1 must be element with minimum ID
613 if( theTria1->GetID() < elem->GetID() ) {
626 return ( theTria1 && theTria2 );
629 //=======================================================================
630 //function : InverseDiag
631 //purpose : Replace two neighbour triangles sharing theNode1-theNode2 link
632 // with ones built on the same 4 nodes but having other common link.
633 // Return false if proper faces not found
634 //=======================================================================
636 bool SMESH_MeshEditor::InverseDiag (const SMDS_MeshNode * theNode1,
637 const SMDS_MeshNode * theNode2)
639 myLastCreatedElems.Clear();
640 myLastCreatedNodes.Clear();
642 MESSAGE( "::InverseDiag()" );
644 const SMDS_MeshElement *tr1, *tr2;
645 if ( !findTriangles( theNode1, theNode2, tr1, tr2 ))
648 const SMDS_FaceOfNodes* F1 = dynamic_cast<const SMDS_FaceOfNodes*>( tr1 );
649 //if (!F1) return false;
650 const SMDS_FaceOfNodes* F2 = dynamic_cast<const SMDS_FaceOfNodes*>( tr2 );
651 //if (!F2) return false;
654 // 1 +--+ A tr1: ( 1 A B ) A->2 ( 1 2 B ) 1 +--+ A
655 // | /| tr2: ( B A 2 ) B->1 ( 1 A 2 ) |\ |
659 // put nodes in array
660 // and find indices of 1,2 and of A in tr1 and of B in tr2
661 int i, iA1 = 0, i1 = 0;
662 const SMDS_MeshNode* aNodes1 [3];
663 SMDS_ElemIteratorPtr it;
664 for (i = 0, it = tr1->nodesIterator(); it->more(); i++ ) {
665 aNodes1[ i ] = static_cast<const SMDS_MeshNode*>( it->next() );
666 if ( aNodes1[ i ] == theNode1 )
667 iA1 = i; // node A in tr1
668 else if ( aNodes1[ i ] != theNode2 )
672 const SMDS_MeshNode* aNodes2 [3];
673 for (i = 0, it = tr2->nodesIterator(); it->more(); i++ ) {
674 aNodes2[ i ] = static_cast<const SMDS_MeshNode*>( it->next() );
675 if ( aNodes2[ i ] == theNode2 )
676 iB2 = i; // node B in tr2
677 else if ( aNodes2[ i ] != theNode1 )
681 // nodes 1 and 2 should not be the same
682 if ( aNodes1[ i1 ] == aNodes2[ i2 ] )
686 aNodes1[ iA1 ] = aNodes2[ i2 ];
688 aNodes2[ iB2 ] = aNodes1[ i1 ];
690 //MESSAGE( tr1 << tr2 );
692 GetMeshDS()->ChangeElementNodes( tr1, aNodes1, 3 );
693 GetMeshDS()->ChangeElementNodes( tr2, aNodes2, 3 );
695 //MESSAGE( tr1 << tr2 );
700 // check case of quadratic faces
701 const SMDS_QuadraticFaceOfNodes* QF1 =
702 dynamic_cast<const SMDS_QuadraticFaceOfNodes*> (tr1);
703 if(!QF1) return false;
704 const SMDS_QuadraticFaceOfNodes* QF2 =
705 dynamic_cast<const SMDS_QuadraticFaceOfNodes*> (tr2);
706 if(!QF2) return false;
707 return InverseDiag(tr1,tr2);
710 //=======================================================================
711 //function : getQuadrangleNodes
712 //purpose : fill theQuadNodes - nodes of a quadrangle resulting from
713 // fusion of triangles tr1 and tr2 having shared link on
714 // theNode1 and theNode2
715 //=======================================================================
717 bool getQuadrangleNodes(const SMDS_MeshNode * theQuadNodes [],
718 const SMDS_MeshNode * theNode1,
719 const SMDS_MeshNode * theNode2,
720 const SMDS_MeshElement * tr1,
721 const SMDS_MeshElement * tr2 )
723 if( tr1->NbNodes() != tr2->NbNodes() )
725 // find the 4-th node to insert into tr1
726 const SMDS_MeshNode* n4 = 0;
727 SMDS_ElemIteratorPtr it = tr2->nodesIterator();
729 while ( !n4 && i<3 ) {
730 const SMDS_MeshNode * n = cast2Node( it->next() );
732 bool isDiag = ( n == theNode1 || n == theNode2 );
736 // Make an array of nodes to be in a quadrangle
737 int iNode = 0, iFirstDiag = -1;
738 it = tr1->nodesIterator();
741 const SMDS_MeshNode * n = cast2Node( it->next() );
743 bool isDiag = ( n == theNode1 || n == theNode2 );
745 if ( iFirstDiag < 0 )
747 else if ( iNode - iFirstDiag == 1 )
748 theQuadNodes[ iNode++ ] = n4; // insert the 4-th node between diagonal nodes
750 else if ( n == n4 ) {
751 return false; // tr1 and tr2 should not have all the same nodes
753 theQuadNodes[ iNode++ ] = n;
755 if ( iNode == 3 ) // diagonal nodes have 0 and 2 indices
756 theQuadNodes[ iNode ] = n4;
761 //=======================================================================
762 //function : DeleteDiag
763 //purpose : Replace two neighbour triangles sharing theNode1-theNode2 link
764 // with a quadrangle built on the same 4 nodes.
765 // Return false if proper faces not found
766 //=======================================================================
768 bool SMESH_MeshEditor::DeleteDiag (const SMDS_MeshNode * theNode1,
769 const SMDS_MeshNode * theNode2)
771 myLastCreatedElems.Clear();
772 myLastCreatedNodes.Clear();
774 MESSAGE( "::DeleteDiag()" );
776 const SMDS_MeshElement *tr1, *tr2;
777 if ( !findTriangles( theNode1, theNode2, tr1, tr2 ))
780 const SMDS_FaceOfNodes* F1 = dynamic_cast<const SMDS_FaceOfNodes*>( tr1 );
781 //if (!F1) return false;
782 const SMDS_FaceOfNodes* F2 = dynamic_cast<const SMDS_FaceOfNodes*>( tr2 );
783 //if (!F2) return false;
786 const SMDS_MeshNode* aNodes [ 4 ];
787 if ( ! getQuadrangleNodes( aNodes, theNode1, theNode2, tr1, tr2 ))
790 //MESSAGE( endl << tr1 << tr2 );
792 GetMeshDS()->ChangeElementNodes( tr1, aNodes, 4 );
793 myLastCreatedElems.Append(tr1);
794 GetMeshDS()->RemoveElement( tr2 );
796 //MESSAGE( endl << tr1 );
801 // check case of quadratic faces
802 const SMDS_QuadraticFaceOfNodes* QF1 =
803 dynamic_cast<const SMDS_QuadraticFaceOfNodes*> (tr1);
804 if(!QF1) return false;
805 const SMDS_QuadraticFaceOfNodes* QF2 =
806 dynamic_cast<const SMDS_QuadraticFaceOfNodes*> (tr2);
807 if(!QF2) return false;
810 // 1 +--+--+ 2 tr1: (1 2 4 5 9 7) or (2 4 1 9 7 5) or (4 1 2 7 5 9)
811 // | /| tr2: (2 3 4 6 8 9) or (3 4 2 8 9 6) or (4 2 3 9 6 8)
819 const SMDS_MeshNode* N1 [6];
820 const SMDS_MeshNode* N2 [6];
821 if(!GetNodesFromTwoTria(tr1,tr2,N1,N2))
823 // now we receive following N1 and N2 (using numeration as above image)
824 // tria1 : (1 2 4 5 9 7) and tria2 : (3 4 2 8 9 6)
825 // i.e. first nodes from both arrays determ new diagonal
827 const SMDS_MeshNode* aNodes[8];
837 GetMeshDS()->ChangeElementNodes( tr1, aNodes, 8 );
838 myLastCreatedElems.Append(tr1);
839 GetMeshDS()->RemoveElement( tr2 );
841 // remove middle node (9)
842 GetMeshDS()->RemoveNode( N1[4] );
847 //=======================================================================
848 //function : Reorient
849 //purpose : Reverse theElement orientation
850 //=======================================================================
852 bool SMESH_MeshEditor::Reorient (const SMDS_MeshElement * theElem)
854 myLastCreatedElems.Clear();
855 myLastCreatedNodes.Clear();
859 SMDS_ElemIteratorPtr it = theElem->nodesIterator();
860 if ( !it || !it->more() )
863 switch ( theElem->GetType() ) {
867 if(!theElem->IsQuadratic()) {
868 int i = theElem->NbNodes();
869 vector<const SMDS_MeshNode*> aNodes( i );
871 aNodes[ --i ]= static_cast<const SMDS_MeshNode*>( it->next() );
872 return GetMeshDS()->ChangeElementNodes( theElem, &aNodes[0], theElem->NbNodes() );
875 // quadratic elements
876 if(theElem->GetType()==SMDSAbs_Edge) {
877 vector<const SMDS_MeshNode*> aNodes(3);
878 aNodes[1]= static_cast<const SMDS_MeshNode*>( it->next() );
879 aNodes[0]= static_cast<const SMDS_MeshNode*>( it->next() );
880 aNodes[2]= static_cast<const SMDS_MeshNode*>( it->next() );
881 return GetMeshDS()->ChangeElementNodes( theElem, &aNodes[0], 3 );
884 int nbn = theElem->NbNodes();
885 vector<const SMDS_MeshNode*> aNodes(nbn);
886 aNodes[0]= static_cast<const SMDS_MeshNode*>( it->next() );
888 for(; i<nbn/2; i++) {
889 aNodes[nbn/2-i]= static_cast<const SMDS_MeshNode*>( it->next() );
891 for(i=0; i<nbn/2; i++) {
892 aNodes[nbn-i-1]= static_cast<const SMDS_MeshNode*>( it->next() );
894 return GetMeshDS()->ChangeElementNodes( theElem, &aNodes[0], nbn );
898 case SMDSAbs_Volume: {
899 if (theElem->IsPoly()) {
900 const SMDS_PolyhedralVolumeOfNodes* aPolyedre =
901 static_cast<const SMDS_PolyhedralVolumeOfNodes*>( theElem );
903 MESSAGE("Warning: bad volumic element");
907 int nbFaces = aPolyedre->NbFaces();
908 vector<const SMDS_MeshNode *> poly_nodes;
909 vector<int> quantities (nbFaces);
911 // reverse each face of the polyedre
912 for (int iface = 1; iface <= nbFaces; iface++) {
913 int inode, nbFaceNodes = aPolyedre->NbFaceNodes(iface);
914 quantities[iface - 1] = nbFaceNodes;
916 for (inode = nbFaceNodes; inode >= 1; inode--) {
917 const SMDS_MeshNode* curNode = aPolyedre->GetFaceNode(iface, inode);
918 poly_nodes.push_back(curNode);
922 return GetMeshDS()->ChangePolyhedronNodes( theElem, poly_nodes, quantities );
926 SMDS_VolumeTool vTool;
927 if ( !vTool.Set( theElem ))
930 return GetMeshDS()->ChangeElementNodes( theElem, vTool.GetNodes(), vTool.NbNodes() );
939 //=======================================================================
940 //function : getBadRate
942 //=======================================================================
944 static double getBadRate (const SMDS_MeshElement* theElem,
945 SMESH::Controls::NumericalFunctorPtr& theCrit)
947 SMESH::Controls::TSequenceOfXYZ P;
948 if ( !theElem || !theCrit->GetPoints( theElem, P ))
950 return theCrit->GetBadRate( theCrit->GetValue( P ), theElem->NbNodes() );
951 //return theCrit->GetBadRate( theCrit->GetValue( theElem->GetID() ), theElem->NbNodes() );
954 //=======================================================================
955 //function : QuadToTri
956 //purpose : Cut quadrangles into triangles.
957 // theCrit is used to select a diagonal to cut
958 //=======================================================================
960 bool SMESH_MeshEditor::QuadToTri (TIDSortedElemSet & theElems,
961 SMESH::Controls::NumericalFunctorPtr theCrit)
963 myLastCreatedElems.Clear();
964 myLastCreatedNodes.Clear();
966 MESSAGE( "::QuadToTri()" );
968 if ( !theCrit.get() )
971 SMESHDS_Mesh * aMesh = GetMeshDS();
973 Handle(Geom_Surface) surface;
974 SMESH_MesherHelper helper( *GetMesh() );
976 TIDSortedElemSet::iterator itElem;
977 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
978 const SMDS_MeshElement* elem = *itElem;
979 if ( !elem || elem->GetType() != SMDSAbs_Face )
981 if ( elem->NbNodes() != ( elem->IsQuadratic() ? 8 : 4 ))
984 // retrieve element nodes
985 const SMDS_MeshNode* aNodes [8];
986 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
988 while ( itN->more() )
989 aNodes[ i++ ] = static_cast<const SMDS_MeshNode*>( itN->next() );
991 // compare two sets of possible triangles
992 double aBadRate1, aBadRate2; // to what extent a set is bad
993 SMDS_FaceOfNodes tr1 ( aNodes[0], aNodes[1], aNodes[2] );
994 SMDS_FaceOfNodes tr2 ( aNodes[2], aNodes[3], aNodes[0] );
995 aBadRate1 = getBadRate( &tr1, theCrit ) + getBadRate( &tr2, theCrit );
997 SMDS_FaceOfNodes tr3 ( aNodes[1], aNodes[2], aNodes[3] );
998 SMDS_FaceOfNodes tr4 ( aNodes[3], aNodes[0], aNodes[1] );
999 aBadRate2 = getBadRate( &tr3, theCrit ) + getBadRate( &tr4, theCrit );
1001 int aShapeId = FindShape( elem );
1002 const SMDS_MeshElement* newElem = 0;
1004 if( !elem->IsQuadratic() ) {
1006 // split liner quadrangle
1008 if ( aBadRate1 <= aBadRate2 ) {
1009 // tr1 + tr2 is better
1010 aMesh->ChangeElementNodes( elem, aNodes, 3 );
1011 newElem = aMesh->AddFace( aNodes[2], aNodes[3], aNodes[0] );
1014 // tr3 + tr4 is better
1015 aMesh->ChangeElementNodes( elem, &aNodes[1], 3 );
1016 newElem = aMesh->AddFace( aNodes[3], aNodes[0], aNodes[1] );
1021 // split quadratic quadrangle
1023 // get surface elem is on
1024 if ( aShapeId != helper.GetSubShapeID() ) {
1028 shape = aMesh->IndexToShape( aShapeId );
1029 if ( !shape.IsNull() && shape.ShapeType() == TopAbs_FACE ) {
1030 TopoDS_Face face = TopoDS::Face( shape );
1031 surface = BRep_Tool::Surface( face );
1032 if ( !surface.IsNull() )
1033 helper.SetSubShape( shape );
1037 const SMDS_MeshNode* aNodes [8];
1038 const SMDS_MeshNode* inFaceNode = 0;
1039 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
1041 while ( itN->more() ) {
1042 aNodes[ i++ ] = static_cast<const SMDS_MeshNode*>( itN->next() );
1043 if ( !inFaceNode && helper.GetNodeUVneedInFaceNode() &&
1044 aNodes[ i-1 ]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
1046 inFaceNode = aNodes[ i-1 ];
1049 // find middle point for (0,1,2,3)
1050 // and create a node in this point;
1052 if ( surface.IsNull() ) {
1054 p += gp_XYZ(aNodes[i]->X(), aNodes[i]->Y(), aNodes[i]->Z() );
1058 TopoDS_Face face = TopoDS::Face( helper.GetSubShape() );
1061 uv += helper.GetNodeUV( face, aNodes[i], inFaceNode );
1063 p = surface->Value( uv.X(), uv.Y() ).XYZ();
1065 const SMDS_MeshNode* newN = aMesh->AddNode( p.X(), p.Y(), p.Z() );
1066 myLastCreatedNodes.Append(newN);
1068 // create a new element
1069 const SMDS_MeshNode* N[6];
1070 if ( aBadRate1 <= aBadRate2 ) {
1077 newElem = aMesh->AddFace(aNodes[2], aNodes[3], aNodes[0],
1078 aNodes[6], aNodes[7], newN );
1087 newElem = aMesh->AddFace(aNodes[3], aNodes[0], aNodes[1],
1088 aNodes[7], aNodes[4], newN );
1090 aMesh->ChangeElementNodes( elem, N, 6 );
1094 // care of a new element
1096 myLastCreatedElems.Append(newElem);
1097 AddToSameGroups( newElem, elem, aMesh );
1099 // put a new triangle on the same shape
1101 aMesh->SetMeshElementOnShape( newElem, aShapeId );
1106 //=======================================================================
1107 //function : BestSplit
1108 //purpose : Find better diagonal for cutting.
1109 //=======================================================================
1110 int SMESH_MeshEditor::BestSplit (const SMDS_MeshElement* theQuad,
1111 SMESH::Controls::NumericalFunctorPtr theCrit)
1113 myLastCreatedElems.Clear();
1114 myLastCreatedNodes.Clear();
1119 if (!theQuad || theQuad->GetType() != SMDSAbs_Face )
1122 if( theQuad->NbNodes()==4 ||
1123 (theQuad->NbNodes()==8 && theQuad->IsQuadratic()) ) {
1125 // retrieve element nodes
1126 const SMDS_MeshNode* aNodes [4];
1127 SMDS_ElemIteratorPtr itN = theQuad->nodesIterator();
1129 //while (itN->more())
1131 aNodes[ i++ ] = static_cast<const SMDS_MeshNode*>( itN->next() );
1133 // compare two sets of possible triangles
1134 double aBadRate1, aBadRate2; // to what extent a set is bad
1135 SMDS_FaceOfNodes tr1 ( aNodes[0], aNodes[1], aNodes[2] );
1136 SMDS_FaceOfNodes tr2 ( aNodes[2], aNodes[3], aNodes[0] );
1137 aBadRate1 = getBadRate( &tr1, theCrit ) + getBadRate( &tr2, theCrit );
1139 SMDS_FaceOfNodes tr3 ( aNodes[1], aNodes[2], aNodes[3] );
1140 SMDS_FaceOfNodes tr4 ( aNodes[3], aNodes[0], aNodes[1] );
1141 aBadRate2 = getBadRate( &tr3, theCrit ) + getBadRate( &tr4, theCrit );
1143 if (aBadRate1 <= aBadRate2) // tr1 + tr2 is better
1144 return 1; // diagonal 1-3
1146 return 2; // diagonal 2-4
1151 //=======================================================================
1152 //function : AddToSameGroups
1153 //purpose : add elemToAdd to the groups the elemInGroups belongs to
1154 //=======================================================================
1156 void SMESH_MeshEditor::AddToSameGroups (const SMDS_MeshElement* elemToAdd,
1157 const SMDS_MeshElement* elemInGroups,
1158 SMESHDS_Mesh * aMesh)
1160 const set<SMESHDS_GroupBase*>& groups = aMesh->GetGroups();
1161 set<SMESHDS_GroupBase*>::const_iterator grIt = groups.begin();
1162 for ( ; grIt != groups.end(); grIt++ ) {
1163 SMESHDS_Group* group = dynamic_cast<SMESHDS_Group*>( *grIt );
1164 if ( group && group->SMDSGroup().Contains( elemInGroups ))
1165 group->SMDSGroup().Add( elemToAdd );
1170 //=======================================================================
1171 //function : RemoveElemFromGroups
1172 //purpose : Remove removeelem to the groups the elemInGroups belongs to
1173 //=======================================================================
1174 void SMESH_MeshEditor::RemoveElemFromGroups (const SMDS_MeshElement* removeelem,
1175 SMESHDS_Mesh * aMesh)
1177 const set<SMESHDS_GroupBase*>& groups = aMesh->GetGroups();
1178 if (!groups.empty())
1180 set<SMESHDS_GroupBase*>::const_iterator GrIt = groups.begin();
1181 for (; GrIt != groups.end(); GrIt++)
1183 SMESHDS_Group* grp = dynamic_cast<SMESHDS_Group*>(*GrIt);
1184 if (!grp || grp->IsEmpty()) continue;
1185 grp->SMDSGroup().Remove(removeelem);
1191 //=======================================================================
1192 //function : QuadToTri
1193 //purpose : Cut quadrangles into triangles.
1194 // theCrit is used to select a diagonal to cut
1195 //=======================================================================
1197 bool SMESH_MeshEditor::QuadToTri (TIDSortedElemSet & theElems,
1198 const bool the13Diag)
1200 myLastCreatedElems.Clear();
1201 myLastCreatedNodes.Clear();
1203 MESSAGE( "::QuadToTri()" );
1205 SMESHDS_Mesh * aMesh = GetMeshDS();
1207 Handle(Geom_Surface) surface;
1208 SMESH_MesherHelper helper( *GetMesh() );
1210 TIDSortedElemSet::iterator itElem;
1211 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
1212 const SMDS_MeshElement* elem = *itElem;
1213 if ( !elem || elem->GetType() != SMDSAbs_Face )
1215 bool isquad = elem->NbNodes()==4 || elem->NbNodes()==8;
1216 if(!isquad) continue;
1218 if(elem->NbNodes()==4) {
1219 // retrieve element nodes
1220 const SMDS_MeshNode* aNodes [4];
1221 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
1223 while ( itN->more() )
1224 aNodes[ i++ ] = static_cast<const SMDS_MeshNode*>( itN->next() );
1226 int aShapeId = FindShape( elem );
1227 const SMDS_MeshElement* newElem = 0;
1229 aMesh->ChangeElementNodes( elem, aNodes, 3 );
1230 newElem = aMesh->AddFace( aNodes[2], aNodes[3], aNodes[0] );
1233 aMesh->ChangeElementNodes( elem, &aNodes[1], 3 );
1234 newElem = aMesh->AddFace( aNodes[3], aNodes[0], aNodes[1] );
1236 myLastCreatedElems.Append(newElem);
1237 // put a new triangle on the same shape and add to the same groups
1239 aMesh->SetMeshElementOnShape( newElem, aShapeId );
1240 AddToSameGroups( newElem, elem, aMesh );
1243 // Quadratic quadrangle
1245 if( elem->NbNodes()==8 && elem->IsQuadratic() ) {
1247 // get surface elem is on
1248 int aShapeId = FindShape( elem );
1249 if ( aShapeId != helper.GetSubShapeID() ) {
1253 shape = aMesh->IndexToShape( aShapeId );
1254 if ( !shape.IsNull() && shape.ShapeType() == TopAbs_FACE ) {
1255 TopoDS_Face face = TopoDS::Face( shape );
1256 surface = BRep_Tool::Surface( face );
1257 if ( !surface.IsNull() )
1258 helper.SetSubShape( shape );
1262 const SMDS_MeshNode* aNodes [8];
1263 const SMDS_MeshNode* inFaceNode = 0;
1264 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
1266 while ( itN->more() ) {
1267 aNodes[ i++ ] = static_cast<const SMDS_MeshNode*>( itN->next() );
1268 if ( !inFaceNode && helper.GetNodeUVneedInFaceNode() &&
1269 aNodes[ i-1 ]->GetPosition()->GetTypeOfPosition() == SMDS_TOP_FACE )
1271 inFaceNode = aNodes[ i-1 ];
1275 // find middle point for (0,1,2,3)
1276 // and create a node in this point;
1278 if ( surface.IsNull() ) {
1280 p += gp_XYZ(aNodes[i]->X(), aNodes[i]->Y(), aNodes[i]->Z() );
1284 TopoDS_Face geomFace = TopoDS::Face( helper.GetSubShape() );
1287 uv += helper.GetNodeUV( geomFace, aNodes[i], inFaceNode );
1289 p = surface->Value( uv.X(), uv.Y() ).XYZ();
1291 const SMDS_MeshNode* newN = aMesh->AddNode( p.X(), p.Y(), p.Z() );
1292 myLastCreatedNodes.Append(newN);
1294 // create a new element
1295 const SMDS_MeshElement* newElem = 0;
1296 const SMDS_MeshNode* N[6];
1304 newElem = aMesh->AddFace(aNodes[2], aNodes[3], aNodes[0],
1305 aNodes[6], aNodes[7], newN );
1314 newElem = aMesh->AddFace(aNodes[3], aNodes[0], aNodes[1],
1315 aNodes[7], aNodes[4], newN );
1317 myLastCreatedElems.Append(newElem);
1318 aMesh->ChangeElementNodes( elem, N, 6 );
1319 // put a new triangle on the same shape and add to the same groups
1321 aMesh->SetMeshElementOnShape( newElem, aShapeId );
1322 AddToSameGroups( newElem, elem, aMesh );
1329 //=======================================================================
1330 //function : getAngle
1332 //=======================================================================
1334 double getAngle(const SMDS_MeshElement * tr1,
1335 const SMDS_MeshElement * tr2,
1336 const SMDS_MeshNode * n1,
1337 const SMDS_MeshNode * n2)
1339 double angle = 2*PI; // bad angle
1342 SMESH::Controls::TSequenceOfXYZ P1, P2;
1343 if ( !SMESH::Controls::NumericalFunctor::GetPoints( tr1, P1 ) ||
1344 !SMESH::Controls::NumericalFunctor::GetPoints( tr2, P2 ))
1347 if(!tr1->IsQuadratic())
1348 N1 = gp_Vec( P1(2) - P1(1) ) ^ gp_Vec( P1(3) - P1(1) );
1350 N1 = gp_Vec( P1(3) - P1(1) ) ^ gp_Vec( P1(5) - P1(1) );
1351 if ( N1.SquareMagnitude() <= gp::Resolution() )
1353 if(!tr2->IsQuadratic())
1354 N2 = gp_Vec( P2(2) - P2(1) ) ^ gp_Vec( P2(3) - P2(1) );
1356 N2 = gp_Vec( P2(3) - P2(1) ) ^ gp_Vec( P2(5) - P2(1) );
1357 if ( N2.SquareMagnitude() <= gp::Resolution() )
1360 // find the first diagonal node n1 in the triangles:
1361 // take in account a diagonal link orientation
1362 const SMDS_MeshElement *nFirst[2], *tr[] = { tr1, tr2 };
1363 for ( int t = 0; t < 2; t++ ) {
1364 SMDS_ElemIteratorPtr it = tr[ t ]->nodesIterator();
1365 int i = 0, iDiag = -1;
1366 while ( it->more()) {
1367 const SMDS_MeshElement *n = it->next();
1368 if ( n == n1 || n == n2 )
1372 if ( i - iDiag == 1 )
1373 nFirst[ t ] = ( n == n1 ? n2 : n1 );
1381 if ( nFirst[ 0 ] == nFirst[ 1 ] )
1384 angle = N1.Angle( N2 );
1389 // =================================================
1390 // class generating a unique ID for a pair of nodes
1391 // and able to return nodes by that ID
1392 // =================================================
1396 LinkID_Gen( const SMESHDS_Mesh* theMesh )
1397 :myMesh( theMesh ), myMaxID( theMesh->MaxNodeID() + 1)
1400 long GetLinkID (const SMDS_MeshNode * n1,
1401 const SMDS_MeshNode * n2) const
1403 return ( Min(n1->GetID(),n2->GetID()) * myMaxID + Max(n1->GetID(),n2->GetID()));
1406 bool GetNodes (const long theLinkID,
1407 const SMDS_MeshNode* & theNode1,
1408 const SMDS_MeshNode* & theNode2) const
1410 theNode1 = myMesh->FindNode( theLinkID / myMaxID );
1411 if ( !theNode1 ) return false;
1412 theNode2 = myMesh->FindNode( theLinkID % myMaxID );
1413 if ( !theNode2 ) return false;
1419 const SMESHDS_Mesh* myMesh;
1424 //=======================================================================
1425 //function : TriToQuad
1426 //purpose : Fuse neighbour triangles into quadrangles.
1427 // theCrit is used to select a neighbour to fuse with.
1428 // theMaxAngle is a max angle between element normals at which
1429 // fusion is still performed.
1430 //=======================================================================
1432 bool SMESH_MeshEditor::TriToQuad (TIDSortedElemSet & theElems,
1433 SMESH::Controls::NumericalFunctorPtr theCrit,
1434 const double theMaxAngle)
1436 myLastCreatedElems.Clear();
1437 myLastCreatedNodes.Clear();
1439 MESSAGE( "::TriToQuad()" );
1441 if ( !theCrit.get() )
1444 SMESHDS_Mesh * aMesh = GetMeshDS();
1446 // Prepare data for algo: build
1447 // 1. map of elements with their linkIDs
1448 // 2. map of linkIDs with their elements
1450 map< TLink, list< const SMDS_MeshElement* > > mapLi_listEl;
1451 map< TLink, list< const SMDS_MeshElement* > >::iterator itLE;
1452 map< const SMDS_MeshElement*, set< TLink > > mapEl_setLi;
1453 map< const SMDS_MeshElement*, set< TLink > >::iterator itEL;
1455 TIDSortedElemSet::iterator itElem;
1456 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
1457 const SMDS_MeshElement* elem = *itElem;
1458 if(!elem || elem->GetType() != SMDSAbs_Face ) continue;
1459 bool IsTria = elem->NbNodes()==3 || (elem->NbNodes()==6 && elem->IsQuadratic());
1460 if(!IsTria) continue;
1462 // retrieve element nodes
1463 const SMDS_MeshNode* aNodes [4];
1464 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
1467 aNodes[ i++ ] = cast2Node( itN->next() );
1468 aNodes[ 3 ] = aNodes[ 0 ];
1471 for ( i = 0; i < 3; i++ ) {
1472 TLink link( aNodes[i], aNodes[i+1] );
1473 // check if elements sharing a link can be fused
1474 itLE = mapLi_listEl.find( link );
1475 if ( itLE != mapLi_listEl.end() ) {
1476 if ((*itLE).second.size() > 1 ) // consider only 2 elems adjacent by a link
1478 const SMDS_MeshElement* elem2 = (*itLE).second.front();
1479 //if ( FindShape( elem ) != FindShape( elem2 ))
1480 // continue; // do not fuse triangles laying on different shapes
1481 if ( getAngle( elem, elem2, aNodes[i], aNodes[i+1] ) > theMaxAngle )
1482 continue; // avoid making badly shaped quads
1483 (*itLE).second.push_back( elem );
1486 mapLi_listEl[ link ].push_back( elem );
1488 mapEl_setLi [ elem ].insert( link );
1491 // Clean the maps from the links shared by a sole element, ie
1492 // links to which only one element is bound in mapLi_listEl
1494 for ( itLE = mapLi_listEl.begin(); itLE != mapLi_listEl.end(); itLE++ ) {
1495 int nbElems = (*itLE).second.size();
1496 if ( nbElems < 2 ) {
1497 const SMDS_MeshElement* elem = (*itLE).second.front();
1498 TLink link = (*itLE).first;
1499 mapEl_setLi[ elem ].erase( link );
1500 if ( mapEl_setLi[ elem ].empty() )
1501 mapEl_setLi.erase( elem );
1505 // Algo: fuse triangles into quadrangles
1507 while ( ! mapEl_setLi.empty() ) {
1508 // Look for the start element:
1509 // the element having the least nb of shared links
1510 const SMDS_MeshElement* startElem = 0;
1512 for ( itEL = mapEl_setLi.begin(); itEL != mapEl_setLi.end(); itEL++ ) {
1513 int nbLinks = (*itEL).second.size();
1514 if ( nbLinks < minNbLinks ) {
1515 startElem = (*itEL).first;
1516 minNbLinks = nbLinks;
1517 if ( minNbLinks == 1 )
1522 // search elements to fuse starting from startElem or links of elements
1523 // fused earlyer - startLinks
1524 list< TLink > startLinks;
1525 while ( startElem || !startLinks.empty() ) {
1526 while ( !startElem && !startLinks.empty() ) {
1527 // Get an element to start, by a link
1528 TLink linkId = startLinks.front();
1529 startLinks.pop_front();
1530 itLE = mapLi_listEl.find( linkId );
1531 if ( itLE != mapLi_listEl.end() ) {
1532 list< const SMDS_MeshElement* > & listElem = (*itLE).second;
1533 list< const SMDS_MeshElement* >::iterator itE = listElem.begin();
1534 for ( ; itE != listElem.end() ; itE++ )
1535 if ( mapEl_setLi.find( (*itE) ) != mapEl_setLi.end() )
1537 mapLi_listEl.erase( itLE );
1542 // Get candidates to be fused
1543 const SMDS_MeshElement *tr1 = startElem, *tr2 = 0, *tr3 = 0;
1544 const TLink *link12, *link13;
1546 ASSERT( mapEl_setLi.find( tr1 ) != mapEl_setLi.end() );
1547 set< TLink >& setLi = mapEl_setLi[ tr1 ];
1548 ASSERT( !setLi.empty() );
1549 set< TLink >::iterator itLi;
1550 for ( itLi = setLi.begin(); itLi != setLi.end(); itLi++ )
1552 const TLink & link = (*itLi);
1553 itLE = mapLi_listEl.find( link );
1554 if ( itLE == mapLi_listEl.end() )
1557 const SMDS_MeshElement* elem = (*itLE).second.front();
1559 elem = (*itLE).second.back();
1560 mapLi_listEl.erase( itLE );
1561 if ( mapEl_setLi.find( elem ) == mapEl_setLi.end())
1572 // add other links of elem to list of links to re-start from
1573 set< TLink >& links = mapEl_setLi[ elem ];
1574 set< TLink >::iterator it;
1575 for ( it = links.begin(); it != links.end(); it++ ) {
1576 const TLink& link2 = (*it);
1577 if ( link2 != link )
1578 startLinks.push_back( link2 );
1582 // Get nodes of possible quadrangles
1583 const SMDS_MeshNode *n12 [4], *n13 [4];
1584 bool Ok12 = false, Ok13 = false;
1585 const SMDS_MeshNode *linkNode1, *linkNode2;
1587 linkNode1 = link12->first;
1588 linkNode2 = link12->second;
1589 if ( tr2 && getQuadrangleNodes( n12, linkNode1, linkNode2, tr1, tr2 ))
1593 linkNode1 = link13->first;
1594 linkNode2 = link13->second;
1595 if ( tr3 && getQuadrangleNodes( n13, linkNode1, linkNode2, tr1, tr3 ))
1599 // Choose a pair to fuse
1600 if ( Ok12 && Ok13 ) {
1601 SMDS_FaceOfNodes quad12 ( n12[ 0 ], n12[ 1 ], n12[ 2 ], n12[ 3 ] );
1602 SMDS_FaceOfNodes quad13 ( n13[ 0 ], n13[ 1 ], n13[ 2 ], n13[ 3 ] );
1603 double aBadRate12 = getBadRate( &quad12, theCrit );
1604 double aBadRate13 = getBadRate( &quad13, theCrit );
1605 if ( aBadRate13 < aBadRate12 )
1612 // and remove fused elems and removed links from the maps
1613 mapEl_setLi.erase( tr1 );
1615 mapEl_setLi.erase( tr2 );
1616 mapLi_listEl.erase( *link12 );
1617 if(tr1->NbNodes()==3) {
1618 if( tr1->GetID() < tr2->GetID() ) {
1619 aMesh->ChangeElementNodes( tr1, n12, 4 );
1620 myLastCreatedElems.Append(tr1);
1621 aMesh->RemoveElement( tr2 );
1624 aMesh->ChangeElementNodes( tr2, n12, 4 );
1625 myLastCreatedElems.Append(tr2);
1626 aMesh->RemoveElement( tr1);
1630 const SMDS_MeshNode* N1 [6];
1631 const SMDS_MeshNode* N2 [6];
1632 GetNodesFromTwoTria(tr1,tr2,N1,N2);
1633 // now we receive following N1 and N2 (using numeration as above image)
1634 // tria1 : (1 2 4 5 9 7) and tria2 : (3 4 2 8 9 6)
1635 // i.e. first nodes from both arrays determ new diagonal
1636 const SMDS_MeshNode* aNodes[8];
1645 if( tr1->GetID() < tr2->GetID() ) {
1646 GetMeshDS()->ChangeElementNodes( tr1, aNodes, 8 );
1647 myLastCreatedElems.Append(tr1);
1648 GetMeshDS()->RemoveElement( tr2 );
1651 GetMeshDS()->ChangeElementNodes( tr2, aNodes, 8 );
1652 myLastCreatedElems.Append(tr2);
1653 GetMeshDS()->RemoveElement( tr1 );
1655 // remove middle node (9)
1656 GetMeshDS()->RemoveNode( N1[4] );
1660 mapEl_setLi.erase( tr3 );
1661 mapLi_listEl.erase( *link13 );
1662 if(tr1->NbNodes()==3) {
1663 if( tr1->GetID() < tr2->GetID() ) {
1664 aMesh->ChangeElementNodes( tr1, n13, 4 );
1665 myLastCreatedElems.Append(tr1);
1666 aMesh->RemoveElement( tr3 );
1669 aMesh->ChangeElementNodes( tr3, n13, 4 );
1670 myLastCreatedElems.Append(tr3);
1671 aMesh->RemoveElement( tr1 );
1675 const SMDS_MeshNode* N1 [6];
1676 const SMDS_MeshNode* N2 [6];
1677 GetNodesFromTwoTria(tr1,tr3,N1,N2);
1678 // now we receive following N1 and N2 (using numeration as above image)
1679 // tria1 : (1 2 4 5 9 7) and tria2 : (3 4 2 8 9 6)
1680 // i.e. first nodes from both arrays determ new diagonal
1681 const SMDS_MeshNode* aNodes[8];
1690 if( tr1->GetID() < tr2->GetID() ) {
1691 GetMeshDS()->ChangeElementNodes( tr1, aNodes, 8 );
1692 myLastCreatedElems.Append(tr1);
1693 GetMeshDS()->RemoveElement( tr3 );
1696 GetMeshDS()->ChangeElementNodes( tr3, aNodes, 8 );
1697 myLastCreatedElems.Append(tr3);
1698 GetMeshDS()->RemoveElement( tr1 );
1700 // remove middle node (9)
1701 GetMeshDS()->RemoveNode( N1[4] );
1705 // Next element to fuse: the rejected one
1707 startElem = Ok12 ? tr3 : tr2;
1709 } // if ( startElem )
1710 } // while ( startElem || !startLinks.empty() )
1711 } // while ( ! mapEl_setLi.empty() )
1717 /*#define DUMPSO(txt) \
1718 // cout << txt << endl;
1719 //=============================================================================
1723 //=============================================================================
1724 static void swap( int i1, int i2, int idNodes[], gp_Pnt P[] )
1728 int tmp = idNodes[ i1 ];
1729 idNodes[ i1 ] = idNodes[ i2 ];
1730 idNodes[ i2 ] = tmp;
1731 gp_Pnt Ptmp = P[ i1 ];
1734 DUMPSO( i1 << "(" << idNodes[ i2 ] << ") <-> " << i2 << "(" << idNodes[ i1 ] << ")");
1737 //=======================================================================
1738 //function : SortQuadNodes
1739 //purpose : Set 4 nodes of a quadrangle face in a good order.
1740 // Swap 1<->2 or 2<->3 nodes and correspondingly return
1742 //=======================================================================
1744 int SMESH_MeshEditor::SortQuadNodes (const SMDS_Mesh * theMesh,
1749 for ( i = 0; i < 4; i++ ) {
1750 const SMDS_MeshNode *n = theMesh->FindNode( idNodes[i] );
1752 P[ i ].SetCoord( n->X(), n->Y(), n->Z() );
1755 gp_Vec V1(P[0], P[1]);
1756 gp_Vec V2(P[0], P[2]);
1757 gp_Vec V3(P[0], P[3]);
1759 gp_Vec Cross1 = V1 ^ V2;
1760 gp_Vec Cross2 = V2 ^ V3;
1763 if (Cross1.Dot(Cross2) < 0)
1768 if (Cross1.Dot(Cross2) < 0)
1772 swap ( i, i + 1, idNodes, P );
1774 // for ( int ii = 0; ii < 4; ii++ ) {
1775 // const SMDS_MeshNode *n = theMesh->FindNode( idNodes[ii] );
1776 // DUMPSO( ii << "(" << idNodes[ii] <<") : "<<n->X()<<" "<<n->Y()<<" "<<n->Z());
1782 //=======================================================================
1783 //function : SortHexaNodes
1784 //purpose : Set 8 nodes of a hexahedron in a good order.
1785 // Return success status
1786 //=======================================================================
1788 bool SMESH_MeshEditor::SortHexaNodes (const SMDS_Mesh * theMesh,
1793 DUMPSO( "INPUT: ========================================");
1794 for ( i = 0; i < 8; i++ ) {
1795 const SMDS_MeshNode *n = theMesh->FindNode( idNodes[i] );
1796 if ( !n ) return false;
1797 P[ i ].SetCoord( n->X(), n->Y(), n->Z() );
1798 DUMPSO( i << "(" << idNodes[i] <<") : "<<n->X()<<" "<<n->Y()<<" "<<n->Z());
1800 DUMPSO( "========================================");
1803 set<int> faceNodes; // ids of bottom face nodes, to be found
1804 set<int> checkedId1; // ids of tried 2-nd nodes
1805 Standard_Real leastDist = DBL_MAX; // dist of the 4-th node from 123 plane
1806 const Standard_Real tol = 1.e-6; // tolerance to find nodes in plane
1807 int iMin, iLoop1 = 0;
1809 // Loop to try the 2-nd nodes
1811 while ( leastDist > DBL_MIN && ++iLoop1 < 8 )
1813 // Find not checked 2-nd node
1814 for ( i = 1; i < 8; i++ )
1815 if ( checkedId1.find( idNodes[i] ) == checkedId1.end() ) {
1816 int id1 = idNodes[i];
1817 swap ( 1, i, idNodes, P );
1818 checkedId1.insert ( id1 );
1822 // Find the 3-d node so that 1-2-3 triangle to be on a hexa face,
1823 // ie that all but meybe one (id3 which is on the same face) nodes
1824 // lay on the same side from the triangle plane.
1826 bool manyInPlane = false; // more than 4 nodes lay in plane
1828 while ( ++iLoop2 < 6 ) {
1830 // get 1-2-3 plane coeffs
1831 Standard_Real A, B, C, D;
1832 gp_Vec N = gp_Vec (P[0], P[1]).Crossed( gp_Vec (P[0], P[2]) );
1833 if ( N.SquareMagnitude() > gp::Resolution() )
1835 gp_Pln pln ( P[0], N );
1836 pln.Coefficients( A, B, C, D );
1838 // find the node (iMin) closest to pln
1839 Standard_Real dist[ 8 ], minDist = DBL_MAX;
1841 for ( i = 3; i < 8; i++ ) {
1842 dist[i] = A * P[i].X() + B * P[i].Y() + C * P[i].Z() + D;
1843 if ( fabs( dist[i] ) < minDist ) {
1844 minDist = fabs( dist[i] );
1847 if ( fabs( dist[i] ) <= tol )
1848 idInPln.insert( idNodes[i] );
1851 // there should not be more than 4 nodes in bottom plane
1852 if ( idInPln.size() > 1 )
1854 DUMPSO( "### idInPln.size() = " << idInPln.size());
1855 // idInPlane does not contain the first 3 nodes
1856 if ( manyInPlane || idInPln.size() == 5)
1857 return false; // all nodes in one plane
1860 // set the 1-st node to be not in plane
1861 for ( i = 3; i < 8; i++ ) {
1862 if ( idInPln.find( idNodes[ i ] ) == idInPln.end() ) {
1863 DUMPSO( "### Reset 0-th node");
1864 swap( 0, i, idNodes, P );
1869 // reset to re-check second nodes
1870 leastDist = DBL_MAX;
1874 break; // from iLoop2;
1877 // check that the other 4 nodes are on the same side
1878 bool sameSide = true;
1879 bool isNeg = dist[ iMin == 3 ? 4 : 3 ] <= 0.;
1880 for ( i = 3; sameSide && i < 8; i++ ) {
1882 sameSide = ( isNeg == dist[i] <= 0.);
1885 // keep best solution
1886 if ( sameSide && minDist < leastDist ) {
1887 leastDist = minDist;
1889 faceNodes.insert( idNodes[ 1 ] );
1890 faceNodes.insert( idNodes[ 2 ] );
1891 faceNodes.insert( idNodes[ iMin ] );
1892 DUMPSO( "loop " << iLoop2 << " id2 " << idNodes[ 1 ] << " id3 " << idNodes[ 2 ]
1893 << " leastDist = " << leastDist);
1894 if ( leastDist <= DBL_MIN )
1899 // set next 3-d node to check
1900 int iNext = 2 + iLoop2;
1902 DUMPSO( "Try 2-nd");
1903 swap ( 2, iNext, idNodes, P );
1905 } // while ( iLoop2 < 6 )
1908 if ( faceNodes.empty() ) return false;
1910 // Put the faceNodes in proper places
1911 for ( i = 4; i < 8; i++ ) {
1912 if ( faceNodes.find( idNodes[ i ] ) != faceNodes.end() ) {
1913 // find a place to put
1915 while ( faceNodes.find( idNodes[ iTo ] ) != faceNodes.end() )
1917 DUMPSO( "Set faceNodes");
1918 swap ( iTo, i, idNodes, P );
1923 // Set nodes of the found bottom face in good order
1924 DUMPSO( " Found bottom face: ");
1925 i = SortQuadNodes( theMesh, idNodes );
1927 gp_Pnt Ptmp = P[ i ];
1932 // for ( int ii = 0; ii < 4; ii++ ) {
1933 // const SMDS_MeshNode *n = theMesh->FindNode( idNodes[ii] );
1934 // DUMPSO( ii << "(" << idNodes[ii] <<") : "<<n->X()<<" "<<n->Y()<<" "<<n->Z());
1937 // Gravity center of the top and bottom faces
1938 gp_Pnt aGCb = ( P[0].XYZ() + P[1].XYZ() + P[2].XYZ() + P[3].XYZ() ) / 4.;
1939 gp_Pnt aGCt = ( P[4].XYZ() + P[5].XYZ() + P[6].XYZ() + P[7].XYZ() ) / 4.;
1941 // Get direction from the bottom to the top face
1942 gp_Vec upDir ( aGCb, aGCt );
1943 Standard_Real upDirSize = upDir.Magnitude();
1944 if ( upDirSize <= gp::Resolution() ) return false;
1947 // Assure that the bottom face normal points up
1948 gp_Vec Nb = gp_Vec (P[0], P[1]).Crossed( gp_Vec (P[0], P[2]) );
1949 Nb += gp_Vec (P[0], P[2]).Crossed( gp_Vec (P[0], P[3]) );
1950 if ( Nb.Dot( upDir ) < 0 ) {
1951 DUMPSO( "Reverse bottom face");
1952 swap( 1, 3, idNodes, P );
1955 // Find 5-th node - the one closest to the 1-st among the last 4 nodes.
1956 Standard_Real minDist = DBL_MAX;
1957 for ( i = 4; i < 8; i++ ) {
1958 // projection of P[i] to the plane defined by P[0] and upDir
1959 gp_Pnt Pp = P[i].Translated( upDir * ( upDir.Dot( gp_Vec( P[i], P[0] ))));
1960 Standard_Real sqDist = P[0].SquareDistance( Pp );
1961 if ( sqDist < minDist ) {
1966 DUMPSO( "Set 4-th");
1967 swap ( 4, iMin, idNodes, P );
1969 // Set nodes of the top face in good order
1970 DUMPSO( "Sort top face");
1971 i = SortQuadNodes( theMesh, &idNodes[4] );
1974 gp_Pnt Ptmp = P[ i ];
1979 // Assure that direction of the top face normal is from the bottom face
1980 gp_Vec Nt = gp_Vec (P[4], P[5]).Crossed( gp_Vec (P[4], P[6]) );
1981 Nt += gp_Vec (P[4], P[6]).Crossed( gp_Vec (P[4], P[7]) );
1982 if ( Nt.Dot( upDir ) < 0 ) {
1983 DUMPSO( "Reverse top face");
1984 swap( 5, 7, idNodes, P );
1987 // DUMPSO( "OUTPUT: ========================================");
1988 // for ( i = 0; i < 8; i++ ) {
1989 // float *p = ugrid->GetPoint(idNodes[i]);
1990 // DUMPSO( i << "(" << idNodes[i] << ") : " << p[0] << " " << p[1] << " " << p[2]);
1996 //================================================================================
1998 * \brief Return nodes linked to the given one
1999 * \param theNode - the node
2000 * \param linkedNodes - the found nodes
2001 * \param type - the type of elements to check
2003 * Medium nodes are ignored
2005 //================================================================================
2007 void SMESH_MeshEditor::GetLinkedNodes( const SMDS_MeshNode* theNode,
2008 TIDSortedElemSet & linkedNodes,
2009 SMDSAbs_ElementType type )
2011 SMDS_ElemIteratorPtr elemIt = theNode->GetInverseElementIterator(type);
2012 while ( elemIt->more() )
2014 const SMDS_MeshElement* elem = elemIt->next();
2015 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
2016 if ( elem->GetType() == SMDSAbs_Volume )
2018 SMDS_VolumeTool vol( elem );
2019 while ( nodeIt->more() ) {
2020 const SMDS_MeshNode* n = cast2Node( nodeIt->next() );
2021 if ( theNode != n && vol.IsLinked( theNode, n ))
2022 linkedNodes.insert( n );
2027 for ( int i = 0; nodeIt->more(); ++i ) {
2028 const SMDS_MeshNode* n = cast2Node( nodeIt->next() );
2029 if ( n == theNode ) {
2030 int iBefore = i - 1;
2032 if ( elem->IsQuadratic() ) {
2033 int nb = elem->NbNodes() / 2;
2034 iAfter = SMESH_MesherHelper::WrapIndex( iAfter, nb );
2035 iBefore = SMESH_MesherHelper::WrapIndex( iBefore, nb );
2037 linkedNodes.insert( elem->GetNode( iAfter ));
2038 linkedNodes.insert( elem->GetNode( iBefore ));
2045 //=======================================================================
2046 //function : laplacianSmooth
2047 //purpose : pulls theNode toward the center of surrounding nodes directly
2048 // connected to that node along an element edge
2049 //=======================================================================
2051 void laplacianSmooth(const SMDS_MeshNode* theNode,
2052 const Handle(Geom_Surface)& theSurface,
2053 map< const SMDS_MeshNode*, gp_XY* >& theUVMap)
2055 // find surrounding nodes
2057 TIDSortedElemSet nodeSet;
2058 SMESH_MeshEditor::GetLinkedNodes( theNode, nodeSet, SMDSAbs_Face );
2060 // compute new coodrs
2062 double coord[] = { 0., 0., 0. };
2063 TIDSortedElemSet::iterator nodeSetIt = nodeSet.begin();
2064 for ( ; nodeSetIt != nodeSet.end(); nodeSetIt++ ) {
2065 const SMDS_MeshNode* node = cast2Node(*nodeSetIt);
2066 if ( theSurface.IsNull() ) { // smooth in 3D
2067 coord[0] += node->X();
2068 coord[1] += node->Y();
2069 coord[2] += node->Z();
2071 else { // smooth in 2D
2072 ASSERT( theUVMap.find( node ) != theUVMap.end() );
2073 gp_XY* uv = theUVMap[ node ];
2074 coord[0] += uv->X();
2075 coord[1] += uv->Y();
2078 int nbNodes = nodeSet.size();
2081 coord[0] /= nbNodes;
2082 coord[1] /= nbNodes;
2084 if ( !theSurface.IsNull() ) {
2085 ASSERT( theUVMap.find( theNode ) != theUVMap.end() );
2086 theUVMap[ theNode ]->SetCoord( coord[0], coord[1] );
2087 gp_Pnt p3d = theSurface->Value( coord[0], coord[1] );
2093 coord[2] /= nbNodes;
2097 const_cast< SMDS_MeshNode* >( theNode )->setXYZ(coord[0],coord[1],coord[2]);
2100 //=======================================================================
2101 //function : centroidalSmooth
2102 //purpose : pulls theNode toward the element-area-weighted centroid of the
2103 // surrounding elements
2104 //=======================================================================
2106 void centroidalSmooth(const SMDS_MeshNode* theNode,
2107 const Handle(Geom_Surface)& theSurface,
2108 map< const SMDS_MeshNode*, gp_XY* >& theUVMap)
2110 gp_XYZ aNewXYZ(0.,0.,0.);
2111 SMESH::Controls::Area anAreaFunc;
2112 double totalArea = 0.;
2117 SMDS_ElemIteratorPtr elemIt = theNode->GetInverseElementIterator(SMDSAbs_Face);
2118 while ( elemIt->more() )
2120 const SMDS_MeshElement* elem = elemIt->next();
2123 gp_XYZ elemCenter(0.,0.,0.);
2124 SMESH::Controls::TSequenceOfXYZ aNodePoints;
2125 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
2126 int nn = elem->NbNodes();
2127 if(elem->IsQuadratic()) nn = nn/2;
2129 //while ( itN->more() ) {
2131 const SMDS_MeshNode* aNode = static_cast<const SMDS_MeshNode*>( itN->next() );
2133 gp_XYZ aP( aNode->X(), aNode->Y(), aNode->Z() );
2134 aNodePoints.push_back( aP );
2135 if ( !theSurface.IsNull() ) { // smooth in 2D
2136 ASSERT( theUVMap.find( aNode ) != theUVMap.end() );
2137 gp_XY* uv = theUVMap[ aNode ];
2138 aP.SetCoord( uv->X(), uv->Y(), 0. );
2142 double elemArea = anAreaFunc.GetValue( aNodePoints );
2143 totalArea += elemArea;
2145 aNewXYZ += elemCenter * elemArea;
2147 aNewXYZ /= totalArea;
2148 if ( !theSurface.IsNull() ) {
2149 theUVMap[ theNode ]->SetCoord( aNewXYZ.X(), aNewXYZ.Y() );
2150 aNewXYZ = theSurface->Value( aNewXYZ.X(), aNewXYZ.Y() ).XYZ();
2155 const_cast< SMDS_MeshNode* >( theNode )->setXYZ(aNewXYZ.X(),aNewXYZ.Y(),aNewXYZ.Z());
2158 //=======================================================================
2159 //function : getClosestUV
2160 //purpose : return UV of closest projection
2161 //=======================================================================
2163 static bool getClosestUV (Extrema_GenExtPS& projector,
2164 const gp_Pnt& point,
2167 projector.Perform( point );
2168 if ( projector.IsDone() ) {
2169 double u, v, minVal = DBL_MAX;
2170 for ( int i = projector.NbExt(); i > 0; i-- )
2171 if ( projector.Value( i ) < minVal ) {
2172 minVal = projector.Value( i );
2173 projector.Point( i ).Parameter( u, v );
2175 result.SetCoord( u, v );
2181 //=======================================================================
2183 //purpose : Smooth theElements during theNbIterations or until a worst
2184 // element has aspect ratio <= theTgtAspectRatio.
2185 // Aspect Ratio varies in range [1.0, inf].
2186 // If theElements is empty, the whole mesh is smoothed.
2187 // theFixedNodes contains additionally fixed nodes. Nodes built
2188 // on edges and boundary nodes are always fixed.
2189 //=======================================================================
2191 void SMESH_MeshEditor::Smooth (TIDSortedElemSet & theElems,
2192 set<const SMDS_MeshNode*> & theFixedNodes,
2193 const SmoothMethod theSmoothMethod,
2194 const int theNbIterations,
2195 double theTgtAspectRatio,
2198 myLastCreatedElems.Clear();
2199 myLastCreatedNodes.Clear();
2201 MESSAGE((theSmoothMethod==LAPLACIAN ? "LAPLACIAN" : "CENTROIDAL") << "--::Smooth()");
2203 if ( theTgtAspectRatio < 1.0 )
2204 theTgtAspectRatio = 1.0;
2206 const double disttol = 1.e-16;
2208 SMESH::Controls::AspectRatio aQualityFunc;
2210 SMESHDS_Mesh* aMesh = GetMeshDS();
2212 if ( theElems.empty() ) {
2213 // add all faces to theElems
2214 SMDS_FaceIteratorPtr fIt = aMesh->facesIterator();
2215 while ( fIt->more() ) {
2216 const SMDS_MeshElement* face = fIt->next();
2217 theElems.insert( face );
2220 // get all face ids theElems are on
2221 set< int > faceIdSet;
2222 TIDSortedElemSet::iterator itElem;
2224 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
2225 int fId = FindShape( *itElem );
2226 // check that corresponding submesh exists and a shape is face
2228 faceIdSet.find( fId ) == faceIdSet.end() &&
2229 aMesh->MeshElements( fId )) {
2230 TopoDS_Shape F = aMesh->IndexToShape( fId );
2231 if ( !F.IsNull() && F.ShapeType() == TopAbs_FACE )
2232 faceIdSet.insert( fId );
2235 faceIdSet.insert( 0 ); // to smooth elements that are not on any TopoDS_Face
2237 // ===============================================
2238 // smooth elements on each TopoDS_Face separately
2239 // ===============================================
2241 set< int >::reverse_iterator fId = faceIdSet.rbegin(); // treate 0 fId at the end
2242 for ( ; fId != faceIdSet.rend(); ++fId ) {
2243 // get face surface and submesh
2244 Handle(Geom_Surface) surface;
2245 SMESHDS_SubMesh* faceSubMesh = 0;
2247 double fToler2 = 0, vPeriod = 0., uPeriod = 0., f,l;
2248 double u1 = 0, u2 = 0, v1 = 0, v2 = 0;
2249 bool isUPeriodic = false, isVPeriodic = false;
2251 face = TopoDS::Face( aMesh->IndexToShape( *fId ));
2252 surface = BRep_Tool::Surface( face );
2253 faceSubMesh = aMesh->MeshElements( *fId );
2254 fToler2 = BRep_Tool::Tolerance( face );
2255 fToler2 *= fToler2 * 10.;
2256 isUPeriodic = surface->IsUPeriodic();
2258 vPeriod = surface->UPeriod();
2259 isVPeriodic = surface->IsVPeriodic();
2261 uPeriod = surface->VPeriod();
2262 surface->Bounds( u1, u2, v1, v2 );
2264 // ---------------------------------------------------------
2265 // for elements on a face, find movable and fixed nodes and
2266 // compute UV for them
2267 // ---------------------------------------------------------
2268 bool checkBoundaryNodes = false;
2269 bool isQuadratic = false;
2270 set<const SMDS_MeshNode*> setMovableNodes;
2271 map< const SMDS_MeshNode*, gp_XY* > uvMap, uvMap2;
2272 list< gp_XY > listUV; // uvs the 2 uvMaps refer to
2273 list< const SMDS_MeshElement* > elemsOnFace;
2275 Extrema_GenExtPS projector;
2276 GeomAdaptor_Surface surfAdaptor;
2277 if ( !surface.IsNull() ) {
2278 surfAdaptor.Load( surface );
2279 projector.Initialize( surfAdaptor, 20,20, 1e-5,1e-5 );
2281 int nbElemOnFace = 0;
2282 itElem = theElems.begin();
2283 // loop on not yet smoothed elements: look for elems on a face
2284 while ( itElem != theElems.end() ) {
2285 if ( faceSubMesh && nbElemOnFace == faceSubMesh->NbElements() )
2286 break; // all elements found
2288 const SMDS_MeshElement* elem = *itElem;
2289 if ( !elem || elem->GetType() != SMDSAbs_Face || elem->NbNodes() < 3 ||
2290 ( faceSubMesh && !faceSubMesh->Contains( elem ))) {
2294 elemsOnFace.push_back( elem );
2295 theElems.erase( itElem++ );
2299 isQuadratic = elem->IsQuadratic();
2301 // get movable nodes of elem
2302 const SMDS_MeshNode* node;
2303 SMDS_TypeOfPosition posType;
2304 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
2305 int nn = 0, nbn = elem->NbNodes();
2306 if(elem->IsQuadratic())
2308 while ( nn++ < nbn ) {
2309 node = static_cast<const SMDS_MeshNode*>( itN->next() );
2310 const SMDS_PositionPtr& pos = node->GetPosition();
2311 posType = pos.get() ? pos->GetTypeOfPosition() : SMDS_TOP_3DSPACE;
2312 if (posType != SMDS_TOP_EDGE &&
2313 posType != SMDS_TOP_VERTEX &&
2314 theFixedNodes.find( node ) == theFixedNodes.end())
2316 // check if all faces around the node are on faceSubMesh
2317 // because a node on edge may be bound to face
2318 SMDS_ElemIteratorPtr eIt = node->GetInverseElementIterator(SMDSAbs_Face);
2320 if ( faceSubMesh ) {
2321 while ( eIt->more() && all ) {
2322 const SMDS_MeshElement* e = eIt->next();
2323 all = faceSubMesh->Contains( e );
2327 setMovableNodes.insert( node );
2329 checkBoundaryNodes = true;
2331 if ( posType == SMDS_TOP_3DSPACE )
2332 checkBoundaryNodes = true;
2335 if ( surface.IsNull() )
2338 // get nodes to check UV
2339 list< const SMDS_MeshNode* > uvCheckNodes;
2340 itN = elem->nodesIterator();
2341 nn = 0; nbn = elem->NbNodes();
2342 if(elem->IsQuadratic())
2344 while ( nn++ < nbn ) {
2345 node = static_cast<const SMDS_MeshNode*>( itN->next() );
2346 if ( uvMap.find( node ) == uvMap.end() )
2347 uvCheckNodes.push_back( node );
2348 // add nodes of elems sharing node
2349 // SMDS_ElemIteratorPtr eIt = node->GetInverseElementIterator(SMDSAbs_Face);
2350 // while ( eIt->more() ) {
2351 // const SMDS_MeshElement* e = eIt->next();
2352 // if ( e != elem ) {
2353 // SMDS_ElemIteratorPtr nIt = e->nodesIterator();
2354 // while ( nIt->more() ) {
2355 // const SMDS_MeshNode* n =
2356 // static_cast<const SMDS_MeshNode*>( nIt->next() );
2357 // if ( uvMap.find( n ) == uvMap.end() )
2358 // uvCheckNodes.push_back( n );
2364 list< const SMDS_MeshNode* >::iterator n = uvCheckNodes.begin();
2365 for ( ; n != uvCheckNodes.end(); ++n ) {
2368 const SMDS_PositionPtr& pos = node->GetPosition();
2369 posType = pos.get() ? pos->GetTypeOfPosition() : SMDS_TOP_3DSPACE;
2371 switch ( posType ) {
2372 case SMDS_TOP_FACE: {
2373 SMDS_FacePosition* fPos = ( SMDS_FacePosition* ) pos.get();
2374 uv.SetCoord( fPos->GetUParameter(), fPos->GetVParameter() );
2377 case SMDS_TOP_EDGE: {
2378 TopoDS_Shape S = aMesh->IndexToShape( pos->GetShapeId() );
2379 Handle(Geom2d_Curve) pcurve;
2380 if ( !S.IsNull() && S.ShapeType() == TopAbs_EDGE )
2381 pcurve = BRep_Tool::CurveOnSurface( TopoDS::Edge( S ), face, f,l );
2382 if ( !pcurve.IsNull() ) {
2383 double u = (( SMDS_EdgePosition* ) pos.get() )->GetUParameter();
2384 uv = pcurve->Value( u ).XY();
2388 case SMDS_TOP_VERTEX: {
2389 TopoDS_Shape S = aMesh->IndexToShape( pos->GetShapeId() );
2390 if ( !S.IsNull() && S.ShapeType() == TopAbs_VERTEX )
2391 uv = BRep_Tool::Parameters( TopoDS::Vertex( S ), face ).XY();
2396 // check existing UV
2397 bool project = true;
2398 gp_Pnt pNode ( node->X(), node->Y(), node->Z() );
2399 double dist1 = DBL_MAX, dist2 = 0;
2400 if ( posType != SMDS_TOP_3DSPACE ) {
2401 dist1 = pNode.SquareDistance( surface->Value( uv.X(), uv.Y() ));
2402 project = dist1 > fToler2;
2404 if ( project ) { // compute new UV
2406 if ( !getClosestUV( projector, pNode, newUV )) {
2407 MESSAGE("Node Projection Failed " << node);
2411 newUV.SetX( ElCLib::InPeriod( newUV.X(), u1, u2 ));
2413 newUV.SetY( ElCLib::InPeriod( newUV.Y(), v1, v2 ));
2415 if ( posType != SMDS_TOP_3DSPACE )
2416 dist2 = pNode.SquareDistance( surface->Value( newUV.X(), newUV.Y() ));
2417 if ( dist2 < dist1 )
2421 // store UV in the map
2422 listUV.push_back( uv );
2423 uvMap.insert( make_pair( node, &listUV.back() ));
2425 } // loop on not yet smoothed elements
2427 if ( !faceSubMesh || nbElemOnFace != faceSubMesh->NbElements() )
2428 checkBoundaryNodes = true;
2430 // fix nodes on mesh boundary
2432 if ( checkBoundaryNodes ) {
2433 typedef pair<const SMDS_MeshNode*, const SMDS_MeshNode*> TLink;
2434 map< TLink, int > linkNbMap; // how many times a link encounters in elemsOnFace
2435 map< TLink, int >::iterator link_nb;
2436 // put all elements links to linkNbMap
2437 list< const SMDS_MeshElement* >::iterator elemIt = elemsOnFace.begin();
2438 for ( ; elemIt != elemsOnFace.end(); ++elemIt ) {
2439 const SMDS_MeshElement* elem = (*elemIt);
2440 int nbn = elem->NbNodes();
2441 if(elem->IsQuadratic())
2443 // loop on elem links: insert them in linkNbMap
2444 const SMDS_MeshNode* curNode, *prevNode = elem->GetNode( nbn );
2445 for ( int iN = 0; iN < nbn; ++iN ) {
2446 curNode = elem->GetNode( iN );
2448 if ( curNode < prevNode ) link = make_pair( curNode , prevNode );
2449 else link = make_pair( prevNode , curNode );
2451 link_nb = linkNbMap.find( link );
2452 if ( link_nb == linkNbMap.end() )
2453 linkNbMap.insert( make_pair ( link, 1 ));
2458 // remove nodes that are in links encountered only once from setMovableNodes
2459 for ( link_nb = linkNbMap.begin(); link_nb != linkNbMap.end(); ++link_nb ) {
2460 if ( link_nb->second == 1 ) {
2461 setMovableNodes.erase( link_nb->first.first );
2462 setMovableNodes.erase( link_nb->first.second );
2467 // -----------------------------------------------------
2468 // for nodes on seam edge, compute one more UV ( uvMap2 );
2469 // find movable nodes linked to nodes on seam and which
2470 // are to be smoothed using the second UV ( uvMap2 )
2471 // -----------------------------------------------------
2473 set<const SMDS_MeshNode*> nodesNearSeam; // to smooth using uvMap2
2474 if ( !surface.IsNull() ) {
2475 TopExp_Explorer eExp( face, TopAbs_EDGE );
2476 for ( ; eExp.More(); eExp.Next() ) {
2477 TopoDS_Edge edge = TopoDS::Edge( eExp.Current() );
2478 if ( !BRep_Tool::IsClosed( edge, face ))
2480 SMESHDS_SubMesh* sm = aMesh->MeshElements( edge );
2481 if ( !sm ) continue;
2482 // find out which parameter varies for a node on seam
2485 Handle(Geom2d_Curve) pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
2486 if ( pcurve.IsNull() ) continue;
2487 uv1 = pcurve->Value( f );
2489 pcurve = BRep_Tool::CurveOnSurface( edge, face, f, l );
2490 if ( pcurve.IsNull() ) continue;
2491 uv2 = pcurve->Value( f );
2492 int iPar = Abs( uv1.X() - uv2.X() ) > Abs( uv1.Y() - uv2.Y() ) ? 1 : 2;
2494 if ( uv1.Coord( iPar ) > uv2.Coord( iPar )) {
2495 gp_Pnt2d tmp = uv1; uv1 = uv2; uv2 = tmp;
2497 // get nodes on seam and its vertices
2498 list< const SMDS_MeshNode* > seamNodes;
2499 SMDS_NodeIteratorPtr nSeamIt = sm->GetNodes();
2500 while ( nSeamIt->more() ) {
2501 const SMDS_MeshNode* node = nSeamIt->next();
2502 if ( !isQuadratic || !IsMedium( node ))
2503 seamNodes.push_back( node );
2505 TopExp_Explorer vExp( edge, TopAbs_VERTEX );
2506 for ( ; vExp.More(); vExp.Next() ) {
2507 sm = aMesh->MeshElements( vExp.Current() );
2509 nSeamIt = sm->GetNodes();
2510 while ( nSeamIt->more() )
2511 seamNodes.push_back( nSeamIt->next() );
2514 // loop on nodes on seam
2515 list< const SMDS_MeshNode* >::iterator noSeIt = seamNodes.begin();
2516 for ( ; noSeIt != seamNodes.end(); ++noSeIt ) {
2517 const SMDS_MeshNode* nSeam = *noSeIt;
2518 map< const SMDS_MeshNode*, gp_XY* >::iterator n_uv = uvMap.find( nSeam );
2519 if ( n_uv == uvMap.end() )
2522 n_uv->second->SetCoord( iPar, uv1.Coord( iPar ));
2523 // set the second UV
2524 listUV.push_back( *n_uv->second );
2525 listUV.back().SetCoord( iPar, uv2.Coord( iPar ));
2526 if ( uvMap2.empty() )
2527 uvMap2 = uvMap; // copy the uvMap contents
2528 uvMap2[ nSeam ] = &listUV.back();
2530 // collect movable nodes linked to ones on seam in nodesNearSeam
2531 SMDS_ElemIteratorPtr eIt = nSeam->GetInverseElementIterator(SMDSAbs_Face);
2532 while ( eIt->more() ) {
2533 const SMDS_MeshElement* e = eIt->next();
2534 int nbUseMap1 = 0, nbUseMap2 = 0;
2535 SMDS_ElemIteratorPtr nIt = e->nodesIterator();
2536 int nn = 0, nbn = e->NbNodes();
2537 if(e->IsQuadratic()) nbn = nbn/2;
2538 while ( nn++ < nbn )
2540 const SMDS_MeshNode* n =
2541 static_cast<const SMDS_MeshNode*>( nIt->next() );
2543 setMovableNodes.find( n ) == setMovableNodes.end() )
2545 // add only nodes being closer to uv2 than to uv1
2546 gp_Pnt pMid (0.5 * ( n->X() + nSeam->X() ),
2547 0.5 * ( n->Y() + nSeam->Y() ),
2548 0.5 * ( n->Z() + nSeam->Z() ));
2550 getClosestUV( projector, pMid, uv );
2551 if ( uv.Coord( iPar ) > uvMap[ n ]->Coord( iPar ) ) {
2552 nodesNearSeam.insert( n );
2558 // for centroidalSmooth all element nodes must
2559 // be on one side of a seam
2560 if ( theSmoothMethod == CENTROIDAL && nbUseMap1 && nbUseMap2 ) {
2561 SMDS_ElemIteratorPtr nIt = e->nodesIterator();
2563 while ( nn++ < nbn ) {
2564 const SMDS_MeshNode* n =
2565 static_cast<const SMDS_MeshNode*>( nIt->next() );
2566 setMovableNodes.erase( n );
2570 } // loop on nodes on seam
2571 } // loop on edge of a face
2572 } // if ( !face.IsNull() )
2574 if ( setMovableNodes.empty() ) {
2575 MESSAGE( "Face id : " << *fId << " - NO SMOOTHING: no nodes to move!!!");
2576 continue; // goto next face
2584 double maxRatio = -1., maxDisplacement = -1.;
2585 set<const SMDS_MeshNode*>::iterator nodeToMove;
2586 for ( it = 0; it < theNbIterations; it++ ) {
2587 maxDisplacement = 0.;
2588 nodeToMove = setMovableNodes.begin();
2589 for ( ; nodeToMove != setMovableNodes.end(); nodeToMove++ ) {
2590 const SMDS_MeshNode* node = (*nodeToMove);
2591 gp_XYZ aPrevPos ( node->X(), node->Y(), node->Z() );
2594 bool map2 = ( nodesNearSeam.find( node ) != nodesNearSeam.end() );
2595 if ( theSmoothMethod == LAPLACIAN )
2596 laplacianSmooth( node, surface, map2 ? uvMap2 : uvMap );
2598 centroidalSmooth( node, surface, map2 ? uvMap2 : uvMap );
2600 // node displacement
2601 gp_XYZ aNewPos ( node->X(), node->Y(), node->Z() );
2602 Standard_Real aDispl = (aPrevPos - aNewPos).SquareModulus();
2603 if ( aDispl > maxDisplacement )
2604 maxDisplacement = aDispl;
2606 // no node movement => exit
2607 //if ( maxDisplacement < 1.e-16 ) {
2608 if ( maxDisplacement < disttol ) {
2609 MESSAGE("-- no node movement --");
2613 // check elements quality
2615 list< const SMDS_MeshElement* >::iterator elemIt = elemsOnFace.begin();
2616 for ( ; elemIt != elemsOnFace.end(); ++elemIt ) {
2617 const SMDS_MeshElement* elem = (*elemIt);
2618 if ( !elem || elem->GetType() != SMDSAbs_Face )
2620 SMESH::Controls::TSequenceOfXYZ aPoints;
2621 if ( aQualityFunc.GetPoints( elem, aPoints )) {
2622 double aValue = aQualityFunc.GetValue( aPoints );
2623 if ( aValue > maxRatio )
2627 if ( maxRatio <= theTgtAspectRatio ) {
2628 MESSAGE("-- quality achived --");
2631 if (it+1 == theNbIterations) {
2632 MESSAGE("-- Iteration limit exceeded --");
2634 } // smoothing iterations
2636 MESSAGE(" Face id: " << *fId <<
2637 " Nb iterstions: " << it <<
2638 " Displacement: " << maxDisplacement <<
2639 " Aspect Ratio " << maxRatio);
2641 // ---------------------------------------
2642 // new nodes positions are computed,
2643 // record movement in DS and set new UV
2644 // ---------------------------------------
2645 nodeToMove = setMovableNodes.begin();
2646 for ( ; nodeToMove != setMovableNodes.end(); nodeToMove++ ) {
2647 SMDS_MeshNode* node = const_cast< SMDS_MeshNode* > (*nodeToMove);
2648 aMesh->MoveNode( node, node->X(), node->Y(), node->Z() );
2649 map< const SMDS_MeshNode*, gp_XY* >::iterator node_uv = uvMap.find( node );
2650 if ( node_uv != uvMap.end() ) {
2651 gp_XY* uv = node_uv->second;
2653 ( SMDS_PositionPtr( new SMDS_FacePosition( *fId, uv->X(), uv->Y() )));
2657 // move medium nodes of quadratic elements
2660 SMESH_MesherHelper helper( *GetMesh() );
2661 if ( !face.IsNull() )
2662 helper.SetSubShape( face );
2663 list< const SMDS_MeshElement* >::iterator elemIt = elemsOnFace.begin();
2664 for ( ; elemIt != elemsOnFace.end(); ++elemIt ) {
2665 const SMDS_QuadraticFaceOfNodes* QF =
2666 dynamic_cast<const SMDS_QuadraticFaceOfNodes*> (*elemIt);
2668 vector<const SMDS_MeshNode*> Ns;
2669 Ns.reserve(QF->NbNodes()+1);
2670 SMDS_NodeIteratorPtr anIter = QF->interlacedNodesIterator();
2671 while ( anIter->more() )
2672 Ns.push_back( anIter->next() );
2673 Ns.push_back( Ns[0] );
2675 for(int i=0; i<QF->NbNodes(); i=i+2) {
2676 if ( !surface.IsNull() ) {
2677 gp_XY uv1 = helper.GetNodeUV( face, Ns[i], Ns[i+2] );
2678 gp_XY uv2 = helper.GetNodeUV( face, Ns[i+2], Ns[i] );
2679 gp_XY uv = ( uv1 + uv2 ) / 2.;
2680 gp_Pnt xyz = surface->Value( uv.X(), uv.Y() );
2681 x = xyz.X(); y = xyz.Y(); z = xyz.Z();
2684 x = (Ns[i]->X() + Ns[i+2]->X())/2;
2685 y = (Ns[i]->Y() + Ns[i+2]->Y())/2;
2686 z = (Ns[i]->Z() + Ns[i+2]->Z())/2;
2688 if( fabs( Ns[i+1]->X() - x ) > disttol ||
2689 fabs( Ns[i+1]->Y() - y ) > disttol ||
2690 fabs( Ns[i+1]->Z() - z ) > disttol ) {
2691 // we have to move i+1 node
2692 aMesh->MoveNode( Ns[i+1], x, y, z );
2699 } // loop on face ids
2703 //=======================================================================
2704 //function : isReverse
2705 //purpose : Return true if normal of prevNodes is not co-directied with
2706 // gp_Vec(prevNodes[iNotSame],nextNodes[iNotSame]).
2707 // iNotSame is where prevNodes and nextNodes are different
2708 //=======================================================================
2710 static bool isReverse(const SMDS_MeshNode* prevNodes[],
2711 const SMDS_MeshNode* nextNodes[],
2715 int iBeforeNotSame = ( iNotSame == 0 ? nbNodes - 1 : iNotSame - 1 );
2716 int iAfterNotSame = ( iNotSame + 1 == nbNodes ? 0 : iNotSame + 1 );
2718 const SMDS_MeshNode* nB = prevNodes[ iBeforeNotSame ];
2719 const SMDS_MeshNode* nA = prevNodes[ iAfterNotSame ];
2720 const SMDS_MeshNode* nP = prevNodes[ iNotSame ];
2721 const SMDS_MeshNode* nN = nextNodes[ iNotSame ];
2723 gp_Pnt pB ( nB->X(), nB->Y(), nB->Z() );
2724 gp_Pnt pA ( nA->X(), nA->Y(), nA->Z() );
2725 gp_Pnt pP ( nP->X(), nP->Y(), nP->Z() );
2726 gp_Pnt pN ( nN->X(), nN->Y(), nN->Z() );
2728 gp_Vec vB ( pP, pB ), vA ( pP, pA ), vN ( pP, pN );
2730 return (vA ^ vB) * vN < 0.0;
2733 //=======================================================================
2734 //function : sweepElement
2736 //=======================================================================
2738 static void sweepElement(SMESHDS_Mesh* aMesh,
2739 const SMDS_MeshElement* elem,
2740 const vector<TNodeOfNodeListMapItr> & newNodesItVec,
2741 list<const SMDS_MeshElement*>& newElems,
2743 SMESH_SequenceOfElemPtr& myLastCreatedElems)
2745 // Loop on elem nodes:
2746 // find new nodes and detect same nodes indices
2747 int nbNodes = elem->NbNodes();
2748 list<const SMDS_MeshNode*>::const_iterator itNN[ nbNodes ];
2749 const SMDS_MeshNode* prevNod[ nbNodes ], *nextNod[ nbNodes ], *midlNod[ nbNodes ];
2750 int iNode, nbSame = 0, iNotSameNode = 0, iSameNode = 0;
2751 vector<int> sames(nbNodes);
2753 bool issimple[nbNodes];
2755 for ( iNode = 0; iNode < nbNodes; iNode++ ) {
2756 TNodeOfNodeListMapItr nnIt = newNodesItVec[ iNode ];
2757 const SMDS_MeshNode* node = nnIt->first;
2758 const list< const SMDS_MeshNode* > & listNewNodes = nnIt->second;
2759 if ( listNewNodes.empty() )
2762 if(listNewNodes.size()==nbSteps) {
2763 issimple[iNode] = true;
2766 issimple[iNode] = false;
2769 itNN[ iNode ] = listNewNodes.begin();
2770 prevNod[ iNode ] = node;
2771 nextNod[ iNode ] = listNewNodes.front();
2772 //cout<<"iNode="<<iNode<<endl;
2773 //cout<<" prevNod[iNode]="<< prevNod[iNode]<<" nextNod[iNode]="<< nextNod[iNode]<<endl;
2774 if ( prevNod[ iNode ] != nextNod [ iNode ])
2775 iNotSameNode = iNode;
2779 sames[nbSame++] = iNode;
2782 //cout<<"1 nbSame="<<nbSame<<endl;
2783 if ( nbSame == nbNodes || nbSame > 2) {
2784 MESSAGE( " Too many same nodes of element " << elem->GetID() );
2788 // if( elem->IsQuadratic() && nbSame>0 ) {
2789 // MESSAGE( "Can not rotate quadratic element " << elem->GetID() );
2793 int iBeforeSame = 0, iAfterSame = 0, iOpposSame = 0;
2795 iBeforeSame = ( iSameNode == 0 ? nbNodes - 1 : iSameNode - 1 );
2796 iAfterSame = ( iSameNode + 1 == nbNodes ? 0 : iSameNode + 1 );
2797 iOpposSame = ( iSameNode - 2 < 0 ? iSameNode + 2 : iSameNode - 2 );
2801 //cout<<" prevNod[0]="<< prevNod[0]<<" prevNod[1]="<< prevNod[1]
2802 // <<" prevNod[2]="<< prevNod[2]<<" prevNod[3]="<< prevNod[4]
2803 // <<" prevNod[4]="<< prevNod[4]<<" prevNod[5]="<< prevNod[5]
2804 // <<" prevNod[6]="<< prevNod[6]<<" prevNod[7]="<< prevNod[7]<<endl;
2806 // check element orientation
2808 if ( nbNodes > 2 && !isReverse( prevNod, nextNod, nbNodes, iNotSameNode )) {
2809 //MESSAGE("Reversed elem " << elem );
2813 int iAB = iAfterSame + iBeforeSame;
2814 iBeforeSame = iAB - iBeforeSame;
2815 iAfterSame = iAB - iAfterSame;
2819 // make new elements
2820 int iStep;//, nbSteps = newNodesItVec[ 0 ]->second.size();
2821 for (iStep = 0; iStep < nbSteps; iStep++ ) {
2823 for ( iNode = 0; iNode < nbNodes; iNode++ ) {
2824 if(issimple[iNode]) {
2825 nextNod[ iNode ] = *itNN[ iNode ];
2829 if( elem->GetType()==SMDSAbs_Node ) {
2830 // we have to use two nodes
2831 midlNod[ iNode ] = *itNN[ iNode ];
2833 nextNod[ iNode ] = *itNN[ iNode ];
2836 else if(!elem->IsQuadratic() ||
2837 elem->IsQuadratic() && elem->IsMediumNode(prevNod[iNode]) ) {
2838 // we have to use each second node
2840 nextNod[ iNode ] = *itNN[ iNode ];
2844 // we have to use two nodes
2845 midlNod[ iNode ] = *itNN[ iNode ];
2847 nextNod[ iNode ] = *itNN[ iNode ];
2852 SMDS_MeshElement* aNewElem = 0;
2853 if(!elem->IsPoly()) {
2854 switch ( nbNodes ) {
2858 if ( nbSame == 0 ) {
2860 aNewElem = aMesh->AddEdge( prevNod[ 0 ], nextNod[ 0 ] );
2862 aNewElem = aMesh->AddEdge( prevNod[ 0 ], nextNod[ 0 ], midlNod[ 0 ] );
2868 aNewElem = aMesh->AddFace(prevNod[ 0 ], prevNod[ 1 ],
2869 nextNod[ 1 ], nextNod[ 0 ] );
2871 aNewElem = aMesh->AddFace(prevNod[ 0 ], prevNod[ 1 ],
2872 nextNod[ iNotSameNode ] );
2876 case 3: { // TRIANGLE or quadratic edge
2877 if(elem->GetType() == SMDSAbs_Face) { // TRIANGLE
2879 if ( nbSame == 0 ) // --- pentahedron
2880 aNewElem = aMesh->AddVolume (prevNod[ i0 ], prevNod[ 1 ], prevNod[ i2 ],
2881 nextNod[ i0 ], nextNod[ 1 ], nextNod[ i2 ] );
2883 else if ( nbSame == 1 ) // --- pyramid
2884 aNewElem = aMesh->AddVolume (prevNod[ iBeforeSame ], prevNod[ iAfterSame ],
2885 nextNod[ iAfterSame ], nextNod[ iBeforeSame ],
2886 nextNod[ iSameNode ]);
2888 else // 2 same nodes: --- tetrahedron
2889 aNewElem = aMesh->AddVolume (prevNod[ i0 ], prevNod[ 1 ], prevNod[ i2 ],
2890 nextNod[ iNotSameNode ]);
2892 else { // quadratic edge
2893 if(nbSame==0) { // quadratic quadrangle
2894 aNewElem = aMesh->AddFace(prevNod[0], nextNod[0], nextNod[1], prevNod[1],
2895 midlNod[0], nextNod[2], midlNod[1], prevNod[2]);
2897 else if(nbSame==1) { // quadratic triangle
2899 return; // medium node on axis
2900 else if(sames[0]==0) {
2901 aNewElem = aMesh->AddFace(prevNod[0], nextNod[1], prevNod[1],
2902 nextNod[2], midlNod[1], prevNod[2]);
2904 else { // sames[0]==1
2905 aNewElem = aMesh->AddFace(prevNod[0], nextNod[0], prevNod[1],
2906 midlNod[0], nextNod[2], prevNod[2]);
2914 case 4: { // QUADRANGLE
2916 if ( nbSame == 0 ) // --- hexahedron
2917 aNewElem = aMesh->AddVolume (prevNod[ i0 ], prevNod[ 1 ], prevNod[ i2 ], prevNod[ 3 ],
2918 nextNod[ i0 ], nextNod[ 1 ], nextNod[ i2 ], nextNod[ 3 ]);
2920 else if ( nbSame == 1 ) { // --- pyramid + pentahedron
2921 aNewElem = aMesh->AddVolume (prevNod[ iBeforeSame ], prevNod[ iAfterSame ],
2922 nextNod[ iAfterSame ], nextNod[ iBeforeSame ],
2923 nextNod[ iSameNode ]);
2924 newElems.push_back( aNewElem );
2925 aNewElem = aMesh->AddVolume (prevNod[ iAfterSame ], prevNod[ iOpposSame ],
2926 prevNod[ iBeforeSame ], nextNod[ iAfterSame ],
2927 nextNod[ iOpposSame ], nextNod[ iBeforeSame ] );
2929 else if ( nbSame == 2 ) { // pentahedron
2930 if ( prevNod[ iBeforeSame ] == nextNod[ iBeforeSame ] )
2931 // iBeforeSame is same too
2932 aNewElem = aMesh->AddVolume (prevNod[ iBeforeSame ], prevNod[ iOpposSame ],
2933 nextNod[ iOpposSame ], prevNod[ iSameNode ],
2934 prevNod[ iAfterSame ], nextNod[ iAfterSame ]);
2936 // iAfterSame is same too
2937 aNewElem = aMesh->AddVolume (prevNod[ iSameNode ], prevNod[ iBeforeSame ],
2938 nextNod[ iBeforeSame ], prevNod[ iAfterSame ],
2939 prevNod[ iOpposSame ], nextNod[ iOpposSame ]);
2943 case 6: { // quadratic triangle
2944 // create pentahedron with 15 nodes
2945 if(i0>0) { // reversed case
2946 aNewElem = aMesh->AddVolume (prevNod[0], prevNod[2], prevNod[1],
2947 nextNod[0], nextNod[2], nextNod[1],
2948 prevNod[5], prevNod[4], prevNod[3],
2949 nextNod[5], nextNod[4], nextNod[3],
2950 midlNod[0], midlNod[2], midlNod[1]);
2952 else { // not reversed case
2953 aNewElem = aMesh->AddVolume (prevNod[0], prevNod[1], prevNod[2],
2954 nextNod[0], nextNod[1], nextNod[2],
2955 prevNod[3], prevNod[4], prevNod[5],
2956 nextNod[3], nextNod[4], nextNod[5],
2957 midlNod[0], midlNod[1], midlNod[2]);
2961 case 8: { // quadratic quadrangle
2962 // create hexahedron with 20 nodes
2963 if(i0>0) { // reversed case
2964 aNewElem = aMesh->AddVolume (prevNod[0], prevNod[3], prevNod[2], prevNod[1],
2965 nextNod[0], nextNod[3], nextNod[2], nextNod[1],
2966 prevNod[7], prevNod[6], prevNod[5], prevNod[4],
2967 nextNod[7], nextNod[6], nextNod[5], nextNod[4],
2968 midlNod[0], midlNod[3], midlNod[2], midlNod[1]);
2970 else { // not reversed case
2971 aNewElem = aMesh->AddVolume (prevNod[0], prevNod[1], prevNod[2], prevNod[3],
2972 nextNod[0], nextNod[1], nextNod[2], nextNod[3],
2973 prevNod[4], prevNod[5], prevNod[6], prevNod[7],
2974 nextNod[4], nextNod[5], nextNod[6], nextNod[7],
2975 midlNod[0], midlNod[1], midlNod[2], midlNod[3]);
2980 // realized for extrusion only
2981 //vector<const SMDS_MeshNode*> polyedre_nodes (nbNodes*2 + 4*nbNodes);
2982 //vector<int> quantities (nbNodes + 2);
2984 //quantities[0] = nbNodes; // bottom of prism
2985 //for (int inode = 0; inode < nbNodes; inode++) {
2986 // polyedre_nodes[inode] = prevNod[inode];
2989 //quantities[1] = nbNodes; // top of prism
2990 //for (int inode = 0; inode < nbNodes; inode++) {
2991 // polyedre_nodes[nbNodes + inode] = nextNod[inode];
2994 //for (int iface = 0; iface < nbNodes; iface++) {
2995 // quantities[iface + 2] = 4;
2996 // int inextface = (iface == nbNodes - 1) ? 0 : iface + 1;
2997 // polyedre_nodes[2*nbNodes + 4*iface + 0] = prevNod[iface];
2998 // polyedre_nodes[2*nbNodes + 4*iface + 1] = prevNod[inextface];
2999 // polyedre_nodes[2*nbNodes + 4*iface + 2] = nextNod[inextface];
3000 // polyedre_nodes[2*nbNodes + 4*iface + 3] = nextNod[iface];
3002 //aNewElem = aMesh->AddPolyhedralVolume (polyedre_nodes, quantities);
3009 // realized for extrusion only
3010 vector<const SMDS_MeshNode*> polyedre_nodes (nbNodes*2 + 4*nbNodes);
3011 vector<int> quantities (nbNodes + 2);
3013 quantities[0] = nbNodes; // bottom of prism
3014 for (int inode = 0; inode < nbNodes; inode++) {
3015 polyedre_nodes[inode] = prevNod[inode];
3018 quantities[1] = nbNodes; // top of prism
3019 for (int inode = 0; inode < nbNodes; inode++) {
3020 polyedre_nodes[nbNodes + inode] = nextNod[inode];
3023 for (int iface = 0; iface < nbNodes; iface++) {
3024 quantities[iface + 2] = 4;
3025 int inextface = (iface == nbNodes - 1) ? 0 : iface + 1;
3026 polyedre_nodes[2*nbNodes + 4*iface + 0] = prevNod[iface];
3027 polyedre_nodes[2*nbNodes + 4*iface + 1] = prevNod[inextface];
3028 polyedre_nodes[2*nbNodes + 4*iface + 2] = nextNod[inextface];
3029 polyedre_nodes[2*nbNodes + 4*iface + 3] = nextNod[iface];
3031 aNewElem = aMesh->AddPolyhedralVolume (polyedre_nodes, quantities);
3035 newElems.push_back( aNewElem );
3036 myLastCreatedElems.Append(aNewElem);
3039 // set new prev nodes
3040 for ( iNode = 0; iNode < nbNodes; iNode++ )
3041 prevNod[ iNode ] = nextNod[ iNode ];
3046 //=======================================================================
3047 //function : makeWalls
3048 //purpose : create 1D and 2D elements around swept elements
3049 //=======================================================================
3051 static void makeWalls (SMESHDS_Mesh* aMesh,
3052 TNodeOfNodeListMap & mapNewNodes,
3053 TElemOfElemListMap & newElemsMap,
3054 TElemOfVecOfNnlmiMap & elemNewNodesMap,
3055 TIDSortedElemSet& elemSet,
3057 SMESH_SequenceOfElemPtr& myLastCreatedElems)
3059 ASSERT( newElemsMap.size() == elemNewNodesMap.size() );
3061 // Find nodes belonging to only one initial element - sweep them to get edges.
3063 TNodeOfNodeListMapItr nList = mapNewNodes.begin();
3064 for ( ; nList != mapNewNodes.end(); nList++ ) {
3065 const SMDS_MeshNode* node =
3066 static_cast<const SMDS_MeshNode*>( nList->first );
3067 SMDS_ElemIteratorPtr eIt = node->GetInverseElementIterator();
3068 int nbInitElems = 0;
3069 const SMDS_MeshElement* el = 0;
3070 SMDSAbs_ElementType highType = SMDSAbs_Edge; // count most complex elements only
3071 while ( eIt->more() && nbInitElems < 2 ) {
3073 SMDSAbs_ElementType type = el->GetType();
3074 if ( type == SMDSAbs_Volume || type < highType ) continue;
3075 if ( type > highType ) {
3079 if ( elemSet.find(el) != elemSet.end() )
3082 if ( nbInitElems < 2 ) {
3083 bool NotCreateEdge = el && el->IsQuadratic() && el->IsMediumNode(node);
3084 if(!NotCreateEdge) {
3085 vector<TNodeOfNodeListMapItr> newNodesItVec( 1, nList );
3086 list<const SMDS_MeshElement*> newEdges;
3087 sweepElement( aMesh, node, newNodesItVec, newEdges, nbSteps, myLastCreatedElems );
3092 // Make a ceiling for each element ie an equal element of last new nodes.
3093 // Find free links of faces - make edges and sweep them into faces.
3095 TElemOfElemListMap::iterator itElem = newElemsMap.begin();
3096 TElemOfVecOfNnlmiMap::iterator itElemNodes = elemNewNodesMap.begin();
3097 for ( ; itElem != newElemsMap.end(); itElem++, itElemNodes++ ) {
3098 const SMDS_MeshElement* elem = itElem->first;
3099 vector<TNodeOfNodeListMapItr>& vecNewNodes = itElemNodes->second;
3101 if ( elem->GetType() == SMDSAbs_Edge ) {
3102 // create a ceiling edge
3103 if (!elem->IsQuadratic()) {
3104 if ( !aMesh->FindEdge( vecNewNodes[ 0 ]->second.back(),
3105 vecNewNodes[ 1 ]->second.back()))
3106 myLastCreatedElems.Append(aMesh->AddEdge(vecNewNodes[ 0 ]->second.back(),
3107 vecNewNodes[ 1 ]->second.back()));
3110 if ( !aMesh->FindEdge( vecNewNodes[ 0 ]->second.back(),
3111 vecNewNodes[ 1 ]->second.back(),
3112 vecNewNodes[ 2 ]->second.back()))
3113 myLastCreatedElems.Append(aMesh->AddEdge(vecNewNodes[ 0 ]->second.back(),
3114 vecNewNodes[ 1 ]->second.back(),
3115 vecNewNodes[ 2 ]->second.back()));
3118 if ( elem->GetType() != SMDSAbs_Face )
3121 if(itElem->second.size()==0) continue;
3123 bool hasFreeLinks = false;
3125 TIDSortedElemSet avoidSet;
3126 avoidSet.insert( elem );
3128 set<const SMDS_MeshNode*> aFaceLastNodes;
3129 int iNode, nbNodes = vecNewNodes.size();
3130 if(!elem->IsQuadratic()) {
3131 // loop on the face nodes
3132 for ( iNode = 0; iNode < nbNodes; iNode++ ) {
3133 aFaceLastNodes.insert( vecNewNodes[ iNode ]->second.back() );
3134 // look for free links of the face
3135 int iNext = ( iNode + 1 == nbNodes ) ? 0 : iNode + 1;
3136 const SMDS_MeshNode* n1 = vecNewNodes[ iNode ]->first;
3137 const SMDS_MeshNode* n2 = vecNewNodes[ iNext ]->first;
3138 // check if a link is free
3139 if ( ! SMESH_MeshEditor::FindFaceInSet ( n1, n2, elemSet, avoidSet )) {
3140 hasFreeLinks = true;
3141 // make an edge and a ceiling for a new edge
3142 if ( !aMesh->FindEdge( n1, n2 )) {
3143 myLastCreatedElems.Append(aMesh->AddEdge( n1, n2 ));
3145 n1 = vecNewNodes[ iNode ]->second.back();
3146 n2 = vecNewNodes[ iNext ]->second.back();
3147 if ( !aMesh->FindEdge( n1, n2 )) {
3148 myLastCreatedElems.Append(aMesh->AddEdge( n1, n2 ));
3153 else { // elem is quadratic face
3154 int nbn = nbNodes/2;
3155 for ( iNode = 0; iNode < nbn; iNode++ ) {
3156 aFaceLastNodes.insert( vecNewNodes[ iNode ]->second.back() );
3157 int iNext = ( iNode + 1 == nbn ) ? 0 : iNode + 1;
3158 const SMDS_MeshNode* n1 = vecNewNodes[ iNode ]->first;
3159 const SMDS_MeshNode* n2 = vecNewNodes[ iNext ]->first;
3160 // check if a link is free
3161 if ( ! SMESH_MeshEditor::FindFaceInSet ( n1, n2, elemSet, avoidSet )) {
3162 hasFreeLinks = true;
3163 // make an edge and a ceiling for a new edge
3165 const SMDS_MeshNode* n3 = vecNewNodes[ iNode+nbn ]->first;
3166 if ( !aMesh->FindEdge( n1, n2, n3 )) {
3167 myLastCreatedElems.Append(aMesh->AddEdge( n1, n2, n3 ));
3169 n1 = vecNewNodes[ iNode ]->second.back();
3170 n2 = vecNewNodes[ iNext ]->second.back();
3171 n3 = vecNewNodes[ iNode+nbn ]->second.back();
3172 if ( !aMesh->FindEdge( n1, n2, n3 )) {
3173 myLastCreatedElems.Append(aMesh->AddEdge( n1, n2, n3 ));
3177 for ( iNode = nbn; iNode < 2*nbn; iNode++ ) {
3178 aFaceLastNodes.insert( vecNewNodes[ iNode ]->second.back() );
3182 // sweep free links into faces
3184 if ( hasFreeLinks ) {
3185 list<const SMDS_MeshElement*> & newVolumes = itElem->second;
3186 int iStep; //, nbSteps = vecNewNodes[0]->second.size();
3187 int iVol, volNb, nbVolumesByStep = newVolumes.size() / nbSteps;
3189 set<const SMDS_MeshNode*> initNodeSet, faceNodeSet;
3190 for ( iNode = 0; iNode < nbNodes; iNode++ )
3191 initNodeSet.insert( vecNewNodes[ iNode ]->first );
3193 for ( volNb = 0; volNb < nbVolumesByStep; volNb++ ) {
3194 list<const SMDS_MeshElement*>::iterator v = newVolumes.begin();
3196 while ( iVol++ < volNb ) v++;
3197 // find indices of free faces of a volume
3199 SMDS_VolumeTool vTool( *v );
3200 int iF, nbF = vTool.NbFaces();
3201 for ( iF = 0; iF < nbF; iF ++ ) {
3202 if (vTool.IsFreeFace( iF ) &&
3203 vTool.GetFaceNodes( iF, faceNodeSet ) &&
3204 initNodeSet != faceNodeSet) // except an initial face
3205 fInd.push_back( iF );
3210 // create faces for all steps
3211 // if such a face has been already created by sweep of edge, assure that its orientation is OK
3212 for ( iStep = 0; iStep < nbSteps; iStep++ ) {
3214 vTool.SetExternalNormal();
3215 list< int >::iterator ind = fInd.begin();
3216 for ( ; ind != fInd.end(); ind++ ) {
3217 const SMDS_MeshNode** nodes = vTool.GetFaceNodes( *ind );
3218 int nbn = vTool.NbFaceNodes( *ind );
3220 case 3: { ///// triangle
3221 const SMDS_MeshFace * f = aMesh->FindFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ]);
3223 myLastCreatedElems.Append(aMesh->AddFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ] ));
3224 else if ( nodes[ 1 ] != f->GetNode( f->GetNodeIndex( nodes[ 0 ] ) + 1 ))
3225 aMesh->ChangeElementNodes( f, nodes, nbn );
3228 case 4: { ///// quadrangle
3229 const SMDS_MeshFace * f = aMesh->FindFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ], nodes[ 3 ]);
3231 myLastCreatedElems.Append(aMesh->AddFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ], nodes[ 3 ] ));
3232 else if ( nodes[ 1 ] != f->GetNode( f->GetNodeIndex( nodes[ 0 ] ) + 1 ))
3233 aMesh->ChangeElementNodes( f, nodes, nbn );
3237 if( (*v)->IsQuadratic() ) {
3238 if(nbn==6) { /////// quadratic triangle
3239 const SMDS_MeshFace * f = aMesh->FindFace( nodes[0], nodes[2], nodes[4],
3240 nodes[1], nodes[3], nodes[5] );
3242 myLastCreatedElems.Append(aMesh->AddFace(nodes[0], nodes[2], nodes[4],
3243 nodes[1], nodes[3], nodes[5]));
3244 else if ( nodes[ 2 ] != f->GetNode( f->GetNodeIndex( nodes[ 0 ] ) + 1 ))
3245 aMesh->ChangeElementNodes( f, nodes, nbn );
3247 else { /////// quadratic quadrangle
3248 const SMDS_MeshFace * f = aMesh->FindFace( nodes[0], nodes[2], nodes[4], nodes[6],
3249 nodes[1], nodes[3], nodes[5], nodes[7] );
3251 myLastCreatedElems.Append(aMesh->AddFace(nodes[0], nodes[2], nodes[4], nodes[6],
3252 nodes[1], nodes[3], nodes[5], nodes[7]));
3253 else if ( nodes[ 2 ] != f->GetNode( f->GetNodeIndex( nodes[ 0 ] ) + 1 ))
3254 aMesh->ChangeElementNodes( f, nodes, nbn );
3257 else { //////// polygon
3258 vector<const SMDS_MeshNode*> polygon_nodes ( nodes, &nodes[nbn] );
3259 const SMDS_MeshFace * f = aMesh->FindFace( polygon_nodes );
3261 myLastCreatedElems.Append(aMesh->AddPolygonalFace(polygon_nodes));
3262 else if ( nodes[ 1 ] != f->GetNode( f->GetNodeIndex( nodes[ 0 ] ) + 1 ))
3263 aMesh->ChangeElementNodes( f, nodes, nbn );
3267 // go to the next volume
3269 while ( iVol++ < nbVolumesByStep ) v++;
3272 } // sweep free links into faces
3274 // make a ceiling face with a normal external to a volume
3276 SMDS_VolumeTool lastVol( itElem->second.back() );
3278 int iF = lastVol.GetFaceIndex( aFaceLastNodes );
3280 lastVol.SetExternalNormal();
3281 const SMDS_MeshNode** nodes = lastVol.GetFaceNodes( iF );
3282 int nbn = lastVol.NbFaceNodes( iF );
3285 if (!hasFreeLinks ||
3286 !aMesh->FindFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ]))
3287 myLastCreatedElems.Append(aMesh->AddFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ] ));
3290 if (!hasFreeLinks ||
3291 !aMesh->FindFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ], nodes[ 3 ]))
3292 myLastCreatedElems.Append(aMesh->AddFace( nodes[ 0 ], nodes[ 1 ], nodes[ 2 ], nodes[ 3 ] ));
3295 if(itElem->second.back()->IsQuadratic()) {
3297 if (!hasFreeLinks ||
3298 !aMesh->FindFace(nodes[0], nodes[2], nodes[4],
3299 nodes[1], nodes[3], nodes[5]) ) {
3300 myLastCreatedElems.Append(aMesh->AddFace(nodes[0], nodes[2], nodes[4],
3301 nodes[1], nodes[3], nodes[5]));
3305 if (!hasFreeLinks ||
3306 !aMesh->FindFace(nodes[0], nodes[2], nodes[4], nodes[6],
3307 nodes[1], nodes[3], nodes[5], nodes[7]) )
3308 myLastCreatedElems.Append(aMesh->AddFace(nodes[0], nodes[2], nodes[4], nodes[6],
3309 nodes[1], nodes[3], nodes[5], nodes[7]));
3313 vector<const SMDS_MeshNode*> polygon_nodes ( nodes, &nodes[nbn] );
3314 if (!hasFreeLinks || !aMesh->FindFace(polygon_nodes))
3315 myLastCreatedElems.Append(aMesh->AddPolygonalFace(polygon_nodes));
3319 } // loop on swept elements
3322 //=======================================================================
3323 //function : RotationSweep
3325 //=======================================================================
3327 void SMESH_MeshEditor::RotationSweep(TIDSortedElemSet & theElems,
3328 const gp_Ax1& theAxis,
3329 const double theAngle,
3330 const int theNbSteps,
3331 const double theTol,
3332 const bool theMakeWalls)
3334 myLastCreatedElems.Clear();
3335 myLastCreatedNodes.Clear();
3337 MESSAGE( "RotationSweep()");
3339 aTrsf.SetRotation( theAxis, theAngle );
3341 aTrsf2.SetRotation( theAxis, theAngle/2. );
3343 gp_Lin aLine( theAxis );
3344 double aSqTol = theTol * theTol;
3346 SMESHDS_Mesh* aMesh = GetMeshDS();
3348 TNodeOfNodeListMap mapNewNodes;
3349 TElemOfVecOfNnlmiMap mapElemNewNodes;
3350 TElemOfElemListMap newElemsMap;
3353 TIDSortedElemSet::iterator itElem;
3354 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
3355 const SMDS_MeshElement* elem = *itElem;
3356 if ( !elem || elem->GetType() == SMDSAbs_Volume )
3358 vector<TNodeOfNodeListMapItr> & newNodesItVec = mapElemNewNodes[ elem ];
3359 newNodesItVec.reserve( elem->NbNodes() );
3361 // loop on elem nodes
3362 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
3363 while ( itN->more() ) {
3365 // check if a node has been already sweeped
3366 const SMDS_MeshNode* node =
3367 static_cast<const SMDS_MeshNode*>( itN->next() );
3368 TNodeOfNodeListMapItr nIt = mapNewNodes.find( node );
3369 if ( nIt == mapNewNodes.end() ) {
3370 nIt = mapNewNodes.insert( make_pair( node, list<const SMDS_MeshNode*>() )).first;
3371 list<const SMDS_MeshNode*>& listNewNodes = nIt->second;
3374 gp_XYZ aXYZ( node->X(), node->Y(), node->Z() );
3376 aXYZ.Coord( coord[0], coord[1], coord[2] );
3377 bool isOnAxis = ( aLine.SquareDistance( aXYZ ) <= aSqTol );
3378 const SMDS_MeshNode * newNode = node;
3379 for ( int i = 0; i < theNbSteps; i++ ) {
3381 if( elem->IsQuadratic() && !elem->IsMediumNode(node) ) {
3383 aTrsf2.Transforms( coord[0], coord[1], coord[2] );
3384 //aTrsf.Transforms( coord[0], coord[1], coord[2] );
3385 newNode = aMesh->AddNode( coord[0], coord[1], coord[2] );
3386 myLastCreatedNodes.Append(newNode);
3387 listNewNodes.push_back( newNode );
3388 aTrsf2.Transforms( coord[0], coord[1], coord[2] );
3389 //aTrsf.Transforms( coord[0], coord[1], coord[2] );
3392 aTrsf.Transforms( coord[0], coord[1], coord[2] );
3394 newNode = aMesh->AddNode( coord[0], coord[1], coord[2] );
3395 myLastCreatedNodes.Append(newNode);
3397 listNewNodes.push_back( newNode );
3401 // if current elem is quadratic and current node is not medium
3402 // we have to check - may be it is needed to insert additional nodes
3403 if( elem->IsQuadratic() && !elem->IsMediumNode(node) ) {
3404 list< const SMDS_MeshNode* > & listNewNodes = nIt->second;
3405 if(listNewNodes.size()==theNbSteps) {
3406 listNewNodes.clear();
3408 gp_XYZ aXYZ( node->X(), node->Y(), node->Z() );
3410 aXYZ.Coord( coord[0], coord[1], coord[2] );
3411 const SMDS_MeshNode * newNode = node;
3412 for(int i = 0; i<theNbSteps; i++) {
3413 aTrsf2.Transforms( coord[0], coord[1], coord[2] );
3414 newNode = aMesh->AddNode( coord[0], coord[1], coord[2] );
3415 myLastCreatedNodes.Append(newNode);
3416 listNewNodes.push_back( newNode );
3417 aTrsf2.Transforms( coord[0], coord[1], coord[2] );
3418 newNode = aMesh->AddNode( coord[0], coord[1], coord[2] );
3419 myLastCreatedNodes.Append(newNode);
3420 listNewNodes.push_back( newNode );
3425 newNodesItVec.push_back( nIt );
3427 // make new elements
3428 sweepElement( aMesh, elem, newNodesItVec, newElemsMap[elem], theNbSteps, myLastCreatedElems );
3432 makeWalls( aMesh, mapNewNodes, newElemsMap, mapElemNewNodes,
3433 theElems, theNbSteps, myLastCreatedElems );
3437 //=======================================================================
3438 //function : CreateNode
3440 //=======================================================================
3441 const SMDS_MeshNode* SMESH_MeshEditor::CreateNode(const double x,
3444 const double tolnode,
3445 SMESH_SequenceOfNode& aNodes)
3447 myLastCreatedElems.Clear();
3448 myLastCreatedNodes.Clear();
3451 SMESHDS_Mesh * aMesh = myMesh->GetMeshDS();
3453 // try to search in sequence of existing nodes
3454 // if aNodes.Length()>0 we 'nave to use given sequence
3455 // else - use all nodes of mesh
3456 if(aNodes.Length()>0) {
3458 for(i=1; i<=aNodes.Length(); i++) {
3459 gp_Pnt P2(aNodes.Value(i)->X(),aNodes.Value(i)->Y(),aNodes.Value(i)->Z());
3460 if(P1.Distance(P2)<tolnode)
3461 return aNodes.Value(i);
3465 SMDS_NodeIteratorPtr itn = aMesh->nodesIterator();
3466 while(itn->more()) {
3467 const SMDS_MeshNode* aN = static_cast<const SMDS_MeshNode*> (itn->next());
3468 gp_Pnt P2(aN->X(),aN->Y(),aN->Z());
3469 if(P1.Distance(P2)<tolnode)
3474 // create new node and return it
3475 const SMDS_MeshNode* NewNode = aMesh->AddNode(x,y,z);
3476 myLastCreatedNodes.Append(NewNode);
3481 //=======================================================================
3482 //function : ExtrusionSweep
3484 //=======================================================================
3486 void SMESH_MeshEditor::ExtrusionSweep (TIDSortedElemSet & theElems,
3487 const gp_Vec& theStep,
3488 const int theNbSteps,
3489 TElemOfElemListMap& newElemsMap,
3491 const double theTolerance)
3493 ExtrusParam aParams;
3494 aParams.myDir = gp_Dir(theStep);
3495 aParams.myNodes.Clear();
3496 aParams.mySteps = new TColStd_HSequenceOfReal;
3498 for(i=1; i<=theNbSteps; i++)
3499 aParams.mySteps->Append(theStep.Magnitude());
3501 ExtrusionSweep(theElems,aParams,newElemsMap,theFlags,theTolerance);
3506 //=======================================================================
3507 //function : ExtrusionSweep
3509 //=======================================================================
3511 void SMESH_MeshEditor::ExtrusionSweep (TIDSortedElemSet & theElems,
3512 ExtrusParam& theParams,
3513 TElemOfElemListMap& newElemsMap,
3515 const double theTolerance)
3517 myLastCreatedElems.Clear();
3518 myLastCreatedNodes.Clear();
3520 SMESHDS_Mesh* aMesh = GetMeshDS();
3522 int nbsteps = theParams.mySteps->Length();
3524 TNodeOfNodeListMap mapNewNodes;
3525 //TNodeOfNodeVecMap mapNewNodes;
3526 TElemOfVecOfNnlmiMap mapElemNewNodes;
3527 //TElemOfVecOfMapNodesMap mapElemNewNodes;
3530 TIDSortedElemSet::iterator itElem;
3531 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
3532 // check element type
3533 const SMDS_MeshElement* elem = *itElem;
3534 if ( !elem || elem->GetType() == SMDSAbs_Volume )
3537 vector<TNodeOfNodeListMapItr> & newNodesItVec = mapElemNewNodes[ elem ];
3538 //vector<TNodeOfNodeVecMapItr> & newNodesItVec = mapElemNewNodes[ elem ];
3539 newNodesItVec.reserve( elem->NbNodes() );
3541 // loop on elem nodes
3542 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
3543 while ( itN->more() ) {
3545 // check if a node has been already sweeped
3546 const SMDS_MeshNode* node =
3547 static_cast<const SMDS_MeshNode*>( itN->next() );
3548 TNodeOfNodeListMap::iterator nIt = mapNewNodes.find( node );
3549 //TNodeOfNodeVecMap::iterator nIt = mapNewNodes.find( node );
3550 if ( nIt == mapNewNodes.end() ) {
3551 nIt = mapNewNodes.insert( make_pair( node, list<const SMDS_MeshNode*>() )).first;
3552 //nIt = mapNewNodes.insert( make_pair( node, vector<const SMDS_MeshNode*>() )).first;
3553 list<const SMDS_MeshNode*>& listNewNodes = nIt->second;
3554 //vector<const SMDS_MeshNode*>& vecNewNodes = nIt->second;
3555 //vecNewNodes.reserve(nbsteps);
3558 double coord[] = { node->X(), node->Y(), node->Z() };
3559 //int nbsteps = theParams.mySteps->Length();
3560 for ( int i = 0; i < nbsteps; i++ ) {
3561 if( elem->IsQuadratic() && !elem->IsMediumNode(node) ) {
3562 // create additional node
3563 double x = coord[0] + theParams.myDir.X()*theParams.mySteps->Value(i+1)/2.;
3564 double y = coord[1] + theParams.myDir.Y()*theParams.mySteps->Value(i+1)/2.;
3565 double z = coord[2] + theParams.myDir.Z()*theParams.mySteps->Value(i+1)/2.;
3566 if( theFlags & EXTRUSION_FLAG_SEW ) {
3567 const SMDS_MeshNode * newNode = CreateNode(x, y, z,
3568 theTolerance, theParams.myNodes);
3569 listNewNodes.push_back( newNode );
3572 const SMDS_MeshNode * newNode = aMesh->AddNode(x, y, z);
3573 myLastCreatedNodes.Append(newNode);
3574 listNewNodes.push_back( newNode );
3577 //aTrsf.Transforms( coord[0], coord[1], coord[2] );
3578 coord[0] = coord[0] + theParams.myDir.X()*theParams.mySteps->Value(i+1);
3579 coord[1] = coord[1] + theParams.myDir.Y()*theParams.mySteps->Value(i+1);
3580 coord[2] = coord[2] + theParams.myDir.Z()*theParams.mySteps->Value(i+1);
3581 if( theFlags & EXTRUSION_FLAG_SEW ) {
3582 const SMDS_MeshNode * newNode = CreateNode(coord[0], coord[1], coord[2],
3583 theTolerance, theParams.myNodes);
3584 listNewNodes.push_back( newNode );
3585 //vecNewNodes[i]=newNode;
3588 const SMDS_MeshNode * newNode = aMesh->AddNode( coord[0], coord[1], coord[2] );
3589 myLastCreatedNodes.Append(newNode);
3590 listNewNodes.push_back( newNode );
3591 //vecNewNodes[i]=newNode;
3596 // if current elem is quadratic and current node is not medium
3597 // we have to check - may be it is needed to insert additional nodes
3598 if( elem->IsQuadratic() && !elem->IsMediumNode(node) ) {
3599 list< const SMDS_MeshNode* > & listNewNodes = nIt->second;
3600 if(listNewNodes.size()==nbsteps) {
3601 listNewNodes.clear();
3602 double coord[] = { node->X(), node->Y(), node->Z() };
3603 for ( int i = 0; i < nbsteps; i++ ) {
3604 double x = coord[0] + theParams.myDir.X()*theParams.mySteps->Value(i+1);
3605 double y = coord[1] + theParams.myDir.Y()*theParams.mySteps->Value(i+1);
3606 double z = coord[2] + theParams.myDir.Z()*theParams.mySteps->Value(i+1);
3607 if( theFlags & EXTRUSION_FLAG_SEW ) {
3608 const SMDS_MeshNode * newNode = CreateNode(x, y, z,
3609 theTolerance, theParams.myNodes);
3610 listNewNodes.push_back( newNode );
3613 const SMDS_MeshNode * newNode = aMesh->AddNode(x, y, z);
3614 myLastCreatedNodes.Append(newNode);
3615 listNewNodes.push_back( newNode );
3617 coord[0] = coord[0] + theParams.myDir.X()*theParams.mySteps->Value(i+1);
3618 coord[1] = coord[1] + theParams.myDir.Y()*theParams.mySteps->Value(i+1);
3619 coord[2] = coord[2] + theParams.myDir.Z()*theParams.mySteps->Value(i+1);
3620 if( theFlags & EXTRUSION_FLAG_SEW ) {
3621 const SMDS_MeshNode * newNode = CreateNode(coord[0], coord[1], coord[2],
3622 theTolerance, theParams.myNodes);
3623 listNewNodes.push_back( newNode );
3626 const SMDS_MeshNode * newNode = aMesh->AddNode( coord[0], coord[1], coord[2] );
3627 myLastCreatedNodes.Append(newNode);
3628 listNewNodes.push_back( newNode );
3634 newNodesItVec.push_back( nIt );
3636 // make new elements
3637 sweepElement( aMesh, elem, newNodesItVec, newElemsMap[elem], nbsteps, myLastCreatedElems );
3640 if( theFlags & EXTRUSION_FLAG_BOUNDARY ) {
3641 makeWalls( aMesh, mapNewNodes, newElemsMap, mapElemNewNodes, theElems, nbsteps, myLastCreatedElems );
3646 //=======================================================================
3647 //class : SMESH_MeshEditor_PathPoint
3648 //purpose : auxiliary class
3649 //=======================================================================
3650 class SMESH_MeshEditor_PathPoint {
3652 SMESH_MeshEditor_PathPoint() {
3653 myPnt.SetCoord(99., 99., 99.);
3654 myTgt.SetCoord(1.,0.,0.);
3658 void SetPnt(const gp_Pnt& aP3D){
3661 void SetTangent(const gp_Dir& aTgt){
3664 void SetAngle(const double& aBeta){
3667 void SetParameter(const double& aPrm){
3670 const gp_Pnt& Pnt()const{
3673 const gp_Dir& Tangent()const{
3676 double Angle()const{
3679 double Parameter()const{
3690 //=======================================================================
3691 //function : ExtrusionAlongTrack
3693 //=======================================================================
3694 SMESH_MeshEditor::Extrusion_Error
3695 SMESH_MeshEditor::ExtrusionAlongTrack (TIDSortedElemSet & theElements,
3696 SMESH_subMesh* theTrack,
3697 const SMDS_MeshNode* theN1,
3698 const bool theHasAngles,
3699 list<double>& theAngles,
3700 const bool theHasRefPoint,
3701 const gp_Pnt& theRefPoint)
3703 myLastCreatedElems.Clear();
3704 myLastCreatedNodes.Clear();
3706 MESSAGE("SMESH_MeshEditor::ExtrusionAlongTrack")
3707 int j, aNbTP, aNbE, aNb;
3708 double aT1, aT2, aT, aAngle, aX, aY, aZ;
3709 std::list<double> aPrms;
3710 std::list<double>::iterator aItD;
3711 TIDSortedElemSet::iterator itElem;
3713 Standard_Real aTx1, aTx2, aL2, aTolVec, aTolVec2;
3717 Handle(Geom_Curve) aC3D;
3718 TopoDS_Edge aTrackEdge;
3719 TopoDS_Vertex aV1, aV2;
3721 SMDS_ElemIteratorPtr aItE;
3722 SMDS_NodeIteratorPtr aItN;
3723 SMDSAbs_ElementType aTypeE;
3725 TNodeOfNodeListMap mapNewNodes;
3726 TElemOfVecOfNnlmiMap mapElemNewNodes;
3727 TElemOfElemListMap newElemsMap;
3730 aTolVec2=aTolVec*aTolVec;
3733 aNbE = theElements.size();
3736 return EXTR_NO_ELEMENTS;
3738 // 1.1 Track Pattern
3741 SMESHDS_SubMesh* pSubMeshDS=theTrack->GetSubMeshDS();
3743 aItE = pSubMeshDS->GetElements();
3744 while ( aItE->more() ) {
3745 const SMDS_MeshElement* pE = aItE->next();
3746 aTypeE = pE->GetType();
3747 // Pattern must contain links only
3748 if ( aTypeE != SMDSAbs_Edge )
3749 return EXTR_PATH_NOT_EDGE;
3752 const TopoDS_Shape& aS = theTrack->GetSubShape();
3753 // Sub shape for the Pattern must be an Edge
3754 if ( aS.ShapeType() != TopAbs_EDGE )
3755 return EXTR_BAD_PATH_SHAPE;
3757 aTrackEdge = TopoDS::Edge( aS );
3758 // the Edge must not be degenerated
3759 if ( BRep_Tool::Degenerated( aTrackEdge ) )
3760 return EXTR_BAD_PATH_SHAPE;
3762 TopExp::Vertices( aTrackEdge, aV1, aV2 );
3763 aT1=BRep_Tool::Parameter( aV1, aTrackEdge );
3764 aT2=BRep_Tool::Parameter( aV2, aTrackEdge );
3766 aItN = theTrack->GetFather()->GetSubMesh( aV1 )->GetSubMeshDS()->GetNodes();
3767 const SMDS_MeshNode* aN1 = aItN->next();
3769 aItN = theTrack->GetFather()->GetSubMesh( aV2 )->GetSubMeshDS()->GetNodes();
3770 const SMDS_MeshNode* aN2 = aItN->next();
3772 // starting node must be aN1 or aN2
3773 if ( !( aN1 == theN1 || aN2 == theN1 ) )
3774 return EXTR_BAD_STARTING_NODE;
3776 aNbTP = pSubMeshDS->NbNodes() + 2;
3779 vector<double> aAngles( aNbTP );
3781 for ( j=0; j < aNbTP; ++j ) {
3785 if ( theHasAngles ) {
3786 aItD = theAngles.begin();
3787 for ( j=1; (aItD != theAngles.end()) && (j<aNbTP); ++aItD, ++j ) {
3789 aAngles[j] = aAngle;
3793 // 2. Collect parameters on the track edge
3794 aPrms.push_back( aT1 );
3795 aPrms.push_back( aT2 );
3797 aItN = pSubMeshDS->GetNodes();
3798 while ( aItN->more() ) {
3799 const SMDS_MeshNode* pNode = aItN->next();
3800 const SMDS_EdgePosition* pEPos =
3801 static_cast<const SMDS_EdgePosition*>( pNode->GetPosition().get() );
3802 aT = pEPos->GetUParameter();
3803 aPrms.push_back( aT );
3808 if ( aN1 == theN1 ) {
3820 SMESH_MeshEditor_PathPoint aPP;
3821 vector<SMESH_MeshEditor_PathPoint> aPPs( aNbTP );
3823 aC3D = BRep_Tool::Curve( aTrackEdge, aTx1, aTx2 );
3825 aItD = aPrms.begin();
3826 for ( j=0; aItD != aPrms.end(); ++aItD, ++j ) {
3828 aC3D->D1( aT, aP3D, aVec );
3829 aL2 = aVec.SquareMagnitude();
3830 if ( aL2 < aTolVec2 )
3831 return EXTR_CANT_GET_TANGENT;
3833 gp_Dir aTgt( aVec );
3834 aAngle = aAngles[j];
3837 aPP.SetTangent( aTgt );
3838 aPP.SetAngle( aAngle );
3839 aPP.SetParameter( aT );
3843 // 3. Center of rotation aV0
3845 if ( !theHasRefPoint ) {
3847 aGC.SetCoord( 0.,0.,0. );
3849 itElem = theElements.begin();
3850 for ( ; itElem != theElements.end(); itElem++ ) {
3851 const SMDS_MeshElement* elem = *itElem;
3853 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
3854 while ( itN->more() ) {
3855 const SMDS_MeshNode* node = static_cast<const SMDS_MeshNode*>( itN->next() );
3860 if ( mapNewNodes.find( node ) == mapNewNodes.end() ) {
3861 list<const SMDS_MeshNode*> aLNx;
3862 mapNewNodes[node] = aLNx;
3864 gp_XYZ aXYZ( aX, aY, aZ );
3872 } // if (!theHasRefPoint) {
3873 mapNewNodes.clear();
3875 // 4. Processing the elements
3876 SMESHDS_Mesh* aMesh = GetMeshDS();
3878 for ( itElem = theElements.begin(); itElem != theElements.end(); itElem++ ) {
3879 // check element type
3880 const SMDS_MeshElement* elem = *itElem;
3881 aTypeE = elem->GetType();
3882 if ( !elem || ( aTypeE != SMDSAbs_Face && aTypeE != SMDSAbs_Edge ) )
3885 vector<TNodeOfNodeListMapItr> & newNodesItVec = mapElemNewNodes[ elem ];
3886 newNodesItVec.reserve( elem->NbNodes() );
3888 // loop on elem nodes
3889 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
3890 while ( itN->more() ) {
3892 // check if a node has been already processed
3893 const SMDS_MeshNode* node =
3894 static_cast<const SMDS_MeshNode*>( itN->next() );
3895 TNodeOfNodeListMap::iterator nIt = mapNewNodes.find( node );
3896 if ( nIt == mapNewNodes.end() ) {
3897 nIt = mapNewNodes.insert( make_pair( node, list<const SMDS_MeshNode*>() )).first;
3898 list<const SMDS_MeshNode*>& listNewNodes = nIt->second;
3901 aX = node->X(); aY = node->Y(); aZ = node->Z();
3903 Standard_Real aAngle1x, aAngleT1T0, aTolAng;
3904 gp_Pnt aP0x, aP1x, aPN0, aPN1, aV0x, aV1x;
3905 gp_Ax1 anAx1, anAxT1T0;
3906 gp_Dir aDT1x, aDT0x, aDT1T0;
3911 aPN0.SetCoord(aX, aY, aZ);
3913 const SMESH_MeshEditor_PathPoint& aPP0 = aPPs[0];
3915 aDT0x= aPP0.Tangent();
3917 for ( j = 1; j < aNbTP; ++j ) {
3918 const SMESH_MeshEditor_PathPoint& aPP1 = aPPs[j];
3920 aDT1x = aPP1.Tangent();
3921 aAngle1x = aPP1.Angle();
3923 gp_Trsf aTrsf, aTrsfRot, aTrsfRotT1T0;
3925 gp_Vec aV01x( aP0x, aP1x );
3926 aTrsf.SetTranslation( aV01x );
3929 aV1x = aV0x.Transformed( aTrsf );
3930 aPN1 = aPN0.Transformed( aTrsf );
3932 // rotation 1 [ T1,T0 ]
3933 aAngleT1T0=-aDT1x.Angle( aDT0x );
3934 if (fabs(aAngleT1T0) > aTolAng) {
3936 anAxT1T0.SetLocation( aV1x );
3937 anAxT1T0.SetDirection( aDT1T0 );
3938 aTrsfRotT1T0.SetRotation( anAxT1T0, aAngleT1T0 );
3940 aPN1 = aPN1.Transformed( aTrsfRotT1T0 );
3944 if ( theHasAngles ) {
3945 anAx1.SetLocation( aV1x );
3946 anAx1.SetDirection( aDT1x );
3947 aTrsfRot.SetRotation( anAx1, aAngle1x );
3949 aPN1 = aPN1.Transformed( aTrsfRot );
3953 if( elem->IsQuadratic() && !elem->IsMediumNode(node) ) {
3954 // create additional node
3955 double x = ( aPN1.X() + aPN0.X() )/2.;
3956 double y = ( aPN1.Y() + aPN0.Y() )/2.;
3957 double z = ( aPN1.Z() + aPN0.Z() )/2.;
3958 const SMDS_MeshNode* newNode = aMesh->AddNode(x,y,z);
3959 myLastCreatedNodes.Append(newNode);
3960 listNewNodes.push_back( newNode );
3965 const SMDS_MeshNode* newNode = aMesh->AddNode( aX, aY, aZ );
3966 myLastCreatedNodes.Append(newNode);
3967 listNewNodes.push_back( newNode );
3977 // if current elem is quadratic and current node is not medium
3978 // we have to check - may be it is needed to insert additional nodes
3979 if( elem->IsQuadratic() && !elem->IsMediumNode(node) ) {
3980 list< const SMDS_MeshNode* > & listNewNodes = nIt->second;
3981 if(listNewNodes.size()==aNbTP-1) {
3982 vector<const SMDS_MeshNode*> aNodes(2*(aNbTP-1));
3983 gp_XYZ P(node->X(), node->Y(), node->Z());
3984 list< const SMDS_MeshNode* >::iterator it = listNewNodes.begin();
3986 for(i=0; i<aNbTP-1; i++) {
3987 const SMDS_MeshNode* N = *it;
3988 double x = ( N->X() + P.X() )/2.;
3989 double y = ( N->Y() + P.Y() )/2.;
3990 double z = ( N->Z() + P.Z() )/2.;
3991 const SMDS_MeshNode* newN = aMesh->AddNode(x,y,z);
3992 myLastCreatedNodes.Append(newN);
3995 P = gp_XYZ(N->X(),N->Y(),N->Z());
3997 listNewNodes.clear();
3998 for(i=0; i<2*(aNbTP-1); i++) {
3999 listNewNodes.push_back(aNodes[i]);
4005 newNodesItVec.push_back( nIt );
4007 // make new elements
4008 //sweepElement( aMesh, elem, newNodesItVec, newElemsMap[elem],
4009 // newNodesItVec[0]->second.size(), myLastCreatedElems );
4010 sweepElement( aMesh, elem, newNodesItVec, newElemsMap[elem],
4011 aNbTP-1, myLastCreatedElems );
4014 makeWalls( aMesh, mapNewNodes, newElemsMap, mapElemNewNodes, theElements,
4015 aNbTP-1, myLastCreatedElems );
4020 //=======================================================================
4021 //function : Transform
4023 //=======================================================================
4025 void SMESH_MeshEditor::Transform (TIDSortedElemSet & theElems,
4026 const gp_Trsf& theTrsf,
4029 myLastCreatedElems.Clear();
4030 myLastCreatedNodes.Clear();
4033 switch ( theTrsf.Form() ) {
4039 needReverse = false;
4042 SMESHDS_Mesh* aMesh = GetMeshDS();
4044 // map old node to new one
4045 TNodeNodeMap nodeMap;
4047 // elements sharing moved nodes; those of them which have all
4048 // nodes mirrored but are not in theElems are to be reversed
4049 TIDSortedElemSet inverseElemSet;
4052 TIDSortedElemSet::iterator itElem;
4053 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
4054 const SMDS_MeshElement* elem = *itElem;
4058 // loop on elem nodes
4059 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
4060 while ( itN->more() ) {
4062 // check if a node has been already transformed
4063 const SMDS_MeshNode* node =
4064 static_cast<const SMDS_MeshNode*>( itN->next() );
4065 if (nodeMap.find( node ) != nodeMap.end() )
4069 coord[0] = node->X();
4070 coord[1] = node->Y();
4071 coord[2] = node->Z();
4072 theTrsf.Transforms( coord[0], coord[1], coord[2] );
4073 const SMDS_MeshNode * newNode = node;
4075 newNode = aMesh->AddNode( coord[0], coord[1], coord[2] );
4076 myLastCreatedNodes.Append(newNode);
4079 aMesh->MoveNode( node, coord[0], coord[1], coord[2] );
4080 // node position on shape becomes invalid
4081 const_cast< SMDS_MeshNode* > ( node )->SetPosition
4082 ( SMDS_SpacePosition::originSpacePosition() );
4084 nodeMap.insert( TNodeNodeMap::value_type( node, newNode ));
4086 // keep inverse elements
4087 if ( !theCopy && needReverse ) {
4088 SMDS_ElemIteratorPtr invElemIt = node->GetInverseElementIterator();
4089 while ( invElemIt->more() ) {
4090 const SMDS_MeshElement* iel = invElemIt->next();
4091 inverseElemSet.insert( iel );
4097 // either new elements are to be created
4098 // or a mirrored element are to be reversed
4099 if ( !theCopy && !needReverse)
4102 if ( !inverseElemSet.empty()) {
4103 TIDSortedElemSet::iterator invElemIt = inverseElemSet.begin();
4104 for ( ; invElemIt != inverseElemSet.end(); invElemIt++ )
4105 theElems.insert( *invElemIt );
4108 // replicate or reverse elements
4111 REV_TETRA = 0, // = nbNodes - 4
4112 REV_PYRAMID = 1, // = nbNodes - 4
4113 REV_PENTA = 2, // = nbNodes - 4
4115 REV_HEXA = 4, // = nbNodes - 4
4119 { 2, 1, 0, 3, 4, 0, 0, 0 }, // REV_TETRA
4120 { 2, 1, 0, 3, 4, 0, 0, 0 }, // REV_PYRAMID
4121 { 2, 1, 0, 5, 4, 3, 0, 0 }, // REV_PENTA
4122 { 2, 1, 0, 3, 0, 0, 0, 0 }, // REV_FACE
4123 { 2, 1, 0, 3, 6, 5, 4, 7 }, // REV_HEXA
4124 { 0, 1, 2, 3, 4, 5, 6, 7 } // FORWARD
4127 for ( itElem = theElems.begin(); itElem != theElems.end(); itElem++ ) {
4128 const SMDS_MeshElement* elem = *itElem;
4129 if ( !elem || elem->GetType() == SMDSAbs_Node )
4132 int nbNodes = elem->NbNodes();
4133 int elemType = elem->GetType();
4135 if (elem->IsPoly()) {
4136 // Polygon or Polyhedral Volume
4137 switch ( elemType ) {
4140 vector<const SMDS_MeshNode*> poly_nodes (nbNodes);
4142 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
4143 while (itN->more()) {
4144 const SMDS_MeshNode* node =
4145 static_cast<const SMDS_MeshNode*>(itN->next());
4146 TNodeNodeMap::iterator nodeMapIt = nodeMap.find(node);
4147 if (nodeMapIt == nodeMap.end())
4148 break; // not all nodes transformed
4150 // reverse mirrored faces and volumes
4151 poly_nodes[nbNodes - iNode - 1] = (*nodeMapIt).second;
4153 poly_nodes[iNode] = (*nodeMapIt).second;
4157 if ( iNode != nbNodes )
4158 continue; // not all nodes transformed
4161 myLastCreatedElems.Append(aMesh->AddPolygonalFace(poly_nodes));
4164 aMesh->ChangePolygonNodes(elem, poly_nodes);
4168 case SMDSAbs_Volume:
4170 // ATTENTION: Reversing is not yet done!!!
4171 const SMDS_PolyhedralVolumeOfNodes* aPolyedre =
4172 (const SMDS_PolyhedralVolumeOfNodes*) elem;
4174 MESSAGE("Warning: bad volumic element");
4178 vector<const SMDS_MeshNode*> poly_nodes;
4179 vector<int> quantities;
4181 bool allTransformed = true;
4182 int nbFaces = aPolyedre->NbFaces();
4183 for (int iface = 1; iface <= nbFaces && allTransformed; iface++) {
4184 int nbFaceNodes = aPolyedre->NbFaceNodes(iface);
4185 for (int inode = 1; inode <= nbFaceNodes && allTransformed; inode++) {
4186 const SMDS_MeshNode* node = aPolyedre->GetFaceNode(iface, inode);
4187 TNodeNodeMap::iterator nodeMapIt = nodeMap.find(node);
4188 if (nodeMapIt == nodeMap.end()) {
4189 allTransformed = false; // not all nodes transformed
4191 poly_nodes.push_back((*nodeMapIt).second);
4194 quantities.push_back(nbFaceNodes);
4196 if ( !allTransformed )
4197 continue; // not all nodes transformed
4200 myLastCreatedElems.Append(aMesh->AddPolyhedralVolume(poly_nodes, quantities));
4203 aMesh->ChangePolyhedronNodes(elem, poly_nodes, quantities);
4213 int* i = index[ FORWARD ];
4214 if ( needReverse && nbNodes > 2) // reverse mirrored faces and volumes
4215 if ( elemType == SMDSAbs_Face )
4216 i = index[ REV_FACE ];
4218 i = index[ nbNodes - 4 ];
4220 if(elem->IsQuadratic()) {
4221 static int anIds[] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};
4224 if(nbNodes==3) { // quadratic edge
4225 static int anIds[] = {1,0,2};
4228 else if(nbNodes==6) { // quadratic triangle
4229 static int anIds[] = {0,2,1,5,4,3};
4232 else if(nbNodes==8) { // quadratic quadrangle
4233 static int anIds[] = {0,3,2,1,7,6,5,4};
4236 else if(nbNodes==10) { // quadratic tetrahedron of 10 nodes
4237 static int anIds[] = {0,2,1,3,6,5,4,7,9,8};
4240 else if(nbNodes==13) { // quadratic pyramid of 13 nodes
4241 static int anIds[] = {0,3,2,1,4,8,7,6,5,9,12,11,10};
4244 else if(nbNodes==15) { // quadratic pentahedron with 15 nodes
4245 static int anIds[] = {0,2,1,3,5,4,8,7,6,11,10,9,12,14,13};
4248 else { // nbNodes==20 - quadratic hexahedron with 20 nodes
4249 static int anIds[] = {0,3,2,1,4,7,6,5,11,10,9,8,15,14,13,12,16,19,18,17};
4255 // find transformed nodes
4256 vector<const SMDS_MeshNode*> nodes(nbNodes);
4258 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
4259 while ( itN->more() ) {
4260 const SMDS_MeshNode* node =
4261 static_cast<const SMDS_MeshNode*>( itN->next() );
4262 TNodeNodeMap::iterator nodeMapIt = nodeMap.find( node );
4263 if ( nodeMapIt == nodeMap.end() )
4264 break; // not all nodes transformed
4265 nodes[ i [ iNode++ ]] = (*nodeMapIt).second;
4267 if ( iNode != nbNodes )
4268 continue; // not all nodes transformed
4271 if ( SMDS_MeshElement* copy = AddElement( nodes, elem->GetType(), elem->IsPoly() ))
4272 myLastCreatedElems.Append( copy );
4276 // reverse element as it was reversed by transformation
4278 aMesh->ChangeElementNodes( elem, &nodes[0], nbNodes );
4283 //=======================================================================
4284 //function : FindCoincidentNodes
4285 //purpose : Return list of group of nodes close to each other within theTolerance
4286 // Search among theNodes or in the whole mesh if theNodes is empty using
4287 // an Octree algorithm
4288 //=======================================================================
4290 void SMESH_MeshEditor::FindCoincidentNodes (set<const SMDS_MeshNode*> & theNodes,
4291 const double theTolerance,
4292 TListOfListOfNodes & theGroupsOfNodes)
4294 myLastCreatedElems.Clear();
4295 myLastCreatedNodes.Clear();
4297 set<const SMDS_MeshNode*> nodes;
4298 if ( theNodes.empty() )
4299 { // get all nodes in the mesh
4300 SMDS_NodeIteratorPtr nIt = GetMeshDS()->nodesIterator();
4301 while ( nIt->more() )
4302 nodes.insert( nodes.end(),nIt->next());
4306 SMESH_OctreeNode::FindCoincidentNodes ( nodes, &theGroupsOfNodes, theTolerance);
4310 //=======================================================================
4312 * \brief Implementation of search for the node closest to point
4314 //=======================================================================
4316 struct SMESH_NodeSearcherImpl: public SMESH_NodeSearcher
4319 * \brief Constructor
4321 SMESH_NodeSearcherImpl( const SMESHDS_Mesh* theMesh )
4323 set<const SMDS_MeshNode*> nodes;
4325 SMDS_NodeIteratorPtr nIt = theMesh->nodesIterator();
4326 while ( nIt->more() )
4327 nodes.insert( nodes.end(), nIt->next() );
4329 myOctreeNode = new SMESH_OctreeNode(nodes) ;
4332 * \brief Do it's job
4334 const SMDS_MeshNode* FindClosestTo( const gp_Pnt& thePnt )
4336 SMDS_MeshNode tgtNode( thePnt.X(), thePnt.Y(), thePnt.Z() );
4337 list<const SMDS_MeshNode*> nodes;
4338 const double precision = 1e-6;
4339 myOctreeNode->NodesAround( &tgtNode, &nodes, precision );
4341 double minSqDist = DBL_MAX;
4343 if ( nodes.empty() ) // get all nodes of OctreeNode's closest to thePnt
4345 // sort leafs by their distance from thePnt
4346 typedef map< double, SMESH_OctreeNode* > TDistTreeMap;
4347 TDistTreeMap treeMap;
4348 list< SMESH_OctreeNode* > treeList;
4349 list< SMESH_OctreeNode* >::iterator trIt;
4350 treeList.push_back( myOctreeNode );
4351 for ( trIt = treeList.begin(); trIt != treeList.end(); ++trIt)
4353 SMESH_OctreeNode* tree = *trIt;
4354 if ( !tree->isLeaf() ) { // put children to the queue
4355 SMESH_OctreeNodeIteratorPtr cIt = tree->GetChildrenIterator();
4356 while ( cIt->more() )
4357 treeList.push_back( cIt->next() );
4359 else if ( tree->NbNodes() ) { // put tree to treeMap
4360 tree->getBox( box );
4361 double sqDist = thePnt.SquareDistance( 0.5 * ( box.CornerMin() + box.CornerMax() ));
4362 pair<TDistTreeMap::iterator,bool> it_in = treeMap.insert( make_pair( sqDist, tree ));
4363 if ( !it_in.second ) // not unique distance to box center
4364 treeMap.insert( it_in.first, make_pair( sqDist - 1e-13*treeMap.size(), tree ));
4367 // find distance after which there is no sense to check tree's
4368 double sqLimit = DBL_MAX;
4369 TDistTreeMap::iterator sqDist_tree = treeMap.begin();
4370 if ( treeMap.size() > 5 ) {
4371 SMESH_OctreeNode* closestTree = sqDist_tree->second;
4372 closestTree->getBox( box );
4373 double limit = sqrt( sqDist_tree->first ) + sqrt ( box.SquareExtent() );
4374 sqLimit = limit * limit;
4376 // get all nodes from trees
4377 for ( ; sqDist_tree != treeMap.end(); ++sqDist_tree) {
4378 if ( sqDist_tree->first > sqLimit )
4380 SMESH_OctreeNode* tree = sqDist_tree->second;
4381 tree->NodesAround( tree->GetNodeIterator()->next(), &nodes );
4384 // find closest among nodes
4385 minSqDist = DBL_MAX;
4386 const SMDS_MeshNode* closestNode = 0;
4387 list<const SMDS_MeshNode*>::iterator nIt = nodes.begin();
4388 for ( ; nIt != nodes.end(); ++nIt ) {
4389 double sqDist = thePnt.SquareDistance( TNodeXYZ( *nIt ) );
4390 if ( minSqDist > sqDist ) {
4400 ~SMESH_NodeSearcherImpl() { delete myOctreeNode; }
4402 SMESH_OctreeNode* myOctreeNode;
4405 //=======================================================================
4407 * \brief Return SMESH_NodeSearcher
4409 //=======================================================================
4411 SMESH_NodeSearcher* SMESH_MeshEditor::GetNodeSearcher()
4413 return new SMESH_NodeSearcherImpl( GetMeshDS() );
4416 //=======================================================================
4417 //function : SimplifyFace
4419 //=======================================================================
4420 int SMESH_MeshEditor::SimplifyFace (const vector<const SMDS_MeshNode *> faceNodes,
4421 vector<const SMDS_MeshNode *>& poly_nodes,
4422 vector<int>& quantities) const
4424 int nbNodes = faceNodes.size();
4429 set<const SMDS_MeshNode*> nodeSet;
4431 // get simple seq of nodes
4432 const SMDS_MeshNode* simpleNodes[ nbNodes ];
4433 int iSimple = 0, nbUnique = 0;
4435 simpleNodes[iSimple++] = faceNodes[0];
4437 for (int iCur = 1; iCur < nbNodes; iCur++) {
4438 if (faceNodes[iCur] != simpleNodes[iSimple - 1]) {
4439 simpleNodes[iSimple++] = faceNodes[iCur];
4440 if (nodeSet.insert( faceNodes[iCur] ).second)
4444 int nbSimple = iSimple;
4445 if (simpleNodes[nbSimple - 1] == simpleNodes[0]) {
4455 bool foundLoop = (nbSimple > nbUnique);
4458 set<const SMDS_MeshNode*> loopSet;
4459 for (iSimple = 0; iSimple < nbSimple && !foundLoop; iSimple++) {
4460 const SMDS_MeshNode* n = simpleNodes[iSimple];
4461 if (!loopSet.insert( n ).second) {
4465 int iC = 0, curLast = iSimple;
4466 for (; iC < curLast; iC++) {
4467 if (simpleNodes[iC] == n) break;
4469 int loopLen = curLast - iC;
4471 // create sub-element
4473 quantities.push_back(loopLen);
4474 for (; iC < curLast; iC++) {
4475 poly_nodes.push_back(simpleNodes[iC]);
4478 // shift the rest nodes (place from the first loop position)
4479 for (iC = curLast + 1; iC < nbSimple; iC++) {
4480 simpleNodes[iC - loopLen] = simpleNodes[iC];
4482 nbSimple -= loopLen;
4485 } // for (iSimple = 0; iSimple < nbSimple; iSimple++)
4486 } // while (foundLoop)
4490 quantities.push_back(iSimple);
4491 for (int i = 0; i < iSimple; i++)
4492 poly_nodes.push_back(simpleNodes[i]);
4498 //=======================================================================
4499 //function : MergeNodes
4500 //purpose : In each group, the cdr of nodes are substituted by the first one
4502 //=======================================================================
4504 void SMESH_MeshEditor::MergeNodes (TListOfListOfNodes & theGroupsOfNodes)
4506 myLastCreatedElems.Clear();
4507 myLastCreatedNodes.Clear();
4509 SMESHDS_Mesh* aMesh = GetMeshDS();
4511 TNodeNodeMap nodeNodeMap; // node to replace - new node
4512 set<const SMDS_MeshElement*> elems; // all elements with changed nodes
4513 list< int > rmElemIds, rmNodeIds;
4515 // Fill nodeNodeMap and elems
4517 TListOfListOfNodes::iterator grIt = theGroupsOfNodes.begin();
4518 for ( ; grIt != theGroupsOfNodes.end(); grIt++ ) {
4519 list<const SMDS_MeshNode*>& nodes = *grIt;
4520 list<const SMDS_MeshNode*>::iterator nIt = nodes.begin();
4521 const SMDS_MeshNode* nToKeep = *nIt;
4522 for ( ++nIt; nIt != nodes.end(); nIt++ ) {
4523 const SMDS_MeshNode* nToRemove = *nIt;
4524 nodeNodeMap.insert( TNodeNodeMap::value_type( nToRemove, nToKeep ));
4525 if ( nToRemove != nToKeep ) {
4526 rmNodeIds.push_back( nToRemove->GetID() );
4527 AddToSameGroups( nToKeep, nToRemove, aMesh );
4530 SMDS_ElemIteratorPtr invElemIt = nToRemove->GetInverseElementIterator();
4531 while ( invElemIt->more() ) {
4532 const SMDS_MeshElement* elem = invElemIt->next();
4537 // Change element nodes or remove an element
4539 set<const SMDS_MeshElement*>::iterator eIt = elems.begin();
4540 for ( ; eIt != elems.end(); eIt++ ) {
4541 const SMDS_MeshElement* elem = *eIt;
4542 int nbNodes = elem->NbNodes();
4543 int aShapeId = FindShape( elem );
4545 set<const SMDS_MeshNode*> nodeSet;
4546 const SMDS_MeshNode* curNodes[ nbNodes ], *uniqueNodes[ nbNodes ];
4547 int iUnique = 0, iCur = 0, nbRepl = 0, iRepl [ nbNodes ];
4549 // get new seq of nodes
4550 SMDS_ElemIteratorPtr itN = elem->nodesIterator();
4551 while ( itN->more() ) {
4552 const SMDS_MeshNode* n =
4553 static_cast<const SMDS_MeshNode*>( itN->next() );
4555 TNodeNodeMap::iterator nnIt = nodeNodeMap.find( n );
4556 if ( nnIt != nodeNodeMap.end() ) { // n sticks
4558 iRepl[ nbRepl++ ] = iCur;
4560 curNodes[ iCur ] = n;
4561 bool isUnique = nodeSet.insert( n ).second;
4563 uniqueNodes[ iUnique++ ] = n;
4567 // Analyse element topology after replacement
4570 int nbUniqueNodes = nodeSet.size();
4571 if ( nbNodes != nbUniqueNodes ) { // some nodes stick
4572 // Polygons and Polyhedral volumes
4573 if (elem->IsPoly()) {
4575 if (elem->GetType() == SMDSAbs_Face) {
4577 vector<const SMDS_MeshNode *> face_nodes (nbNodes);
4579 for (; inode < nbNodes; inode++) {
4580 face_nodes[inode] = curNodes[inode];
4583 vector<const SMDS_MeshNode *> polygons_nodes;
4584 vector<int> quantities;
4585 int nbNew = SimplifyFace(face_nodes, polygons_nodes, quantities);
4589 for (int iface = 0; iface < nbNew - 1; iface++) {
4590 int nbNodes = quantities[iface];
4591 vector<const SMDS_MeshNode *> poly_nodes (nbNodes);
4592 for (int ii = 0; ii < nbNodes; ii++, inode++) {
4593 poly_nodes[ii] = polygons_nodes[inode];
4595 SMDS_MeshElement* newElem = aMesh->AddPolygonalFace(poly_nodes);
4596 myLastCreatedElems.Append(newElem);
4598 aMesh->SetMeshElementOnShape(newElem, aShapeId);
4600 aMesh->ChangeElementNodes(elem, &polygons_nodes[inode], quantities[nbNew - 1]);
4603 rmElemIds.push_back(elem->GetID());
4607 else if (elem->GetType() == SMDSAbs_Volume) {
4608 // Polyhedral volume
4609 if (nbUniqueNodes < 4) {
4610 rmElemIds.push_back(elem->GetID());
4613 // each face has to be analized in order to check volume validity
4614 const SMDS_PolyhedralVolumeOfNodes* aPolyedre =
4615 static_cast<const SMDS_PolyhedralVolumeOfNodes*>( elem );
4617 int nbFaces = aPolyedre->NbFaces();
4619 vector<const SMDS_MeshNode *> poly_nodes;
4620 vector<int> quantities;
4622 for (int iface = 1; iface <= nbFaces; iface++) {
4623 int nbFaceNodes = aPolyedre->NbFaceNodes(iface);
4624 vector<const SMDS_MeshNode *> faceNodes (nbFaceNodes);
4626 for (int inode = 1; inode <= nbFaceNodes; inode++) {
4627 const SMDS_MeshNode * faceNode = aPolyedre->GetFaceNode(iface, inode);
4628 TNodeNodeMap::iterator nnIt = nodeNodeMap.find(faceNode);
4629 if (nnIt != nodeNodeMap.end()) { // faceNode sticks
4630 faceNode = (*nnIt).second;
4632 faceNodes[inode - 1] = faceNode;
4635 SimplifyFace(faceNodes, poly_nodes, quantities);
4638 if (quantities.size() > 3) {
4639 // to be done: remove coincident faces
4642 if (quantities.size() > 3)
4643 aMesh->ChangePolyhedronNodes(elem, poly_nodes, quantities);
4645 rmElemIds.push_back(elem->GetID());
4649 rmElemIds.push_back(elem->GetID());
4660 switch ( nbNodes ) {
4661 case 2: ///////////////////////////////////// EDGE
4662 isOk = false; break;
4663 case 3: ///////////////////////////////////// TRIANGLE
4664 isOk = false; break;
4666 if ( elem->GetType() == SMDSAbs_Volume ) // TETRAHEDRON
4668 else { //////////////////////////////////// QUADRANGLE
4669 if ( nbUniqueNodes < 3 )
4671 else if ( nbRepl == 2 && iRepl[ 1 ] - iRepl[ 0 ] == 2 )
4672 isOk = false; // opposite nodes stick
4675 case 6: ///////////////////////////////////// PENTAHEDRON
4676 if ( nbUniqueNodes == 4 ) {
4677 // ---------------------------------> tetrahedron
4679 iRepl[ 0 ] > 2 && iRepl[ 1 ] > 2 && iRepl[ 2 ] > 2 ) {
4680 // all top nodes stick: reverse a bottom
4681 uniqueNodes[ 0 ] = curNodes [ 1 ];
4682 uniqueNodes[ 1 ] = curNodes [ 0 ];
4684 else if (nbRepl == 3 &&
4685 iRepl[ 0 ] < 3 && iRepl[ 1 ] < 3 && iRepl[ 2 ] < 3 ) {
4686 // all bottom nodes stick: set a top before
4687 uniqueNodes[ 3 ] = uniqueNodes [ 0 ];
4688 uniqueNodes[ 0 ] = curNodes [ 3 ];
4689 uniqueNodes[ 1 ] = curNodes [ 4 ];
4690 uniqueNodes[ 2 ] = curNodes [ 5 ];
4692 else if (nbRepl == 4 &&
4693 iRepl[ 2 ] - iRepl [ 0 ] == 3 && iRepl[ 3 ] - iRepl [ 1 ] == 3 ) {
4694 // a lateral face turns into a line: reverse a bottom
4695 uniqueNodes[ 0 ] = curNodes [ 1 ];
4696 uniqueNodes[ 1 ] = curNodes [ 0 ];
4701 else if ( nbUniqueNodes == 5 ) {
4702 // PENTAHEDRON --------------------> 2 tetrahedrons
4703 if ( nbRepl == 2 && iRepl[ 1 ] - iRepl [ 0 ] == 3 ) {
4704 // a bottom node sticks with a linked top one
4706 SMDS_MeshElement* newElem =
4707 aMesh->AddVolume(curNodes[ 3 ],
4710 curNodes[ iRepl[ 0 ] == 2 ? 1 : 2 ]);
4711 myLastCreatedElems.Append(newElem);
4713 aMesh->SetMeshElementOnShape( newElem, aShapeId );
4714 // 2. : reverse a bottom
4715 uniqueNodes[ 0 ] = curNodes [ 1 ];
4716 uniqueNodes[ 1 ] = curNodes [ 0 ];
4726 if(elem->IsQuadratic()) { // Quadratic quadrangle
4739 if( iRepl[0]==0 && iRepl[1]==1 && iRepl[2]==4 ) {
4740 uniqueNodes[0] = curNodes[0];
4741 uniqueNodes[1] = curNodes[2];
4742 uniqueNodes[2] = curNodes[3];
4743 uniqueNodes[3] = curNodes[5];
4744 uniqueNodes[4] = curNodes[6];
4745 uniqueNodes[5] = curNodes[7];
4748 if( iRepl[0]==0 && iRepl[1]==3 && iRepl[2]==7 ) {
4749 uniqueNodes[0] = curNodes[0];
4750 uniqueNodes[1] = curNodes[1];
4751 uniqueNodes[2] = curNodes[2];
4752 uniqueNodes[3] = curNodes[4];
4753 uniqueNodes[4] = curNodes[5];
4754 uniqueNodes[5] = curNodes[6];
4757 if( iRepl[0]==0 && iRepl[1]==4 && iRepl[2]==7 ) {
4758 uniqueNodes[0] = curNodes[1];
4759 uniqueNodes[1] = curNodes[2];
4760 uniqueNodes[2] = curNodes[3];
4761 uniqueNodes[3] = curNodes[5];
4762 uniqueNodes[4] = curNodes[6];
4763 uniqueNodes[5] = curNodes[0];
4766 if( iRepl[0]==1 && iRepl[1]==2 && iRepl[2]==5 ) {
4767 uniqueNodes[0] = curNodes[0];
4768 uniqueNodes[1] = curNodes[1];
4769 uniqueNodes[2] = curNodes[3];
4770 uniqueNodes[3] = curNodes[4];
4771 uniqueNodes[4] = curNodes[6];
4772 uniqueNodes[5] = curNodes[7];
4775 if( iRepl[0]==1 && iRepl[1]==4 && iRepl[2]==5 ) {
4776 uniqueNodes[0] = curNodes[0];
4777 uniqueNodes[1] = curNodes[2];
4778 uniqueNodes[2] = curNodes[3];
4779 uniqueNodes[3] = curNodes[1];
4780 uniqueNodes[4] = curNodes[6];
4781 uniqueNodes[5] = curNodes[7];
4784 if( iRepl[0]==2 && iRepl[1]==3 && iRepl[2]==6 ) {
4785 uniqueNodes[0] = curNodes[0];
4786 uniqueNodes[1] = curNodes[1];
4787 uniqueNodes[2] = curNodes[2];
4788 uniqueNodes[3] = curNodes[4];
4789 uniqueNodes[4] = curNodes[5];
4790 uniqueNodes[5] = curNodes[7];
4793 if( iRepl[0]==2 && iRepl[1]==5 && iRepl[2]==6 ) {
4794 uniqueNodes[0] = curNodes[0];
4795 uniqueNodes[1] = curNodes[1];
4796 uniqueNodes[2] = curNodes[3];
4797 uniqueNodes[3] = curNodes[4];
4798 uniqueNodes[4] = curNodes[2];
4799 uniqueNodes[5] = curNodes[7];
4802 if( iRepl[0]==3 && iRepl[1]==6 && iRepl[2]==7 ) {
4803 uniqueNodes[0] = curNodes[0];
4804 uniqueNodes[1] = curNodes[1];
4805 uniqueNodes[2] = curNodes[2];
4806 uniqueNodes[3] = curNodes[4];
4807 uniqueNodes[4] = curNodes[5];
4808 uniqueNodes[5] = curNodes[3];
4814 //////////////////////////////////// HEXAHEDRON
4816 SMDS_VolumeTool hexa (elem);
4817 hexa.SetExternalNormal();
4818 if ( nbUniqueNodes == 4 && nbRepl == 6 ) {
4819 //////////////////////// ---> tetrahedron
4820 for ( int iFace = 0; iFace < 6; iFace++ ) {
4821 const int *ind = hexa.GetFaceNodesIndices( iFace ); // indices of face nodes
4822 if (curNodes[ind[ 0 ]] == curNodes[ind[ 1 ]] &&
4823 curNodes[ind[ 0 ]] == curNodes[ind[ 2 ]] &&
4824 curNodes[ind[ 0 ]] == curNodes[ind[ 3 ]] ) {
4825 // one face turns into a point ...
4826 int iOppFace = hexa.GetOppFaceIndex( iFace );
4827 ind = hexa.GetFaceNodesIndices( iOppFace );
4829 iUnique = 2; // reverse a tetrahedron bottom
4830 for ( iCur = 0; iCur < 4 && nbStick < 2; iCur++ ) {
4831 if ( curNodes[ind[ iCur ]] == curNodes[ind[ iCur + 1 ]] )
4833 else if ( iUnique >= 0 )
4834 uniqueNodes[ iUnique-- ] = curNodes[ind[ iCur ]];
4836 if ( nbStick == 1 ) {
4837 // ... and the opposite one - into a triangle.
4839 ind = hexa.GetFaceNodesIndices( iFace );
4840 uniqueNodes[ 3 ] = curNodes[ind[ 0 ]];
4847 else if (nbUniqueNodes == 5 && nbRepl == 4 ) {
4848 //////////////////// HEXAHEDRON ---> 2 tetrahedrons
4849 for ( int iFace = 0; iFace < 6; iFace++ ) {
4850 const int *ind = hexa.GetFaceNodesIndices( iFace ); // indices of face nodes
4851 if (curNodes[ind[ 0 ]] == curNodes[ind[ 1 ]] &&
4852 curNodes[ind[ 0 ]] == curNodes[ind[ 2 ]] &&
4853 curNodes[ind[ 0 ]] == curNodes[ind[ 3 ]] ) {
4854 // one face turns into a point ...
4855 int iOppFace = hexa.GetOppFaceIndex( iFace );
4856 ind = hexa.GetFaceNodesIndices( iOppFace );
4858 iUnique = 2; // reverse a tetrahedron 1 bottom
4859 for ( iCur = 0; iCur < 4 && nbStick == 0; iCur++ ) {
4860 if ( curNodes[ind[ iCur ]] == curNodes[ind[ iCur + 1 ]] )
4862 else if ( iUnique >= 0 )
4863 uniqueNodes[ iUnique-- ] = curNodes[ind[ iCur ]];
4865 if ( nbStick == 0 ) {
4866 // ... and the opposite one is a quadrangle
4868 const int* indTop = hexa.GetFaceNodesIndices( iFace );
4869 uniqueNodes[ 3 ] = curNodes[indTop[ 0 ]];
4872 SMDS_MeshElement* newElem =
4873 aMesh->AddVolume(curNodes[ind[ 0 ]],
4876 curNodes[indTop[ 0 ]]);
4877 myLastCreatedElems.Append(newElem);
4879 aMesh->SetMeshElementOnShape( newElem, aShapeId );
4886 else if ( nbUniqueNodes == 6 && nbRepl == 4 ) {
4887 ////////////////// HEXAHEDRON ---> 2 tetrahedrons or 1 prism
4888 // find indices of quad and tri faces
4889 int iQuadFace[ 6 ], iTriFace[ 6 ], nbQuad = 0, nbTri = 0, iFace;
4890 for ( iFace = 0; iFace < 6; iFace++ ) {
4891 const int *ind = hexa.GetFaceNodesIndices( iFace ); // indices of face nodes
4893 for ( iCur = 0; iCur < 4; iCur++ )
4894 nodeSet.insert( curNodes[ind[ iCur ]] );
4895 nbUniqueNodes = nodeSet.size();
4896 if ( nbUniqueNodes == 3 )
4897 iTriFace[ nbTri++ ] = iFace;
4898 else if ( nbUniqueNodes == 4 )
4899 iQuadFace[ nbQuad++ ] = iFace;
4901 if (nbQuad == 2 && nbTri == 4 &&
4902 hexa.GetOppFaceIndex( iQuadFace[ 0 ] ) == iQuadFace[ 1 ]) {
4903 // 2 opposite quadrangles stuck with a diagonal;
4904 // sample groups of merged indices: (0-4)(2-6)
4905 // --------------------------------------------> 2 tetrahedrons
4906 const int *ind1 = hexa.GetFaceNodesIndices( iQuadFace[ 0 ]); // indices of quad1 nodes
4907 const int *ind2 = hexa.GetFaceNodesIndices( iQuadFace[ 1 ]);
4908 int i0, i1d, i2, i3d, i0t, i2t; // d-daigonal, t-top
4909 if (curNodes[ind1[ 0 ]] == curNodes[ind2[ 0 ]] &&
4910 curNodes[ind1[ 2 ]] == curNodes[ind2[ 2 ]]) {
4911 // stuck with 0-2 diagonal
4919 else if (curNodes[ind1[ 1 ]] == curNodes[ind2[ 3 ]] &&
4920 curNodes[ind1[ 3 ]] == curNodes[ind2[ 1 ]]) {
4921 // stuck with 1-3 diagonal
4933 uniqueNodes[ 0 ] = curNodes [ i0 ];
4934 uniqueNodes[ 1 ] = curNodes [ i1d ];
4935 uniqueNodes[ 2 ] = curNodes [ i3d ];
4936 uniqueNodes[ 3 ] = curNodes [ i0t ];
4939 SMDS_MeshElement* newElem = aMesh->AddVolume(curNodes[ i1d ],
4943 myLastCreatedElems.Append(newElem);
4945 aMesh->SetMeshElementOnShape( newElem, aShapeId );
4948 else if (( nbTri == 2 && nbQuad == 3 ) || // merged (0-4)(1-5)
4949 ( nbTri == 4 && nbQuad == 2 )) { // merged (7-4)(1-5)
4950 // --------------------------------------------> prism
4951 // find 2 opposite triangles
4953 for ( iFace = 0; iFace + 1 < nbTri; iFace++ ) {
4954 if ( hexa.GetOppFaceIndex( iTriFace[ iFace ] ) == iTriFace[ iFace + 1 ]) {
4955 // find indices of kept and replaced nodes
4956 // and fill unique nodes of 2 opposite triangles
4957 const int *ind1 = hexa.GetFaceNodesIndices( iTriFace[ iFace ]);
4958 const int *ind2 = hexa.GetFaceNodesIndices( iTriFace[ iFace + 1 ]);
4959 const SMDS_MeshNode** hexanodes = hexa.GetNodes();
4960 // fill unique nodes
4963 for ( iCur = 0; iCur < 4 && isOk; iCur++ ) {
4964 const SMDS_MeshNode* n = curNodes[ind1[ iCur ]];
4965 const SMDS_MeshNode* nInit = hexanodes[ind1[ iCur ]];
4967 // iCur of a linked node of the opposite face (make normals co-directed):
4968 int iCurOpp = ( iCur == 1 || iCur == 3 ) ? 4 - iCur : iCur;
4969 // check that correspondent corners of triangles are linked
4970 if ( !hexa.IsLinked( ind1[ iCur ], ind2[ iCurOpp ] ))
4973 uniqueNodes[ iUnique ] = n;
4974 uniqueNodes[ iUnique + 3 ] = curNodes[ind2[ iCurOpp ]];
4983 } // if ( nbUniqueNodes == 6 && nbRepl == 4 )
4989 } // switch ( nbNodes )
4991 } // if ( nbNodes != nbUniqueNodes ) // some nodes stick
4994 if (elem->IsPoly() && elem->GetType() == SMDSAbs_Volume) {
4995 // Change nodes of polyedre
4996 const SMDS_PolyhedralVolumeOfNodes* aPolyedre =
4997 static_cast<const SMDS_PolyhedralVolumeOfNodes*>( elem );
4999 int nbFaces = aPolyedre->NbFaces();
5001 vector<const SMDS_MeshNode *> poly_nodes;
5002 vector<int> quantities (nbFaces);
5004 for (int iface = 1; iface <= nbFaces; iface++) {
5005 int inode, nbFaceNodes = aPolyedre->NbFaceNodes(iface);
5006 quantities[iface - 1] = nbFaceNodes;
5008 for (inode = 1; inode <= nbFaceNodes; inode++) {
5009 const SMDS_MeshNode* curNode = aPolyedre->GetFaceNode(iface, inode);
5011 TNodeNodeMap::iterator nnIt = nodeNodeMap.find( curNode );
5012 if (nnIt != nodeNodeMap.end()) { // curNode sticks
5013 curNode = (*nnIt).second;
5015 poly_nodes.push_back(curNode);
5018 aMesh->ChangePolyhedronNodes( elem, poly_nodes, quantities );
5022 // Change regular element or polygon
5023 aMesh->ChangeElementNodes( elem, uniqueNodes, nbUniqueNodes );
5027 // Remove invalid regular element or invalid polygon
5028 rmElemIds.push_back( elem->GetID() );
5031 } // loop on elements
5033 // Remove equal nodes and bad elements
5035 Remove( rmNodeIds, true );
5036 Remove( rmElemIds, false );
5041 // =================================================
5042 // class : SortableElement
5043 // purpose : auxilary
5044 // =================================================
5045 class SortableElement : public set <const SMDS_MeshElement*>
5049 SortableElement( const SMDS_MeshElement* theElem )
5051 myID = theElem->GetID();
5052 SMDS_ElemIteratorPtr nodeIt = theElem->nodesIterator();
5053 while ( nodeIt->more() )
5054 this->insert( nodeIt->next() );
5057 const long GetID() const
5060 void SetID(const long anID) const
5069 //=======================================================================
5070 //function : MergeEqualElements
5071 //purpose : Remove all but one of elements built on the same nodes.
5072 //=======================================================================
5074 void SMESH_MeshEditor::MergeEqualElements()
5076 myLastCreatedElems.Clear();
5077 myLastCreatedNodes.Clear();
5079 SMESHDS_Mesh* aMesh = GetMeshDS();
5081 SMDS_EdgeIteratorPtr eIt = aMesh->edgesIterator();
5082 SMDS_FaceIteratorPtr fIt = aMesh->facesIterator();
5083 SMDS_VolumeIteratorPtr vIt = aMesh->volumesIterator();
5085 list< int > rmElemIds; // IDs of elems to remove
5087 for ( int iDim = 1; iDim <= 3; iDim++ ) {
5089 set< SortableElement > setOfNodeSet;
5092 const SMDS_MeshElement* elem = 0;
5094 if ( eIt->more() ) elem = eIt->next();
5095 } else if ( iDim == 2 ) {
5096 if ( fIt->more() ) elem = fIt->next();
5098 if ( vIt->more() ) elem = vIt->next();
5102 SortableElement SE(elem);
5105 pair< set<SortableElement>::iterator, bool> pp = setOfNodeSet.insert(SE);
5106 if( !(pp.second) ) {
5107 set<SortableElement>::iterator itSE = pp.first;
5108 SortableElement SEold = *itSE;
5109 if( SEold.GetID() > SE.GetID() ) {
5110 rmElemIds.push_back( SEold.GetID() );
5111 (*itSE).SetID(SE.GetID());
5114 rmElemIds.push_back( SE.GetID() );
5120 Remove( rmElemIds, false );
5123 //=======================================================================
5124 //function : FindFaceInSet
5125 //purpose : Return a face having linked nodes n1 and n2 and which is
5126 // - not in avoidSet,
5127 // - in elemSet provided that !elemSet.empty()
5128 //=======================================================================
5130 const SMDS_MeshElement*
5131 SMESH_MeshEditor::FindFaceInSet(const SMDS_MeshNode* n1,
5132 const SMDS_MeshNode* n2,
5133 const TIDSortedElemSet& elemSet,
5134 const TIDSortedElemSet& avoidSet)
5137 SMDS_ElemIteratorPtr invElemIt = n1->GetInverseElementIterator(SMDSAbs_Face);
5138 while ( invElemIt->more() ) { // loop on inverse elements of n1
5139 const SMDS_MeshElement* elem = invElemIt->next();
5140 if (avoidSet.find( elem ) != avoidSet.end() )
5142 if ( !elemSet.empty() && elemSet.find( elem ) == elemSet.end())
5144 // get face nodes and find index of n1
5145 int i1, nbN = elem->NbNodes(), iNode = 0;
5146 const SMDS_MeshNode* faceNodes[ nbN ], *n;
5147 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
5148 while ( nIt->more() ) {
5149 faceNodes[ iNode ] = static_cast<const SMDS_MeshNode*>( nIt->next() );
5150 if ( faceNodes[ iNode++ ] == n1 )
5153 // find a n2 linked to n1
5154 if(!elem->IsQuadratic()) {
5155 for ( iNode = 0; iNode < 2; iNode++ ) {
5156 if ( iNode ) // node before n1
5157 n = faceNodes[ i1 == 0 ? nbN - 1 : i1 - 1 ];
5158 else // node after n1
5159 n = faceNodes[ i1 + 1 == nbN ? 0 : i1 + 1 ];
5164 else { // analysis for quadratic elements
5165 bool IsFind = false;
5166 // check using only corner nodes
5167 for ( iNode = 0; iNode < 2; iNode++ ) {
5168 if ( iNode ) // node before n1
5169 n = faceNodes[ i1 == 0 ? nbN/2 - 1 : i1 - 1 ];
5170 else // node after n1
5171 n = faceNodes[ i1 + 1 == nbN/2 ? 0 : i1 + 1 ];
5179 // check using all nodes
5180 const SMDS_QuadraticFaceOfNodes* F =
5181 static_cast<const SMDS_QuadraticFaceOfNodes*>(elem);
5182 // use special nodes iterator
5184 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
5185 while ( anIter->more() ) {
5186 faceNodes[iNode] = static_cast<const SMDS_MeshNode*>(anIter->next());
5187 if ( faceNodes[ iNode++ ] == n1 )
5190 for ( iNode = 0; iNode < 2; iNode++ ) {
5191 if ( iNode ) // node before n1
5192 n = faceNodes[ i1 == 0 ? nbN - 1 : i1 - 1 ];
5193 else // node after n1
5194 n = faceNodes[ i1 + 1 == nbN ? 0 : i1 + 1 ];
5200 } // end analysis for quadratic elements
5205 //=======================================================================
5206 //function : findAdjacentFace
5208 //=======================================================================
5210 static const SMDS_MeshElement* findAdjacentFace(const SMDS_MeshNode* n1,
5211 const SMDS_MeshNode* n2,
5212 const SMDS_MeshElement* elem)
5214 TIDSortedElemSet elemSet, avoidSet;
5216 avoidSet.insert ( elem );
5217 return SMESH_MeshEditor::FindFaceInSet( n1, n2, elemSet, avoidSet );
5220 //=======================================================================
5221 //function : FindFreeBorder
5223 //=======================================================================
5225 #define ControlFreeBorder SMESH::Controls::FreeEdges::IsFreeEdge
5227 bool SMESH_MeshEditor::FindFreeBorder (const SMDS_MeshNode* theFirstNode,
5228 const SMDS_MeshNode* theSecondNode,
5229 const SMDS_MeshNode* theLastNode,
5230 list< const SMDS_MeshNode* > & theNodes,
5231 list< const SMDS_MeshElement* >& theFaces)
5233 if ( !theFirstNode || !theSecondNode )
5235 // find border face between theFirstNode and theSecondNode
5236 const SMDS_MeshElement* curElem = findAdjacentFace( theFirstNode, theSecondNode, 0 );
5240 theFaces.push_back( curElem );
5241 theNodes.push_back( theFirstNode );
5242 theNodes.push_back( theSecondNode );
5244 //vector<const SMDS_MeshNode*> nodes;
5245 const SMDS_MeshNode *nIgnore = theFirstNode, *nStart = theSecondNode;
5246 set < const SMDS_MeshElement* > foundElems;
5247 bool needTheLast = ( theLastNode != 0 );
5249 while ( nStart != theLastNode ) {
5250 if ( nStart == theFirstNode )
5251 return !needTheLast;
5253 // find all free border faces sharing form nStart
5255 list< const SMDS_MeshElement* > curElemList;
5256 list< const SMDS_MeshNode* > nStartList;
5257 SMDS_ElemIteratorPtr invElemIt = nStart->GetInverseElementIterator(SMDSAbs_Face);
5258 while ( invElemIt->more() ) {
5259 const SMDS_MeshElement* e = invElemIt->next();
5260 if ( e == curElem || foundElems.insert( e ).second ) {
5262 int iNode = 0, nbNodes = e->NbNodes();
5263 const SMDS_MeshNode* nodes[nbNodes+1];
5264 if(e->IsQuadratic()) {
5265 const SMDS_QuadraticFaceOfNodes* F =
5266 static_cast<const SMDS_QuadraticFaceOfNodes*>(e);
5267 // use special nodes iterator
5268 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
5269 while( anIter->more() ) {
5270 nodes[ iNode++ ] = anIter->next();
5274 SMDS_ElemIteratorPtr nIt = e->nodesIterator();
5275 while ( nIt->more() )
5276 nodes[ iNode++ ] = static_cast<const SMDS_MeshNode*>( nIt->next() );
5278 nodes[ iNode ] = nodes[ 0 ];
5280 for ( iNode = 0; iNode < nbNodes; iNode++ )
5281 if (((nodes[ iNode ] == nStart && nodes[ iNode + 1] != nIgnore ) ||
5282 (nodes[ iNode + 1] == nStart && nodes[ iNode ] != nIgnore )) &&
5283 ControlFreeBorder( &nodes[ iNode ], e->GetID() ))
5285 nStartList.push_back( nodes[ iNode + ( nodes[ iNode ] == nStart ? 1 : 0 )]);
5286 curElemList.push_back( e );
5290 // analyse the found
5292 int nbNewBorders = curElemList.size();
5293 if ( nbNewBorders == 0 ) {
5294 // no free border furthermore
5295 return !needTheLast;
5297 else if ( nbNewBorders == 1 ) {
5298 // one more element found
5300 nStart = nStartList.front();
5301 curElem = curElemList.front();
5302 theFaces.push_back( curElem );
5303 theNodes.push_back( nStart );
5306 // several continuations found
5307 list< const SMDS_MeshElement* >::iterator curElemIt;
5308 list< const SMDS_MeshNode* >::iterator nStartIt;
5309 // check if one of them reached the last node
5310 if ( needTheLast ) {
5311 for (curElemIt = curElemList.begin(), nStartIt = nStartList.begin();
5312 curElemIt!= curElemList.end();
5313 curElemIt++, nStartIt++ )
5314 if ( *nStartIt == theLastNode ) {
5315 theFaces.push_back( *curElemIt );
5316 theNodes.push_back( *nStartIt );
5320 // find the best free border by the continuations
5321 list<const SMDS_MeshNode*> contNodes[ 2 ], *cNL;
5322 list<const SMDS_MeshElement*> contFaces[ 2 ], *cFL;
5323 for (curElemIt = curElemList.begin(), nStartIt = nStartList.begin();
5324 curElemIt!= curElemList.end();
5325 curElemIt++, nStartIt++ )
5327 cNL = & contNodes[ contNodes[0].empty() ? 0 : 1 ];
5328 cFL = & contFaces[ contFaces[0].empty() ? 0 : 1 ];
5329 // find one more free border
5330 if ( ! FindFreeBorder( nStart, *nStartIt, theLastNode, *cNL, *cFL )) {
5334 else if ( !contNodes[0].empty() && !contNodes[1].empty() ) {
5335 // choice: clear a worse one
5336 int iLongest = ( contNodes[0].size() < contNodes[1].size() ? 1 : 0 );
5337 int iWorse = ( needTheLast ? 1 - iLongest : iLongest );
5338 contNodes[ iWorse ].clear();
5339 contFaces[ iWorse ].clear();
5342 if ( contNodes[0].empty() && contNodes[1].empty() )
5345 // append the best free border
5346 cNL = & contNodes[ contNodes[0].empty() ? 1 : 0 ];
5347 cFL = & contFaces[ contFaces[0].empty() ? 1 : 0 ];
5348 theNodes.pop_back(); // remove nIgnore
5349 theNodes.pop_back(); // remove nStart
5350 theFaces.pop_back(); // remove curElem
5351 list< const SMDS_MeshNode* >::iterator nIt = cNL->begin();
5352 list< const SMDS_MeshElement* >::iterator fIt = cFL->begin();
5353 for ( ; nIt != cNL->end(); nIt++ ) theNodes.push_back( *nIt );
5354 for ( ; fIt != cFL->end(); fIt++ ) theFaces.push_back( *fIt );
5357 } // several continuations found
5358 } // while ( nStart != theLastNode )
5363 //=======================================================================
5364 //function : CheckFreeBorderNodes
5365 //purpose : Return true if the tree nodes are on a free border
5366 //=======================================================================
5368 bool SMESH_MeshEditor::CheckFreeBorderNodes(const SMDS_MeshNode* theNode1,
5369 const SMDS_MeshNode* theNode2,
5370 const SMDS_MeshNode* theNode3)
5372 list< const SMDS_MeshNode* > nodes;
5373 list< const SMDS_MeshElement* > faces;
5374 return FindFreeBorder( theNode1, theNode2, theNode3, nodes, faces);
5377 //=======================================================================
5378 //function : SewFreeBorder
5380 //=======================================================================
5382 SMESH_MeshEditor::Sew_Error
5383 SMESH_MeshEditor::SewFreeBorder (const SMDS_MeshNode* theBordFirstNode,
5384 const SMDS_MeshNode* theBordSecondNode,
5385 const SMDS_MeshNode* theBordLastNode,
5386 const SMDS_MeshNode* theSideFirstNode,
5387 const SMDS_MeshNode* theSideSecondNode,
5388 const SMDS_MeshNode* theSideThirdNode,
5389 const bool theSideIsFreeBorder,
5390 const bool toCreatePolygons,
5391 const bool toCreatePolyedrs)
5393 myLastCreatedElems.Clear();
5394 myLastCreatedNodes.Clear();
5396 MESSAGE("::SewFreeBorder()");
5397 Sew_Error aResult = SEW_OK;
5399 // ====================================
5400 // find side nodes and elements
5401 // ====================================
5403 list< const SMDS_MeshNode* > nSide[ 2 ];
5404 list< const SMDS_MeshElement* > eSide[ 2 ];
5405 list< const SMDS_MeshNode* >::iterator nIt[ 2 ];
5406 list< const SMDS_MeshElement* >::iterator eIt[ 2 ];
5410 if (!FindFreeBorder(theBordFirstNode,theBordSecondNode,theBordLastNode,
5411 nSide[0], eSide[0])) {
5412 MESSAGE(" Free Border 1 not found " );
5413 aResult = SEW_BORDER1_NOT_FOUND;
5415 if (theSideIsFreeBorder) {
5418 if (!FindFreeBorder(theSideFirstNode, theSideSecondNode, theSideThirdNode,
5419 nSide[1], eSide[1])) {
5420 MESSAGE(" Free Border 2 not found " );
5421 aResult = ( aResult != SEW_OK ? SEW_BOTH_BORDERS_NOT_FOUND : SEW_BORDER2_NOT_FOUND );
5424 if ( aResult != SEW_OK )
5427 if (!theSideIsFreeBorder) {
5431 // -------------------------------------------------------------------------
5433 // 1. If nodes to merge are not coincident, move nodes of the free border
5434 // from the coord sys defined by the direction from the first to last
5435 // nodes of the border to the correspondent sys of the side 2
5436 // 2. On the side 2, find the links most co-directed with the correspondent
5437 // links of the free border
5438 // -------------------------------------------------------------------------
5440 // 1. Since sewing may brake if there are volumes to split on the side 2,
5441 // we wont move nodes but just compute new coordinates for them
5442 typedef map<const SMDS_MeshNode*, gp_XYZ> TNodeXYZMap;
5443 TNodeXYZMap nBordXYZ;
5444 list< const SMDS_MeshNode* >& bordNodes = nSide[ 0 ];
5445 list< const SMDS_MeshNode* >::iterator nBordIt;
5447 gp_XYZ Pb1( theBordFirstNode->X(), theBordFirstNode->Y(), theBordFirstNode->Z() );
5448 gp_XYZ Pb2( theBordLastNode->X(), theBordLastNode->Y(), theBordLastNode->Z() );
5449 gp_XYZ Ps1( theSideFirstNode->X(), theSideFirstNode->Y(), theSideFirstNode->Z() );
5450 gp_XYZ Ps2( theSideSecondNode->X(), theSideSecondNode->Y(), theSideSecondNode->Z() );
5451 double tol2 = 1.e-8;
5452 gp_Vec Vbs1( Pb1 - Ps1 ),Vbs2( Pb2 - Ps2 );
5453 if ( Vbs1.SquareMagnitude() > tol2 || Vbs2.SquareMagnitude() > tol2 ) {
5454 // Need node movement.
5456 // find X and Z axes to create trsf
5457 gp_Vec Zb( Pb1 - Pb2 ), Zs( Ps1 - Ps2 );
5459 if ( X.SquareMagnitude() <= gp::Resolution() * gp::Resolution() )
5461 X = gp_Ax2( gp::Origin(), Zb ).XDirection();
5464 gp_Ax3 toBordAx( Pb1, Zb, X );
5465 gp_Ax3 fromSideAx( Ps1, Zs, X );
5466 gp_Ax3 toGlobalAx( gp::Origin(), gp::DZ(), gp::DX() );
5468 gp_Trsf toBordSys, fromSide2Sys;
5469 toBordSys.SetTransformation( toBordAx );
5470 fromSide2Sys.SetTransformation( fromSideAx, toGlobalAx );
5471 fromSide2Sys.SetScaleFactor( Zs.Magnitude() / Zb.Magnitude() );
5474 for ( nBordIt = bordNodes.begin(); nBordIt != bordNodes.end(); nBordIt++ ) {
5475 const SMDS_MeshNode* n = *nBordIt;
5476 gp_XYZ xyz( n->X(),n->Y(),n->Z() );
5477 toBordSys.Transforms( xyz );
5478 fromSide2Sys.Transforms( xyz );
5479 nBordXYZ.insert( TNodeXYZMap::value_type( n, xyz ));
5483 // just insert nodes XYZ in the nBordXYZ map
5484 for ( nBordIt = bordNodes.begin(); nBordIt != bordNodes.end(); nBordIt++ ) {
5485 const SMDS_MeshNode* n = *nBordIt;
5486 nBordXYZ.insert( TNodeXYZMap::value_type( n, gp_XYZ( n->X(),n->Y(),n->Z() )));
5490 // 2. On the side 2, find the links most co-directed with the correspondent
5491 // links of the free border
5493 list< const SMDS_MeshElement* >& sideElems = eSide[ 1 ];
5494 list< const SMDS_MeshNode* >& sideNodes = nSide[ 1 ];
5495 sideNodes.push_back( theSideFirstNode );
5497 bool hasVolumes = false;
5498 LinkID_Gen aLinkID_Gen( GetMeshDS() );
5499 set<long> foundSideLinkIDs, checkedLinkIDs;
5500 SMDS_VolumeTool volume;
5501 //const SMDS_MeshNode* faceNodes[ 4 ];
5503 const SMDS_MeshNode* sideNode;
5504 const SMDS_MeshElement* sideElem;
5505 const SMDS_MeshNode* prevSideNode = theSideFirstNode;
5506 const SMDS_MeshNode* prevBordNode = theBordFirstNode;
5507 nBordIt = bordNodes.begin();
5509 // border node position and border link direction to compare with
5510 gp_XYZ bordPos = nBordXYZ[ *nBordIt ];
5511 gp_XYZ bordDir = bordPos - nBordXYZ[ prevBordNode ];
5512 // choose next side node by link direction or by closeness to
5513 // the current border node:
5514 bool searchByDir = ( *nBordIt != theBordLastNode );
5516 // find the next node on the Side 2
5518 double maxDot = -DBL_MAX, minDist = DBL_MAX;
5520 checkedLinkIDs.clear();
5521 gp_XYZ prevXYZ( prevSideNode->X(), prevSideNode->Y(), prevSideNode->Z() );
5523 // loop on inverse elements of current node (prevSideNode) on the Side 2
5524 SMDS_ElemIteratorPtr invElemIt = prevSideNode->GetInverseElementIterator();
5525 while ( invElemIt->more() )
5527 const SMDS_MeshElement* elem = invElemIt->next();
5528 // prepare data for a loop on links coming to prevSideNode, of a face or a volume
5529 int iPrevNode, iNode = 0, nbNodes = elem->NbNodes();
5530 const SMDS_MeshNode* faceNodes[ nbNodes ];
5531 bool isVolume = volume.Set( elem );
5532 const SMDS_MeshNode** nodes = isVolume ? volume.GetNodes() : faceNodes;
5533 if ( isVolume ) // --volume
5535 //else if ( nbNodes > 2 ) { // --face
5536 else if ( elem->GetType()==SMDSAbs_Face ) { // --face
5537 // retrieve all face nodes and find iPrevNode - an index of the prevSideNode
5538 if(elem->IsQuadratic()) {
5539 const SMDS_QuadraticFaceOfNodes* F =
5540 static_cast<const SMDS_QuadraticFaceOfNodes*>(elem);
5541 // use special nodes iterator
5542 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
5543 while( anIter->more() ) {
5544 nodes[ iNode ] = anIter->next();
5545 if ( nodes[ iNode++ ] == prevSideNode )
5546 iPrevNode = iNode - 1;
5550 SMDS_ElemIteratorPtr nIt = elem->nodesIterator();
5551 while ( nIt->more() ) {
5552 nodes[ iNode ] = static_cast<const SMDS_MeshNode*>( nIt->next() );
5553 if ( nodes[ iNode++ ] == prevSideNode )
5554 iPrevNode = iNode - 1;
5557 // there are 2 links to check
5562 // loop on links, to be precise, on the second node of links
5563 for ( iNode = 0; iNode < nbNodes; iNode++ ) {
5564 const SMDS_MeshNode* n = nodes[ iNode ];
5566 if ( !volume.IsLinked( n, prevSideNode ))
5570 if ( iNode ) // a node before prevSideNode
5571 n = nodes[ iPrevNode == 0 ? elem->NbNodes() - 1 : iPrevNode - 1 ];
5572 else // a node after prevSideNode
5573 n = nodes[ iPrevNode + 1 == elem->NbNodes() ? 0 : iPrevNode + 1 ];
5575 // check if this link was already used
5576 long iLink = aLinkID_Gen.GetLinkID( prevSideNode, n );
5577 bool isJustChecked = !checkedLinkIDs.insert( iLink ).second;
5578 if (!isJustChecked &&
5579 foundSideLinkIDs.find( iLink ) == foundSideLinkIDs.end() )
5581 // test a link geometrically
5582 gp_XYZ nextXYZ ( n->X(), n->Y(), n->Z() );
5583 bool linkIsBetter = false;
5585 if ( searchByDir ) { // choose most co-directed link
5586 dot = bordDir * ( nextXYZ - prevXYZ ).Normalized();
5587 linkIsBetter = ( dot > maxDot );
5589 else { // choose link with the node closest to bordPos
5590 dist = ( nextXYZ - bordPos ).SquareModulus();
5591 linkIsBetter = ( dist < minDist );
5593 if ( linkIsBetter ) {
5602 } // loop on inverse elements of prevSideNode
5605 MESSAGE(" Cant find path by links of the Side 2 ");
5606 return SEW_BAD_SIDE_NODES;
5608 sideNodes.push_back( sideNode );
5609 sideElems.push_back( sideElem );
5610 foundSideLinkIDs.insert ( linkID );
5611 prevSideNode = sideNode;
5613 if ( *nBordIt == theBordLastNode )
5614 searchByDir = false;
5616 // find the next border link to compare with
5617 gp_XYZ sidePos( sideNode->X(), sideNode->Y(), sideNode->Z() );
5618 searchByDir = ( bordDir * ( sidePos - bordPos ) <= 0 );
5619 // move to next border node if sideNode is before forward border node (bordPos)
5620 while ( *nBordIt != theBordLastNode && !searchByDir ) {
5621 prevBordNode = *nBordIt;
5623 bordPos = nBordXYZ[ *nBordIt ];
5624 bordDir = bordPos - nBordXYZ[ prevBordNode ];
5625 searchByDir = ( bordDir * ( sidePos - bordPos ) <= 0 );
5629 while ( sideNode != theSideSecondNode );
5631 if ( hasVolumes && sideNodes.size () != bordNodes.size() && !toCreatePolyedrs) {
5632 MESSAGE("VOLUME SPLITTING IS FORBIDDEN");
5633 return SEW_VOLUMES_TO_SPLIT; // volume splitting is forbidden
5635 } // end nodes search on the side 2
5637 // ============================
5638 // sew the border to the side 2
5639 // ============================
5641 int nbNodes[] = { nSide[0].size(), nSide[1].size() };
5642 int maxNbNodes = Max( nbNodes[0], nbNodes[1] );
5644 TListOfListOfNodes nodeGroupsToMerge;
5645 if ( nbNodes[0] == nbNodes[1] ||
5646 ( theSideIsFreeBorder && !theSideThirdNode)) {
5648 // all nodes are to be merged
5650 for (nIt[0] = nSide[0].begin(), nIt[1] = nSide[1].begin();
5651 nIt[0] != nSide[0].end() && nIt[1] != nSide[1].end();
5652 nIt[0]++, nIt[1]++ )
5654 nodeGroupsToMerge.push_back( list<const SMDS_MeshNode*>() );
5655 nodeGroupsToMerge.back().push_back( *nIt[1] ); // to keep
5656 nodeGroupsToMerge.back().push_back( *nIt[0] ); // tp remove
5661 // insert new nodes into the border and the side to get equal nb of segments
5663 // get normalized parameters of nodes on the borders
5664 double param[ 2 ][ maxNbNodes ];
5666 for ( iBord = 0; iBord < 2; iBord++ ) { // loop on 2 borders
5667 list< const SMDS_MeshNode* >& nodes = nSide[ iBord ];
5668 list< const SMDS_MeshNode* >::iterator nIt = nodes.begin();
5669 const SMDS_MeshNode* nPrev = *nIt;
5670 double bordLength = 0;
5671 for ( iNode = 0; nIt != nodes.end(); nIt++, iNode++ ) { // loop on border nodes
5672 const SMDS_MeshNode* nCur = *nIt;
5673 gp_XYZ segment (nCur->X() - nPrev->X(),
5674 nCur->Y() - nPrev->Y(),
5675 nCur->Z() - nPrev->Z());
5676 double segmentLen = segment.Modulus();
5677 bordLength += segmentLen;
5678 param[ iBord ][ iNode ] = bordLength;
5681 // normalize within [0,1]
5682 for ( iNode = 0; iNode < nbNodes[ iBord ]; iNode++ ) {
5683 param[ iBord ][ iNode ] /= bordLength;
5687 // loop on border segments
5688 const SMDS_MeshNode *nPrev[ 2 ] = { 0, 0 };
5689 int i[ 2 ] = { 0, 0 };
5690 nIt[0] = nSide[0].begin(); eIt[0] = eSide[0].begin();
5691 nIt[1] = nSide[1].begin(); eIt[1] = eSide[1].begin();
5693 TElemOfNodeListMap insertMap;
5694 TElemOfNodeListMap::iterator insertMapIt;
5696 // key: elem to insert nodes into
5697 // value: 2 nodes to insert between + nodes to be inserted
5699 bool next[ 2 ] = { false, false };
5701 // find min adjacent segment length after sewing
5702 double nextParam = 10., prevParam = 0;
5703 for ( iBord = 0; iBord < 2; iBord++ ) { // loop on 2 borders
5704 if ( i[ iBord ] + 1 < nbNodes[ iBord ])
5705 nextParam = Min( nextParam, param[iBord][ i[iBord] + 1 ]);
5706 if ( i[ iBord ] > 0 )
5707 prevParam = Max( prevParam, param[iBord][ i[iBord] - 1 ]);
5709 double minParam = Min( param[ 0 ][ i[0] ], param[ 1 ][ i[1] ]);
5710 double maxParam = Max( param[ 0 ][ i[0] ], param[ 1 ][ i[1] ]);
5711 double minSegLen = Min( nextParam - minParam, maxParam - prevParam );
5713 // choose to insert or to merge nodes
5714 double du = param[ 1 ][ i[1] ] - param[ 0 ][ i[0] ];
5715 if ( Abs( du ) <= minSegLen * 0.2 ) {
5718 nodeGroupsToMerge.push_back( list<const SMDS_MeshNode*>() );
5719 const SMDS_MeshNode* n0 = *nIt[0];
5720 const SMDS_MeshNode* n1 = *nIt[1];
5721 nodeGroupsToMerge.back().push_back( n1 );
5722 nodeGroupsToMerge.back().push_back( n0 );
5723 // position of node of the border changes due to merge
5724 param[ 0 ][ i[0] ] += du;
5725 // move n1 for the sake of elem shape evaluation during insertion.
5726 // n1 will be removed by MergeNodes() anyway
5727 const_cast<SMDS_MeshNode*>( n0 )->setXYZ( n1->X(), n1->Y(), n1->Z() );
5728 next[0] = next[1] = true;
5733 int intoBord = ( du < 0 ) ? 0 : 1;
5734 const SMDS_MeshElement* elem = *eIt[ intoBord ];
5735 const SMDS_MeshNode* n1 = nPrev[ intoBord ];
5736 const SMDS_MeshNode* n2 = *nIt[ intoBord ];
5737 const SMDS_MeshNode* nIns = *nIt[ 1 - intoBord ];
5738 if ( intoBord == 1 ) {
5739 // move node of the border to be on a link of elem of the side
5740 gp_XYZ p1 (n1->X(), n1->Y(), n1->Z());
5741 gp_XYZ p2 (n2->X(), n2->Y(), n2->Z());
5742 double ratio = du / ( param[ 1 ][ i[1] ] - param[ 1 ][ i[1]-1 ]);
5743 gp_XYZ p = p2 * ( 1 - ratio ) + p1 * ratio;
5744 GetMeshDS()->MoveNode( nIns, p.X(), p.Y(), p.Z() );
5746 insertMapIt = insertMap.find( elem );
5747 bool notFound = ( insertMapIt == insertMap.end() );
5748 bool otherLink = ( !notFound && (*insertMapIt).second.front() != n1 );
5750 // insert into another link of the same element:
5751 // 1. perform insertion into the other link of the elem
5752 list<const SMDS_MeshNode*> & nodeList = (*insertMapIt).second;
5753 const SMDS_MeshNode* n12 = nodeList.front(); nodeList.pop_front();
5754 const SMDS_MeshNode* n22 = nodeList.front(); nodeList.pop_front();
5755 InsertNodesIntoLink( elem, n12, n22, nodeList, toCreatePolygons );
5756 // 2. perform insertion into the link of adjacent faces
5758 const SMDS_MeshElement* adjElem = findAdjacentFace( n12, n22, elem );
5760 InsertNodesIntoLink( adjElem, n12, n22, nodeList, toCreatePolygons );
5764 if (toCreatePolyedrs) {
5765 // perform insertion into the links of adjacent volumes
5766 UpdateVolumes(n12, n22, nodeList);
5768 // 3. find an element appeared on n1 and n2 after the insertion
5769 insertMap.erase( elem );
5770 elem = findAdjacentFace( n1, n2, 0 );
5772 if ( notFound || otherLink ) {
5773 // add element and nodes of the side into the insertMap
5774 insertMapIt = insertMap.insert
5775 ( TElemOfNodeListMap::value_type( elem, list<const SMDS_MeshNode*>() )).first;
5776 (*insertMapIt).second.push_back( n1 );
5777 (*insertMapIt).second.push_back( n2 );
5779 // add node to be inserted into elem
5780 (*insertMapIt).second.push_back( nIns );
5781 next[ 1 - intoBord ] = true;
5784 // go to the next segment
5785 for ( iBord = 0; iBord < 2; iBord++ ) { // loop on 2 borders
5786 if ( next[ iBord ] ) {
5787 if ( i[ iBord ] != 0 && eIt[ iBord ] != eSide[ iBord ].end())
5789 nPrev[ iBord ] = *nIt[ iBord ];
5790 nIt[ iBord ]++; i[ iBord ]++;
5794 while ( nIt[0] != nSide[0].end() && nIt[1] != nSide[1].end());
5796 // perform insertion of nodes into elements
5798 for (insertMapIt = insertMap.begin();
5799 insertMapIt != insertMap.end();
5802 const SMDS_MeshElement* elem = (*insertMapIt).first;
5803 list<const SMDS_MeshNode*> & nodeList = (*insertMapIt).second;
5804 const SMDS_MeshNode* n1 = nodeList.front(); nodeList.pop_front();
5805 const SMDS_MeshNode* n2 = nodeList.front(); nodeList.pop_front();
5807 InsertNodesIntoLink( elem, n1, n2, nodeList, toCreatePolygons );
5809 if ( !theSideIsFreeBorder ) {
5810 // look for and insert nodes into the faces adjacent to elem
5812 const SMDS_MeshElement* adjElem = findAdjacentFace( n1, n2, elem );
5814 InsertNodesIntoLink( adjElem, n1, n2, nodeList, toCreatePolygons );
5819 if (toCreatePolyedrs) {
5820 // perform insertion into the links of adjacent volumes
5821 UpdateVolumes(n1, n2, nodeList);
5825 } // end: insert new nodes
5827 MergeNodes ( nodeGroupsToMerge );
5832 //=======================================================================
5833 //function : InsertNodesIntoLink
5834 //purpose : insert theNodesToInsert into theFace between theBetweenNode1
5835 // and theBetweenNode2 and split theElement
5836 //=======================================================================
5838 void SMESH_MeshEditor::InsertNodesIntoLink(const SMDS_MeshElement* theFace,
5839 const SMDS_MeshNode* theBetweenNode1,
5840 const SMDS_MeshNode* theBetweenNode2,
5841 list<const SMDS_MeshNode*>& theNodesToInsert,
5842 const bool toCreatePoly)
5844 if ( theFace->GetType() != SMDSAbs_Face ) return;
5846 // find indices of 2 link nodes and of the rest nodes
5847 int iNode = 0, il1, il2, i3, i4;
5848 il1 = il2 = i3 = i4 = -1;
5849 const SMDS_MeshNode* nodes[ theFace->NbNodes() ];
5851 if(theFace->IsQuadratic()) {
5852 const SMDS_QuadraticFaceOfNodes* F =
5853 static_cast<const SMDS_QuadraticFaceOfNodes*>(theFace);
5854 // use special nodes iterator
5855 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
5856 while( anIter->more() ) {
5857 const SMDS_MeshNode* n = anIter->next();
5858 if ( n == theBetweenNode1 )
5860 else if ( n == theBetweenNode2 )
5866 nodes[ iNode++ ] = n;
5870 SMDS_ElemIteratorPtr nodeIt = theFace->nodesIterator();
5871 while ( nodeIt->more() ) {
5872 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
5873 if ( n == theBetweenNode1 )
5875 else if ( n == theBetweenNode2 )
5881 nodes[ iNode++ ] = n;
5884 if ( il1 < 0 || il2 < 0 || i3 < 0 )
5887 // arrange link nodes to go one after another regarding the face orientation
5888 bool reverse = ( Abs( il2 - il1 ) == 1 ? il2 < il1 : il1 < il2 );
5889 list<const SMDS_MeshNode *> aNodesToInsert = theNodesToInsert;
5894 aNodesToInsert.reverse();
5896 // check that not link nodes of a quadrangles are in good order
5897 int nbFaceNodes = theFace->NbNodes();
5898 if ( nbFaceNodes == 4 && i4 - i3 != 1 ) {
5904 if (toCreatePoly || theFace->IsPoly()) {
5907 vector<const SMDS_MeshNode *> poly_nodes (nbFaceNodes + aNodesToInsert.size());
5909 // add nodes of face up to first node of link
5912 if(theFace->IsQuadratic()) {
5913 const SMDS_QuadraticFaceOfNodes* F =
5914 static_cast<const SMDS_QuadraticFaceOfNodes*>(theFace);
5915 // use special nodes iterator
5916 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
5917 while( anIter->more() && !isFLN ) {
5918 const SMDS_MeshNode* n = anIter->next();
5919 poly_nodes[iNode++] = n;
5920 if (n == nodes[il1]) {
5924 // add nodes to insert
5925 list<const SMDS_MeshNode*>::iterator nIt = aNodesToInsert.begin();
5926 for (; nIt != aNodesToInsert.end(); nIt++) {
5927 poly_nodes[iNode++] = *nIt;
5929 // add nodes of face starting from last node of link
5930 while ( anIter->more() ) {
5931 poly_nodes[iNode++] = anIter->next();
5935 SMDS_ElemIteratorPtr nodeIt = theFace->nodesIterator();
5936 while ( nodeIt->more() && !isFLN ) {
5937 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
5938 poly_nodes[iNode++] = n;
5939 if (n == nodes[il1]) {
5943 // add nodes to insert
5944 list<const SMDS_MeshNode*>::iterator nIt = aNodesToInsert.begin();
5945 for (; nIt != aNodesToInsert.end(); nIt++) {
5946 poly_nodes[iNode++] = *nIt;
5948 // add nodes of face starting from last node of link
5949 while ( nodeIt->more() ) {
5950 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
5951 poly_nodes[iNode++] = n;
5955 // edit or replace the face
5956 SMESHDS_Mesh *aMesh = GetMeshDS();
5958 if (theFace->IsPoly()) {
5959 aMesh->ChangePolygonNodes(theFace, poly_nodes);
5962 int aShapeId = FindShape( theFace );
5964 SMDS_MeshElement* newElem = aMesh->AddPolygonalFace(poly_nodes);
5965 myLastCreatedElems.Append(newElem);
5966 if ( aShapeId && newElem )
5967 aMesh->SetMeshElementOnShape( newElem, aShapeId );
5969 aMesh->RemoveElement(theFace);
5974 if( !theFace->IsQuadratic() ) {
5976 // put aNodesToInsert between theBetweenNode1 and theBetweenNode2
5977 int nbLinkNodes = 2 + aNodesToInsert.size();
5978 const SMDS_MeshNode* linkNodes[ nbLinkNodes ];
5979 linkNodes[ 0 ] = nodes[ il1 ];
5980 linkNodes[ nbLinkNodes - 1 ] = nodes[ il2 ];
5981 list<const SMDS_MeshNode*>::iterator nIt = aNodesToInsert.begin();
5982 for ( iNode = 1; nIt != aNodesToInsert.end(); nIt++ ) {
5983 linkNodes[ iNode++ ] = *nIt;
5985 // decide how to split a quadrangle: compare possible variants
5986 // and choose which of splits to be a quadrangle
5987 int i1, i2, iSplit, nbSplits = nbLinkNodes - 1, iBestQuad;
5988 if ( nbFaceNodes == 3 ) {
5989 iBestQuad = nbSplits;
5992 else if ( nbFaceNodes == 4 ) {
5993 SMESH::Controls::NumericalFunctorPtr aCrit( new SMESH::Controls::AspectRatio);
5994 double aBestRate = DBL_MAX;
5995 for ( int iQuad = 0; iQuad < nbSplits; iQuad++ ) {
5997 double aBadRate = 0;
5998 // evaluate elements quality
5999 for ( iSplit = 0; iSplit < nbSplits; iSplit++ ) {
6000 if ( iSplit == iQuad ) {
6001 SMDS_FaceOfNodes quad (linkNodes[ i1++ ],
6005 aBadRate += getBadRate( &quad, aCrit );
6008 SMDS_FaceOfNodes tria (linkNodes[ i1++ ],
6010 nodes[ iSplit < iQuad ? i4 : i3 ]);
6011 aBadRate += getBadRate( &tria, aCrit );
6015 if ( aBadRate < aBestRate ) {
6017 aBestRate = aBadRate;
6022 // create new elements
6023 SMESHDS_Mesh *aMesh = GetMeshDS();
6024 int aShapeId = FindShape( theFace );
6027 for ( iSplit = 0; iSplit < nbSplits - 1; iSplit++ ) {
6028 SMDS_MeshElement* newElem = 0;
6029 if ( iSplit == iBestQuad )
6030 newElem = aMesh->AddFace (linkNodes[ i1++ ],
6035 newElem = aMesh->AddFace (linkNodes[ i1++ ],
6037 nodes[ iSplit < iBestQuad ? i4 : i3 ]);
6038 myLastCreatedElems.Append(newElem);
6039 if ( aShapeId && newElem )
6040 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6043 // change nodes of theFace
6044 const SMDS_MeshNode* newNodes[ 4 ];
6045 newNodes[ 0 ] = linkNodes[ i1 ];
6046 newNodes[ 1 ] = linkNodes[ i2 ];
6047 newNodes[ 2 ] = nodes[ iSplit >= iBestQuad ? i3 : i4 ];
6048 newNodes[ 3 ] = nodes[ i4 ];
6049 aMesh->ChangeElementNodes( theFace, newNodes, iSplit == iBestQuad ? 4 : 3 );
6050 } // end if(!theFace->IsQuadratic())
6051 else { // theFace is quadratic
6052 // we have to split theFace on simple triangles and one simple quadrangle
6054 int nbshift = tmp*2;
6055 // shift nodes in nodes[] by nbshift
6057 for(i=0; i<nbshift; i++) {
6058 const SMDS_MeshNode* n = nodes[0];
6059 for(j=0; j<nbFaceNodes-1; j++) {
6060 nodes[j] = nodes[j+1];
6062 nodes[nbFaceNodes-1] = n;
6064 il1 = il1 - nbshift;
6065 // now have to insert nodes between n0 and n1 or n1 and n2 (see below)
6066 // n0 n1 n2 n0 n1 n2
6067 // +-----+-----+ +-----+-----+
6076 // create new elements
6077 SMESHDS_Mesh *aMesh = GetMeshDS();
6078 int aShapeId = FindShape( theFace );
6081 if(nbFaceNodes==6) { // quadratic triangle
6082 SMDS_MeshElement* newElem =
6083 aMesh->AddFace(nodes[3],nodes[4],nodes[5]);
6084 myLastCreatedElems.Append(newElem);
6085 if ( aShapeId && newElem )
6086 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6087 if(theFace->IsMediumNode(nodes[il1])) {
6088 // create quadrangle
6089 newElem = aMesh->AddFace(nodes[0],nodes[1],nodes[3],nodes[5]);
6090 myLastCreatedElems.Append(newElem);
6091 if ( aShapeId && newElem )
6092 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6098 // create quadrangle
6099 newElem = aMesh->AddFace(nodes[1],nodes[2],nodes[3],nodes[5]);
6100 myLastCreatedElems.Append(newElem);
6101 if ( aShapeId && newElem )
6102 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6108 else { // nbFaceNodes==8 - quadratic quadrangle
6109 SMDS_MeshElement* newElem =
6110 aMesh->AddFace(nodes[3],nodes[4],nodes[5]);
6111 myLastCreatedElems.Append(newElem);
6112 if ( aShapeId && newElem )
6113 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6114 newElem = aMesh->AddFace(nodes[5],nodes[6],nodes[7]);
6115 myLastCreatedElems.Append(newElem);
6116 if ( aShapeId && newElem )
6117 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6118 newElem = aMesh->AddFace(nodes[5],nodes[7],nodes[3]);
6119 myLastCreatedElems.Append(newElem);
6120 if ( aShapeId && newElem )
6121 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6122 if(theFace->IsMediumNode(nodes[il1])) {
6123 // create quadrangle
6124 newElem = aMesh->AddFace(nodes[0],nodes[1],nodes[3],nodes[7]);
6125 myLastCreatedElems.Append(newElem);
6126 if ( aShapeId && newElem )
6127 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6133 // create quadrangle
6134 newElem = aMesh->AddFace(nodes[1],nodes[2],nodes[3],nodes[7]);
6135 myLastCreatedElems.Append(newElem);
6136 if ( aShapeId && newElem )
6137 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6143 // create needed triangles using n1,n2,n3 and inserted nodes
6144 int nbn = 2 + aNodesToInsert.size();
6145 const SMDS_MeshNode* aNodes[nbn];
6146 aNodes[0] = nodes[n1];
6147 aNodes[nbn-1] = nodes[n2];
6148 list<const SMDS_MeshNode*>::iterator nIt = aNodesToInsert.begin();
6149 for ( iNode = 1; nIt != aNodesToInsert.end(); nIt++ ) {
6150 aNodes[iNode++] = *nIt;
6152 for(i=1; i<nbn; i++) {
6153 SMDS_MeshElement* newElem =
6154 aMesh->AddFace(aNodes[i-1],aNodes[i],nodes[n3]);
6155 myLastCreatedElems.Append(newElem);
6156 if ( aShapeId && newElem )
6157 aMesh->SetMeshElementOnShape( newElem, aShapeId );
6159 // remove old quadratic face
6160 aMesh->RemoveElement(theFace);
6164 //=======================================================================
6165 //function : UpdateVolumes
6167 //=======================================================================
6168 void SMESH_MeshEditor::UpdateVolumes (const SMDS_MeshNode* theBetweenNode1,
6169 const SMDS_MeshNode* theBetweenNode2,
6170 list<const SMDS_MeshNode*>& theNodesToInsert)
6172 myLastCreatedElems.Clear();
6173 myLastCreatedNodes.Clear();
6175 SMDS_ElemIteratorPtr invElemIt = theBetweenNode1->GetInverseElementIterator(SMDSAbs_Volume);
6176 while (invElemIt->more()) { // loop on inverse elements of theBetweenNode1
6177 const SMDS_MeshElement* elem = invElemIt->next();
6179 // check, if current volume has link theBetweenNode1 - theBetweenNode2
6180 SMDS_VolumeTool aVolume (elem);
6181 if (!aVolume.IsLinked(theBetweenNode1, theBetweenNode2))
6184 // insert new nodes in all faces of the volume, sharing link theBetweenNode1 - theBetweenNode2
6185 int iface, nbFaces = aVolume.NbFaces();
6186 vector<const SMDS_MeshNode *> poly_nodes;
6187 vector<int> quantities (nbFaces);
6189 for (iface = 0; iface < nbFaces; iface++) {
6190 int nbFaceNodes = aVolume.NbFaceNodes(iface), nbInserted = 0;
6191 // faceNodes will contain (nbFaceNodes + 1) nodes, last = first
6192 const SMDS_MeshNode** faceNodes = aVolume.GetFaceNodes(iface);
6194 for (int inode = 0; inode < nbFaceNodes; inode++) {
6195 poly_nodes.push_back(faceNodes[inode]);
6197 if (nbInserted == 0) {
6198 if (faceNodes[inode] == theBetweenNode1) {
6199 if (faceNodes[inode + 1] == theBetweenNode2) {
6200 nbInserted = theNodesToInsert.size();
6202 // add nodes to insert
6203 list<const SMDS_MeshNode*>::iterator nIt = theNodesToInsert.begin();
6204 for (; nIt != theNodesToInsert.end(); nIt++) {
6205 poly_nodes.push_back(*nIt);
6209 else if (faceNodes[inode] == theBetweenNode2) {
6210 if (faceNodes[inode + 1] == theBetweenNode1) {
6211 nbInserted = theNodesToInsert.size();
6213 // add nodes to insert in reversed order
6214 list<const SMDS_MeshNode*>::iterator nIt = theNodesToInsert.end();
6216 for (; nIt != theNodesToInsert.begin(); nIt--) {
6217 poly_nodes.push_back(*nIt);
6219 poly_nodes.push_back(*nIt);
6226 quantities[iface] = nbFaceNodes + nbInserted;
6229 // Replace or update the volume
6230 SMESHDS_Mesh *aMesh = GetMeshDS();
6232 if (elem->IsPoly()) {
6233 aMesh->ChangePolyhedronNodes(elem, poly_nodes, quantities);
6237 int aShapeId = FindShape( elem );
6239 SMDS_MeshElement* newElem =
6240 aMesh->AddPolyhedralVolume(poly_nodes, quantities);
6241 myLastCreatedElems.Append(newElem);
6242 if (aShapeId && newElem)
6243 aMesh->SetMeshElementOnShape(newElem, aShapeId);
6245 aMesh->RemoveElement(elem);
6250 //=======================================================================
6251 //function : ConvertElemToQuadratic
6253 //=======================================================================
6254 void SMESH_MeshEditor::ConvertElemToQuadratic(SMESHDS_SubMesh * theSm,
6255 SMESH_MesherHelper& theHelper,
6256 const bool theForce3d)
6258 if( !theSm ) return;
6259 SMESHDS_Mesh* meshDS = GetMeshDS();
6260 SMDS_ElemIteratorPtr ElemItr = theSm->GetElements();
6261 while(ElemItr->more())
6263 const SMDS_MeshElement* elem = ElemItr->next();
6264 if( !elem || elem->IsQuadratic() ) continue;
6266 int id = elem->GetID();
6267 int nbNodes = elem->NbNodes();
6268 vector<const SMDS_MeshNode *> aNds (nbNodes);
6270 for(int i = 0; i < nbNodes; i++)
6272 aNds[i] = elem->GetNode(i);
6274 SMDSAbs_ElementType aType = elem->GetType();
6276 theSm->RemoveElement(elem);
6277 meshDS->SMDS_Mesh::RemoveFreeElement(elem);
6279 const SMDS_MeshElement* NewElem = 0;
6285 NewElem = theHelper.AddEdge(aNds[0], aNds[1], id, theForce3d);
6293 NewElem = theHelper.AddFace(aNds[0], aNds[1], aNds[2], id, theForce3d);
6296 NewElem = theHelper.AddFace(aNds[0], aNds[1], aNds[2], aNds[3], id, theForce3d);
6303 case SMDSAbs_Volume :
6308 NewElem = theHelper.AddVolume(aNds[0], aNds[1], aNds[2], aNds[3], id, true);
6311 NewElem = theHelper.AddVolume(aNds[0], aNds[1], aNds[2], aNds[3], aNds[4], aNds[5], id, true);
6314 NewElem = theHelper.AddVolume(aNds[0], aNds[1], aNds[2], aNds[3],
6315 aNds[4], aNds[5], aNds[6], aNds[7], id, true);
6327 AddToSameGroups( NewElem, elem, meshDS);
6328 theSm->AddElement( NewElem );
6330 if ( NewElem != elem )
6331 RemoveElemFromGroups (elem, meshDS);
6335 //=======================================================================
6336 //function : ConvertToQuadratic
6338 //=======================================================================
6339 void SMESH_MeshEditor::ConvertToQuadratic(const bool theForce3d)
6341 SMESHDS_Mesh* meshDS = GetMeshDS();
6343 SMESH_MesherHelper aHelper(*myMesh);
6344 aHelper.SetIsQuadratic( true );
6345 const TopoDS_Shape& aShape = meshDS->ShapeToMesh();
6347 if ( !aShape.IsNull() && GetMesh()->GetSubMeshContaining(aShape) )
6349 SMESH_subMesh *aSubMesh = GetMesh()->GetSubMeshContaining(aShape);
6351 const map < int, SMESH_subMesh * >& aMapSM = aSubMesh->DependsOn();
6352 map < int, SMESH_subMesh * >::const_iterator itsub;
6353 for (itsub = aMapSM.begin(); itsub != aMapSM.end(); itsub++)
6355 SMESHDS_SubMesh *sm = ((*itsub).second)->GetSubMeshDS();
6356 aHelper.SetSubShape( (*itsub).second->GetSubShape() );
6357 ConvertElemToQuadratic(sm, aHelper, theForce3d);
6359 aHelper.SetSubShape( aSubMesh->GetSubShape() );
6360 ConvertElemToQuadratic(aSubMesh->GetSubMeshDS(), aHelper, theForce3d);
6364 SMDS_EdgeIteratorPtr aEdgeItr = meshDS->edgesIterator();
6365 while(aEdgeItr->more())
6367 const SMDS_MeshEdge* edge = aEdgeItr->next();
6368 if(edge && !edge->IsQuadratic())
6370 int id = edge->GetID();
6371 const SMDS_MeshNode* n1 = edge->GetNode(0);
6372 const SMDS_MeshNode* n2 = edge->GetNode(1);
6374 meshDS->SMDS_Mesh::RemoveFreeElement(edge);
6376 const SMDS_MeshEdge* NewEdge = aHelper.AddEdge(n1, n2, id, theForce3d);
6378 AddToSameGroups(NewEdge, edge, meshDS);
6379 if ( NewEdge != edge )
6380 RemoveElemFromGroups (edge, meshDS);
6383 SMDS_FaceIteratorPtr aFaceItr = meshDS->facesIterator();
6384 while(aFaceItr->more())
6386 const SMDS_MeshFace* face = aFaceItr->next();
6387 if(!face || face->IsQuadratic() ) continue;
6389 int id = face->GetID();
6390 int nbNodes = face->NbNodes();
6391 vector<const SMDS_MeshNode *> aNds (nbNodes);
6393 for(int i = 0; i < nbNodes; i++)
6395 aNds[i] = face->GetNode(i);
6398 meshDS->SMDS_Mesh::RemoveFreeElement(face);
6400 SMDS_MeshFace * NewFace = 0;
6404 NewFace = aHelper.AddFace(aNds[0], aNds[1], aNds[2], id, theForce3d);
6407 NewFace = aHelper.AddFace(aNds[0], aNds[1], aNds[2], aNds[3], id, theForce3d);
6413 AddToSameGroups(NewFace, face, meshDS);
6414 if ( NewFace != face )
6415 RemoveElemFromGroups (face, meshDS);
6417 SMDS_VolumeIteratorPtr aVolumeItr = meshDS->volumesIterator();
6418 while(aVolumeItr->more())
6420 const SMDS_MeshVolume* volume = aVolumeItr->next();
6421 if(!volume || volume->IsQuadratic() ) continue;
6423 int id = volume->GetID();
6424 int nbNodes = volume->NbNodes();
6425 vector<const SMDS_MeshNode *> aNds (nbNodes);
6427 for(int i = 0; i < nbNodes; i++)
6429 aNds[i] = volume->GetNode(i);
6432 meshDS->SMDS_Mesh::RemoveFreeElement(volume);
6434 SMDS_MeshVolume * NewVolume = 0;
6438 NewVolume = aHelper.AddVolume(aNds[0], aNds[1], aNds[2],
6439 aNds[3], id, true );
6442 NewVolume = aHelper.AddVolume(aNds[0], aNds[1], aNds[2],
6443 aNds[3], aNds[4], aNds[5], id, true);
6446 NewVolume = aHelper.AddVolume(aNds[0], aNds[1], aNds[2], aNds[3],
6447 aNds[4], aNds[5], aNds[6], aNds[7], id, true);
6453 AddToSameGroups(NewVolume, volume, meshDS);
6454 if ( NewVolume != volume )
6455 RemoveElemFromGroups (volume, meshDS);
6460 //=======================================================================
6461 //function : RemoveQuadElem
6463 //=======================================================================
6464 void SMESH_MeshEditor::RemoveQuadElem(SMESHDS_SubMesh * theSm,
6465 SMDS_ElemIteratorPtr theItr,
6466 const int theShapeID)
6468 SMESHDS_Mesh* meshDS = GetMeshDS();
6469 while( theItr->more() )
6471 const SMDS_MeshElement* elem = theItr->next();
6472 if( elem && elem->IsQuadratic())
6474 int id = elem->GetID();
6475 int nbNodes = elem->NbNodes();
6476 vector<const SMDS_MeshNode *> aNds, mediumNodes;
6477 aNds.reserve( nbNodes );
6478 mediumNodes.reserve( nbNodes );
6480 for(int i = 0; i < nbNodes; i++)
6482 const SMDS_MeshNode* n = elem->GetNode(i);
6484 if( elem->IsMediumNode( n ) )
6485 mediumNodes.push_back( n );
6487 aNds.push_back( n );
6489 if( aNds.empty() ) continue;
6490 SMDSAbs_ElementType aType = elem->GetType();
6492 //remove old quadratic elements
6493 meshDS->SMDS_Mesh::RemoveFreeElement( elem );
6495 theSm->RemoveElement( elem );
6497 SMDS_MeshElement * NewElem = AddElement( aNds, aType, false, id );
6499 AddToSameGroups(NewElem, elem, meshDS);
6500 if ( NewElem != elem )
6501 RemoveElemFromGroups (elem, meshDS);
6502 if( theSm && NewElem )
6503 theSm->AddElement( NewElem );
6505 // remove medium nodes
6506 vector<const SMDS_MeshNode*>::iterator nIt = mediumNodes.begin();
6507 for ( ; nIt != mediumNodes.end(); ++nIt ) {
6508 const SMDS_MeshNode* n = *nIt;
6509 if ( n->NbInverseNodes() == 0 ) {
6510 if ( n->GetPosition()->GetShapeId() != theShapeID )
6511 meshDS->RemoveFreeNode( n, meshDS->MeshElements
6512 ( n->GetPosition()->GetShapeId() ));
6514 meshDS->RemoveFreeNode( n, theSm );
6521 //=======================================================================
6522 //function : ConvertFromQuadratic
6524 //=======================================================================
6525 bool SMESH_MeshEditor::ConvertFromQuadratic()
6527 SMESHDS_Mesh* meshDS = GetMeshDS();
6528 const TopoDS_Shape& aShape = meshDS->ShapeToMesh();
6530 if ( !aShape.IsNull() && GetMesh()->GetSubMeshContaining(aShape) )
6532 SMESH_subMesh *aSubMesh = GetMesh()->GetSubMeshContaining(aShape);
6534 const map < int, SMESH_subMesh * >& aMapSM = aSubMesh->DependsOn();
6535 map < int, SMESH_subMesh * >::const_iterator itsub;
6536 for (itsub = aMapSM.begin(); itsub != aMapSM.end(); itsub++)
6538 SMESHDS_SubMesh *sm = ((*itsub).second)->GetSubMeshDS();
6540 RemoveQuadElem( sm, sm->GetElements(), itsub->second->GetId() );
6542 SMESHDS_SubMesh *Sm = aSubMesh->GetSubMeshDS();
6544 RemoveQuadElem( Sm, Sm->GetElements(), aSubMesh->GetId() );
6548 SMESHDS_SubMesh *aSM = 0;
6549 RemoveQuadElem( aSM, meshDS->elementsIterator(), 0 );
6555 //=======================================================================
6556 //function : SewSideElements
6558 //=======================================================================
6560 SMESH_MeshEditor::Sew_Error
6561 SMESH_MeshEditor::SewSideElements (TIDSortedElemSet& theSide1,
6562 TIDSortedElemSet& theSide2,
6563 const SMDS_MeshNode* theFirstNode1,
6564 const SMDS_MeshNode* theFirstNode2,
6565 const SMDS_MeshNode* theSecondNode1,
6566 const SMDS_MeshNode* theSecondNode2)
6568 myLastCreatedElems.Clear();
6569 myLastCreatedNodes.Clear();
6571 MESSAGE ("::::SewSideElements()");
6572 if ( theSide1.size() != theSide2.size() )
6573 return SEW_DIFF_NB_OF_ELEMENTS;
6575 Sew_Error aResult = SEW_OK;
6577 // 1. Build set of faces representing each side
6578 // 2. Find which nodes of the side 1 to merge with ones on the side 2
6579 // 3. Replace nodes in elements of the side 1 and remove replaced nodes
6581 // =======================================================================
6582 // 1. Build set of faces representing each side:
6583 // =======================================================================
6584 // a. build set of nodes belonging to faces
6585 // b. complete set of faces: find missing fices whose nodes are in set of nodes
6586 // c. create temporary faces representing side of volumes if correspondent
6587 // face does not exist
6589 SMESHDS_Mesh* aMesh = GetMeshDS();
6590 SMDS_Mesh aTmpFacesMesh;
6591 set<const SMDS_MeshElement*> faceSet1, faceSet2;
6592 set<const SMDS_MeshElement*> volSet1, volSet2;
6593 set<const SMDS_MeshNode*> nodeSet1, nodeSet2;
6594 set<const SMDS_MeshElement*> * faceSetPtr[] = { &faceSet1, &faceSet2 };
6595 set<const SMDS_MeshElement*> * volSetPtr[] = { &volSet1, &volSet2 };
6596 set<const SMDS_MeshNode*> * nodeSetPtr[] = { &nodeSet1, &nodeSet2 };
6597 TIDSortedElemSet * elemSetPtr[] = { &theSide1, &theSide2 };
6598 int iSide, iFace, iNode;
6600 for ( iSide = 0; iSide < 2; iSide++ ) {
6601 set<const SMDS_MeshNode*> * nodeSet = nodeSetPtr[ iSide ];
6602 TIDSortedElemSet * elemSet = elemSetPtr[ iSide ];
6603 set<const SMDS_MeshElement*> * faceSet = faceSetPtr[ iSide ];
6604 set<const SMDS_MeshElement*> * volSet = volSetPtr [ iSide ];
6605 set<const SMDS_MeshElement*>::iterator vIt;
6606 TIDSortedElemSet::iterator eIt;
6607 set<const SMDS_MeshNode*>::iterator nIt;
6609 // check that given nodes belong to given elements
6610 const SMDS_MeshNode* n1 = ( iSide == 0 ) ? theFirstNode1 : theFirstNode2;
6611 const SMDS_MeshNode* n2 = ( iSide == 0 ) ? theSecondNode1 : theSecondNode2;
6612 int firstIndex = -1, secondIndex = -1;
6613 for (eIt = elemSet->begin(); eIt != elemSet->end(); eIt++ ) {
6614 const SMDS_MeshElement* elem = *eIt;
6615 if ( firstIndex < 0 ) firstIndex = elem->GetNodeIndex( n1 );
6616 if ( secondIndex < 0 ) secondIndex = elem->GetNodeIndex( n2 );
6617 if ( firstIndex > -1 && secondIndex > -1 ) break;
6619 if ( firstIndex < 0 || secondIndex < 0 ) {
6620 // we can simply return until temporary faces created
6621 return (iSide == 0 ) ? SEW_BAD_SIDE1_NODES : SEW_BAD_SIDE2_NODES;
6624 // -----------------------------------------------------------
6625 // 1a. Collect nodes of existing faces
6626 // and build set of face nodes in order to detect missing
6627 // faces corresponing to sides of volumes
6628 // -----------------------------------------------------------
6630 set< set <const SMDS_MeshNode*> > setOfFaceNodeSet;
6632 // loop on the given element of a side
6633 for (eIt = elemSet->begin(); eIt != elemSet->end(); eIt++ ) {
6634 //const SMDS_MeshElement* elem = *eIt;
6635 const SMDS_MeshElement* elem = *eIt;
6636 if ( elem->GetType() == SMDSAbs_Face ) {
6637 faceSet->insert( elem );
6638 set <const SMDS_MeshNode*> faceNodeSet;
6639 SMDS_ElemIteratorPtr nodeIt = elem->nodesIterator();
6640 while ( nodeIt->more() ) {
6641 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
6642 nodeSet->insert( n );
6643 faceNodeSet.insert( n );
6645 setOfFaceNodeSet.insert( faceNodeSet );
6647 else if ( elem->GetType() == SMDSAbs_Volume )
6648 volSet->insert( elem );
6650 // ------------------------------------------------------------------------------
6651 // 1b. Complete set of faces: find missing fices whose nodes are in set of nodes
6652 // ------------------------------------------------------------------------------
6654 for ( nIt = nodeSet->begin(); nIt != nodeSet->end(); nIt++ ) { // loop on nodes of iSide
6655 SMDS_ElemIteratorPtr fIt = (*nIt)->GetInverseElementIterator(SMDSAbs_Face);
6656 while ( fIt->more() ) { // loop on faces sharing a node
6657 const SMDS_MeshElement* f = fIt->next();
6658 if ( faceSet->find( f ) == faceSet->end() ) {
6659 // check if all nodes are in nodeSet and
6660 // complete setOfFaceNodeSet if they are
6661 set <const SMDS_MeshNode*> faceNodeSet;
6662 SMDS_ElemIteratorPtr nodeIt = f->nodesIterator();
6663 bool allInSet = true;
6664 while ( nodeIt->more() && allInSet ) { // loop on nodes of a face
6665 const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
6666 if ( nodeSet->find( n ) == nodeSet->end() )
6669 faceNodeSet.insert( n );
6672 faceSet->insert( f );
6673 setOfFaceNodeSet.insert( faceNodeSet );
6679 // -------------------------------------------------------------------------
6680 // 1c. Create temporary faces representing sides of volumes if correspondent
6681 // face does not exist
6682 // -------------------------------------------------------------------------
6684 if ( !volSet->empty() ) {
6685 //int nodeSetSize = nodeSet->size();
6687 // loop on given volumes
6688 for ( vIt = volSet->begin(); vIt != volSet->end(); vIt++ ) {
6689 SMDS_VolumeTool vol (*vIt);
6690 // loop on volume faces: find free faces
6691 // --------------------------------------
6692 list<const SMDS_MeshElement* > freeFaceList;
6693 for ( iFace = 0; iFace < vol.NbFaces(); iFace++ ) {
6694 if ( !vol.IsFreeFace( iFace ))
6696 // check if there is already a face with same nodes in a face set
6697 const SMDS_MeshElement* aFreeFace = 0;
6698 const SMDS_MeshNode** fNodes = vol.GetFaceNodes( iFace );
6699 int nbNodes = vol.NbFaceNodes( iFace );
6700 set <const SMDS_MeshNode*> faceNodeSet;
6701 vol.GetFaceNodes( iFace, faceNodeSet );
6702 bool isNewFace = setOfFaceNodeSet.insert( faceNodeSet ).second;
6704 // no such a face is given but it still can exist, check it
6705 if ( nbNodes == 3 ) {
6706 aFreeFace = aMesh->FindFace( fNodes[0],fNodes[1],fNodes[2] );
6708 else if ( nbNodes == 4 ) {
6709 aFreeFace = aMesh->FindFace( fNodes[0],fNodes[1],fNodes[2],fNodes[3] );
6712 vector<const SMDS_MeshNode *> poly_nodes ( fNodes, & fNodes[nbNodes]);
6713 aFreeFace = aMesh->FindFace(poly_nodes);
6717 // create a temporary face
6718 if ( nbNodes == 3 ) {
6719 aFreeFace = aTmpFacesMesh.AddFace( fNodes[0],fNodes[1],fNodes[2] );
6721 else if ( nbNodes == 4 ) {
6722 aFreeFace = aTmpFacesMesh.AddFace( fNodes[0],fNodes[1],fNodes[2],fNodes[3] );
6725 vector<const SMDS_MeshNode *> poly_nodes ( fNodes, & fNodes[nbNodes]);
6726 aFreeFace = aTmpFacesMesh.AddPolygonalFace(poly_nodes);
6730 freeFaceList.push_back( aFreeFace );
6732 } // loop on faces of a volume
6734 // choose one of several free faces
6735 // --------------------------------------
6736 if ( freeFaceList.size() > 1 ) {
6737 // choose a face having max nb of nodes shared by other elems of a side
6738 int maxNbNodes = -1/*, nbExcludedFaces = 0*/;
6739 list<const SMDS_MeshElement* >::iterator fIt = freeFaceList.begin();
6740 while ( fIt != freeFaceList.end() ) { // loop on free faces
6741 int nbSharedNodes = 0;
6742 SMDS_ElemIteratorPtr nodeIt = (*fIt)->nodesIterator();
6743 while ( nodeIt->more() ) { // loop on free face nodes
6744 const SMDS_MeshNode* n =
6745 static_cast<const SMDS_MeshNode*>( nodeIt->next() );
6746 SMDS_ElemIteratorPtr invElemIt = n->GetInverseElementIterator();
6747 while ( invElemIt->more() ) {
6748 const SMDS_MeshElement* e = invElemIt->next();
6749 if ( faceSet->find( e ) != faceSet->end() )
6751 if ( elemSet->find( e ) != elemSet->end() )
6755 if ( nbSharedNodes >= maxNbNodes ) {
6756 maxNbNodes = nbSharedNodes;
6760 freeFaceList.erase( fIt++ ); // here fIt++ occures before erase
6762 if ( freeFaceList.size() > 1 )
6764 // could not choose one face, use another way
6765 // choose a face most close to the bary center of the opposite side
6766 gp_XYZ aBC( 0., 0., 0. );
6767 set <const SMDS_MeshNode*> addedNodes;
6768 TIDSortedElemSet * elemSet2 = elemSetPtr[ 1 - iSide ];
6769 eIt = elemSet2->begin();
6770 for ( eIt = elemSet2->begin(); eIt != elemSet2->end(); eIt++ ) {
6771 SMDS_ElemIteratorPtr nodeIt = (*eIt)->nodesIterator();
6772 while ( nodeIt->more() ) { // loop on free face nodes
6773 const SMDS_MeshNode* n =
6774 static_cast<const SMDS_MeshNode*>( nodeIt->next() );
6775 if ( addedNodes.insert( n ).second )
6776 aBC += gp_XYZ( n->X(),n->Y(),n->Z() );
6779 aBC /= addedNodes.size();
6780 double minDist = DBL_MAX;
6781 fIt = freeFaceList.begin();
6782 while ( fIt != freeFaceList.end() ) { // loop on free faces
6784 SMDS_ElemIteratorPtr nodeIt = (*fIt)->nodesIterator();
6785 while ( nodeIt->more() ) { // loop on free face nodes
6786 const SMDS_MeshNode* n =
6787 static_cast<const SMDS_MeshNode*>( nodeIt->next() );
6788 gp_XYZ p( n->X(),n->Y(),n->Z() );
6789 dist += ( aBC - p ).SquareModulus();
6791 if ( dist < minDist ) {
6793 freeFaceList.erase( freeFaceList.begin(), fIt++ );
6796 fIt = freeFaceList.erase( fIt++ );
6799 } // choose one of several free faces of a volume
6801 if ( freeFaceList.size() == 1 ) {
6802 const SMDS_MeshElement* aFreeFace = freeFaceList.front();
6803 faceSet->insert( aFreeFace );
6804 // complete a node set with nodes of a found free face
6805 // for ( iNode = 0; iNode < ; iNode++ )
6806 // nodeSet->insert( fNodes[ iNode ] );
6809 } // loop on volumes of a side
6811 // // complete a set of faces if new nodes in a nodeSet appeared
6812 // // ----------------------------------------------------------
6813 // if ( nodeSetSize != nodeSet->size() ) {
6814 // for ( ; nIt != nodeSet->end(); nIt++ ) { // loop on nodes of iSide
6815 // SMDS_ElemIteratorPtr fIt = (*nIt)->GetInverseElementIterator(SMDSAbs_Face);
6816 // while ( fIt->more() ) { // loop on faces sharing a node
6817 // const SMDS_MeshElement* f = fIt->next();
6818 // if ( faceSet->find( f ) == faceSet->end() ) {
6819 // // check if all nodes are in nodeSet and
6820 // // complete setOfFaceNodeSet if they are
6821 // set <const SMDS_MeshNode*> faceNodeSet;
6822 // SMDS_ElemIteratorPtr nodeIt = f->nodesIterator();
6823 // bool allInSet = true;
6824 // while ( nodeIt->more() && allInSet ) { // loop on nodes of a face
6825 // const SMDS_MeshNode* n = static_cast<const SMDS_MeshNode*>( nodeIt->next() );
6826 // if ( nodeSet->find( n ) == nodeSet->end() )
6827 // allInSet = false;
6829 // faceNodeSet.insert( n );
6831 // if ( allInSet ) {
6832 // faceSet->insert( f );
6833 // setOfFaceNodeSet.insert( faceNodeSet );
6839 } // Create temporary faces, if there are volumes given
6842 if ( faceSet1.size() != faceSet2.size() ) {
6843 // delete temporary faces: they are in reverseElements of actual nodes
6844 SMDS_FaceIteratorPtr tmpFaceIt = aTmpFacesMesh.facesIterator();
6845 while ( tmpFaceIt->more() )
6846 aTmpFacesMesh.RemoveElement( tmpFaceIt->next() );
6847 MESSAGE("Diff nb of faces");
6848 return SEW_TOPO_DIFF_SETS_OF_ELEMENTS;
6851 // ============================================================
6852 // 2. Find nodes to merge:
6853 // bind a node to remove to a node to put instead
6854 // ============================================================
6856 TNodeNodeMap nReplaceMap; // bind a node to remove to a node to put instead
6857 if ( theFirstNode1 != theFirstNode2 )
6858 nReplaceMap.insert( TNodeNodeMap::value_type( theFirstNode1, theFirstNode2 ));
6859 if ( theSecondNode1 != theSecondNode2 )
6860 nReplaceMap.insert( TNodeNodeMap::value_type( theSecondNode1, theSecondNode2 ));
6862 LinkID_Gen aLinkID_Gen( GetMeshDS() );
6863 set< long > linkIdSet; // links to process
6864 linkIdSet.insert( aLinkID_Gen.GetLinkID( theFirstNode1, theSecondNode1 ));
6866 typedef pair< const SMDS_MeshNode*, const SMDS_MeshNode* > NLink;
6867 list< NLink > linkList[2];
6868 linkList[0].push_back( NLink( theFirstNode1, theSecondNode1 ));
6869 linkList[1].push_back( NLink( theFirstNode2, theSecondNode2 ));
6870 // loop on links in linkList; find faces by links and append links
6871 // of the found faces to linkList
6872 list< NLink >::iterator linkIt[] = { linkList[0].begin(), linkList[1].begin() } ;
6873 for ( ; linkIt[0] != linkList[0].end(); linkIt[0]++, linkIt[1]++ ) {
6874 NLink link[] = { *linkIt[0], *linkIt[1] };
6875 long linkID = aLinkID_Gen.GetLinkID( link[0].first, link[0].second );
6876 if ( linkIdSet.find( linkID ) == linkIdSet.end() )
6879 // by links, find faces in the face sets,
6880 // and find indices of link nodes in the found faces;
6881 // in a face set, there is only one or no face sharing a link
6882 // ---------------------------------------------------------------
6884 const SMDS_MeshElement* face[] = { 0, 0 };
6885 //const SMDS_MeshNode* faceNodes[ 2 ][ 5 ];
6886 vector<const SMDS_MeshNode*> fnodes1(9);
6887 vector<const SMDS_MeshNode*> fnodes2(9);
6888 //const SMDS_MeshNode* notLinkNodes[ 2 ][ 2 ] = {{ 0, 0 },{ 0, 0 }} ;
6889 vector<const SMDS_MeshNode*> notLinkNodes1(6);
6890 vector<const SMDS_MeshNode*> notLinkNodes2(6);
6891 int iLinkNode[2][2];
6892 for ( iSide = 0; iSide < 2; iSide++ ) { // loop on 2 sides
6893 const SMDS_MeshNode* n1 = link[iSide].first;
6894 const SMDS_MeshNode* n2 = link[iSide].second;
6895 set<const SMDS_MeshElement*> * faceSet = faceSetPtr[ iSide ];
6896 set< const SMDS_MeshElement* > fMap;
6897 for ( int i = 0; i < 2; i++ ) { // loop on 2 nodes of a link
6898 const SMDS_MeshNode* n = i ? n1 : n2; // a node of a link
6899 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator(SMDSAbs_Face);
6900 while ( fIt->more() ) { // loop on faces sharing a node
6901 const SMDS_MeshElement* f = fIt->next();
6902 if (faceSet->find( f ) != faceSet->end() && // f is in face set
6903 ! fMap.insert( f ).second ) // f encounters twice
6905 if ( face[ iSide ] ) {
6906 MESSAGE( "2 faces per link " );
6907 aResult = iSide ? SEW_BAD_SIDE2_NODES : SEW_BAD_SIDE1_NODES;
6911 faceSet->erase( f );
6912 // get face nodes and find ones of a link
6917 fnodes1.resize(f->NbNodes()+1);
6918 notLinkNodes1.resize(f->NbNodes()-2);
6921 fnodes2.resize(f->NbNodes()+1);
6922 notLinkNodes2.resize(f->NbNodes()-2);
6925 if(!f->IsQuadratic()) {
6926 SMDS_ElemIteratorPtr nIt = f->nodesIterator();
6927 while ( nIt->more() ) {
6928 const SMDS_MeshNode* n =
6929 static_cast<const SMDS_MeshNode*>( nIt->next() );
6931 iLinkNode[ iSide ][ 0 ] = iNode;
6933 else if ( n == n2 ) {
6934 iLinkNode[ iSide ][ 1 ] = iNode;
6936 //else if ( notLinkNodes[ iSide ][ 0 ] )
6937 // notLinkNodes[ iSide ][ 1 ] = n;
6939 // notLinkNodes[ iSide ][ 0 ] = n;
6943 notLinkNodes1[nbl] = n;
6944 //notLinkNodes1.push_back(n);
6946 notLinkNodes2[nbl] = n;
6947 //notLinkNodes2.push_back(n);
6949 //faceNodes[ iSide ][ iNode++ ] = n;
6951 fnodes1[iNode++] = n;
6954 fnodes2[iNode++] = n;
6958 else { // f->IsQuadratic()
6959 const SMDS_QuadraticFaceOfNodes* F =
6960 static_cast<const SMDS_QuadraticFaceOfNodes*>(f);
6961 // use special nodes iterator
6962 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
6963 while ( anIter->more() ) {
6964 const SMDS_MeshNode* n =
6965 static_cast<const SMDS_MeshNode*>( anIter->next() );
6967 iLinkNode[ iSide ][ 0 ] = iNode;
6969 else if ( n == n2 ) {
6970 iLinkNode[ iSide ][ 1 ] = iNode;
6975 notLinkNodes1[nbl] = n;
6978 notLinkNodes2[nbl] = n;
6982 fnodes1[iNode++] = n;
6985 fnodes2[iNode++] = n;
6989 //faceNodes[ iSide ][ iNode ] = faceNodes[ iSide ][ 0 ];
6991 fnodes1[iNode] = fnodes1[0];
6994 fnodes2[iNode] = fnodes1[0];
7001 // check similarity of elements of the sides
7002 if (aResult == SEW_OK && ( face[0] && !face[1] ) || ( !face[0] && face[1] )) {
7003 MESSAGE("Correspondent face not found on side " << ( face[0] ? 1 : 0 ));
7004 if ( nReplaceMap.size() == 2 ) { // faces on input nodes not found
7005 aResult = ( face[0] ? SEW_BAD_SIDE2_NODES : SEW_BAD_SIDE1_NODES );
7008 aResult = SEW_TOPO_DIFF_SETS_OF_ELEMENTS;
7010 break; // do not return because it s necessary to remove tmp faces
7013 // set nodes to merge
7014 // -------------------
7016 if ( face[0] && face[1] ) {
7017 int nbNodes = face[0]->NbNodes();
7018 if ( nbNodes != face[1]->NbNodes() ) {
7019 MESSAGE("Diff nb of face nodes");
7020 aResult = SEW_TOPO_DIFF_SETS_OF_ELEMENTS;
7021 break; // do not return because it s necessary to remove tmp faces
7023 bool reverse[] = { false, false }; // order of notLinkNodes of quadrangle
7024 if ( nbNodes == 3 ) {
7025 //nReplaceMap.insert( TNodeNodeMap::value_type
7026 // ( notLinkNodes[0][0], notLinkNodes[1][0] ));
7027 nReplaceMap.insert( TNodeNodeMap::value_type
7028 ( notLinkNodes1[0], notLinkNodes2[0] ));
7031 for ( iSide = 0; iSide < 2; iSide++ ) { // loop on 2 sides
7032 // analyse link orientation in faces
7033 int i1 = iLinkNode[ iSide ][ 0 ];
7034 int i2 = iLinkNode[ iSide ][ 1 ];
7035 reverse[ iSide ] = Abs( i1 - i2 ) == 1 ? i1 > i2 : i2 > i1;
7036 // if notLinkNodes are the first and the last ones, then
7037 // their order does not correspond to the link orientation
7038 if (( i1 == 1 && i2 == 2 ) ||
7039 ( i1 == 2 && i2 == 1 ))
7040 reverse[ iSide ] = !reverse[ iSide ];
7042 if ( reverse[0] == reverse[1] ) {
7043 //nReplaceMap.insert( TNodeNodeMap::value_type
7044 // ( notLinkNodes[0][0], notLinkNodes[1][0] ));
7045 //nReplaceMap.insert( TNodeNodeMap::value_type
7046 // ( notLinkNodes[0][1], notLinkNodes[1][1] ));
7047 for(int nn=0; nn<nbNodes-2; nn++) {
7048 nReplaceMap.insert( TNodeNodeMap::value_type
7049 ( notLinkNodes1[nn], notLinkNodes2[nn] ));
7053 //nReplaceMap.insert( TNodeNodeMap::value_type
7054 // ( notLinkNodes[0][0], notLinkNodes[1][1] ));
7055 //nReplaceMap.insert( TNodeNodeMap::value_type
7056 // ( notLinkNodes[0][1], notLinkNodes[1][0] ));
7057 for(int nn=0; nn<nbNodes-2; nn++) {
7058 nReplaceMap.insert( TNodeNodeMap::value_type
7059 ( notLinkNodes1[nn], notLinkNodes2[nbNodes-3-nn] ));
7064 // add other links of the faces to linkList
7065 // -----------------------------------------
7067 //const SMDS_MeshNode** nodes = faceNodes[ 0 ];
7068 for ( iNode = 0; iNode < nbNodes; iNode++ ) {
7069 //linkID = aLinkID_Gen.GetLinkID( nodes[iNode], nodes[iNode+1] );
7070 linkID = aLinkID_Gen.GetLinkID( fnodes1[iNode], fnodes1[iNode+1] );
7071 pair< set<long>::iterator, bool > iter_isnew = linkIdSet.insert( linkID );
7072 if ( !iter_isnew.second ) { // already in a set: no need to process
7073 linkIdSet.erase( iter_isnew.first );
7075 else // new in set == encountered for the first time: add
7077 //const SMDS_MeshNode* n1 = nodes[ iNode ];
7078 //const SMDS_MeshNode* n2 = nodes[ iNode + 1];
7079 const SMDS_MeshNode* n1 = fnodes1[ iNode ];
7080 const SMDS_MeshNode* n2 = fnodes1[ iNode + 1];
7081 linkList[0].push_back ( NLink( n1, n2 ));
7082 linkList[1].push_back ( NLink( nReplaceMap[n1], nReplaceMap[n2] ));
7086 } // loop on link lists
7088 if ( aResult == SEW_OK &&
7089 ( linkIt[0] != linkList[0].end() ||
7090 !faceSetPtr[0]->empty() || !faceSetPtr[1]->empty() )) {
7091 MESSAGE( (linkIt[0] != linkList[0].end()) <<" "<< (faceSetPtr[0]->empty()) <<
7092 " " << (faceSetPtr[1]->empty()));
7093 aResult = SEW_TOPO_DIFF_SETS_OF_ELEMENTS;
7096 // ====================================================================
7097 // 3. Replace nodes in elements of the side 1 and remove replaced nodes
7098 // ====================================================================
7100 // delete temporary faces: they are in reverseElements of actual nodes
7101 SMDS_FaceIteratorPtr tmpFaceIt = aTmpFacesMesh.facesIterator();
7102 while ( tmpFaceIt->more() )
7103 aTmpFacesMesh.RemoveElement( tmpFaceIt->next() );
7105 if ( aResult != SEW_OK)
7108 list< int > nodeIDsToRemove/*, elemIDsToRemove*/;
7109 // loop on nodes replacement map
7110 TNodeNodeMap::iterator nReplaceMapIt = nReplaceMap.begin(), nnIt;
7111 for ( ; nReplaceMapIt != nReplaceMap.end(); nReplaceMapIt++ )
7112 if ( (*nReplaceMapIt).first != (*nReplaceMapIt).second ) {
7113 const SMDS_MeshNode* nToRemove = (*nReplaceMapIt).first;
7114 nodeIDsToRemove.push_back( nToRemove->GetID() );
7115 // loop on elements sharing nToRemove
7116 SMDS_ElemIteratorPtr invElemIt = nToRemove->GetInverseElementIterator();
7117 while ( invElemIt->more() ) {
7118 const SMDS_MeshElement* e = invElemIt->next();
7119 // get a new suite of nodes: make replacement
7120 int nbReplaced = 0, i = 0, nbNodes = e->NbNodes();
7121 vector< const SMDS_MeshNode*> nodes( nbNodes );
7122 SMDS_ElemIteratorPtr nIt = e->nodesIterator();
7123 while ( nIt->more() ) {
7124 const SMDS_MeshNode* n =
7125 static_cast<const SMDS_MeshNode*>( nIt->next() );
7126 nnIt = nReplaceMap.find( n );
7127 if ( nnIt != nReplaceMap.end() ) {
7133 // if ( nbReplaced == nbNodes && e->GetType() == SMDSAbs_Face )
7134 // elemIDsToRemove.push_back( e->GetID() );
7137 aMesh->ChangeElementNodes( e, & nodes[0], nbNodes );
7141 Remove( nodeIDsToRemove, true );
7146 //================================================================================
7148 * \brief Find corresponding nodes in two sets of faces
7149 * \param theSide1 - first face set
7150 * \param theSide2 - second first face
7151 * \param theFirstNode1 - a boundary node of set 1
7152 * \param theFirstNode2 - a node of set 2 corresponding to theFirstNode1
7153 * \param theSecondNode1 - a boundary node of set 1 linked with theFirstNode1
7154 * \param theSecondNode2 - a node of set 2 corresponding to theSecondNode1
7155 * \param nReplaceMap - output map of corresponding nodes
7156 * \retval bool - is a success or not
7158 //================================================================================
7160 //#define DEBUG_MATCHING_NODES
7162 SMESH_MeshEditor::Sew_Error
7163 SMESH_MeshEditor::FindMatchingNodes(set<const SMDS_MeshElement*>& theSide1,
7164 set<const SMDS_MeshElement*>& theSide2,
7165 const SMDS_MeshNode* theFirstNode1,
7166 const SMDS_MeshNode* theFirstNode2,
7167 const SMDS_MeshNode* theSecondNode1,
7168 const SMDS_MeshNode* theSecondNode2,
7169 TNodeNodeMap & nReplaceMap)
7171 set<const SMDS_MeshElement*> * faceSetPtr[] = { &theSide1, &theSide2 };
7173 nReplaceMap.clear();
7174 if ( theFirstNode1 != theFirstNode2 )
7175 nReplaceMap.insert( make_pair( theFirstNode1, theFirstNode2 ));
7176 if ( theSecondNode1 != theSecondNode2 )
7177 nReplaceMap.insert( make_pair( theSecondNode1, theSecondNode2 ));
7179 set< TLink > linkSet; // set of nodes where order of nodes is ignored
7180 linkSet.insert( TLink( theFirstNode1, theSecondNode1 ));
7182 list< NLink > linkList[2];
7183 linkList[0].push_back( NLink( theFirstNode1, theSecondNode1 ));
7184 linkList[1].push_back( NLink( theFirstNode2, theSecondNode2 ));
7186 // loop on links in linkList; find faces by links and append links
7187 // of the found faces to linkList
7188 list< NLink >::iterator linkIt[] = { linkList[0].begin(), linkList[1].begin() } ;
7189 for ( ; linkIt[0] != linkList[0].end(); linkIt[0]++, linkIt[1]++ ) {
7190 NLink link[] = { *linkIt[0], *linkIt[1] };
7191 if ( linkSet.find( link[0] ) == linkSet.end() )
7194 // by links, find faces in the face sets,
7195 // and find indices of link nodes in the found faces;
7196 // in a face set, there is only one or no face sharing a link
7197 // ---------------------------------------------------------------
7199 const SMDS_MeshElement* face[] = { 0, 0 };
7200 list<const SMDS_MeshNode*> notLinkNodes[2];
7201 //bool reverse[] = { false, false }; // order of notLinkNodes
7203 for ( int iSide = 0; iSide < 2; iSide++ ) // loop on 2 sides
7205 const SMDS_MeshNode* n1 = link[iSide].first;
7206 const SMDS_MeshNode* n2 = link[iSide].second;
7207 set<const SMDS_MeshElement*> * faceSet = faceSetPtr[ iSide ];
7208 set< const SMDS_MeshElement* > facesOfNode1;
7209 for ( int iNode = 0; iNode < 2; iNode++ ) // loop on 2 nodes of a link
7211 // during a loop of the first node, we find all faces around n1,
7212 // during a loop of the second node, we find one face sharing both n1 and n2
7213 const SMDS_MeshNode* n = iNode ? n1 : n2; // a node of a link
7214 SMDS_ElemIteratorPtr fIt = n->GetInverseElementIterator(SMDSAbs_Face);
7215 while ( fIt->more() ) { // loop on faces sharing a node
7216 const SMDS_MeshElement* f = fIt->next();
7217 if (faceSet->find( f ) != faceSet->end() && // f is in face set
7218 ! facesOfNode1.insert( f ).second ) // f encounters twice
7220 if ( face[ iSide ] ) {
7221 MESSAGE( "2 faces per link " );
7222 return ( iSide ? SEW_BAD_SIDE2_NODES : SEW_BAD_SIDE1_NODES );
7225 faceSet->erase( f );
7227 // get not link nodes
7228 int nbN = f->NbNodes();
7229 if ( f->IsQuadratic() )
7231 nbNodes[ iSide ] = nbN;
7232 list< const SMDS_MeshNode* > & nodes = notLinkNodes[ iSide ];
7233 int i1 = f->GetNodeIndex( n1 );
7234 int i2 = f->GetNodeIndex( n2 );
7235 int iEnd = nbN, iBeg = -1, iDelta = 1;
7236 bool reverse = ( Abs( i1 - i2 ) == 1 ? i1 > i2 : i2 > i1 );
7238 std::swap( iEnd, iBeg ); iDelta = -1;
7243 if ( i == iEnd ) i = iBeg + iDelta;
7244 if ( i == i1 ) break;
7245 nodes.push_back ( f->GetNode( i ) );
7251 // check similarity of elements of the sides
7252 if (( face[0] && !face[1] ) || ( !face[0] && face[1] )) {
7253 MESSAGE("Correspondent face not found on side " << ( face[0] ? 1 : 0 ));
7254 if ( nReplaceMap.size() == 2 ) { // faces on input nodes not found
7255 return ( face[0] ? SEW_BAD_SIDE2_NODES : SEW_BAD_SIDE1_NODES );
7258 return SEW_TOPO_DIFF_SETS_OF_ELEMENTS;
7262 // set nodes to merge
7263 // -------------------
7265 if ( face[0] && face[1] ) {
7266 if ( nbNodes[0] != nbNodes[1] ) {
7267 MESSAGE("Diff nb of face nodes");
7268 return SEW_TOPO_DIFF_SETS_OF_ELEMENTS;
7270 #ifdef DEBUG_MATCHING_NODES
7271 cout << " Link 1: " << link[0].first->GetID() <<" "<< link[0].second->GetID()
7272 << " F 1: " << face[0];
7273 cout << "| Link 2: " << link[1].first->GetID() <<" "<< link[1].second->GetID()
7274 << " F 2: " << face[1] << " | Bind: "<<endl ;
7276 int nbN = nbNodes[0];
7278 list<const SMDS_MeshNode*>::iterator n1 = notLinkNodes[0].begin();
7279 list<const SMDS_MeshNode*>::iterator n2 = notLinkNodes[1].begin();
7280 for ( int i = 0 ; i < nbN - 2; ++i ) {
7281 #ifdef DEBUG_MATCHING_NODES
7282 cout << (*n1)->GetID() << " to " << (*n2)->GetID() << endl;
7284 nReplaceMap.insert( make_pair( *(n1++), *(n2++) ));
7288 // add other links of the face 1 to linkList
7289 // -----------------------------------------
7291 const SMDS_MeshElement* f0 = face[0];
7292 const SMDS_MeshNode* n1 = f0->GetNode( nbN - 1 );
7293 for ( int i = 0; i < nbN; i++ )
7295 const SMDS_MeshNode* n2 = f0->GetNode( i );
7296 pair< set< TLink >::iterator, bool > iter_isnew =
7297 linkSet.insert( TLink( n1, n2 ));
7298 if ( !iter_isnew.second ) { // already in a set: no need to process
7299 linkSet.erase( iter_isnew.first );
7301 else // new in set == encountered for the first time: add
7303 #ifdef DEBUG_MATCHING_NODES
7304 cout << "Add link 1: " << n1->GetID() << " " << n2->GetID() << " ";
7305 cout << " | link 2: " << nReplaceMap[n1]->GetID() << " " << nReplaceMap[n2]->GetID() << " " << endl;
7307 linkList[0].push_back ( NLink( n1, n2 ));
7308 linkList[1].push_back ( NLink( nReplaceMap[n1], nReplaceMap[n2] ));
7313 } // loop on link lists