1 // Copyright (C) 2007-2010 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 // SMESH SMESH : idl implementation based on 'SMESH' unit's calsses
24 // File : StdMeshers_ProjectionUtils.cxx
25 // Created : Fri Oct 27 10:24:28 2006
26 // Author : Edward AGAPOV (eap)
28 #include "StdMeshers_ProjectionUtils.hxx"
30 #include "StdMeshers_ProjectionSource1D.hxx"
31 #include "StdMeshers_ProjectionSource2D.hxx"
32 #include "StdMeshers_ProjectionSource3D.hxx"
34 #include "SMESH_Algo.hxx"
35 #include "SMESH_Block.hxx"
36 #include "SMESH_Gen.hxx"
37 #include "SMESH_Hypothesis.hxx"
38 #include "SMESH_IndexedDataMapOfShapeIndexedMapOfShape.hxx"
39 #include "SMESH_Mesh.hxx"
40 #include "SMESH_MesherHelper.hxx"
41 #include "SMESH_subMesh.hxx"
42 #include "SMESH_subMeshEventListener.hxx"
43 #include "SMDS_EdgePosition.hxx"
45 #include "utilities.h"
47 #include <BRepTools.hxx>
48 #include <BRepTools_WireExplorer.hxx>
49 #include <BRep_Builder.hxx>
50 #include <BRep_Tool.hxx>
51 #include <Bnd_Box.hxx>
54 #include <TopExp_Explorer.hxx>
55 #include <TopTools_Array1OfShape.hxx>
56 #include <TopTools_ListIteratorOfListOfShape.hxx>
57 #include <TopTools_ListOfShape.hxx>
58 #include <TopTools_MapOfShape.hxx>
60 #include <TopoDS_Compound.hxx>
61 #include <TopoDS_Shape.hxx>
64 #include <TopTools_DataMapIteratorOfDataMapOfShapeShape.hxx>
65 #include <TopTools_DataMapIteratorOfDataMapOfShapeListOfShape.hxx>
70 #define RETURN_BAD_RESULT(msg) { MESSAGE(")-: Error: " << msg); return false; }
71 #define CONT_BAD_RESULT(msg) { MESSAGE(")-: Error: " << msg); continue; }
72 #define SHOW_VERTEX(v,msg) \
74 // if ( (v).IsNull() ) cout << msg << " NULL SHAPE" << endl; \
75 // else if ((v).ShapeType() == TopAbs_VERTEX) {\
76 // gp_Pnt p = BRep_Tool::Pnt( TopoDS::Vertex( (v) ));\
77 // cout<<msg<<" "<<(v).TShape().operator->()<<" ( "<<p.X()<<", "<<p.Y()<<", "<<p.Z()<<" )"<<endl;}\
79 // cout << msg << " "; TopAbs::Print((v).ShapeType(),cout) <<" "<<(v).TShape().operator->()<<endl;}\
81 #define SHOW_LIST(msg,l) \
83 // cout << msg << " ";\
84 // list< TopoDS_Edge >::const_iterator e = l.begin();\
85 // for ( int i = 0; e != l.end(); ++e, ++i ) {\
86 // cout << i << "V (" << TopExp::FirstVertex( *e, true ).TShape().operator->() << ") "\
87 // << i << "E (" << e->TShape().operator->() << "); "; }\
91 #define HERE StdMeshers_ProjectionUtils
95 //================================================================================
97 * \brief Write shape for debug purposes
99 //================================================================================
101 bool _StoreBadShape(const TopoDS_Shape& shape)
104 const char* type[] ={"COMPOUND","COMPSOLID","SOLID","SHELL","FACE","WIRE","EDGE","VERTEX"};
105 BRepTools::Write( shape, SMESH_Comment("/tmp/") << type[shape.ShapeType()] << "_"
106 << shape.TShape().operator->() << ".brep");
111 //================================================================================
113 * \brief Reverse order of edges in a list and their orientation
114 * \param edges - list of edges to reverse
115 * \param nbEdges - number of edges to reverse
117 //================================================================================
119 void Reverse( list< TopoDS_Edge > & edges, const int nbEdges )
121 SHOW_LIST("BEFORE REVERSE", edges);
123 list< TopoDS_Edge >::iterator eIt = edges.begin();
124 if ( edges.size() == nbEdges )
128 else // reverse only the given nb of edges
130 // look for the last edge to be reversed
131 list< TopoDS_Edge >::iterator eBackIt = edges.begin();
132 for ( int i = 1; i < nbEdges; ++i )
135 while ( eIt != eBackIt ) {
136 std::swap( *eIt, *eBackIt );
137 SHOW_LIST("# AFTER SWAP", edges)
138 if ( (++eIt) != eBackIt )
142 for ( eIt = edges.begin(); eIt != edges.end(); ++eIt )
144 SHOW_LIST("ATFER REVERSE", edges)
147 //================================================================================
149 * \brief Check if propagation is possible
150 * \param theMesh1 - source mesh
151 * \param theMesh2 - target mesh
152 * \retval bool - true if possible
154 //================================================================================
156 bool IsPropagationPossible( SMESH_Mesh* theMesh1, SMESH_Mesh* theMesh2 )
158 if ( theMesh1 != theMesh2 ) {
159 TopoDS_Shape mainShape1 = theMesh1->GetMeshDS()->ShapeToMesh();
160 TopoDS_Shape mainShape2 = theMesh2->GetMeshDS()->ShapeToMesh();
161 return mainShape1.IsSame( mainShape2 );
166 //================================================================================
168 * \brief Fix up association of edges in faces by possible propagation
169 * \param nbEdges - nb of edges in an outer wire
170 * \param edges1 - edges of one face
171 * \param edges2 - matching edges of another face
172 * \param theMesh1 - mesh 1
173 * \param theMesh2 - mesh 2
174 * \retval bool - true if association was fixed
176 //================================================================================
178 bool FixAssocByPropagation( const int nbEdges,
179 list< TopoDS_Edge > & edges1,
180 list< TopoDS_Edge > & edges2,
181 SMESH_Mesh* theMesh1,
182 SMESH_Mesh* theMesh2)
184 if ( nbEdges == 2 && IsPropagationPossible( theMesh1, theMesh2 ) )
186 list< TopoDS_Edge >::iterator eIt2 = ++edges2.begin(); // 2nd edge of the 2nd face
187 TopoDS_Edge edge2 = HERE::GetPropagationEdge( theMesh1, *eIt2, edges1.front() ).second;
188 if ( !edge2.IsNull() ) { // propagation found for the second edge
189 Reverse( edges2, nbEdges );
196 //================================================================================
198 * \brief Look for a group containing a target shape and similar to a source group
199 * \param tgtShape - target edge or face
200 * \param tgtMesh1 - target mesh
201 * \param srcGroup - source group
202 * \retval TopoDS_Shape - found target group
204 //================================================================================
206 TopoDS_Shape FindGroupContaining(const TopoDS_Shape& tgtShape,
207 const SMESH_Mesh* tgtMesh1,
208 const TopoDS_Shape& srcGroup)
210 list<SMESH_subMesh*> subMeshes = tgtMesh1->GetGroupSubMeshesContaining(tgtShape);
211 list<SMESH_subMesh*>::iterator sm = subMeshes.begin();
212 int type, last = TopAbs_SHAPE;
213 StdMeshers_ProjectionUtils util;
214 for ( ; sm != subMeshes.end(); ++sm ) {
215 const TopoDS_Shape & group = (*sm)->GetSubShape();
216 // check if group is similar to srcGroup
217 for ( type = srcGroup.ShapeType(); type < last; ++type)
218 if ( util.Count( srcGroup, (TopAbs_ShapeEnum)type, 0) !=
219 util.Count( group, (TopAbs_ShapeEnum)type, 0))
224 return TopoDS_Shape();
227 //================================================================================
229 * \brief Find association of groups at top and bottom of prism
231 //================================================================================
233 bool AssocGroupsByPropagation(const TopoDS_Shape& theGroup1,
234 const TopoDS_Shape& theGroup2,
236 HERE::TShapeShapeMap& theMap)
238 // If groups are on top and bottom of prism then we can associate
239 // them using "vertical" (or "side") edges and faces of prism since
240 // they connect corresponding vertices and edges of groups.
242 TopTools_IndexedMapOfShape subshapes1, subshapes2;
243 TopExp::MapShapes( theGroup1, subshapes1 );
244 TopExp::MapShapes( theGroup2, subshapes2 );
245 TopTools_ListIteratorOfListOfShape ancestIt;
247 // Iterate on vertices of group1 to find corresponding vertices in group2
248 // and associate adjacent edges and faces
250 TopTools_MapOfShape verticShapes;
251 TopExp_Explorer vExp1( theGroup1, TopAbs_VERTEX );
252 for ( ; vExp1.More(); vExp1.Next() )
254 const TopoDS_Vertex& v1 = TopoDS::Vertex( vExp1.Current() );
255 if ( theMap.IsBound( v1 )) continue; // already processed
257 // Find "vertical" edge ending in v1 and whose other vertex belongs to group2
258 TopoDS_Shape verticEdge, v2;
259 ancestIt.Initialize( theMesh.GetAncestors( v1 ));
260 for ( ; verticEdge.IsNull() && ancestIt.More(); ancestIt.Next() )
262 if ( ancestIt.Value().ShapeType() != TopAbs_EDGE ) continue;
263 v2 = HERE::GetNextVertex( TopoDS::Edge( ancestIt.Value() ), v1 );
264 if ( subshapes2.Contains( v2 ))
265 verticEdge = ancestIt.Value();
267 if ( verticEdge.IsNull() )
270 HERE::InsertAssociation( v1, v2, theMap);
272 // Associate edges by vertical faces sharing the found vertical edge
273 ancestIt.Initialize( theMesh.GetAncestors( verticEdge ) );
274 for ( ; ancestIt.More(); ancestIt.Next() )
276 if ( ancestIt.Value().ShapeType() != TopAbs_FACE ) continue;
277 if ( !verticShapes.Add( ancestIt.Value() )) continue;
278 const TopoDS_Face& face = TopoDS::Face( ancestIt.Value() );
280 // get edges of the face
281 TopoDS_Edge edgeGr1, edgeGr2, verticEdge2;
282 list< TopoDS_Edge > edges; list< int > nbEdgesInWire;
283 SMESH_Block::GetOrderedEdges( face, v1, edges, nbEdgesInWire);
284 if ( nbEdgesInWire.front() != 4 )
285 return _StoreBadShape( face );
286 list< TopoDS_Edge >::iterator edge = edges.begin();
287 if ( verticEdge.IsSame( *edge )) {
289 verticEdge2 = *(++edge);
293 verticEdge2 = *(edge++);
297 HERE::InsertAssociation( edgeGr1, edgeGr2.Reversed(), theMap);
302 TopoDS_Iterator gr1It( theGroup1 );
303 if ( gr1It.Value().ShapeType() == TopAbs_FACE )
305 // find a boundary edge of group1 to start from
306 TopoDS_Shape bndEdge;
307 TopExp_Explorer edgeExp1( theGroup1, TopAbs_EDGE );
308 for ( ; bndEdge.IsNull() && edgeExp1.More(); edgeExp1.Next())
309 if ( HERE::IsBoundaryEdge( TopoDS::Edge( edgeExp1.Current()), theGroup1, theMesh ))
310 bndEdge = edgeExp1.Current();
311 if ( bndEdge.IsNull() )
314 list< TopoDS_Shape > edges(1, bndEdge);
315 list< TopoDS_Shape >::iterator edge1 = edges.begin();
316 for ( ; edge1 != edges.end(); ++edge1 )
318 // there must be one or zero not associated faces between ancestors of edge
319 // belonging to theGroup1
321 ancestIt.Initialize( theMesh.GetAncestors( *edge1 ) );
322 for ( ; ancestIt.More() && face1.IsNull(); ancestIt.Next() ) {
323 if ( ancestIt.Value().ShapeType() == TopAbs_FACE &&
324 !theMap.IsBound( ancestIt.Value() ) &&
325 subshapes1.Contains( ancestIt.Value() ))
326 face1 = ancestIt.Value();
328 // add edges of face1 to start searching for adjacent faces from
329 for ( TopExp_Explorer e(face1, TopAbs_EDGE); e.More(); e.Next())
330 if ( !edge1->IsSame( e.Current() ))
331 edges.push_back( e.Current() );
333 if ( !face1.IsNull() ) {
334 // find the corresponding face of theGroup2
335 TopoDS_Shape edge2 = theMap( *edge1 );
337 ancestIt.Initialize( theMesh.GetAncestors( edge2 ) );
338 for ( ; ancestIt.More() && face2.IsNull(); ancestIt.Next() ) {
339 if ( ancestIt.Value().ShapeType() == TopAbs_FACE &&
340 !theMap.IsBound( ancestIt.Value() ) &&
341 subshapes2.Contains( ancestIt.Value() ))
342 face2 = ancestIt.Value();
344 if ( face2.IsNull() )
347 HERE::InsertAssociation( face1, face2, theMap);
356 //=======================================================================
358 * \brief Looks for association of all subshapes of two shapes
359 * \param theShape1 - shape 1
360 * \param theMesh1 - mesh built on shape 1
361 * \param theShape2 - shape 2
362 * \param theMesh2 - mesh built on shape 2
363 * \param theAssociation - association map to be filled that may
364 * contain association of one or two pairs of vertices
365 * \retval bool - true if association found
367 //=======================================================================
369 bool StdMeshers_ProjectionUtils::FindSubShapeAssociation(const TopoDS_Shape& theShape1,
370 SMESH_Mesh* theMesh1,
371 const TopoDS_Shape& theShape2,
372 SMESH_Mesh* theMesh2,
373 TShapeShapeMap & theMap)
375 // Structure of this long function is following
376 // 1) Group->group projection: theShape1 is a group member,
377 // theShape2 is a group. We find a group theShape1 is in and recall self.
378 // 2) Accosiate same shapes with different location (partners).
379 // 3) If vertex association is given, perform accosiation according to shape type:
380 // switch ( ShapeType ) {
384 // else try to accosiate in different ways:
385 // a) accosiate shapes by propagation and other simple cases
386 // switch ( ShapeType ) {
390 // b) find association of a couple of vertices and recall self.
393 // =================================================================================
394 // Is it the case of associating a group member -> another group? (PAL16202, 16203)
395 // =================================================================================
396 if ( theShape1.ShapeType() != theShape2.ShapeType() ) {
397 TopoDS_Shape group1, group2;
398 if ( theShape1.ShapeType() == TopAbs_COMPOUND ) {
400 group2 = FindGroupContaining( theShape2, theMesh2, group1 );
402 else if ( theShape2.ShapeType() == TopAbs_COMPOUND ) {
404 group1 = FindGroupContaining( theShape1, theMesh1, group2 );
406 if ( group1.IsNull() || group2.IsNull() )
407 RETURN_BAD_RESULT("Different shape types");
408 // Associate compounds
409 return FindSubShapeAssociation(group1, theMesh1, group2, theMesh2, theMap );
412 bool bidirect = ( !theShape1.IsSame( theShape2 ));
417 bool partner = theShape1.IsPartner( theShape2 );
418 TopTools_DataMapIteratorOfDataMapOfShapeShape vvIt( theMap );
419 for ( ; partner && vvIt.More(); vvIt.Next() )
420 partner = vvIt.Key().IsPartner( vvIt.Value() );
422 if ( partner ) // Same shape with different location
424 // recursively associate all subshapes of theShape1 and theShape2
425 typedef list< pair< TopoDS_Shape, TopoDS_Shape > > TShapePairsList;
426 TShapePairsList shapesQueue( 1, make_pair( theShape1, theShape2 ));
427 TShapePairsList::iterator s1_s2 = shapesQueue.begin();
428 for ( ; s1_s2 != shapesQueue.end(); ++s1_s2 )
430 InsertAssociation( s1_s2->first, s1_s2->second, theMap, bidirect);
431 TopoDS_Iterator s1It( s1_s2->first), s2It( s1_s2->second );
432 for ( ; s1It.More(); s1It.Next(), s2It.Next() )
433 shapesQueue.push_back( make_pair( s1It.Value(), s2It.Value() ));
438 if ( !theMap.IsEmpty() )
440 //======================================================================
441 // HAS initial vertex association
442 //======================================================================
443 switch ( theShape1.ShapeType() ) {
444 // ----------------------------------------------------------------------
445 case TopAbs_EDGE: { // TopAbs_EDGE
446 // ----------------------------------------------------------------------
447 if ( theMap.Extent() != 2 )
448 RETURN_BAD_RESULT("Wrong map extent " << theMap.Extent() );
449 TopoDS_Edge edge1 = TopoDS::Edge( theShape1 );
450 TopoDS_Edge edge2 = TopoDS::Edge( theShape2 );
451 TopoDS_Vertex VV1[2], VV2[2];
452 TopExp::Vertices( edge1, VV1[0], VV1[1] );
453 TopExp::Vertices( edge2, VV2[0], VV2[1] );
455 if ( theMap.IsBound( VV1[ i1 ] )) i1 = 1;
456 if ( theMap.IsBound( VV2[ i2 ] )) i2 = 1;
457 InsertAssociation( VV1[ i1 ], VV2[ i2 ], theMap, bidirect);
458 InsertAssociation( theShape1, theShape2, theMap, bidirect );
461 // ----------------------------------------------------------------------
462 case TopAbs_FACE: { // TopAbs_FACE
463 // ----------------------------------------------------------------------
464 TopoDS_Face face1 = TopoDS::Face( theShape1 );
465 TopoDS_Face face2 = TopoDS::Face( theShape2 );
467 TopoDS_Vertex VV1[2], VV2[2];
468 // find a not closed edge of face1 both vertices of which are associated
470 TopExp_Explorer exp ( face1, TopAbs_EDGE );
471 for ( ; VV2[ 1 ].IsNull() && exp.More(); exp.Next(), ++nbEdges ) {
472 TopExp::Vertices( TopoDS::Edge( exp.Current() ), VV1[0], VV1[1] );
473 if ( theMap.IsBound( VV1[0] ) ) {
474 VV2[ 0 ] = TopoDS::Vertex( theMap( VV1[0] ));
475 if ( theMap.IsBound( VV1[1] ) && !VV1[0].IsSame( VV1[1] ))
476 VV2[ 1 ] = TopoDS::Vertex( theMap( VV1[1] ));
479 if ( VV2[ 1 ].IsNull() ) { // 2 bound vertices not found
481 RETURN_BAD_RESULT("2 bound vertices not found" );
486 list< TopoDS_Edge > edges1, edges2;
487 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
488 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
489 FixAssocByPropagation( nbE, edges1, edges2, theMesh1, theMesh2 );
491 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
492 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
493 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
495 InsertAssociation( *eIt1, *eIt2, theMap, bidirect);
496 VV1[0] = TopExp::FirstVertex( *eIt1, true );
497 VV2[0] = TopExp::FirstVertex( *eIt2, true );
498 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
500 InsertAssociation( theShape1, theShape2, theMap, bidirect );
503 // ----------------------------------------------------------------------
504 case TopAbs_SHELL: // TopAbs_SHELL, TopAbs_SOLID
506 // ----------------------------------------------------------------------
507 TopoDS_Vertex VV1[2], VV2[2];
508 // try to find a not closed edge of shape1 both vertices of which are associated
510 TopExp_Explorer exp ( theShape1, TopAbs_EDGE );
511 for ( ; VV2[ 1 ].IsNull() && exp.More(); exp.Next() ) {
512 edge1 = TopoDS::Edge( exp.Current() );
513 TopExp::Vertices( edge1 , VV1[0], VV1[1] );
514 if ( theMap.IsBound( VV1[0] )) {
515 VV2[ 0 ] = TopoDS::Vertex( theMap( VV1[0] ));
516 if ( theMap.IsBound( VV1[1] ) && !VV1[0].IsSame( VV1[1] ))
517 VV2[ 1 ] = TopoDS::Vertex( theMap( VV1[1] ));
520 if ( VV2[ 1 ].IsNull() ) // 2 bound vertices not found
521 RETURN_BAD_RESULT("2 bound vertices not found" );
522 // get an edge2 of theShape2 corresponding to edge1
523 TopoDS_Edge edge2 = GetEdgeByVertices( theMesh2, VV2[ 0 ], VV2[ 1 ]);
524 if ( edge2.IsNull() )
525 RETURN_BAD_RESULT("GetEdgeByVertices() failed");
527 // build map of edge to faces if shapes are not subshapes of main ones
528 bool isSubOfMain = false;
529 if ( SMESHDS_SubMesh * sm = theMesh1->GetMeshDS()->MeshElements( theShape1 ))
530 isSubOfMain = !sm->IsComplexSubmesh();
532 isSubOfMain = theMesh1->GetMeshDS()->ShapeToIndex( theShape1 );
533 TAncestorMap e2f1, e2f2;
534 const TAncestorMap& edgeToFace1 = isSubOfMain ? theMesh1->GetAncestorMap() : e2f1;
535 const TAncestorMap& edgeToFace2 = isSubOfMain ? theMesh2->GetAncestorMap() : e2f2;
537 TopExp::MapShapesAndAncestors( theShape1, TopAbs_EDGE, TopAbs_FACE, e2f1 );
538 TopExp::MapShapesAndAncestors( theShape2, TopAbs_EDGE, TopAbs_FACE, e2f2 );
539 if ( !edgeToFace1.Contains( edge1 ))
540 RETURN_BAD_RESULT("edge1 does not belong to theShape1");
541 if ( !edgeToFace2.Contains( edge2 ))
542 RETURN_BAD_RESULT("edge2 does not belong to theShape2");
545 // Look for 2 corresponing faces:
549 // get a face sharing edge1 (F1)
551 TopTools_ListIteratorOfListOfShape ancestIt1( edgeToFace1.FindFromKey( edge1 ));
552 for ( ; F1.IsNull() && ancestIt1.More(); ancestIt1.Next() )
553 if ( ancestIt1.Value().ShapeType() == TopAbs_FACE )
554 F1 = ancestIt1.Value().Oriented( TopAbs_FORWARD );
556 RETURN_BAD_RESULT(" Face1 not found");
558 // get 2 faces sharing edge2 (one of them is F2)
559 TopTools_ListIteratorOfListOfShape ancestIt2( edgeToFace2.FindFromKey( edge2 ));
560 for ( int i = 0; FF2[1].IsNull() && ancestIt2.More(); ancestIt2.Next() )
561 if ( ancestIt2.Value().ShapeType() == TopAbs_FACE )
562 FF2[ i++ ] = ancestIt2.Value().Oriented( TopAbs_FORWARD );
564 // get oriented edge1 and edge2 from F1 and FF2[0]
565 for ( exp.Init( F1, TopAbs_EDGE ); exp.More(); exp.Next() )
566 if ( edge1.IsSame( exp.Current() )) {
567 edge1 = TopoDS::Edge( exp.Current() );
570 for ( exp.Init( FF2[ 0 ], TopAbs_EDGE ); exp.More(); exp.Next() )
571 if ( edge2.IsSame( exp.Current() )) {
572 edge2 = TopoDS::Edge( exp.Current() );
576 // compare first vertices of edge1 and edge2
577 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
578 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
579 F2 = FF2[ 0 ]; // (F2 !)
580 if ( !VV1[ 0 ].IsSame( theMap( VV2[ 0 ]))) {
582 if ( FF2[ 1 ].IsNull() )
588 TopTools_MapOfShape boundEdges;
590 // association of face subshapes and neighbour faces
591 list< pair < TopoDS_Face, TopoDS_Edge > > FE1, FE2;
592 list< pair < TopoDS_Face, TopoDS_Edge > >::iterator fe1, fe2;
593 FE1.push_back( make_pair( TopoDS::Face( F1 ), edge1 ));
594 FE2.push_back( make_pair( TopoDS::Face( F2 ), edge2 ));
595 for ( fe1 = FE1.begin(), fe2 = FE2.begin(); fe1 != FE1.end(); ++fe1, ++fe2 )
597 const TopoDS_Face& face1 = fe1->first;
598 if ( theMap.IsBound( face1 ) ) continue;
599 const TopoDS_Face& face2 = fe2->first;
602 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
603 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
604 list< TopoDS_Edge > edges1, edges2;
605 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
606 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
607 InsertAssociation( face1, face2, theMap, bidirect); // assoc faces
608 MESSAGE("Assoc FACE " << theMesh1->GetMeshDS()->ShapeToIndex( face1 )<<
609 " to " << theMesh2->GetMeshDS()->ShapeToIndex( face2 ));
610 if ( nbE == 2 && (edge1.IsSame( edges1.front())) != (edge2.IsSame( edges2.front())))
612 Reverse( edges2, nbE );
614 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
615 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
616 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
618 if ( !boundEdges.Add( *eIt1 )) continue; // already associated
619 InsertAssociation( *eIt1, *eIt2, theMap, bidirect); // assoc edges
620 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( *eIt1 )<<
621 " to " << theMesh2->GetMeshDS()->ShapeToIndex( *eIt2 ));
622 VV1[0] = TopExp::FirstVertex( *eIt1, true );
623 VV2[0] = TopExp::FirstVertex( *eIt2, true );
624 InsertAssociation( VV1[0], VV2[0], theMap, bidirect); // assoc vertices
625 MESSAGE("Assoc vertex " << theMesh1->GetMeshDS()->ShapeToIndex( VV1[0] )<<
626 " to " << theMesh2->GetMeshDS()->ShapeToIndex( VV2[0] ));
628 // add adjacent faces to process
629 TopoDS_Face nextFace1 = GetNextFace( edgeToFace1, *eIt1, face1 );
630 TopoDS_Face nextFace2 = GetNextFace( edgeToFace2, *eIt2, face2 );
631 if ( !nextFace1.IsNull() && !nextFace2.IsNull() ) {
632 FE1.push_back( make_pair( nextFace1, *eIt1 ));
633 FE2.push_back( make_pair( nextFace2, *eIt2 ));
637 InsertAssociation( theShape1, theShape2, theMap, bidirect );
640 // ----------------------------------------------------------------------
641 case TopAbs_COMPOUND: { // GROUP
642 // ----------------------------------------------------------------------
643 // Maybe groups contain only one member
644 TopoDS_Iterator it1( theShape1 ), it2( theShape2 );
645 TopAbs_ShapeEnum memberType = it1.Value().ShapeType();
646 int nbMembers = Count( theShape1, memberType, true );
647 if ( nbMembers == 0 ) return true;
648 if ( nbMembers == 1 ) {
649 return FindSubShapeAssociation( it1.Value(), theMesh1, it2.Value(), theMesh2, theMap );
651 // Try to make shells of faces
653 BRep_Builder builder;
654 TopoDS_Shell shell1, shell2;
655 builder.MakeShell(shell1); builder.MakeShell(shell2);
656 if ( memberType == TopAbs_FACE ) {
657 // just add faces of groups to shells
658 for (; it1.More(); it1.Next(), it2.Next() )
659 builder.Add( shell1, it1.Value() ), builder.Add( shell2, it2.Value() );
661 else if ( memberType == TopAbs_EDGE ) {
662 // Try to add faces sharing more than one edge of a group or
663 // sharing all its vertices with the group
664 TopTools_IndexedMapOfShape groupVertices[2];
665 TopExp::MapShapes( theShape1, TopAbs_VERTEX, groupVertices[0]);
666 TopExp::MapShapes( theShape2, TopAbs_VERTEX, groupVertices[1]);
668 TopTools_MapOfShape groupEdges[2], addedFaces[2];
669 bool hasInitAssoc = (!theMap.IsEmpty()), initAssocOK = !hasInitAssoc;
670 for (; it1.More(); it1.Next(), it2.Next() ) {
671 groupEdges[0].Add( it1.Value() );
672 groupEdges[1].Add( it2.Value() );
673 if ( !initAssocOK ) {
674 // for shell association there must be an edge with both vertices bound
675 TopoDS_Vertex v1, v2;
676 TopExp::Vertices( TopoDS::Edge( it1.Value()), v1, v2 );
677 initAssocOK = ( theMap.IsBound( v1 ) && theMap.IsBound( v2 ));
680 for (int is2ndGroup = 0; initAssocOK && is2ndGroup < 2; ++is2ndGroup) {
681 const TopoDS_Shape& group = is2ndGroup ? theShape2: theShape1;
682 SMESH_Mesh* mesh = is2ndGroup ? theMesh2 : theMesh1;
683 TopoDS_Shell& shell = is2ndGroup ? shell2 : shell1;
684 for ( TopoDS_Iterator it( group ); it.More(); it.Next() ) {
685 const TopoDS_Edge& edge = TopoDS::Edge( it.Value() );
687 for ( int iF = 0; iF < 2; ++iF ) { // loop on 2 faces sharing edge
688 face = GetNextFace(mesh->GetAncestorMap(), edge, face);
689 if ( !face.IsNull() ) {
690 int nbGroupEdges = 0;
691 for ( TopExp_Explorer f( face, TopAbs_EDGE ); f.More(); f.Next())
692 if ( groupEdges[ is2ndGroup ].Contains( f.Current() ))
693 if ( ++nbGroupEdges > 1 )
695 bool add = (nbGroupEdges > 1 || Count( face, TopAbs_EDGE, true ) == 1 );
698 for ( TopExp_Explorer v( face, TopAbs_VERTEX ); add && v.More(); v.Next())
699 add = groupVertices[ is2ndGroup ].Contains( v.Current() );
701 if ( add && addedFaces[ is2ndGroup ].Add( face ))
702 builder.Add( shell, face );
708 RETURN_BAD_RESULT("Unexpected group type");
712 int nbFaces1 = Count( shell1, TopAbs_FACE, 0 );
713 int nbFaces2 = Count( shell2, TopAbs_FACE, 0 );
714 if ( nbFaces1 != nbFaces2 )
715 RETURN_BAD_RESULT("Different nb of faces found for shells");
716 if ( nbFaces1 > 0 ) {
718 if ( nbFaces1 == 1 ) {
719 TopoDS_Shape F1 = TopoDS_Iterator( shell1 ).Value();
720 TopoDS_Shape F2 = TopoDS_Iterator( shell2 ).Value();
721 ok = FindSubShapeAssociation( F1, theMesh1, F2, theMesh2, theMap );
724 ok = FindSubShapeAssociation(shell1, theMesh1, shell2, theMesh2, theMap );
726 // Check if all members are mapped
728 TopTools_MapOfShape boundMembers[2];
730 for ( mIt.Initialize( theShape1 ); mIt.More(); mIt.Next())
731 if ( theMap.IsBound( mIt.Value() )) {
732 boundMembers[0].Add( mIt.Value() );
733 boundMembers[1].Add( theMap( mIt.Value() ));
735 if ( boundMembers[0].Extent() != nbMembers ) {
736 // make compounds of not bound members
737 TopoDS_Compound comp[2];
738 for ( int is2ndGroup = 0; is2ndGroup < 2; ++is2ndGroup ) {
739 builder.MakeCompound( comp[is2ndGroup] );
740 for ( mIt.Initialize( is2ndGroup ? theShape2:theShape1 ); mIt.More(); mIt.Next())
741 if ( ! boundMembers[ is2ndGroup ].Contains( mIt.Value() ))
742 builder.Add( comp[ is2ndGroup ], mIt.Value() );
744 // check if theMap contains initial association for the comp's
745 bool hasInitialAssoc = false;
746 if ( memberType == TopAbs_EDGE ) {
747 for ( TopExp_Explorer v( comp[0], TopAbs_VERTEX ); v.More(); v.Next())
748 if ( theMap.IsBound( v.Current() )) {
749 hasInitialAssoc = true;
753 if ( hasInitialAssoc == bool( !theMap.IsEmpty() ))
754 ok = FindSubShapeAssociation( comp[0], theMesh1, comp[1], theMesh2, theMap );
756 TShapeShapeMap tmpMap;
757 ok = FindSubShapeAssociation( comp[0], theMesh1, comp[1], theMesh2, tmpMap );
759 TopTools_DataMapIteratorOfDataMapOfShapeShape mapIt( tmpMap );
760 for ( ; mapIt.More(); mapIt.Next() )
761 theMap.Bind( mapIt.Key(), mapIt.Value());
768 // Each edge of an edge group is shared by own faces
769 // ------------------------------------------------------------------
771 // map vertices to edges sharing them, avoid doubling edges in lists
772 TopTools_DataMapOfShapeListOfShape v2e[2];
773 for (int isFirst = 0; isFirst < 2; ++isFirst ) {
774 const TopoDS_Shape& group = isFirst ? theShape1 : theShape2;
775 TopTools_DataMapOfShapeListOfShape& veMap = v2e[ isFirst ? 0 : 1 ];
776 TopTools_MapOfShape addedEdges;
777 for ( TopExp_Explorer e( group, TopAbs_EDGE ); e.More(); e.Next() ) {
778 const TopoDS_Shape& edge = e.Current();
779 if ( addedEdges.Add( edge )) {
780 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next()) {
781 const TopoDS_Shape& vertex = v.Current();
782 if ( !veMap.IsBound( vertex )) {
783 TopTools_ListOfShape l;
784 veMap.Bind( vertex, l );
786 veMap( vertex ).Append( edge );
791 while ( !v2e[0].IsEmpty() )
793 // find a bound vertex
795 TopTools_DataMapIteratorOfDataMapOfShapeListOfShape v2eIt( v2e[0] );
796 for ( ; v2eIt.More(); v2eIt.Next())
797 if ( theMap.IsBound( v2eIt.Key() )) {
798 V[0] = TopoDS::Vertex( v2eIt.Key() );
799 V[1] = TopoDS::Vertex( theMap( V[0] ));
803 RETURN_BAD_RESULT("No more bound vertices");
805 while ( !V[0].IsNull() && v2e[0].IsBound( V[0] )) {
806 TopTools_ListOfShape& edges0 = v2e[0]( V[0] );
807 TopTools_ListOfShape& edges1 = v2e[1]( V[1] );
808 int nbE0 = edges0.Extent(), nbE1 = edges1.Extent();
810 RETURN_BAD_RESULT("Different nb of edges: "<< nbE0 << " != " << nbE1);
814 TopoDS_Edge e0 = TopoDS::Edge( edges0.First() );
815 TopoDS_Edge e1 = TopoDS::Edge( edges1.First() );
816 v2e[0].UnBind( V[0] );
817 v2e[1].UnBind( V[1] );
818 InsertAssociation( e0, e1, theMap, bidirect );
819 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( e0 )<<
820 " to " << theMesh2->GetMeshDS()->ShapeToIndex( e1 ));
821 V[0] = GetNextVertex( e0, V[0] );
822 V[1] = GetNextVertex( e1, V[1] );
823 if ( !V[0].IsNull() ) {
824 InsertAssociation( V[0], V[1], theMap, bidirect );
825 MESSAGE("Assoc vertex " << theMesh1->GetMeshDS()->ShapeToIndex( V[0] )<<
826 " to " << theMesh2->GetMeshDS()->ShapeToIndex( V[1] ));
829 else if ( nbE0 == 2 )
831 // one of edges must have both ends bound
832 TopoDS_Vertex v0e0 = GetNextVertex( TopoDS::Edge( edges0.First() ), V[0] );
833 TopoDS_Vertex v1e0 = GetNextVertex( TopoDS::Edge( edges0.Last() ), V[0] );
834 TopoDS_Vertex v0e1 = GetNextVertex( TopoDS::Edge( edges1.First() ), V[1] );
835 TopoDS_Vertex v1e1 = GetNextVertex( TopoDS::Edge( edges1.Last() ), V[1] );
836 TopoDS_Shape e0b, e1b, e0n, e1n, v1b; // bound and not-bound
837 TopoDS_Vertex v0n, v1n;
838 if ( theMap.IsBound( v0e0 )) {
839 v0n = v1e0; e0b = edges0.First(); e0n = edges0.Last(); v1b = theMap( v0e0 );
840 } else if ( theMap.IsBound( v1e0 )) {
841 v0n = v0e0; e0n = edges0.First(); e0b = edges0.Last(); v1b = theMap( v1e0 );
843 RETURN_BAD_RESULT("None of vertices bound");
845 if ( v1b.IsSame( v1e1 )) {
846 v1n = v0e1; e1n = edges1.First(); e1b = edges1.Last();
848 v1n = v1e1; e1b = edges1.First(); e1n = edges1.Last();
850 InsertAssociation( e0b, e1b, theMap, bidirect );
851 InsertAssociation( e0n, e1n, theMap, bidirect );
852 InsertAssociation( v0n, v1n, theMap, bidirect );
853 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( e0b )<<
854 " to " << theMesh2->GetMeshDS()->ShapeToIndex( e1b ));
855 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( e0n )<<
856 " to " << theMesh2->GetMeshDS()->ShapeToIndex( e1n ));
857 MESSAGE("Assoc vertex " << theMesh1->GetMeshDS()->ShapeToIndex( v0n )<<
858 " to " << theMesh2->GetMeshDS()->ShapeToIndex( v1n ));
859 v2e[0].UnBind( V[0] );
860 v2e[1].UnBind( V[1] );
865 RETURN_BAD_RESULT("Not implemented");
868 } //while ( !v2e[0].IsEmpty() )
873 RETURN_BAD_RESULT("Unexpected shape type");
875 } // end switch by shape type
876 } // end case of available initial vertex association
878 //======================================================================
879 // NO INITIAL VERTEX ASSOCIATION
880 //======================================================================
882 switch ( theShape1.ShapeType() ) {
885 // ----------------------------------------------------------------------
886 TopoDS_Edge edge1 = TopoDS::Edge( theShape1 );
887 TopoDS_Edge edge2 = TopoDS::Edge( theShape2 );
888 if ( IsPropagationPossible( theMesh1, theMesh2 ))
890 TopoDS_Edge prpEdge = GetPropagationEdge( theMesh1, edge2, edge1 ).second;
891 if ( !prpEdge.IsNull() )
893 TopoDS_Vertex VV1[2], VV2[2];
894 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
895 TopExp::Vertices( prpEdge, VV2[0], VV2[1], true );
896 InsertAssociation( VV1[ 0 ], VV2[ 0 ], theMap, bidirect);
897 InsertAssociation( VV1[ 1 ], VV2[ 1 ], theMap, bidirect);
898 if ( VV1[0].IsSame( VV1[1] ) || // one of edges is closed
899 VV2[0].IsSame( VV2[1] ) )
901 InsertAssociation( edge1, prpEdge, theMap, bidirect); // insert with a proper orientation
903 InsertAssociation( theShape1, theShape2, theMap, bidirect );
907 if ( IsClosedEdge( edge1 ) && IsClosedEdge( edge2 ))
909 // TODO: find out a proper orientation (is it possible?)
910 InsertAssociation( edge1, edge2, theMap, bidirect); // insert with a proper orientation
911 InsertAssociation( TopExp::FirstVertex(edge1), TopExp::FirstVertex(edge2),
913 InsertAssociation( theShape1, theShape2, theMap, bidirect );
916 break; // try by vertex closeness
920 // ----------------------------------------------------------------------
921 if ( IsPropagationPossible( theMesh1, theMesh2 )) // try by propagation in one mesh
923 TopoDS_Face face1 = TopoDS::Face(theShape1);
924 TopoDS_Face face2 = TopoDS::Face(theShape2);
925 TopoDS_Edge edge1, edge2;
926 // get outer edge of theShape1
927 edge1 = TopoDS::Edge( OuterShape( face1, TopAbs_EDGE ));
928 // find out if any edge of face2 is a propagation edge of outer edge1
929 map<int,TopoDS_Edge> propag_edges; // use map to find the closest propagation edge
930 for ( TopExp_Explorer exp( face2, TopAbs_EDGE ); exp.More(); exp.Next() ) {
931 edge2 = TopoDS::Edge( exp.Current() );
932 pair<int,TopoDS_Edge> step_edge = GetPropagationEdge( theMesh1, edge2, edge1 );
933 if ( !step_edge.second.IsNull() ) { // propagation found
934 propag_edges.insert( step_edge );
935 if ( step_edge.first == 1 ) break; // most close found
938 if ( !propag_edges.empty() ) // propagation found
940 edge2 = propag_edges.begin()->second;
941 TopoDS_Vertex VV1[2], VV2[2];
942 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
943 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
944 list< TopoDS_Edge > edges1, edges2;
945 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
946 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
947 if ( nbE == 2 ) // only 2 edges
949 // take care of proper association of propagated edges
950 bool same1 = edge1.IsSame( edges1.front() );
951 bool same2 = edge2.IsSame( edges2.front() );
952 if ( same1 != same2 )
953 Reverse(edges2, nbE);
956 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
957 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
958 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
960 InsertAssociation( *eIt1, *eIt2, theMap, bidirect);
961 VV1[0] = TopExp::FirstVertex( *eIt1, true );
962 VV2[0] = TopExp::FirstVertex( *eIt2, true );
963 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
965 InsertAssociation( theShape1, theShape2, theMap, bidirect );
969 break; // try by vertex closeness
971 case TopAbs_COMPOUND: {
972 // ----------------------------------------------------------------------
973 if ( IsPropagationPossible( theMesh1, theMesh2 )) {
975 // try to accosiate all using propagation
976 if ( AssocGroupsByPropagation( theShape1, theShape2, *theMesh1, theMap ))
979 // find a boundary edge for theShape1
981 for(TopExp_Explorer exp(theShape1, TopAbs_EDGE); exp.More(); exp.Next() ) {
982 E = TopoDS::Edge( exp.Current() );
983 if ( IsBoundaryEdge( E, theShape1, *theMesh1 ))
989 break; // try by vertex closeness
991 // find association for vertices of edge E
992 TopoDS_Vertex VV1[2], VV2[2];
993 for(TopExp_Explorer eexp(E, TopAbs_VERTEX); eexp.More(); eexp.Next()) {
994 TopoDS_Vertex V1 = TopoDS::Vertex( eexp.Current() );
995 // look for an edge ending in E whose one vertex is in theShape1
996 // and the other, in theShape2
997 const TopTools_ListOfShape& Ancestors = theMesh1->GetAncestors(V1);
998 TopTools_ListIteratorOfListOfShape ita(Ancestors);
999 for(; ita.More(); ita.Next()) {
1000 if( ita.Value().ShapeType() != TopAbs_EDGE ) continue;
1001 TopoDS_Edge edge = TopoDS::Edge(ita.Value());
1002 bool FromShape1 = false;
1003 for(TopExp_Explorer expe(theShape1, TopAbs_EDGE); expe.More(); expe.Next() ) {
1004 if(edge.IsSame(expe.Current())) {
1010 // is it an edge between theShape1 and theShape2?
1011 TopExp_Explorer expv(edge, TopAbs_VERTEX);
1012 TopoDS_Vertex V2 = TopoDS::Vertex( expv.Current() );
1015 V2 = TopoDS::Vertex( expv.Current() );
1017 bool FromShape2 = false;
1018 for ( expv.Init( theShape2, TopAbs_VERTEX ); expv.More(); expv.Next()) {
1019 if ( V2.IsSame( expv.Current() )) {
1025 if ( VV1[0].IsNull() )
1026 VV1[0] = V1, VV2[0] = V2;
1028 VV1[1] = V1, VV2[1] = V2;
1029 break; // from loop on ancestors of V1
1034 if ( !VV1[1].IsNull() ) {
1035 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
1036 InsertAssociation( VV1[1], VV2[1], theMap, bidirect);
1037 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap);
1040 break; // try by vertex closeness
1045 // Find association by closeness of vertices
1046 // ------------------------------------------
1048 TopTools_IndexedMapOfShape vMap1, vMap2;
1049 TopExp::MapShapes( theShape1, TopAbs_VERTEX, vMap1 );
1050 TopExp::MapShapes( theShape2, TopAbs_VERTEX, vMap2 );
1052 if ( vMap1.Extent() != vMap2.Extent() )
1053 RETURN_BAD_RESULT("Different nb of vertices");
1055 if ( vMap1.Extent() == 1 ) {
1056 InsertAssociation( vMap1(1), vMap2(1), theMap, bidirect);
1057 if ( theShape1.ShapeType() == TopAbs_EDGE ) {
1058 InsertAssociation( theShape1, theShape2, theMap, bidirect );
1061 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap);
1064 // Find transformation to make the shapes be of similar size at same location
1067 for ( int i = 1; i <= vMap1.Extent(); ++i ) {
1068 box[ 0 ].Add( BRep_Tool::Pnt ( TopoDS::Vertex( vMap1( i ))));
1069 box[ 1 ].Add( BRep_Tool::Pnt ( TopoDS::Vertex( vMap2( i ))));
1072 gp_Pnt gc[2]; // box center
1073 double x0,y0,z0, x1,y1,z1;
1074 box[0].Get( x0,y0,z0, x1,y1,z1 );
1075 gc[0] = 0.5 * ( gp_XYZ( x0,y0,z0 ) + gp_XYZ( x1,y1,z1 ));
1076 box[1].Get( x0,y0,z0, x1,y1,z1 );
1077 gc[1] = 0.5 * ( gp_XYZ( x0,y0,z0 ) + gp_XYZ( x1,y1,z1 ));
1080 gp_Vec vec01( gc[0], gc[1] );
1081 double scale = sqrt( box[1].SquareExtent() / box[0].SquareExtent() );
1083 // Find 2 closest vertices
1085 TopoDS_Vertex VV1[2], VV2[2];
1086 // get 2 linked vertices of shape 1 not belonging to an inner wire of a face
1087 TopoDS_Shape edge = theShape1;
1088 TopExp_Explorer expF( theShape1, TopAbs_FACE ), expE;
1089 if ( expF.More() ) {
1090 for ( ; expF.More(); expF.Next() ) {
1092 TopoDS_Shape wire = OuterShape( TopoDS::Face( expF.Current() ), TopAbs_WIRE );
1093 for ( expE.Init( wire, TopAbs_EDGE ); edge.IsNull() && expE.More(); expE.Next() )
1094 if ( !IsClosedEdge( TopoDS::Edge( expE.Current() )))
1095 edge = expE.Current();
1096 if ( !edge.IsNull() )
1099 } else if (edge.ShapeType() != TopAbs_EDGE) { // no faces
1101 for ( expE.Init( theShape1, TopAbs_EDGE ); edge.IsNull() && expE.More(); expE.Next() )
1102 if ( !IsClosedEdge( TopoDS::Edge( expE.Current() )))
1103 edge = expE.Current();
1105 if ( edge.IsNull() || edge.ShapeType() != TopAbs_EDGE )
1106 RETURN_BAD_RESULT("Edge not found");
1108 TopExp::Vertices( TopoDS::Edge( edge ), VV1[0], VV1[1]);
1109 if ( VV1[0].IsSame( VV1[1] ))
1110 RETURN_BAD_RESULT("Only closed edges");
1112 // find vertices closest to 2 linked vertices of shape 1
1113 for ( int i1 = 0; i1 < 2; ++i1 )
1115 double dist2 = DBL_MAX;
1116 gp_Pnt p1 = BRep_Tool::Pnt( VV1[ i1 ]);
1117 p1.Translate( vec01 );
1118 p1.Scale( gc[1], scale );
1119 for ( int i2 = 1; i2 <= vMap2.Extent(); ++i2 )
1121 TopoDS_Vertex V2 = TopoDS::Vertex( vMap2( i2 ));
1122 gp_Pnt p2 = BRep_Tool::Pnt ( V2 );
1123 double d2 = p1.SquareDistance( p2 );
1124 if ( d2 < dist2 && !V2.IsSame( VV2[ 0 ])) {
1125 VV2[ i1 ] = V2; dist2 = d2;
1130 InsertAssociation( VV1[ 0 ], VV2[ 0 ], theMap, bidirect);
1131 InsertAssociation( VV1[ 1 ], VV2[ 1 ], theMap, bidirect);
1132 MESSAGE("Initial assoc VERT " << theMesh1->GetMeshDS()->ShapeToIndex( VV1[ 0 ] )<<
1133 " to " << theMesh2->GetMeshDS()->ShapeToIndex( VV2[ 0 ] )<<
1134 "\nand VERT " << theMesh1->GetMeshDS()->ShapeToIndex( VV1[ 1 ] )<<
1135 " to " << theMesh2->GetMeshDS()->ShapeToIndex( VV2[ 1 ] ));
1136 if ( theShape1.ShapeType() == TopAbs_EDGE ) {
1137 InsertAssociation( theShape1, theShape2, theMap, bidirect );
1141 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap );
1144 //================================================================================
1146 * \brief Find association of edges of faces
1147 * \param face1 - face 1
1148 * \param VV1 - vertices of face 1
1149 * \param face2 - face 2
1150 * \param VV2 - vertices of face 2 associated with ones of face 1
1151 * \param edges1 - out list of edges of face 1
1152 * \param edges2 - out list of edges of face 2
1153 * \retval int - nb of edges in an outer wire in a success case, else zero
1155 //================================================================================
1157 int StdMeshers_ProjectionUtils::FindFaceAssociation(const TopoDS_Face& face1,
1158 TopoDS_Vertex VV1[2],
1159 const TopoDS_Face& face2,
1160 TopoDS_Vertex VV2[2],
1161 list< TopoDS_Edge > & edges1,
1162 list< TopoDS_Edge > & edges2)
1164 list< int > nbVInW1, nbVInW2;
1165 for ( int outer_wire_algo = 0; outer_wire_algo < 2; ++outer_wire_algo )
1170 if ( SMESH_Block::GetOrderedEdges( face1, VV1[0], edges1, nbVInW1, outer_wire_algo) !=
1171 SMESH_Block::GetOrderedEdges( face2, VV2[0], edges2, nbVInW2, outer_wire_algo) )
1172 CONT_BAD_RESULT("Different number of wires in faces ");
1174 if ( nbVInW1.front() != nbVInW2.front() )
1175 CONT_BAD_RESULT("Different number of edges in faces: " <<
1176 nbVInW1.front() << " != " << nbVInW2.front());
1178 // Define if we need to reverse one of wires to make edges in lists match each other
1180 bool reverse = false;
1182 list< TopoDS_Edge >::iterator edgeIt;
1183 if ( !VV1[1].IsSame( TopExp::LastVertex( edges1.front(), true ))) {
1185 edgeIt = --edges1.end();
1186 // check if the second vertex belongs to the first or last edge in the wire
1187 if ( !VV1[1].IsSame( TopExp::FirstVertex( *edgeIt, true ))) {
1188 bool KO = true; // belongs to none
1189 if ( nbVInW1.size() > 1 ) { // several wires
1190 edgeIt = edges1.begin();
1191 for ( int i = 1; i < nbVInW1.front(); ++i ) ++edgeIt;
1192 KO = !VV1[1].IsSame( TopExp::FirstVertex( *edgeIt, true ));
1195 CONT_BAD_RESULT("GetOrderedEdges() failed");
1198 edgeIt = --edges2.end();
1199 if ( !VV2[1].IsSame( TopExp::LastVertex( edges2.front(), true ))) {
1201 // check if the second vertex belongs to the first or last edge in the wire
1202 if ( !VV2[1].IsSame( TopExp::FirstVertex( *edgeIt, true ))) {
1203 bool KO = true; // belongs to none
1204 if ( nbVInW2.size() > 1 ) { // several wires
1205 edgeIt = edges2.begin();
1206 for ( int i = 1; i < nbVInW2.front(); ++i ) ++edgeIt;
1207 KO = !VV2[1].IsSame( TopExp::FirstVertex( *edgeIt, true ));
1210 CONT_BAD_RESULT("GetOrderedEdges() failed");
1215 Reverse( edges2 , nbVInW2.front());
1216 if (( VV1[1].IsSame( TopExp::LastVertex( edges1.front(), true ))) !=
1217 ( VV2[1].IsSame( TopExp::LastVertex( edges2.front(), true ))))
1218 CONT_BAD_RESULT("GetOrderedEdges() failed");
1221 return nbVInW2.front();
1224 //=======================================================================
1225 //function : InitVertexAssociation
1227 //=======================================================================
1229 void StdMeshers_ProjectionUtils::InitVertexAssociation( const SMESH_Hypothesis* theHyp,
1230 TShapeShapeMap & theAssociationMap,
1231 const TopoDS_Shape& theTargetShape)
1233 string hypName = theHyp->GetName();
1234 if ( hypName == "ProjectionSource1D" ) {
1235 const StdMeshers_ProjectionSource1D * hyp =
1236 static_cast<const StdMeshers_ProjectionSource1D*>( theHyp );
1237 if ( hyp->HasVertexAssociation() )
1238 InsertAssociation( hyp->GetSourceVertex(),hyp->GetTargetVertex(),theAssociationMap);
1240 else if ( hypName == "ProjectionSource2D" ) {
1241 const StdMeshers_ProjectionSource2D * hyp =
1242 static_cast<const StdMeshers_ProjectionSource2D*>( theHyp );
1243 if ( hyp->HasVertexAssociation() ) {
1244 InsertAssociation( hyp->GetSourceVertex(1),hyp->GetTargetVertex(1),theAssociationMap);
1245 InsertAssociation( hyp->GetSourceVertex(2),hyp->GetTargetVertex(2),theAssociationMap);
1248 else if ( hypName == "ProjectionSource3D" ) {
1249 const StdMeshers_ProjectionSource3D * hyp =
1250 static_cast<const StdMeshers_ProjectionSource3D*>( theHyp );
1251 if ( hyp->HasVertexAssociation() ) {
1252 InsertAssociation( hyp->GetSourceVertex(1),hyp->GetTargetVertex(1),theAssociationMap);
1253 InsertAssociation( hyp->GetSourceVertex(2),hyp->GetTargetVertex(2),theAssociationMap);
1258 //=======================================================================
1260 * \brief Inserts association theShape1 <-> theShape2 to TShapeShapeMap
1261 * \param theShape1 - shape 1
1262 * \param theShape2 - shape 2
1263 * \param theAssociationMap - association map
1264 * \retval bool - true if there was no association for these shapes before
1266 //=======================================================================
1268 bool StdMeshers_ProjectionUtils::InsertAssociation( const TopoDS_Shape& theShape1,
1269 const TopoDS_Shape& theShape2,
1270 TShapeShapeMap & theAssociationMap,
1271 const bool theBidirectional)
1273 if ( !theShape1.IsNull() && !theShape2.IsNull() ) {
1274 SHOW_VERTEX(theShape1,"Assoc ");
1275 SHOW_VERTEX(theShape2," to ");
1276 bool isNew = ( theAssociationMap.Bind( theShape1, theShape2 ));
1277 if ( theBidirectional )
1278 theAssociationMap.Bind( theShape2, theShape1 );
1282 throw SALOME_Exception("StdMeshers_ProjectionUtils: attempt to associate NULL shape");
1287 //=======================================================================
1289 * \brief Finds an edge by its vertices in a main shape of the mesh
1290 * \param aMesh - the mesh
1291 * \param V1 - vertex 1
1292 * \param V2 - vertex 2
1293 * \retval TopoDS_Edge - found edge
1295 //=======================================================================
1297 TopoDS_Edge StdMeshers_ProjectionUtils::GetEdgeByVertices( SMESH_Mesh* theMesh,
1298 const TopoDS_Vertex& theV1,
1299 const TopoDS_Vertex& theV2)
1301 if ( theMesh && !theV1.IsNull() && !theV2.IsNull() )
1303 TopTools_ListIteratorOfListOfShape ancestorIt( theMesh->GetAncestors( theV1 ));
1304 for ( ; ancestorIt.More(); ancestorIt.Next() )
1305 if ( ancestorIt.Value().ShapeType() == TopAbs_EDGE )
1306 for ( TopExp_Explorer expV ( ancestorIt.Value(), TopAbs_VERTEX );
1309 if ( theV2.IsSame( expV.Current() ))
1310 return TopoDS::Edge( ancestorIt.Value() );
1312 return TopoDS_Edge();
1315 //================================================================================
1317 * \brief Return another face sharing an edge
1318 * \param edgeToFaces - data map of descendants to ancestors
1319 * \param edge - edge
1320 * \param face - face
1321 * \retval TopoDS_Face - found face
1323 //================================================================================
1325 TopoDS_Face StdMeshers_ProjectionUtils::GetNextFace( const TAncestorMap& edgeToFaces,
1326 const TopoDS_Edge& edge,
1327 const TopoDS_Face& face)
1329 // if ( !edge.IsNull() && !face.IsNull() && edgeToFaces.Contains( edge ))
1330 if ( !edge.IsNull() && edgeToFaces.Contains( edge )) // PAL16202
1332 TopTools_ListIteratorOfListOfShape ancestorIt( edgeToFaces.FindFromKey( edge ));
1333 for ( ; ancestorIt.More(); ancestorIt.Next() )
1334 if ( ancestorIt.Value().ShapeType() == TopAbs_FACE &&
1335 !face.IsSame( ancestorIt.Value() ))
1336 return TopoDS::Face( ancestorIt.Value() );
1338 return TopoDS_Face();
1341 //================================================================================
1343 * \brief Return other vertex of an edge
1345 //================================================================================
1347 TopoDS_Vertex StdMeshers_ProjectionUtils::GetNextVertex(const TopoDS_Edge& edge,
1348 const TopoDS_Vertex& vertex)
1350 TopoDS_Vertex vF,vL;
1351 TopExp::Vertices(edge,vF,vL);
1352 if ( vF.IsSame( vL ))
1353 return TopoDS_Vertex();
1354 return vertex.IsSame( vF ) ? vL : vF;
1357 //================================================================================
1359 * \brief Return a propagation edge
1360 * \param aMesh - mesh
1361 * \param theEdge - edge to find by propagation
1362 * \param fromEdge - start edge for propagation
1363 * \retval pair<int,TopoDS_Edge> - propagation step and found edge
1365 //================================================================================
1367 pair<int,TopoDS_Edge>
1368 StdMeshers_ProjectionUtils::GetPropagationEdge( SMESH_Mesh* aMesh,
1369 const TopoDS_Edge& theEdge,
1370 const TopoDS_Edge& fromEdge)
1372 SMESH_IndexedMapOfShape aChain;
1375 // List of edges, added to chain on the previous cycle pass
1376 TopTools_ListOfShape listPrevEdges;
1377 listPrevEdges.Append(fromEdge);
1379 // Collect all edges pass by pass
1380 while (listPrevEdges.Extent() > 0) {
1382 // List of edges, added to chain on this cycle pass
1383 TopTools_ListOfShape listCurEdges;
1385 // Find the next portion of edges
1386 TopTools_ListIteratorOfListOfShape itE (listPrevEdges);
1387 for (; itE.More(); itE.Next()) {
1388 TopoDS_Shape anE = itE.Value();
1390 // Iterate on faces, having edge <anE>
1391 TopTools_ListIteratorOfListOfShape itA (aMesh->GetAncestors(anE));
1392 for (; itA.More(); itA.Next()) {
1393 TopoDS_Shape aW = itA.Value();
1395 // There are objects of different type among the ancestors of edge
1396 if (aW.ShapeType() == TopAbs_WIRE) {
1397 TopoDS_Shape anOppE;
1399 BRepTools_WireExplorer aWE (TopoDS::Wire(aW));
1400 Standard_Integer nb = 1, found = 0;
1401 TopTools_Array1OfShape anEdges (1,4);
1402 for (; aWE.More(); aWE.Next(), nb++) {
1407 anEdges(nb) = aWE.Current();
1408 if (anEdges(nb).IsSame(anE)) found = nb;
1411 if (nb == 5 && found > 0) {
1412 // Quadrangle face found, get an opposite edge
1413 Standard_Integer opp = found + 2;
1414 if (opp > 4) opp -= 4;
1415 anOppE = anEdges(opp);
1417 // add anOppE to aChain if ...
1418 if (!aChain.Contains(anOppE)) { // ... anOppE is not in aChain
1419 // Add found edge to the chain oriented so that to
1420 // have it co-directed with a forward MainEdge
1421 TopAbs_Orientation ori = anE.Orientation();
1422 if ( anEdges(opp).Orientation() == anEdges(found).Orientation() )
1423 ori = TopAbs::Reverse( ori );
1424 anOppE.Orientation( ori );
1425 if ( anOppE.IsSame( theEdge ))
1426 return make_pair( step, TopoDS::Edge( anOppE ));
1428 listCurEdges.Append(anOppE);
1430 } // if (nb == 5 && found > 0)
1431 } // if (aF.ShapeType() == TopAbs_WIRE)
1432 } // for (; itF.More(); itF.Next())
1433 } // for (; itE.More(); itE.Next())
1435 listPrevEdges = listCurEdges;
1436 } // while (listPrevEdges.Extent() > 0)
1438 return make_pair( INT_MAX, TopoDS_Edge());
1441 //================================================================================
1443 * \brief Find corresponding nodes on two faces
1444 * \param face1 - the first face
1445 * \param mesh1 - mesh containing elements on the first face
1446 * \param face2 - the second face
1447 * \param mesh2 - mesh containing elements on the second face
1448 * \param assocMap - map associating subshapes of the faces
1449 * \param node1To2Map - map containing found matching nodes
1450 * \retval bool - is a success
1452 //================================================================================
1454 bool StdMeshers_ProjectionUtils::
1455 FindMatchingNodesOnFaces( const TopoDS_Face& face1,
1457 const TopoDS_Face& face2,
1459 const TShapeShapeMap & assocMap,
1460 TNodeNodeMap & node1To2Map)
1462 SMESHDS_Mesh* meshDS1 = mesh1->GetMeshDS();
1463 SMESHDS_Mesh* meshDS2 = mesh2->GetMeshDS();
1465 SMESH_MesherHelper helper1( *mesh1 );
1466 SMESH_MesherHelper helper2( *mesh2 );
1468 // Get corresponding submeshes and roughly check match of meshes
1470 SMESHDS_SubMesh * SM2 = meshDS2->MeshElements( face2 );
1471 SMESHDS_SubMesh * SM1 = meshDS1->MeshElements( face1 );
1473 RETURN_BAD_RESULT("Empty submeshes");
1474 if ( SM2->NbNodes() != SM1->NbNodes() ||
1475 SM2->NbElements() != SM1->NbElements() )
1476 RETURN_BAD_RESULT("Different meshes on corresponding faces "
1477 << meshDS1->ShapeToIndex( face1 ) << " and "
1478 << meshDS2->ShapeToIndex( face2 ));
1479 if ( SM2->NbElements() == 0 )
1480 RETURN_BAD_RESULT("Empty submeshes");
1482 helper1.SetSubShape( face1 );
1483 helper2.SetSubShape( face2 );
1484 if ( helper1.HasSeam() != helper2.HasSeam() )
1485 RETURN_BAD_RESULT("Different faces' geometry");
1487 // Data to call SMESH_MeshEditor::FindMatchingNodes():
1489 // 1. Nodes of corresponding links:
1491 // get 2 matching edges, try to find not seam ones
1492 TopoDS_Edge edge1, edge2, seam1, seam2, anyEdge1, anyEdge2;
1493 TopExp_Explorer eE( OuterShape( face2, TopAbs_WIRE ), TopAbs_EDGE );
1496 TopoDS_Edge e2 = TopoDS::Edge( eE.Current() );
1499 if ( !assocMap.IsBound( e2 ))
1500 RETURN_BAD_RESULT("Association not found for edge " << meshDS2->ShapeToIndex( e2 ));
1501 TopoDS_Edge e1 = TopoDS::Edge( assocMap( e2 ));
1502 if ( !helper1.IsSubShape( e1, face1 ))
1503 RETURN_BAD_RESULT("Wrong association, edge " << meshDS1->ShapeToIndex( e1 ) <<
1504 " isn't a subshape of face " << meshDS1->ShapeToIndex( face1 ));
1505 // check that there are nodes on edges
1506 SMESHDS_SubMesh * eSM1 = meshDS1->MeshElements( e1 );
1507 SMESHDS_SubMesh * eSM2 = meshDS2->MeshElements( e2 );
1508 bool nodesOnEdges = ( eSM1 && eSM2 && eSM1->NbNodes() && eSM2->NbNodes() );
1509 // check that the nodes on edges belong to faces
1510 // (as NETGEN ignores nodes on the degenerated geom edge)
1511 bool nodesOfFaces = false;
1512 if ( nodesOnEdges ) {
1513 const SMDS_MeshNode* n1 = eSM1->GetNodes()->next();
1514 const SMDS_MeshNode* n2 = eSM2->GetNodes()->next();
1515 nodesOfFaces = ( n1->GetInverseElementIterator(SMDSAbs_Face)->more() &&
1516 n2->GetInverseElementIterator(SMDSAbs_Face)->more() );
1520 if ( helper2.IsRealSeam( e2 )) {
1521 seam1 = e1; seam2 = e2;
1524 edge1 = e1; edge2 = e2;
1528 anyEdge1 = e1; anyEdge2 = e2;
1530 } while ( edge2.IsNull() && eE.More() );
1532 if ( edge2.IsNull() ) {
1533 edge1 = seam1; edge2 = seam2;
1535 bool hasNodesOnEdge = (! edge2.IsNull() );
1536 if ( !hasNodesOnEdge ) {
1537 // 0020338 - nb segments == 1
1538 edge1 = anyEdge1; edge2 = anyEdge2;
1541 // get 2 matching vertices
1542 TopoDS_Vertex V2 = TopExp::FirstVertex( TopoDS::Edge( edge2 ));
1543 if ( !assocMap.IsBound( V2 ))
1544 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
1545 TopoDS_Vertex V1 = TopoDS::Vertex( assocMap( V2 ));
1547 // nodes on vertices
1548 const SMDS_MeshNode* vNode1 = SMESH_Algo::VertexNode( V1, meshDS1 );
1549 const SMDS_MeshNode* vNode2 = SMESH_Algo::VertexNode( V2, meshDS2 );
1550 if ( !vNode1 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
1551 if ( !vNode2 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
1553 // nodes on edges linked with nodes on vertices
1554 const SMDS_MeshNode* nullNode = 0;
1555 vector< const SMDS_MeshNode*> eNode1( 2, nullNode );
1556 vector< const SMDS_MeshNode*> eNode2( 2, nullNode );
1557 if ( hasNodesOnEdge )
1559 int nbNodeToGet = 1;
1560 if ( IsClosedEdge( edge1 ) || IsClosedEdge( edge2 ) )
1562 for ( int is2 = 0; is2 < 2; ++is2 )
1564 TopoDS_Edge & edge = is2 ? edge2 : edge1;
1565 SMESHDS_Mesh * smDS = is2 ? meshDS2 : meshDS1;
1566 SMESHDS_SubMesh* edgeSM = smDS->MeshElements( edge );
1567 // nodes linked with ones on vertices
1568 const SMDS_MeshNode* vNode = is2 ? vNode2 : vNode1;
1569 vector< const SMDS_MeshNode*>& eNode = is2 ? eNode2 : eNode1;
1571 SMDS_ElemIteratorPtr vElem = vNode->GetInverseElementIterator(SMDSAbs_Edge);
1572 while ( vElem->more() && nbGotNode != nbNodeToGet ) {
1573 const SMDS_MeshElement* elem = vElem->next();
1574 if ( edgeSM->Contains( elem ))
1575 eNode[ nbGotNode++ ] =
1576 ( elem->GetNode(0) == vNode ) ? elem->GetNode(1) : elem->GetNode(0);
1578 if ( nbGotNode > 1 ) // sort found nodes by param on edge
1580 SMESH_MesherHelper* helper = is2 ? &helper2 : &helper1;
1581 double u0 = helper->GetNodeU( edge, eNode[ 0 ]);
1582 double u1 = helper->GetNodeU( edge, eNode[ 1 ]);
1583 if ( u0 > u1 ) std::swap( eNode[ 0 ], eNode[ 1 ]);
1585 if ( nbGotNode == 0 )
1586 RETURN_BAD_RESULT("Found no nodes on edge " << smDS->ShapeToIndex( edge ) <<
1587 " linked to " << vNode );
1590 else // 0020338 - nb segments == 1
1592 // get 2 other matching vertices
1593 V2 = TopExp::LastVertex( TopoDS::Edge( edge2 ));
1594 if ( !assocMap.IsBound( V2 ))
1595 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
1596 V1 = TopoDS::Vertex( assocMap( V2 ));
1598 // nodes on vertices
1599 eNode1[0] = SMESH_Algo::VertexNode( V1, meshDS1 );
1600 eNode2[0] = SMESH_Algo::VertexNode( V2, meshDS2 );
1601 if ( !eNode1[0] ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
1602 if ( !eNode2[0] ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
1607 set<const SMDS_MeshElement*> Elems1, Elems2;
1608 for ( int is2 = 0; is2 < 2; ++is2 )
1610 set<const SMDS_MeshElement*> & elems = is2 ? Elems2 : Elems1;
1611 SMESHDS_SubMesh* sm = is2 ? SM2 : SM1;
1612 SMESH_MesherHelper* helper = is2 ? &helper2 : &helper1;
1613 const TopoDS_Face & face = is2 ? face2 : face1;
1614 SMDS_ElemIteratorPtr eIt = sm->GetElements();
1616 if ( !helper->IsRealSeam( is2 ? edge2 : edge1 ))
1618 while ( eIt->more() ) elems.insert( eIt->next() );
1622 // the only suitable edge is seam, i.e. it is a sphere.
1623 // FindMatchingNodes() will not know which way to go from any edge.
1624 // So we ignore all faces having nodes on edges or vertices except
1625 // one of faces sharing current start nodes
1627 // find a face to keep
1628 const SMDS_MeshElement* faceToKeep = 0;
1629 const SMDS_MeshNode* vNode = is2 ? vNode2 : vNode1;
1630 const SMDS_MeshNode* eNode = is2 ? eNode2[0] : eNode1[0];
1631 TIDSortedElemSet inSet, notInSet;
1633 const SMDS_MeshElement* f1 =
1634 SMESH_MeshEditor::FindFaceInSet( vNode, eNode, inSet, notInSet );
1635 if ( !f1 ) RETURN_BAD_RESULT("The first face on seam not found");
1636 notInSet.insert( f1 );
1638 const SMDS_MeshElement* f2 =
1639 SMESH_MeshEditor::FindFaceInSet( vNode, eNode, inSet, notInSet );
1640 if ( !f2 ) RETURN_BAD_RESULT("The second face on seam not found");
1642 // select a face with less UV of vNode
1643 const SMDS_MeshNode* notSeamNode[2] = {0, 0};
1644 for ( int iF = 0; iF < 2; ++iF ) {
1645 const SMDS_MeshElement* f = ( iF ? f2 : f1 );
1646 for ( int i = 0; !notSeamNode[ iF ] && i < f->NbNodes(); ++i ) {
1647 const SMDS_MeshNode* node = f->GetNode( i );
1648 if ( !helper->IsSeamShape( node->GetPosition()->GetShapeId() ))
1649 notSeamNode[ iF ] = node;
1652 gp_Pnt2d uv1 = helper->GetNodeUV( face, vNode, notSeamNode[0] );
1653 gp_Pnt2d uv2 = helper->GetNodeUV( face, vNode, notSeamNode[1] );
1654 if ( uv1.X() + uv1.Y() > uv2.X() + uv2.Y() )
1660 elems.insert( faceToKeep );
1661 while ( eIt->more() ) {
1662 const SMDS_MeshElement* f = eIt->next();
1663 int nbNodes = f->NbNodes();
1664 if ( f->IsQuadratic() )
1667 for ( int i = 0; !onBnd && i < nbNodes; ++i ) {
1668 const SMDS_MeshNode* node = f->GetNode( i );
1669 onBnd = ( node->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE);
1674 // add also faces adjacent to faceToKeep
1675 int nbNodes = faceToKeep->NbNodes();
1676 if ( faceToKeep->IsQuadratic() ) nbNodes /= 2;
1677 notInSet.insert( f1 );
1678 notInSet.insert( f2 );
1679 for ( int i = 0; i < nbNodes; ++i ) {
1680 const SMDS_MeshNode* n1 = faceToKeep->GetNode( i );
1681 const SMDS_MeshNode* n2 = faceToKeep->GetNode( i+1 % nbNodes );
1682 f1 = SMESH_MeshEditor::FindFaceInSet( n1, n2, inSet, notInSet );
1686 } // case on a sphere
1687 } // loop on 2 faces
1689 // int quadFactor = (*Elems1.begin())->IsQuadratic() ? 2 : 1;
1691 node1To2Map.clear();
1692 int res = SMESH_MeshEditor::FindMatchingNodes( Elems1, Elems2,
1694 eNode1[0], eNode2[0],
1696 if ( res != SMESH_MeshEditor::SEW_OK )
1697 RETURN_BAD_RESULT("FindMatchingNodes() result " << res );
1699 // On a sphere, add matching nodes on the edge
1701 if ( helper1.IsRealSeam( edge1 ))
1703 // sort nodes on edges by param on edge
1704 map< double, const SMDS_MeshNode* > u2nodesMaps[2];
1705 for ( int is2 = 0; is2 < 2; ++is2 )
1707 TopoDS_Edge & edge = is2 ? edge2 : edge1;
1708 SMESHDS_Mesh * smDS = is2 ? meshDS2 : meshDS1;
1709 SMESHDS_SubMesh* edgeSM = smDS->MeshElements( edge );
1710 map< double, const SMDS_MeshNode* > & pos2nodes = u2nodesMaps[ is2 ];
1712 SMDS_NodeIteratorPtr nIt = edgeSM->GetNodes();
1713 while ( nIt->more() ) {
1714 const SMDS_MeshNode* node = nIt->next();
1715 const SMDS_EdgePosition* pos =
1716 static_cast<const SMDS_EdgePosition*>(node->GetPosition().get());
1717 pos2nodes.insert( make_pair( pos->GetUParameter(), node ));
1719 if ( pos2nodes.size() != edgeSM->NbNodes() )
1720 RETURN_BAD_RESULT("Equal params of nodes on edge "
1721 << smDS->ShapeToIndex( edge ) << " of face " << is2 );
1723 if ( u2nodesMaps[0].size() != u2nodesMaps[1].size() )
1724 RETURN_BAD_RESULT("Different nb of new nodes on edges or wrong params");
1726 // compare edge orientation
1727 double u1 = helper1.GetNodeU( edge1, vNode1 );
1728 double u2 = helper2.GetNodeU( edge2, vNode2 );
1729 bool isFirst1 = ( u1 < u2nodesMaps[0].begin()->first );
1730 bool isFirst2 = ( u2 < u2nodesMaps[1].begin()->first );
1731 bool reverse ( isFirst1 != isFirst2 );
1733 // associate matching nodes
1734 map< double, const SMDS_MeshNode* >::iterator u_Node1, u_Node2, end1;
1735 map< double, const SMDS_MeshNode* >::reverse_iterator uR_Node2;
1736 u_Node1 = u2nodesMaps[0].begin();
1737 u_Node2 = u2nodesMaps[1].begin();
1738 uR_Node2 = u2nodesMaps[1].rbegin();
1739 end1 = u2nodesMaps[0].end();
1740 for ( ; u_Node1 != end1; ++u_Node1 ) {
1741 const SMDS_MeshNode* n1 = u_Node1->second;
1742 const SMDS_MeshNode* n2 = ( reverse ? (uR_Node2++)->second : (u_Node2++)->second );
1743 node1To2Map.insert( make_pair( n1, n2 ));
1746 // associate matching nodes on the last vertices
1747 V2 = TopExp::LastVertex( TopoDS::Edge( edge2 ));
1748 if ( !assocMap.IsBound( V2 ))
1749 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
1750 V1 = TopoDS::Vertex( assocMap( V2 ));
1751 vNode1 = SMESH_Algo::VertexNode( V1, meshDS1 );
1752 vNode2 = SMESH_Algo::VertexNode( V2, meshDS2 );
1753 if ( !vNode1 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
1754 if ( !vNode2 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
1755 node1To2Map.insert( make_pair( vNode1, vNode2 ));
1758 // don't know why this condition is usually true :(
1759 // if ( node1To2Map.size() * quadFactor < SM1->NbNodes() )
1760 // MESSAGE("FindMatchingNodes() found too few node pairs starting from nodes ("
1761 // << vNode1->GetID() << " - " << eNode1[0]->GetID() << ") ("
1762 // << vNode2->GetID() << " - " << eNode2[0]->GetID() << "):"
1763 // << node1To2Map.size() * quadFactor << " < " << SM1->NbNodes());
1768 //================================================================================
1770 * \brief Check if the first and last vertices of an edge are the same
1771 * \param anEdge - the edge to check
1772 * \retval bool - true if same
1774 //================================================================================
1776 bool StdMeshers_ProjectionUtils::IsClosedEdge( const TopoDS_Edge& anEdge )
1778 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
1781 //================================================================================
1783 * \brief Return any subshape of a face belonging to the outer wire
1784 * \param face - the face
1785 * \param type - type of subshape to return
1786 * \retval TopoDS_Shape - the found subshape
1788 //================================================================================
1790 TopoDS_Shape StdMeshers_ProjectionUtils::OuterShape( const TopoDS_Face& face,
1791 TopAbs_ShapeEnum type)
1793 TopExp_Explorer exp( BRepTools::OuterWire( face ), type );
1795 return exp.Current();
1796 return TopoDS_Shape();
1799 //================================================================================
1801 * \brief Check that submesh is computed and try to compute it if is not
1802 * \param sm - submesh to compute
1803 * \param iterationNb - int used to stop infinite recursive call
1804 * \retval bool - true if computed
1806 //================================================================================
1808 bool StdMeshers_ProjectionUtils::MakeComputed(SMESH_subMesh * sm, const int iterationNb)
1810 if ( iterationNb > 10 )
1811 RETURN_BAD_RESULT("Infinite recursive projection");
1813 RETURN_BAD_RESULT("NULL submesh");
1814 if ( sm->IsMeshComputed() )
1817 SMESH_Mesh* mesh = sm->GetFather();
1818 SMESH_Gen* gen = mesh->GetGen();
1819 SMESH_Algo* algo = gen->GetAlgo( *mesh, sm->GetSubShape() );
1822 if ( sm->GetSubShape().ShapeType() != TopAbs_COMPOUND )
1823 RETURN_BAD_RESULT("No algo assigned to submesh " << sm->GetId());
1825 bool computed = true;
1826 for ( TopoDS_Iterator grMember( sm->GetSubShape() ); grMember.More(); grMember.Next())
1827 if ( SMESH_subMesh* grSub = mesh->GetSubMesh( grMember.Value() ))
1828 if ( !MakeComputed( grSub, iterationNb + 1 ))
1833 string algoType = algo->GetName();
1834 if ( algoType.substr(0, 11) != "Projection_")
1835 return gen->Compute( *mesh, sm->GetSubShape() );
1837 // try to compute source mesh
1839 const list <const SMESHDS_Hypothesis *> & hyps =
1840 algo->GetUsedHypothesis( *mesh, sm->GetSubShape() );
1842 TopoDS_Shape srcShape;
1843 SMESH_Mesh* srcMesh = 0;
1844 list <const SMESHDS_Hypothesis*>::const_iterator hIt = hyps.begin();
1845 for ( ; srcShape.IsNull() && hIt != hyps.end(); ++hIt ) {
1846 string hypName = (*hIt)->GetName();
1847 if ( hypName == "ProjectionSource1D" ) {
1848 const StdMeshers_ProjectionSource1D * hyp =
1849 static_cast<const StdMeshers_ProjectionSource1D*>( *hIt );
1850 srcShape = hyp->GetSourceEdge();
1851 srcMesh = hyp->GetSourceMesh();
1853 else if ( hypName == "ProjectionSource2D" ) {
1854 const StdMeshers_ProjectionSource2D * hyp =
1855 static_cast<const StdMeshers_ProjectionSource2D*>( *hIt );
1856 srcShape = hyp->GetSourceFace();
1857 srcMesh = hyp->GetSourceMesh();
1859 else if ( hypName == "ProjectionSource3D" ) {
1860 const StdMeshers_ProjectionSource3D * hyp =
1861 static_cast<const StdMeshers_ProjectionSource3D*>( *hIt );
1862 srcShape = hyp->GetSource3DShape();
1863 srcMesh = hyp->GetSourceMesh();
1866 if ( srcShape.IsNull() ) // no projection source defined
1867 return gen->Compute( *mesh, sm->GetSubShape() );
1869 if ( srcShape.IsSame( sm->GetSubShape() ))
1870 RETURN_BAD_RESULT("Projection from self");
1875 if ( MakeComputed( srcMesh->GetSubMesh( srcShape ), iterationNb + 1 ))
1876 return gen->Compute( *mesh, sm->GetSubShape() );
1881 //================================================================================
1883 * \brief Count nb of subshapes
1884 * \param shape - the shape
1885 * \param type - the type of subshapes to count
1886 * \retval int - the calculated number
1888 //================================================================================
1890 int StdMeshers_ProjectionUtils::Count(const TopoDS_Shape& shape,
1891 const TopAbs_ShapeEnum type,
1892 const bool ignoreSame)
1895 TopTools_IndexedMapOfShape map;
1896 TopExp::MapShapes( shape, type, map );
1897 return map.Extent();
1901 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
1907 //================================================================================
1909 * \brief Return true if edge is a boundary of edgeContainer
1911 //================================================================================
1913 bool StdMeshers_ProjectionUtils::IsBoundaryEdge(const TopoDS_Edge& edge,
1914 const TopoDS_Shape& edgeContainer,
1917 TopTools_IndexedMapOfShape facesOfEdgeContainer, facesNearEdge;
1918 TopExp::MapShapes( edgeContainer, TopAbs_FACE, facesOfEdgeContainer );
1920 const TopTools_ListOfShape& EAncestors = mesh.GetAncestors(edge);
1921 TopTools_ListIteratorOfListOfShape itea(EAncestors);
1922 for(; itea.More(); itea.Next()) {
1923 if( itea.Value().ShapeType() == TopAbs_FACE &&
1924 facesOfEdgeContainer.Contains( itea.Value() ))
1926 facesNearEdge.Add( itea.Value() );
1927 if ( facesNearEdge.Extent() > 1 )
1931 return ( facesNearEdge.Extent() == 1 );
1937 SMESH_subMeshEventListener* GetSrcSubMeshListener();
1939 //================================================================================
1941 * \brief Listener that resets an event listener on source submesh when
1942 * "ProjectionSource*D" hypothesis is modified
1944 //================================================================================
1946 struct HypModifWaiter: SMESH_subMeshEventListener
1948 HypModifWaiter():SMESH_subMeshEventListener(0){} // won't be deleted by submesh
1950 void ProcessEvent(const int event, const int eventType, SMESH_subMesh* subMesh,
1951 EventListenerData*, const SMESH_Hypothesis*)
1953 if ( event == SMESH_subMesh::MODIF_HYP &&
1954 eventType == SMESH_subMesh::ALGO_EVENT)
1956 // delete current source listener
1957 subMesh->DeleteEventListener( GetSrcSubMeshListener() );
1958 // let algo set a new one
1959 SMESH_Gen* gen = subMesh->GetFather()->GetGen();
1960 if ( SMESH_Algo* algo = gen->GetAlgo( *subMesh->GetFather(),
1961 subMesh->GetSubShape() ))
1962 algo->SetEventListener( subMesh );
1966 //================================================================================
1968 * \brief return static HypModifWaiter
1970 //================================================================================
1972 SMESH_subMeshEventListener* GetHypModifWaiter() {
1973 static HypModifWaiter aHypModifWaiter;
1974 return &aHypModifWaiter;
1976 //================================================================================
1978 * \brief return static listener for source shape submeshes
1980 //================================================================================
1982 SMESH_subMeshEventListener* GetSrcSubMeshListener() {
1983 static SMESH_subMeshEventListener srcListener(0); // won't be deleted by submesh
1984 return &srcListener;
1988 //================================================================================
1990 * \brief Set event listeners to submesh with projection algo
1991 * \param subMesh - submesh with projection algo
1992 * \param srcShape - source shape
1993 * \param srcMesh - source mesh
1995 //================================================================================
1997 void StdMeshers_ProjectionUtils::SetEventListener(SMESH_subMesh* subMesh,
1998 TopoDS_Shape srcShape,
1999 SMESH_Mesh* srcMesh)
2001 // Set listener that resets an event listener on source submesh when
2002 // "ProjectionSource*D" hypothesis is modified since source shape can be changed
2003 subMesh->SetEventListener( GetHypModifWaiter(),0,subMesh);
2005 // Set an event listener to submesh of the source shape
2006 if ( !srcShape.IsNull() )
2009 srcMesh = subMesh->GetFather();
2011 SMESH_subMesh* srcShapeSM = srcMesh->GetSubMesh( srcShape );
2013 if ( srcShapeSM != subMesh ) {
2014 if ( srcShapeSM->GetSubMeshDS() &&
2015 srcShapeSM->GetSubMeshDS()->IsComplexSubmesh() )
2016 { // source shape is a group
2017 TopExp_Explorer it(srcShapeSM->GetSubShape(), // explore the group into subshapes...
2018 subMesh->GetSubShape().ShapeType()); // ...of target shape type
2019 for (; it.More(); it.Next())
2021 SMESH_subMesh* srcSM = srcMesh->GetSubMesh( it.Current() );
2022 if ( srcSM != subMesh )
2024 SMESH_subMeshEventListenerData* data =
2025 srcSM->GetEventListenerData(GetSrcSubMeshListener());
2027 data->mySubMeshes.push_back( subMesh );
2029 data = SMESH_subMeshEventListenerData::MakeData( subMesh );
2030 subMesh->SetEventListener ( GetSrcSubMeshListener(), data, srcSM );
2036 subMesh->SetEventListener( GetSrcSubMeshListener(),
2037 SMESH_subMeshEventListenerData::MakeData( subMesh ),