1 // SMESH SMESH : idl implementation based on 'SMESH' unit's calsses
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 : StdMeshers_ProjectionUtils.cxx
25 // Created : Fri Oct 27 10:24:28 2006
26 // Author : Edward AGAPOV (eap)
29 #include "StdMeshers_ProjectionUtils.hxx"
31 #include "StdMeshers_ProjectionSource1D.hxx"
32 #include "StdMeshers_ProjectionSource2D.hxx"
33 #include "StdMeshers_ProjectionSource3D.hxx"
35 #include "SMESH_Algo.hxx"
36 #include "SMESH_Block.hxx"
37 #include "SMESH_Gen.hxx"
38 #include "SMESH_Hypothesis.hxx"
39 #include "SMESH_IndexedDataMapOfShapeIndexedMapOfShape.hxx"
40 #include "SMESH_Mesh.hxx"
41 #include "SMESH_MeshEditor.hxx"
42 #include "SMESH_subMesh.hxx"
43 #include "SMESH_subMeshEventListener.hxx"
44 #include "SMDS_EdgePosition.hxx"
46 #include "utilities.h"
48 #include <BRepAdaptor_Curve.hxx>
49 #include <BRepTools.hxx>
50 #include <BRepTools_WireExplorer.hxx>
51 #include <BRep_Tool.hxx>
52 #include <Bnd_Box.hxx>
54 #include <TopTools_Array1OfShape.hxx>
55 #include <TopTools_DataMapOfShapeShape.hxx>
56 #include <TopTools_ListIteratorOfListOfShape.hxx>
57 #include <TopTools_ListOfShape.hxx>
58 #include <TopTools_MapOfShape.hxx>
59 #include <TopoDS_Shape.hxx>
62 #include <gp_Trsf.hxx>
66 #define RETURN_BAD_RESULT(msg) { MESSAGE(msg); return false; }
67 #define SHOW_VERTEX(v,msg) // { \
68 // if ( v.IsNull() ) cout << msg << " NULL SHAPE" << endl; \
69 // else if (v.ShapeType() == TopAbs_VERTEX) {\
70 // gp_Pnt p = BRep_Tool::Pnt( TopoDS::Vertex( v ));\
71 // cout << msg << (v).TShape().operator->()<<" ( " <<p.X()<<", "<<p.Y()<<", "<<p.Z()<<" )"<<endl;}\
73 // cout << msg << " "; TopAbs::Print(v.ShapeType(),cout) <<" "<<(v).TShape().operator->()<<endl;}\
75 #define SHOW_LIST(msg,l) \
77 // cout << msg << " ";\
78 // list< TopoDS_Edge >::const_iterator e = l.begin();\
79 // for ( int i = 0; e != l.end(); ++e, ++i ) {\
80 // cout << i << "V (" << TopExp::FirstVertex( *e, true ).TShape().operator->() << ") "\
81 // << i << "E (" << e->TShape().operator->() << "); "; }\
86 //================================================================================
88 * \brief Reverse order of edges in a list and their orientation
89 * \param edges - list of edges to reverse
90 * \param nbEdges - number of edges to reverse
92 //================================================================================
94 void Reverse( list< TopoDS_Edge > & edges, const int nbEdges )
96 SHOW_LIST("BEFORE REVERSE", edges);
98 list< TopoDS_Edge >::iterator eIt = edges.begin();
99 if ( edges.size() == nbEdges )
103 else // reverse only the given nb of edges
105 // look for the last edge to be reversed
106 list< TopoDS_Edge >::iterator eBackIt = edges.begin();
107 for ( int i = 1; i < nbEdges; ++i )
110 while ( eIt != eBackIt ) {
111 std::swap( *eIt, *eBackIt );
112 SHOW_LIST("# AFTER SWAP", edges)
113 if ( (++eIt) != eBackIt )
117 for ( eIt = edges.begin(); eIt != edges.end(); ++eIt )
119 SHOW_LIST("ATFER REVERSE", edges)
122 //================================================================================
124 * \brief Check if propagation is possible
125 * \param theMesh1 - source mesh
126 * \param theMesh2 - target mesh
127 * \retval bool - true if possible
129 //================================================================================
131 bool IsPropagationPossible( SMESH_Mesh* theMesh1, SMESH_Mesh* theMesh2 )
133 if ( theMesh1 != theMesh2 ) {
134 TopoDS_Shape mainShape1 = theMesh1->GetMeshDS()->ShapeToMesh();
135 TopoDS_Shape mainShape2 = theMesh2->GetMeshDS()->ShapeToMesh();
136 return mainShape1.IsSame( mainShape2 );
141 //================================================================================
143 * \brief Fix up association of edges in faces by possible propagation
144 * \param nbEdges - nb of edges in an outer wire
145 * \param edges1 - edges of one face
146 * \param edges2 - matching edges of another face
147 * \param theMesh1 - mesh 1
148 * \param theMesh2 - mesh 2
149 * \retval bool - true if association was fixed
151 //================================================================================
153 bool FixAssocByPropagation( const int nbEdges,
154 list< TopoDS_Edge > & edges1,
155 list< TopoDS_Edge > & edges2,
156 SMESH_Mesh* theMesh1,
157 SMESH_Mesh* theMesh2)
159 if ( nbEdges == 2 && IsPropagationPossible( theMesh1, theMesh2 ) )
161 list< TopoDS_Edge >::iterator eIt2 = ++edges2.begin(); // 2nd edge of the 2nd face
163 StdMeshers_ProjectionUtils::GetPropagationEdge( theMesh1, *eIt2, edges1.front() ).second;
164 if ( !edge2.IsNull() ) { // propagation found for the second edge
165 Reverse( edges2, nbEdges );
173 //=======================================================================
175 * \brief Looks for association of all subshapes of two shapes
176 * \param theShape1 - shape 1
177 * \param theMesh1 - mesh built on shape 1
178 * \param theShape2 - shape 2
179 * \param theMesh2 - mesh built on shape 2
180 * \param theAssociation - association map to be filled that may
181 * contain association of one or two pairs of vertices
182 * \retval bool - true if association found
184 //=======================================================================
186 bool StdMeshers_ProjectionUtils::FindSubShapeAssociation(const TopoDS_Shape& theShape1,
187 SMESH_Mesh* theMesh1,
188 const TopoDS_Shape& theShape2,
189 SMESH_Mesh* theMesh2,
190 TShapeShapeMap & theMap)
192 if ( theShape1.ShapeType() != theShape2.ShapeType() )
193 RETURN_BAD_RESULT("Different shape types");
195 bool bidirect = ( !theShape1.IsSame( theShape2 ));
196 if ( !theMap.IsEmpty())
198 switch ( theShape1.ShapeType() ) {
201 // ----------------------------------------------------------------------
202 if ( theMap.Extent() != 2 )
203 RETURN_BAD_RESULT("Wrong map extent " << theMap.Extent() );
204 TopoDS_Edge edge1 = TopoDS::Edge( theShape1 );
205 TopoDS_Edge edge2 = TopoDS::Edge( theShape2 );
206 TopoDS_Vertex VV1[2], VV2[2];
207 TopExp::Vertices( edge1, VV1[0], VV1[1] );
208 TopExp::Vertices( edge2, VV2[0], VV2[1] );
210 if ( theMap.IsBound( VV1[ i1 ] )) i1 = 1;
211 if ( theMap.IsBound( VV2[ i2 ] )) i2 = 1;
212 InsertAssociation( VV1[ i1 ], VV2[ i2 ], theMap, bidirect);
217 // ----------------------------------------------------------------------
218 TopoDS_Face face1 = TopoDS::Face( theShape1 );
219 TopoDS_Face face2 = TopoDS::Face( theShape2 );
221 TopoDS_Vertex VV1[2], VV2[2];
222 // find a not closed edge of face1 both vertices of which are associated
224 TopExp_Explorer exp ( face1, TopAbs_EDGE );
225 for ( ; VV2[ 1 ].IsNull() && exp.More(); exp.Next(), ++nbEdges ) {
226 TopExp::Vertices( TopoDS::Edge( exp.Current() ), VV1[0], VV1[1] );
227 if ( theMap.IsBound( VV1[0] ) ) {
228 VV2[ 0 ] = TopoDS::Vertex( theMap( VV1[0] ));
229 if ( theMap.IsBound( VV1[1] ) && !VV1[0].IsSame( VV1[1] ))
230 VV2[ 1 ] = TopoDS::Vertex( theMap( VV1[1] ));
233 if ( VV2[ 1 ].IsNull() ) { // 2 bound vertices not found
235 RETURN_BAD_RESULT("2 bound vertices not found" );
240 list< TopoDS_Edge > edges1, edges2;
241 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
242 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
243 FixAssocByPropagation( nbE, edges1, edges2, theMesh1, theMesh2 );
245 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
246 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
247 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
249 InsertAssociation( *eIt1, *eIt2, theMap, bidirect);
250 VV1[0] = TopExp::FirstVertex( *eIt1, true );
251 VV2[0] = TopExp::FirstVertex( *eIt2, true );
252 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
259 // ----------------------------------------------------------------------
260 TopoDS_Vertex VV1[2], VV2[2];
261 // find a not closed edge of shape1 both vertices of which are associated
263 TopExp_Explorer exp ( theShape1, TopAbs_EDGE );
264 for ( ; VV2[ 1 ].IsNull() && exp.More(); exp.Next() ) {
265 edge1 = TopoDS::Edge( exp.Current() );
266 TopExp::Vertices( edge1 , VV1[0], VV1[1] );
267 if ( theMap.IsBound( VV1[0] )) {
268 VV2[ 0 ] = TopoDS::Vertex( theMap( VV1[0] ));
269 if ( theMap.IsBound( VV1[1] ) && !VV1[0].IsSame( VV1[1] ))
270 VV2[ 1 ] = TopoDS::Vertex( theMap( VV1[1] ));
273 if ( VV2[ 1 ].IsNull() ) // 2 bound vertices not found
274 RETURN_BAD_RESULT("2 bound vertices not found" );
275 TopoDS_Edge edge2 = GetEdgeByVertices( theMesh2, VV2[ 0 ], VV2[ 1 ]);
276 if ( edge2.IsNull() )
277 RETURN_BAD_RESULT("GetEdgeByVertices() failed");
279 // get a face sharing edge1
280 TopoDS_Shape F1, F2, FF2[2];
281 TopTools_ListIteratorOfListOfShape ancestIt = theMesh1->GetAncestors( edge1 );
282 for ( ; F1.IsNull() && ancestIt.More(); ancestIt.Next() )
283 if ( ancestIt.Value().ShapeType() == TopAbs_FACE )
284 F1 = ancestIt.Value().Oriented( TopAbs_FORWARD );
286 RETURN_BAD_RESULT(" Face1 not found");
288 // get 2 faces sharing edge2
289 ancestIt = theMesh2->GetAncestors( edge2 );
290 for ( int i = 0; FF2[1].IsNull() && ancestIt.More(); ancestIt.Next() )
291 if ( ancestIt.Value().ShapeType() == TopAbs_FACE )
292 FF2[ i++ ] = ancestIt.Value().Oriented( TopAbs_FORWARD );
293 if ( FF2[1].IsNull() )
294 RETURN_BAD_RESULT("2 faces not found");
296 // get oriented edge1 and edge2 from F1 and FF2[0]
297 for ( exp.Init( F1, TopAbs_EDGE ); exp.More(); exp.Next() )
298 if ( edge1.IsSame( exp.Current() )) {
299 edge1 = TopoDS::Edge( exp.Current() );
303 for ( exp.Init( FF2[ 0 ], TopAbs_EDGE ); exp.More(); exp.Next() )
304 if ( edge2.IsSame( exp.Current() )) {
305 edge2 = TopoDS::Edge( exp.Current() );
309 // compare first vertices of edge1 and edge2
310 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
311 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
313 if ( !VV1[ 0 ].IsSame( theMap( VV2[ 0 ]))) {
318 TopTools_MapOfShape boundEdges;
320 // association of face subshapes and neighbour faces
321 list< pair < TopoDS_Face, TopoDS_Edge > > FE1, FE2;
322 list< pair < TopoDS_Face, TopoDS_Edge > >::iterator fe1, fe2;
323 FE1.push_back( make_pair( TopoDS::Face( F1 ), edge1 ));
324 FE2.push_back( make_pair( TopoDS::Face( F2 ), edge2 ));
325 for ( fe1 = FE1.begin(), fe2 = FE2.begin(); fe1 != FE1.end(); ++fe1, ++fe2 )
327 const TopoDS_Face& face1 = fe1->first;
328 if ( theMap.IsBound( face1 ) ) continue;
329 const TopoDS_Face& face2 = fe2->first;
332 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
333 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
334 list< TopoDS_Edge > edges1, edges2;
335 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
336 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
337 InsertAssociation( face1, face2, theMap, bidirect); // assoc faces
338 MESSAGE("Assoc FACE " << theMesh1->GetMeshDS()->ShapeToIndex( face1 )<<
339 " to " << theMesh2->GetMeshDS()->ShapeToIndex( face2 ));
340 if ( nbE == 2 && (edge1.IsSame( edges1.front())) != (edge2.IsSame( edges2.front())))
342 Reverse( edges2, nbE );
344 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
345 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
346 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
348 if ( !boundEdges.Add( *eIt1 )) continue; // already associated
349 InsertAssociation( *eIt1, *eIt2, theMap, bidirect); // assoc edges
350 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( *eIt1 )<<
351 " to " << theMesh2->GetMeshDS()->ShapeToIndex( *eIt2 ));
352 VV1[0] = TopExp::FirstVertex( *eIt1, true );
353 VV2[0] = TopExp::FirstVertex( *eIt2, true );
354 InsertAssociation( VV1[0], VV2[0], theMap, bidirect); // assoc vertices
356 // add adjacent faces to process
357 TopoDS_Face nextFace1 = GetNextFace( theMesh1, *eIt1, face1 );
358 TopoDS_Face nextFace2 = GetNextFace( theMesh2, *eIt2, face2 );
359 if ( !nextFace1.IsNull() && !nextFace2.IsNull() ) {
360 FE1.push_back( make_pair( nextFace1, *eIt1 ));
361 FE2.push_back( make_pair( nextFace2, *eIt2 ));
368 RETURN_BAD_RESULT("Unexpected shape type");
370 } // end switch by shape type
371 } // end case of available initial vertex association
373 //----------------------------------------------------------------------
374 // NO INITIAL VERTEX ASSOCIATION
375 //----------------------------------------------------------------------
377 switch ( theShape1.ShapeType() ) {
380 // ----------------------------------------------------------------------
381 TopoDS_Edge edge1 = TopoDS::Edge( theShape1 );
382 TopoDS_Edge edge2 = TopoDS::Edge( theShape2 );
383 if ( IsPropagationPossible( theMesh1, theMesh2 ))
385 TopoDS_Edge prpEdge = GetPropagationEdge( theMesh1, edge2, edge1 ).second;
386 if ( !prpEdge.IsNull() )
388 TopoDS_Vertex VV1[2], VV2[2];
389 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
390 TopExp::Vertices( prpEdge, VV2[0], VV2[1], true );
391 InsertAssociation( VV1[ 0 ], VV2[ 0 ], theMap, bidirect);
392 InsertAssociation( VV1[ 1 ], VV2[ 1 ], theMap, bidirect);
393 if ( VV1[0].IsSame( VV1[1] ) || // one of edges is closed
394 VV2[0].IsSame( VV2[1] ) )
396 InsertAssociation( edge1, prpEdge, theMap, bidirect); // insert with a proper orientation
401 if ( IsClosedEdge( edge1 ) && IsClosedEdge( edge2 ))
403 // TODO: find out a proper orientation (is it possible?)
404 InsertAssociation( edge1, edge2, theMap, bidirect); // insert with a proper orientation
405 InsertAssociation( TopExp::FirstVertex(edge1), TopExp::FirstVertex(edge2),
409 break; // try by vertex closeness
413 // ----------------------------------------------------------------------
414 if ( IsPropagationPossible( theMesh1, theMesh2 )) // try by propagation in one mesh
416 TopoDS_Face face1 = TopoDS::Face(theShape1);
417 TopoDS_Face face2 = TopoDS::Face(theShape2);
418 TopoDS_Edge edge1, edge2;
419 // get outer edge of theShape1
420 edge1 = TopoDS::Edge( OuterShape( face1, TopAbs_EDGE ));
421 // find out if any edge of face2 is a propagation edge of outer edge1
422 map<int,TopoDS_Edge> propag_edges; // use map to find the closest propagation edge
423 for ( TopExp_Explorer exp( face2, TopAbs_EDGE ); exp.More(); exp.Next() ) {
424 edge2 = TopoDS::Edge( exp.Current() );
425 pair<int,TopoDS_Edge> step_edge = GetPropagationEdge( theMesh1, edge2, edge1 );
426 if ( !step_edge.second.IsNull() ) { // propagation found
427 propag_edges.insert( step_edge );
430 if ( !propag_edges.empty() ) // propagation found
432 edge2 = propag_edges.begin()->second;
433 TopoDS_Vertex VV1[2], VV2[2];
434 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
435 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
436 list< TopoDS_Edge > edges1, edges2;
437 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
438 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
439 if ( nbE == 2 ) // only 2 edges
441 // take care of proper association of propagated edges
442 bool same1 = edge1.IsSame( edges1.front() );
443 bool same2 = edge2.IsSame( edges2.front() );
444 if ( same1 != same2 )
445 Reverse(edges2, nbE);
448 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
449 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
450 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
452 InsertAssociation( *eIt1, *eIt2, theMap, bidirect);
453 VV1[0] = TopExp::FirstVertex( *eIt1, true );
454 VV2[0] = TopExp::FirstVertex( *eIt2, true );
455 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
460 break; // try by vertex closeness
465 // Find association by closeness of vertices
466 // ------------------------------------------
468 TopTools_IndexedMapOfShape vMap1, vMap2;
469 TopExp::MapShapes( theShape1, TopAbs_VERTEX, vMap1 );
470 TopExp::MapShapes( theShape2, TopAbs_VERTEX, vMap2 );
472 if ( vMap1.Extent() != vMap2.Extent() )
473 RETURN_BAD_RESULT("Different nb of vertices");
475 if ( vMap1.Extent() == 1 ) {
476 InsertAssociation( vMap1(1), vMap2(1), theMap, bidirect);
477 if ( theShape1.ShapeType() == TopAbs_EDGE )
479 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap);
482 // Find transformation to make the shapes be of similar size at same location
485 for ( int i = 1; i <= vMap1.Extent(); ++i ) {
486 box[ 0 ].Add( BRep_Tool::Pnt ( TopoDS::Vertex( vMap1( i ))));
487 box[ 1 ].Add( BRep_Tool::Pnt ( TopoDS::Vertex( vMap2( i ))));
490 gp_Pnt gc[2]; // box center
491 double x0,y0,z0, x1,y1,z1;
492 box[0].Get( x0,y0,z0, x1,y1,z1 );
493 gc[0] = 0.5 * ( gp_XYZ( x0,y0,z0 ) + gp_XYZ( x1,y1,z1 ));
494 box[1].Get( x0,y0,z0, x1,y1,z1 );
495 gc[1] = 0.5 * ( gp_XYZ( x0,y0,z0 ) + gp_XYZ( x1,y1,z1 ));
498 gp_Vec vec01( gc[0], gc[1] );
499 double scale = sqrt( box[1].SquareExtent() / box[0].SquareExtent() );
501 // Find 2 closest vertices
503 TopoDS_Vertex VV1[2], VV2[2];
504 // get 2 linked vertices of shape 1 not belonging to an inner wire of a face
505 TopoDS_Shape edge = theShape1;
506 TopExp_Explorer expF( theShape1, TopAbs_FACE ), expE;
507 for ( ; expF.More(); expF.Next() ) {
509 TopoDS_Shape wire = OuterShape( TopoDS::Face( expF.Current() ), TopAbs_WIRE );
510 for ( expE.Init( wire, TopAbs_EDGE ); edge.IsNull() && expE.More(); expE.Next() )
511 if ( !IsClosedEdge( TopoDS::Edge( expE.Current() )))
512 edge = expE.Current();
513 if ( !edge.IsNull() )
516 if ( edge.IsNull() || edge.ShapeType() != TopAbs_EDGE )
517 RETURN_BAD_RESULT("Edge not found");
519 TopExp::Vertices( TopoDS::Edge( edge ), VV1[0], VV1[1]);
520 if ( VV1[0].IsSame( VV1[1] ))
521 RETURN_BAD_RESULT("Only closed edges");
523 // find vertices closest to 2 linked vertices of shape 1
524 for ( int i1 = 0; i1 < 2; ++i1 )
526 double dist2 = DBL_MAX;
527 gp_Pnt p1 = BRep_Tool::Pnt( VV1[ i1 ]);
528 p1.Translate( vec01 );
529 p1.Scale( gc[1], scale );
530 for ( int i2 = 1; i2 <= vMap2.Extent(); ++i2 )
532 TopoDS_Vertex V2 = TopoDS::Vertex( vMap2( i2 ));
533 gp_Pnt p2 = BRep_Tool::Pnt ( V2 );
534 double d2 = p1.SquareDistance( p2 );
535 if ( d2 < dist2 && !V2.IsSame( VV2[ 0 ])) {
536 VV2[ i1 ] = V2; dist2 = d2;
541 InsertAssociation( VV1[ 0 ], VV2 [ 0 ], theMap, bidirect);
542 InsertAssociation( VV1[ 1 ], VV2 [ 1 ], theMap, bidirect);
543 if ( theShape1.ShapeType() == TopAbs_EDGE )
546 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap );
549 //================================================================================
551 * \brief Find association of edges of faces
552 * \param face1 - face 1
553 * \param VV1 - vertices of face 1
554 * \param face2 - face 2
555 * \param VV2 - vertices of face 2 associated with oned of face 1
556 * \param edges1 - out list of edges of face 1
557 * \param edges2 - out list of edges of face 2
558 * \retval int - nb of edges in an outer wire in a success case, else zero
560 //================================================================================
562 int StdMeshers_ProjectionUtils::FindFaceAssociation(const TopoDS_Face& face1,
563 TopoDS_Vertex VV1[2],
564 const TopoDS_Face& face2,
565 TopoDS_Vertex VV2[2],
566 list< TopoDS_Edge > & edges1,
567 list< TopoDS_Edge > & edges2)
572 list< int > nbVInW1, nbVInW2;
573 if ( SMESH_Block::GetOrderedEdges( face1, VV1[0], edges1, nbVInW1) !=
574 SMESH_Block::GetOrderedEdges( face2, VV2[0], edges2, nbVInW2) )
575 RETURN_BAD_RESULT("Different number of wires in faces ");
577 if ( nbVInW1.front() != nbVInW2.front() )
578 RETURN_BAD_RESULT("Different number of edges in faces: " <<
579 nbVInW1.front() << " != " << nbVInW2.front());
581 // Define if we need to reverse one of wires to make edges in lists match each other
583 bool reverse = false;
585 list< TopoDS_Edge >::iterator eBackIt;
586 if ( !VV1[1].IsSame( TopExp::LastVertex( edges1.front(), true ))) {
588 eBackIt = --edges1.end();
589 // check if the second vertex belongs to the first or last edge in the wire
590 if ( !VV1[1].IsSame( TopExp::FirstVertex( *eBackIt, true ))) {
591 bool KO = true; // belongs to none
592 if ( nbVInW1.size() > 1 ) { // several wires
593 eBackIt = edges1.begin();
594 for ( int i = 1; i < nbVInW1.front(); ++i ) ++eBackIt;
595 KO = !VV1[1].IsSame( TopExp::FirstVertex( *eBackIt, true ));
598 RETURN_BAD_RESULT("GetOrderedEdges() failed");
601 eBackIt = --edges2.end();
602 if ( !VV2[1].IsSame( TopExp::LastVertex( edges2.front(), true ))) {
604 // check if the second vertex belongs to the first or last edge in the wire
605 if ( !VV2[1].IsSame( TopExp::FirstVertex( *eBackIt, true ))) {
606 bool KO = true; // belongs to none
607 if ( nbVInW2.size() > 1 ) { // several wires
608 eBackIt = edges2.begin();
609 for ( int i = 1; i < nbVInW2.front(); ++i ) ++eBackIt;
610 KO = !VV2[1].IsSame( TopExp::FirstVertex( *eBackIt, true ));
613 RETURN_BAD_RESULT("GetOrderedEdges() failed");
618 Reverse( edges2 , nbVInW2.front());
619 if (( VV1[1].IsSame( TopExp::LastVertex( edges1.front(), true ))) !=
620 ( VV2[1].IsSame( TopExp::LastVertex( edges2.front(), true ))))
621 RETURN_BAD_RESULT("GetOrderedEdges() failed");
623 return nbVInW2.front();
626 //=======================================================================
627 //function : InitVertexAssociation
629 //=======================================================================
631 void StdMeshers_ProjectionUtils::InitVertexAssociation( const SMESH_Hypothesis* theHyp,
632 TShapeShapeMap & theAssociationMap)
634 string hypName = theHyp->GetName();
635 if ( hypName == "ProjectionSource1D" ) {
636 const StdMeshers_ProjectionSource1D * hyp =
637 static_cast<const StdMeshers_ProjectionSource1D*>( theHyp );
638 if ( hyp->HasVertexAssociation() ) {
639 InsertAssociation( hyp->GetSourceVertex(),hyp->GetTargetVertex(),theAssociationMap);
642 else if ( hypName == "ProjectionSource2D" ) {
643 const StdMeshers_ProjectionSource2D * hyp =
644 static_cast<const StdMeshers_ProjectionSource2D*>( theHyp );
645 if ( hyp->HasVertexAssociation() ) {
646 InsertAssociation( hyp->GetSourceVertex(1),hyp->GetTargetVertex(1),theAssociationMap);
647 InsertAssociation( hyp->GetSourceVertex(2),hyp->GetTargetVertex(2),theAssociationMap);
650 else if ( hypName == "ProjectionSource3D" ) {
651 const StdMeshers_ProjectionSource3D * hyp =
652 static_cast<const StdMeshers_ProjectionSource3D*>( theHyp );
653 if ( hyp->HasVertexAssociation() ) {
654 InsertAssociation( hyp->GetSourceVertex(1),hyp->GetTargetVertex(1),theAssociationMap);
655 InsertAssociation( hyp->GetSourceVertex(2),hyp->GetTargetVertex(2),theAssociationMap);
660 //=======================================================================
662 * \brief Inserts association theShape1 <-> theShape2 to TShapeShapeMap
663 * \param theShape1 - shape 1
664 * \param theShape2 - shape 2
665 * \param theAssociationMap - association map
666 * \retval bool - true if there was no association for these shapes before
668 //=======================================================================
670 bool StdMeshers_ProjectionUtils::InsertAssociation( const TopoDS_Shape& theShape1,
671 const TopoDS_Shape& theShape2,
672 TShapeShapeMap & theAssociationMap,
673 const bool theBidirectional)
675 if ( !theShape1.IsNull() && !theShape2.IsNull() ) {
676 SHOW_VERTEX(theShape1,"Assoc ");
677 SHOW_VERTEX(theShape2," to ");
678 bool isNew = ( theAssociationMap.Bind( theShape1, theShape2 ));
679 if ( theBidirectional )
680 theAssociationMap.Bind( theShape2, theShape1 );
686 //=======================================================================
687 //function : IsSubShape
689 //=======================================================================
691 bool StdMeshers_ProjectionUtils::IsSubShape( const TopoDS_Shape& shape,
694 if ( shape.IsNull() || !aMesh )
696 return aMesh->GetMeshDS()->ShapeToIndex( shape );
699 //=======================================================================
700 //function : IsSubShape
702 //=======================================================================
704 bool StdMeshers_ProjectionUtils::IsSubShape( const TopoDS_Shape& shape,
705 const TopoDS_Shape& mainShape )
707 if ( !shape.IsNull() && !mainShape.IsNull() )
709 for ( TopExp_Explorer exp( mainShape, shape.ShapeType());
712 if ( shape.IsSame( exp.Current() ))
715 SCRUTE((shape.IsNull()));
716 SCRUTE((mainShape.IsNull()));
721 //=======================================================================
723 * \brief Finds an edge by its vertices in a main shape of the mesh
724 * \param aMesh - the mesh
725 * \param V1 - vertex 1
726 * \param V2 - vertex 2
727 * \retval TopoDS_Edge - found edge
729 //=======================================================================
731 TopoDS_Edge StdMeshers_ProjectionUtils::GetEdgeByVertices( SMESH_Mesh* theMesh,
732 const TopoDS_Vertex& theV1,
733 const TopoDS_Vertex& theV2)
735 if ( theMesh && !theV1.IsNull() && !theV2.IsNull() )
737 TopTools_ListIteratorOfListOfShape ancestorIt( theMesh->GetAncestors( theV1 ));
738 for ( ; ancestorIt.More(); ancestorIt.Next() )
739 if ( ancestorIt.Value().ShapeType() == TopAbs_EDGE )
740 for ( TopExp_Explorer expV ( ancestorIt.Value(), TopAbs_VERTEX );
743 if ( theV2.IsSame( expV.Current() ))
744 return TopoDS::Edge( ancestorIt.Value() );
746 return TopoDS_Edge();
749 //================================================================================
751 * \brief Return another face sharing an edge
752 * \param aMesh - mesh
755 * \retval TopoDS_Face - found face
757 //================================================================================
759 TopoDS_Face StdMeshers_ProjectionUtils::GetNextFace( SMESH_Mesh* mesh,
760 const TopoDS_Edge& edge,
761 const TopoDS_Face& face)
763 if ( mesh && !edge.IsNull() && !face.IsNull() )
765 TopTools_ListIteratorOfListOfShape ancestorIt( mesh->GetAncestors( edge ));
766 for ( ; ancestorIt.More(); ancestorIt.Next() )
767 if ( ancestorIt.Value().ShapeType() == TopAbs_FACE &&
768 !face.IsSame( ancestorIt.Value() ))
769 return TopoDS::Face( ancestorIt.Value() );
771 return TopoDS_Face();
775 //================================================================================
777 * \brief Return a propagation edge
778 * \param aMesh - mesh
779 * \param theEdge - edge to find by propagation
780 * \param fromEdge - start edge for propagation
781 * \retval pair<int,TopoDS_Edge> - propagation step and found edge
783 //================================================================================
785 pair<int,TopoDS_Edge>
786 StdMeshers_ProjectionUtils::GetPropagationEdge( SMESH_Mesh* aMesh,
787 const TopoDS_Edge& theEdge,
788 const TopoDS_Edge& fromEdge)
790 SMESH_IndexedMapOfShape aChain;
793 // List of edges, added to chain on the previous cycle pass
794 TopTools_ListOfShape listPrevEdges;
795 listPrevEdges.Append(fromEdge);
797 // Collect all edges pass by pass
798 while (listPrevEdges.Extent() > 0) {
800 // List of edges, added to chain on this cycle pass
801 TopTools_ListOfShape listCurEdges;
803 // Find the next portion of edges
804 TopTools_ListIteratorOfListOfShape itE (listPrevEdges);
805 for (; itE.More(); itE.Next()) {
806 TopoDS_Shape anE = itE.Value();
808 // Iterate on faces, having edge <anE>
809 TopTools_ListIteratorOfListOfShape itA (aMesh->GetAncestors(anE));
810 for (; itA.More(); itA.Next()) {
811 TopoDS_Shape aW = itA.Value();
813 // There are objects of different type among the ancestors of edge
814 if (aW.ShapeType() == TopAbs_WIRE) {
817 BRepTools_WireExplorer aWE (TopoDS::Wire(aW));
818 Standard_Integer nb = 1, found = 0;
819 TopTools_Array1OfShape anEdges (1,4);
820 for (; aWE.More(); aWE.Next(), nb++) {
825 anEdges(nb) = aWE.Current();
826 if (anEdges(nb).IsSame(anE)) found = nb;
829 if (nb == 5 && found > 0) {
830 // Quadrangle face found, get an opposite edge
831 Standard_Integer opp = found + 2;
832 if (opp > 4) opp -= 4;
833 anOppE = anEdges(opp);
835 // add anOppE to aChain if ...
836 if (!aChain.Contains(anOppE)) { // ... anOppE is not in aChain
837 // Add found edge to the chain oriented so that to
838 // have it co-directed with a forward MainEdge
839 TopAbs_Orientation ori = anE.Orientation();
840 if ( anEdges(opp).Orientation() == anEdges(found).Orientation() )
841 ori = TopAbs::Reverse( ori );
842 anOppE.Orientation( ori );
843 if ( anOppE.IsSame( theEdge ))
844 return make_pair( step, TopoDS::Edge( anOppE ));
846 listCurEdges.Append(anOppE);
848 } // if (nb == 5 && found > 0)
849 } // if (aF.ShapeType() == TopAbs_WIRE)
850 } // for (; itF.More(); itF.Next())
851 } // for (; itE.More(); itE.Next())
853 listPrevEdges = listCurEdges;
854 } // while (listPrevEdges.Extent() > 0)
856 return make_pair( INT_MAX, TopoDS_Edge());
859 //================================================================================
861 * \brief Find corresponding nodes on two faces
862 * \param face1 - the first face
863 * \param mesh1 - mesh containing elements on the first face
864 * \param face2 - the second face
865 * \param mesh2 - mesh containing elements on the second face
866 * \param assocMap - map associating subshapes of the faces
867 * \param node1To2Map - map containing found matching nodes
868 * \retval bool - is a success
870 //================================================================================
872 bool StdMeshers_ProjectionUtils::
873 FindMatchingNodesOnFaces( const TopoDS_Face& face1,
875 const TopoDS_Face& face2,
877 const TShapeShapeMap & assocMap,
878 TNodeNodeMap & node1To2Map)
880 SMESHDS_Mesh* meshDS1 = mesh1->GetMeshDS();
881 SMESHDS_Mesh* meshDS2 = mesh2->GetMeshDS();
883 SMESH_MesherHelper helper1( *mesh1 );
884 SMESH_MesherHelper helper2( *mesh2 );
886 // Get corresponding submeshes and roughly check match of meshes
888 SMESHDS_SubMesh * SM2 = meshDS2->MeshElements( face2 );
889 SMESHDS_SubMesh * SM1 = meshDS1->MeshElements( face1 );
891 RETURN_BAD_RESULT("Empty submeshes");
892 if ( SM2->NbNodes() != SM1->NbNodes() ||
893 SM2->NbElements() != SM1->NbElements() )
894 RETURN_BAD_RESULT("Different meshes on corresponding faces "
895 << meshDS1->ShapeToIndex( face1 ) << " and "
896 << meshDS2->ShapeToIndex( face2 ));
897 if ( SM2->NbElements() == 0 )
898 RETURN_BAD_RESULT("Empty submeshes");
900 helper1.SetSubShape( face1 );
901 helper2.SetSubShape( face2 );
902 if ( helper1.HasSeam() != helper2.HasSeam() )
903 RETURN_BAD_RESULT("Different faces' geometry");
905 // Data to call SMESH_MeshEditor::FindMatchingNodes():
907 // 1. Nodes of corresponding links:
909 // get 2 matching edges, try to find not seam ones
910 TopoDS_Edge edge1, edge2, seam1, seam2;
911 TopExp_Explorer eE( OuterShape( face2, TopAbs_WIRE ), TopAbs_EDGE );
914 TopoDS_Edge e2 = TopoDS::Edge( eE.Current() );
917 if ( !assocMap.IsBound( e2 ))
918 RETURN_BAD_RESULT("Association not found for edge " << meshDS2->ShapeToIndex( e2 ));
919 TopoDS_Edge e1 = TopoDS::Edge( assocMap( e2 ));
920 if ( !IsSubShape( e1, face1 ))
921 RETURN_BAD_RESULT("Wrong association, edge " << meshDS1->ShapeToIndex( e1 ) <<
922 " isn't a subshape of face " << meshDS1->ShapeToIndex( face1 ));
923 // check that there are nodes on edges
924 SMESHDS_SubMesh * eSM1 = meshDS1->MeshElements( e1 );
925 SMESHDS_SubMesh * eSM2 = meshDS2->MeshElements( e2 );
926 if ( eSM1 && eSM2 && eSM1->NbNodes() > 0 && eSM2->NbNodes() > 0 )
928 if ( BRep_Tool::IsClosed( e2, face2 )) {
929 seam1 = e1; seam2 = e2;
932 edge1 = e1; edge2 = e2;
935 } while ( edge2.IsNull() && eE.More() );
937 if ( edge2.IsNull() ) {
938 edge1 = seam1; edge2 = seam2;
940 if ( edge2.IsNull() ) RETURN_BAD_RESULT("No matching edges with nodes found");
942 // get 2 matching vertices
943 TopoDS_Vertex V2 = TopExp::FirstVertex( TopoDS::Edge( edge2 ));
944 if ( !assocMap.IsBound( V2 ))
945 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
946 TopoDS_Vertex V1 = TopoDS::Vertex( assocMap( V2 ));
949 const SMDS_MeshNode* vNode1 = SMESH_Algo::VertexNode( V1, meshDS1 );
950 const SMDS_MeshNode* vNode2 = SMESH_Algo::VertexNode( V2, meshDS2 );
951 if ( !vNode1 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
952 if ( !vNode2 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
954 // nodes on edges linked with nodes on vertices
955 const SMDS_MeshNode* nullNode = 0;
956 vector< const SMDS_MeshNode*> eNode1( 2, nullNode );
957 vector< const SMDS_MeshNode*> eNode2( 2, nullNode );
959 if ( IsClosedEdge( edge1 ) || IsClosedEdge( edge2 ) )
961 for ( int is2 = 0; is2 < 2; ++is2 )
963 TopoDS_Edge & edge = is2 ? edge2 : edge1;
964 SMESHDS_Mesh * smDS = is2 ? meshDS2 : meshDS1;
965 SMESHDS_SubMesh* edgeSM = smDS->MeshElements( edge );
966 // nodes linked with ones on vertices
967 const SMDS_MeshNode* vNode = is2 ? vNode2 : vNode1;
968 vector< const SMDS_MeshNode*>& eNode = is2 ? eNode2 : eNode1;
970 SMDS_ElemIteratorPtr vElem = vNode->GetInverseElementIterator();
971 while ( vElem->more() && nbGotNode != nbNodeToGet ) {
972 const SMDS_MeshElement* elem = vElem->next();
973 if ( elem->GetType() == SMDSAbs_Edge && edgeSM->Contains( elem ))
974 eNode[ nbGotNode++ ] =
975 ( elem->GetNode(0) == vNode ) ? elem->GetNode(1) : elem->GetNode(0);
977 if ( nbGotNode > 1 ) // sort found nodes by param on edge
979 SMESH_MesherHelper* helper = is2 ? &helper2 : &helper1;
980 double u0 = helper->GetNodeU( edge, eNode[ 0 ]);
981 double u1 = helper->GetNodeU( edge, eNode[ 1 ]);
982 if ( u0 > u1 ) std::swap( eNode[ 0 ], eNode[ 1 ]);
984 if ( nbGotNode == 0 )
985 RETURN_BAD_RESULT("Found no nodes on edge " << smDS->ShapeToIndex( edge ) <<
986 " linked to " << vNode );
991 set<const SMDS_MeshElement*> Elems1, Elems2;
992 for ( int is2 = 0; is2 < 2; ++is2 )
994 set<const SMDS_MeshElement*> & elems = is2 ? Elems2 : Elems1;
995 SMESHDS_SubMesh* sm = is2 ? SM2 : SM1;
996 SMESH_MesherHelper* helper = is2 ? &helper2 : &helper1;
997 const TopoDS_Face & face = is2 ? face2 : face1;
998 SMDS_ElemIteratorPtr eIt = sm->GetElements();
1000 if ( !helper->IsSeamShape( is2 ? edge2 : edge1 ))
1002 while ( eIt->more() ) elems.insert( eIt->next() );
1006 // there is only seam edge in a face, i.e. it is a sphere.
1007 // FindMatchingNodes() will not know which way to go from any edge.
1008 // So we ignore all faces having nodes on edges or vertices except
1009 // one of faces sharing current start nodes
1011 // find a face to keep
1012 const SMDS_MeshElement* faceToKeep = 0;
1013 const SMDS_MeshNode* vNode = is2 ? vNode2 : vNode1;
1014 const SMDS_MeshNode* eNode = is2 ? eNode2[0] : eNode1[0];
1015 TIDSortedElemSet inSet, notInSet;
1017 const SMDS_MeshElement* f1 =
1018 SMESH_MeshEditor::FindFaceInSet( vNode, eNode, inSet, notInSet );
1019 if ( !f1 ) RETURN_BAD_RESULT("The first face on seam not found");
1020 notInSet.insert( f1 );
1022 const SMDS_MeshElement* f2 =
1023 SMESH_MeshEditor::FindFaceInSet( vNode, eNode, inSet, notInSet );
1024 if ( !f2 ) RETURN_BAD_RESULT("The second face on seam not found");
1026 // select a face with less UV of vNode
1027 const SMDS_MeshNode* notSeamNode[2] = {0, 0};
1028 for ( int iF = 0; iF < 2; ++iF ) {
1029 const SMDS_MeshElement* f = ( iF ? f2 : f1 );
1030 for ( int i = 0; !notSeamNode[ iF ] && i < f->NbNodes(); ++i ) {
1031 const SMDS_MeshNode* node = f->GetNode( i );
1032 if ( !helper->IsSeamShape( node->GetPosition()->GetShapeId() ))
1033 notSeamNode[ iF ] = node;
1036 gp_Pnt2d uv1 = helper->GetNodeUV( face, vNode, notSeamNode[0] );
1037 gp_Pnt2d uv2 = helper->GetNodeUV( face, vNode, notSeamNode[1] );
1038 if ( uv1.X() + uv1.Y() > uv2.X() + uv2.Y() )
1044 elems.insert( faceToKeep );
1045 while ( eIt->more() ) {
1046 const SMDS_MeshElement* f = eIt->next();
1047 int nbNodes = f->NbNodes();
1048 if ( f->IsQuadratic() )
1051 for ( int i = 0; !onBnd && i < nbNodes; ++i ) {
1052 const SMDS_MeshNode* node = f->GetNode( i );
1053 onBnd = ( node->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE);
1058 // add also faces adjacent to faceToKeep
1059 int nbNodes = faceToKeep->NbNodes();
1060 if ( faceToKeep->IsQuadratic() ) nbNodes /= 2;
1061 notInSet.insert( f1 );
1062 notInSet.insert( f2 );
1063 for ( int i = 0; i < nbNodes; ++i ) {
1064 const SMDS_MeshNode* n1 = faceToKeep->GetNode( i );
1065 const SMDS_MeshNode* n2 = faceToKeep->GetNode( i+1 );
1066 f1 = SMESH_MeshEditor::FindFaceInSet( n1, n2, inSet, notInSet );
1070 } // case on a sphere
1071 } // loop on 2 faces
1073 node1To2Map.clear();
1074 int res = SMESH_MeshEditor::FindMatchingNodes( Elems1, Elems2,
1076 eNode1[0], eNode2[0],
1078 if ( res != SMESH_MeshEditor::SEW_OK )
1079 RETURN_BAD_RESULT("FindMatchingNodes() result " << res );
1082 // On a sphere, add matching nodes on the edge
1084 if ( helper1.IsSeamShape( edge1 ))
1086 // sort nodes on edges by param on edge
1087 map< double, const SMDS_MeshNode* > u2nodesMaps[2];
1088 for ( int is2 = 0; is2 < 2; ++is2 )
1090 TopoDS_Edge & edge = is2 ? edge2 : edge1;
1091 SMESHDS_Mesh * smDS = is2 ? meshDS2 : meshDS1;
1092 SMESHDS_SubMesh* edgeSM = smDS->MeshElements( edge );
1093 map< double, const SMDS_MeshNode* > & pos2nodes = u2nodesMaps[ is2 ];
1095 SMDS_NodeIteratorPtr nIt = edgeSM->GetNodes();
1096 while ( nIt->more() ) {
1097 const SMDS_MeshNode* node = nIt->next();
1098 const SMDS_EdgePosition* pos =
1099 static_cast<const SMDS_EdgePosition*>(node->GetPosition().get());
1100 pos2nodes.insert( make_pair( pos->GetUParameter(), node ));
1102 if ( pos2nodes.size() != edgeSM->NbNodes() )
1103 RETURN_BAD_RESULT("Equal params of nodes on edge "
1104 << smDS->ShapeToIndex( edge ) << " of face " << is2 );
1106 if ( u2nodesMaps[0].size() != u2nodesMaps[1].size() )
1107 RETURN_BAD_RESULT("Different nb of new nodes on edges or wrong params");
1109 // compare edge orientation
1110 double u1 = helper1.GetNodeU( edge1, vNode1 );
1111 double u2 = helper2.GetNodeU( edge2, vNode2 );
1112 bool isFirst1 = ( u1 < u2nodesMaps[0].begin()->first );
1113 bool isFirst2 = ( u2 < u2nodesMaps[1].begin()->first );
1114 bool reverse ( isFirst1 != isFirst2 );
1116 // associate matching nodes
1117 map< double, const SMDS_MeshNode* >::iterator u_Node1, u_Node2, end1;
1118 map< double, const SMDS_MeshNode* >::reverse_iterator uR_Node2;
1119 u_Node1 = u2nodesMaps[0].begin();
1120 u_Node2 = u2nodesMaps[1].begin();
1121 uR_Node2 = u2nodesMaps[1].rbegin();
1122 end1 = u2nodesMaps[0].end();
1123 for ( ; u_Node1 != end1; ++u_Node1 ) {
1124 const SMDS_MeshNode* n1 = u_Node1->second;
1125 const SMDS_MeshNode* n2 = ( reverse ? (uR_Node2++)->second : (u_Node2++)->second );
1126 node1To2Map.insert( make_pair( n1, n2 ));
1129 // associate matching nodes on the last vertices
1130 V2 = TopExp::LastVertex( TopoDS::Edge( edge2 ));
1131 if ( !assocMap.IsBound( V2 ))
1132 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
1133 V1 = TopoDS::Vertex( assocMap( V2 ));
1134 vNode1 = SMESH_Algo::VertexNode( V1, meshDS1 );
1135 vNode2 = SMESH_Algo::VertexNode( V2, meshDS2 );
1136 if ( !vNode1 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
1137 if ( !vNode2 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
1138 node1To2Map.insert( make_pair( vNode1, vNode2 ));
1144 //================================================================================
1146 * \brief Check if the first and last vertices of an edge are the same
1147 * \param anEdge - the edge to check
1148 * \retval bool - true if same
1150 //================================================================================
1152 bool StdMeshers_ProjectionUtils::IsClosedEdge( const TopoDS_Edge& anEdge )
1154 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
1157 //================================================================================
1159 * \brief Return any subshape of a face belonging to the outer wire
1160 * \param face - the face
1161 * \param type - type of subshape to return
1162 * \retval TopoDS_Shape - the found subshape
1164 //================================================================================
1166 TopoDS_Shape StdMeshers_ProjectionUtils::OuterShape( const TopoDS_Face& face,
1167 TopAbs_ShapeEnum type)
1169 TopExp_Explorer exp( BRepTools::OuterWire( face ), type );
1171 return exp.Current();
1172 return TopoDS_Shape();
1175 //================================================================================
1177 * \brief Check that submesh is computed and try to compute it if is not
1178 * \param sm - submesh to compute
1179 * \param iterationNb - int used to stop infinite recursive call
1180 * \retval bool - true if computed
1182 //================================================================================
1184 bool StdMeshers_ProjectionUtils::MakeComputed(SMESH_subMesh * sm, const int iterationNb)
1186 if ( iterationNb > 10 )
1187 RETURN_BAD_RESULT("Infinite recursive projection");
1189 RETURN_BAD_RESULT("NULL submesh");
1190 if ( sm->IsMeshComputed() )
1193 SMESH_Mesh* mesh = sm->GetFather();
1194 SMESH_Gen* gen = mesh->GetGen();
1195 SMESH_Algo* algo = gen->GetAlgo( *mesh, sm->GetSubShape() );
1197 RETURN_BAD_RESULT("No algo assigned to submesh " << sm->GetId());
1199 string algoType = algo->GetName();
1200 if ( algoType.substr(0, 11) != "Projection_")
1201 return gen->Compute( *mesh, sm->GetSubShape() );
1203 // try to compute source mesh
1205 const list <const SMESHDS_Hypothesis *> & hyps =
1206 algo->GetUsedHypothesis( *mesh, sm->GetSubShape() );
1208 TopoDS_Shape srcShape;
1209 SMESH_Mesh* srcMesh = 0;
1210 list <const SMESHDS_Hypothesis*>::const_iterator hIt = hyps.begin();
1211 for ( ; srcShape.IsNull() && hIt != hyps.end(); ++hIt ) {
1212 string hypName = (*hIt)->GetName();
1213 if ( hypName == "ProjectionSource1D" ) {
1214 const StdMeshers_ProjectionSource1D * hyp =
1215 static_cast<const StdMeshers_ProjectionSource1D*>( *hIt );
1216 srcShape = hyp->GetSourceEdge();
1217 srcMesh = hyp->GetSourceMesh();
1219 else if ( hypName == "ProjectionSource2D" ) {
1220 const StdMeshers_ProjectionSource2D * hyp =
1221 static_cast<const StdMeshers_ProjectionSource2D*>( *hIt );
1222 srcShape = hyp->GetSourceFace();
1223 srcMesh = hyp->GetSourceMesh();
1225 else if ( hypName == "ProjectionSource3D" ) {
1226 const StdMeshers_ProjectionSource3D * hyp =
1227 static_cast<const StdMeshers_ProjectionSource3D*>( *hIt );
1228 srcShape = hyp->GetSource3DShape();
1229 srcMesh = hyp->GetSourceMesh();
1232 if ( srcShape.IsNull() ) // no projection source defined
1233 return gen->Compute( *mesh, sm->GetSubShape() );
1235 if ( srcShape.IsSame( sm->GetSubShape() ))
1236 RETURN_BAD_RESULT("Projection from self");
1241 return MakeComputed( srcMesh->GetSubMesh( srcShape ), iterationNb + 1 );
1244 //================================================================================
1246 * \brief Count nb of subshapes
1247 * \param shape - the shape
1248 * \param type - the type of subshapes to count
1249 * \retval int - the calculated number
1251 //================================================================================
1253 int StdMeshers_ProjectionUtils::Count(const TopoDS_Shape& shape,
1254 const TopAbs_ShapeEnum type,
1255 const bool ignoreSame)
1258 TopTools_IndexedMapOfShape map;
1259 TopExp::MapShapes( shape, type, map );
1260 return map.Extent();
1264 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
1272 SMESH_subMeshEventListener* GetSrcSubMeshListener();
1274 //================================================================================
1276 * \brief Listener that resets an event listener on source submesh when
1277 * "ProjectionSource*D" hypothesis is modified
1279 //================================================================================
1281 struct HypModifWaiter: SMESH_subMeshEventListener
1283 HypModifWaiter():SMESH_subMeshEventListener(0){} // won't be deleted by submesh
1285 void ProcessEvent(const int event, const int eventType, SMESH_subMesh* subMesh,
1286 EventListenerData*, const SMESH_Hypothesis*)
1288 if ( event == SMESH_subMesh::MODIF_HYP &&
1289 eventType == SMESH_subMesh::ALGO_EVENT)
1291 // delete current source listener
1292 subMesh->DeleteEventListener( GetSrcSubMeshListener() );
1293 // let algo set a new one
1294 SMESH_Gen* gen = subMesh->GetFather()->GetGen();
1295 if ( SMESH_Algo* algo = gen->GetAlgo( *subMesh->GetFather(),
1296 subMesh->GetSubShape() ))
1297 algo->SetEventListener( subMesh );
1301 //================================================================================
1303 * \brief return static HypModifWaiter
1305 //================================================================================
1307 SMESH_subMeshEventListener* GetHypModifWaiter() {
1308 static HypModifWaiter aHypModifWaiter;
1309 return &aHypModifWaiter;
1311 //================================================================================
1313 * \brief return static listener for source shape submeshes
1315 //================================================================================
1317 SMESH_subMeshEventListener* GetSrcSubMeshListener() {
1318 static SMESH_subMeshEventListener srcListener(0); // won't be deleted by submesh
1319 return &srcListener;
1323 //================================================================================
1325 * \brief Set event listeners to submesh with projection algo
1326 * \param subMesh - submesh with projection algo
1327 * \param srcShape - source shape
1328 * \param srcMesh - source mesh
1330 //================================================================================
1332 void StdMeshers_ProjectionUtils::SetEventListener(SMESH_subMesh* subMesh,
1333 TopoDS_Shape srcShape,
1334 SMESH_Mesh* srcMesh)
1336 // Set listener that resets an event listener on source submesh when
1337 // "ProjectionSource*D" hypothesis is modified
1338 subMesh->SetEventListener( GetHypModifWaiter(),0,subMesh);
1340 // Set an event listener to submesh of the source shape
1341 if ( !srcShape.IsNull() )
1344 srcMesh = subMesh->GetFather();
1346 SMESH_subMesh* srcShapeSM = srcMesh->GetSubMesh( srcShape );
1348 if ( srcShapeSM != subMesh )
1349 subMesh->SetEventListener( GetSrcSubMeshListener(),
1350 SMESH_subMeshEventListenerData::MakeData( subMesh ),