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 <BRepAdaptor_Surface.hxx>
48 #include <BRepTools.hxx>
49 #include <BRepTools_WireExplorer.hxx>
50 #include <BRep_Builder.hxx>
51 #include <BRep_Tool.hxx>
52 #include <Bnd_Box.hxx>
55 #include <TopExp_Explorer.hxx>
56 #include <TopTools_Array1OfShape.hxx>
57 #include <TopTools_DataMapIteratorOfDataMapOfShapeListOfShape.hxx>
58 #include <TopTools_DataMapIteratorOfDataMapOfShapeShape.hxx>
59 #include <TopTools_ListIteratorOfListOfShape.hxx>
60 #include <TopTools_ListOfShape.hxx>
61 #include <TopTools_MapOfShape.hxx>
63 #include <TopoDS_Compound.hxx>
64 #include <TopoDS_Shape.hxx>
73 #define RETURN_BAD_RESULT(msg) { MESSAGE(")-: Error: " << msg); return false; }
74 #define CONT_BAD_RESULT(msg) { MESSAGE(")-: Error: " << msg); continue; }
75 #define SHOW_SHAPE(v,msg) \
77 // if ( (v).IsNull() ) cout << msg << " NULL SHAPE" << endl; \
78 // else if ((v).ShapeType() == TopAbs_VERTEX) {\
79 // gp_Pnt p = BRep_Tool::Pnt( TopoDS::Vertex( (v) ));\
80 // cout<<msg<<" "<<shapeIndex((v))<<" ( "<<p.X()<<", "<<p.Y()<<", "<<p.Z()<<" )"<<endl;} \
82 // cout << msg << " "; TopAbs::Print((v).ShapeType(),cout) <<" "<<shapeIndex((v))<<endl;}\
84 #define SHOW_LIST(msg,l) \
86 // cout << msg << " ";\
87 // list< TopoDS_Edge >::const_iterator e = l.begin();\
88 // for ( int i = 0; e != l.end(); ++e, ++i ) {\
89 // cout << i << "V (" << TopExp::FirstVertex( *e, true ).TShape().operator->() << ") "\
90 // << i << "E (" << e->TShape().operator->() << "); "; }\
94 #define HERE StdMeshers_ProjectionUtils
98 static SMESHDS_Mesh* theMeshDS[2] = { 0, 0 }; // used to debug only
99 long shapeIndex(const TopoDS_Shape& S)
101 if ( theMeshDS[0] && theMeshDS[1] )
102 return max(theMeshDS[0]->ShapeToIndex(S), theMeshDS[1]->ShapeToIndex(S) );
103 return long(S.TShape().operator->());
106 //================================================================================
108 * \brief Write shape for debug purposes
110 //================================================================================
112 bool _StoreBadShape(const TopoDS_Shape& shape)
115 const char* type[] ={"COMPOUND","COMPSOLID","SOLID","SHELL","FACE","WIRE","EDGE","VERTEX"};
116 BRepTools::Write( shape, SMESH_Comment("/tmp/") << type[shape.ShapeType()] << "_"
117 << shape.TShape().operator->() << ".brep");
122 //================================================================================
124 * \brief Reverse order of edges in a list and their orientation
125 * \param edges - list of edges to reverse
126 * \param nbEdges - number of edges to reverse
128 //================================================================================
130 void Reverse( list< TopoDS_Edge > & edges, const int nbEdges, const int firstEdge=0)
132 SHOW_LIST("BEFORE REVERSE", edges);
134 list< TopoDS_Edge >::iterator eIt = edges.begin();
135 std::advance( eIt, firstEdge );
136 list< TopoDS_Edge >::iterator eBackIt = eIt;
137 for ( int i = 0; i < nbEdges; ++i, ++eBackIt )
138 eBackIt->Reverse(); // reverse edge
141 while ( eIt != eBackIt )
143 std::swap( *eIt, *eBackIt );
144 SHOW_LIST("# AFTER SWAP", edges)
145 if ( (++eIt) != eBackIt )
148 SHOW_LIST("ATFER REVERSE", edges)
151 //================================================================================
153 * \brief Check if propagation is possible
154 * \param theMesh1 - source mesh
155 * \param theMesh2 - target mesh
156 * \retval bool - true if possible
158 //================================================================================
160 bool IsPropagationPossible( SMESH_Mesh* theMesh1, SMESH_Mesh* theMesh2 )
162 if ( theMesh1 != theMesh2 ) {
163 TopoDS_Shape mainShape1 = theMesh1->GetMeshDS()->ShapeToMesh();
164 TopoDS_Shape mainShape2 = theMesh2->GetMeshDS()->ShapeToMesh();
165 return mainShape1.IsSame( mainShape2 );
170 //================================================================================
172 * \brief Fix up association of edges in faces by possible propagation
173 * \param nbEdges - nb of edges in an outer wire
174 * \param edges1 - edges of one face
175 * \param edges2 - matching edges of another face
176 * \param theMesh1 - mesh 1
177 * \param theMesh2 - mesh 2
178 * \retval bool - true if association was fixed
180 //================================================================================
182 bool FixAssocByPropagation( const int nbEdges,
183 list< TopoDS_Edge > & edges1,
184 list< TopoDS_Edge > & edges2,
185 SMESH_Mesh* theMesh1,
186 SMESH_Mesh* theMesh2)
188 if ( nbEdges == 2 && IsPropagationPossible( theMesh1, theMesh2 ) )
190 list< TopoDS_Edge >::iterator eIt2 = ++edges2.begin(); // 2nd edge of the 2nd face
191 TopoDS_Edge edge2 = HERE::GetPropagationEdge( theMesh1, *eIt2, edges1.front() ).second;
192 if ( !edge2.IsNull() ) { // propagation found for the second edge
193 Reverse( edges2, nbEdges );
200 //================================================================================
202 * \brief Look for a group containing a target shape and similar to a source group
203 * \param tgtShape - target edge or face
204 * \param tgtMesh1 - target mesh
205 * \param srcGroup - source group
206 * \retval TopoDS_Shape - found target group
208 //================================================================================
210 TopoDS_Shape FindGroupContaining(const TopoDS_Shape& tgtShape,
211 const SMESH_Mesh* tgtMesh1,
212 const TopoDS_Shape& srcGroup)
214 list<SMESH_subMesh*> subMeshes = tgtMesh1->GetGroupSubMeshesContaining(tgtShape);
215 list<SMESH_subMesh*>::iterator sm = subMeshes.begin();
216 int type, last = TopAbs_SHAPE;
217 StdMeshers_ProjectionUtils util;
218 for ( ; sm != subMeshes.end(); ++sm ) {
219 const TopoDS_Shape & group = (*sm)->GetSubShape();
220 // check if group is similar to srcGroup
221 for ( type = srcGroup.ShapeType(); type < last; ++type)
222 if ( util.Count( srcGroup, (TopAbs_ShapeEnum)type, 0) !=
223 util.Count( group, (TopAbs_ShapeEnum)type, 0))
228 return TopoDS_Shape();
231 //================================================================================
233 * \brief Find association of groups at top and bottom of prism
235 //================================================================================
237 bool AssocGroupsByPropagation(const TopoDS_Shape& theGroup1,
238 const TopoDS_Shape& theGroup2,
240 HERE::TShapeShapeMap& theMap)
242 // If groups are on top and bottom of prism then we can associate
243 // them using "vertical" (or "side") edges and faces of prism since
244 // they connect corresponding vertices and edges of groups.
246 TopTools_IndexedMapOfShape subshapes1, subshapes2;
247 TopExp::MapShapes( theGroup1, subshapes1 );
248 TopExp::MapShapes( theGroup2, subshapes2 );
249 TopTools_ListIteratorOfListOfShape ancestIt;
251 // Iterate on vertices of group1 to find corresponding vertices in group2
252 // and associate adjacent edges and faces
254 TopTools_MapOfShape verticShapes;
255 TopExp_Explorer vExp1( theGroup1, TopAbs_VERTEX );
256 for ( ; vExp1.More(); vExp1.Next() )
258 const TopoDS_Vertex& v1 = TopoDS::Vertex( vExp1.Current() );
259 if ( theMap.IsBound( v1 )) continue; // already processed
261 // Find "vertical" edge ending in v1 and whose other vertex belongs to group2
262 TopoDS_Shape verticEdge, v2;
263 ancestIt.Initialize( theMesh.GetAncestors( v1 ));
264 for ( ; verticEdge.IsNull() && ancestIt.More(); ancestIt.Next() )
266 if ( ancestIt.Value().ShapeType() != TopAbs_EDGE ) continue;
267 v2 = HERE::GetNextVertex( TopoDS::Edge( ancestIt.Value() ), v1 );
268 if ( subshapes2.Contains( v2 ))
269 verticEdge = ancestIt.Value();
271 if ( verticEdge.IsNull() )
274 HERE::InsertAssociation( v1, v2, theMap);
276 // Associate edges by vertical faces sharing the found vertical edge
277 ancestIt.Initialize( theMesh.GetAncestors( verticEdge ) );
278 for ( ; ancestIt.More(); ancestIt.Next() )
280 if ( ancestIt.Value().ShapeType() != TopAbs_FACE ) continue;
281 if ( !verticShapes.Add( ancestIt.Value() )) continue;
282 const TopoDS_Face& face = TopoDS::Face( ancestIt.Value() );
284 // get edges of the face
285 TopoDS_Edge edgeGr1, edgeGr2, verticEdge2;
286 list< TopoDS_Edge > edges; list< int > nbEdgesInWire;
287 SMESH_Block::GetOrderedEdges( face, v1, edges, nbEdgesInWire);
288 if ( nbEdgesInWire.front() != 4 )
289 return _StoreBadShape( face );
290 list< TopoDS_Edge >::iterator edge = edges.begin();
291 if ( verticEdge.IsSame( *edge )) {
293 verticEdge2 = *(++edge);
297 verticEdge2 = *(edge++);
301 HERE::InsertAssociation( edgeGr1, edgeGr2.Reversed(), theMap);
306 TopoDS_Iterator gr1It( theGroup1 );
307 if ( gr1It.Value().ShapeType() == TopAbs_FACE )
309 // find a boundary edge of group1 to start from
310 TopoDS_Shape bndEdge;
311 TopExp_Explorer edgeExp1( theGroup1, TopAbs_EDGE );
312 for ( ; bndEdge.IsNull() && edgeExp1.More(); edgeExp1.Next())
313 if ( HERE::IsBoundaryEdge( TopoDS::Edge( edgeExp1.Current()), theGroup1, theMesh ))
314 bndEdge = edgeExp1.Current();
315 if ( bndEdge.IsNull() )
318 list< TopoDS_Shape > edges(1, bndEdge);
319 list< TopoDS_Shape >::iterator edge1 = edges.begin();
320 for ( ; edge1 != edges.end(); ++edge1 )
322 // there must be one or zero not associated faces between ancestors of edge
323 // belonging to theGroup1
325 ancestIt.Initialize( theMesh.GetAncestors( *edge1 ) );
326 for ( ; ancestIt.More() && face1.IsNull(); ancestIt.Next() ) {
327 if ( ancestIt.Value().ShapeType() == TopAbs_FACE &&
328 !theMap.IsBound( ancestIt.Value() ) &&
329 subshapes1.Contains( ancestIt.Value() ))
330 face1 = ancestIt.Value();
332 // add edges of face1 to start searching for adjacent faces from
333 for ( TopExp_Explorer e(face1, TopAbs_EDGE); e.More(); e.Next())
334 if ( !edge1->IsSame( e.Current() ))
335 edges.push_back( e.Current() );
337 if ( !face1.IsNull() ) {
338 // find the corresponding face of theGroup2
339 TopoDS_Shape edge2 = theMap( *edge1 );
341 ancestIt.Initialize( theMesh.GetAncestors( edge2 ) );
342 for ( ; ancestIt.More() && face2.IsNull(); ancestIt.Next() ) {
343 if ( ancestIt.Value().ShapeType() == TopAbs_FACE &&
344 !theMap.IsBound( ancestIt.Value() ) &&
345 subshapes2.Contains( ancestIt.Value() ))
346 face2 = ancestIt.Value();
348 if ( face2.IsNull() )
351 HERE::InsertAssociation( face1, face2, theMap);
358 //================================================================================
360 * \brief Return true if uv position of the vIndex-th vertex of edge on face is close
363 //================================================================================
365 bool sameVertexUV( const TopoDS_Edge& edge,
366 const TopoDS_Face& face,
369 const double& tol2d )
372 TopExp::Vertices( edge, VV[0], VV[1], true);
373 gp_Pnt2d v1UV = BRep_Tool::Parameters( VV[vIndex], face);
374 double dist2d = v1UV.Distance( uv );
375 return dist2d < tol2d;
380 //=======================================================================
382 * \brief Looks for association of all subshapes of two shapes
383 * \param theShape1 - shape 1
384 * \param theMesh1 - mesh built on shape 1
385 * \param theShape2 - shape 2
386 * \param theMesh2 - mesh built on shape 2
387 * \param theAssociation - association map to be filled that may
388 * contain association of one or two pairs of vertices
389 * \retval bool - true if association found
391 //=======================================================================
393 bool StdMeshers_ProjectionUtils::FindSubShapeAssociation(const TopoDS_Shape& theShape1,
394 SMESH_Mesh* theMesh1,
395 const TopoDS_Shape& theShape2,
396 SMESH_Mesh* theMesh2,
397 TShapeShapeMap & theMap)
399 // Structure of this long function is following
400 // 1) Group->group projection: theShape1 is a group member,
401 // theShape2 is a group. We find a group theShape1 is in and recall self.
402 // 2) Accosiate same shapes with different location (partners).
403 // 3) If vertex association is given, perform accosiation according to shape type:
404 // switch ( ShapeType ) {
408 // 4) else try to accosiate in different ways:
409 // a) accosiate shapes by propagation and other simple cases
410 // switch ( ShapeType ) {
414 // b) find association of a couple of vertices and recall self.
417 theMeshDS[0] = theMesh1->GetMeshDS(); // debug
418 theMeshDS[1] = theMesh2->GetMeshDS();
420 // =================================================================================
421 // 1) Is it the case of associating a group member -> another group? (PAL16202, 16203)
422 // =================================================================================
423 if ( theShape1.ShapeType() != theShape2.ShapeType() ) {
424 TopoDS_Shape group1, group2;
425 if ( theShape1.ShapeType() == TopAbs_COMPOUND ) {
427 group2 = FindGroupContaining( theShape2, theMesh2, group1 );
429 else if ( theShape2.ShapeType() == TopAbs_COMPOUND ) {
431 group1 = FindGroupContaining( theShape1, theMesh1, group2 );
433 if ( group1.IsNull() || group2.IsNull() )
434 RETURN_BAD_RESULT("Different shape types");
435 // Associate compounds
436 return FindSubShapeAssociation(group1, theMesh1, group2, theMesh2, theMap );
439 bool bidirect = ( !theShape1.IsSame( theShape2 ));
444 bool partner = theShape1.IsPartner( theShape2 );
445 TopTools_DataMapIteratorOfDataMapOfShapeShape vvIt( theMap );
446 for ( ; partner && vvIt.More(); vvIt.Next() )
447 partner = vvIt.Key().IsPartner( vvIt.Value() );
449 if ( partner ) // Same shape with different location
451 // recursively associate all subshapes of theShape1 and theShape2
452 typedef list< pair< TopoDS_Shape, TopoDS_Shape > > TShapePairsList;
453 TShapePairsList shapesQueue( 1, make_pair( theShape1, theShape2 ));
454 TShapePairsList::iterator s1_s2 = shapesQueue.begin();
455 for ( ; s1_s2 != shapesQueue.end(); ++s1_s2 )
457 InsertAssociation( s1_s2->first, s1_s2->second, theMap, bidirect);
458 TopoDS_Iterator s1It( s1_s2->first), s2It( s1_s2->second );
459 for ( ; s1It.More(); s1It.Next(), s2It.Next() )
460 shapesQueue.push_back( make_pair( s1It.Value(), s2It.Value() ));
465 if ( !theMap.IsEmpty() )
467 //======================================================================
468 // 3) HAS initial vertex association
469 //======================================================================
470 switch ( theShape1.ShapeType() ) {
471 // ----------------------------------------------------------------------
472 case TopAbs_EDGE: { // TopAbs_EDGE
473 // ----------------------------------------------------------------------
474 if ( theMap.Extent() != 2 )
475 RETURN_BAD_RESULT("Wrong map extent " << theMap.Extent() );
476 TopoDS_Edge edge1 = TopoDS::Edge( theShape1 );
477 TopoDS_Edge edge2 = TopoDS::Edge( theShape2 );
478 if ( edge1.Orientation() >= TopAbs_INTERNAL ) edge1.Orientation( TopAbs_FORWARD );
479 if ( edge2.Orientation() >= TopAbs_INTERNAL ) edge2.Orientation( TopAbs_FORWARD );
480 TopoDS_Vertex VV1[2], VV2[2];
481 TopExp::Vertices( edge1, VV1[0], VV1[1] );
482 TopExp::Vertices( edge2, VV2[0], VV2[1] );
484 if ( theMap.IsBound( VV1[ i1 ] )) i1 = 1;
485 if ( theMap.IsBound( VV2[ i2 ] )) i2 = 1;
486 InsertAssociation( VV1[ i1 ], VV2[ i2 ], theMap, bidirect);
487 InsertAssociation( theShape1, theShape2, theMap, bidirect );
490 // ----------------------------------------------------------------------
491 case TopAbs_FACE: { // TopAbs_FACE
492 // ----------------------------------------------------------------------
493 TopoDS_Face face1 = TopoDS::Face( theShape1 );
494 TopoDS_Face face2 = TopoDS::Face( theShape2 );
495 if ( face1.Orientation() >= TopAbs_INTERNAL ) face1.Orientation( TopAbs_FORWARD );
496 if ( face2.Orientation() >= TopAbs_INTERNAL ) face2.Orientation( TopAbs_FORWARD );
498 TopoDS_Vertex VV1[2], VV2[2];
499 // find a not closed edge of face1 both vertices of which are associated
501 TopExp_Explorer exp ( face1, TopAbs_EDGE );
502 for ( ; VV2[ 1 ].IsNull() && exp.More(); exp.Next(), ++nbEdges ) {
503 TopExp::Vertices( TopoDS::Edge( exp.Current() ), VV1[0], VV1[1] );
504 if ( theMap.IsBound( VV1[0] ) ) {
505 VV2[ 0 ] = TopoDS::Vertex( theMap( VV1[0] ));
506 if ( theMap.IsBound( VV1[1] ) && !VV1[0].IsSame( VV1[1] ))
507 VV2[ 1 ] = TopoDS::Vertex( theMap( VV1[1] ));
510 if ( VV2[ 1 ].IsNull() ) { // 2 bound vertices not found
512 RETURN_BAD_RESULT("2 bound vertices not found" );
517 list< TopoDS_Edge > edges1, edges2;
518 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
519 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
520 FixAssocByPropagation( nbE, edges1, edges2, theMesh1, theMesh2 );
522 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
523 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
524 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
526 InsertAssociation( *eIt1, *eIt2, theMap, bidirect);
527 VV1[0] = TopExp::FirstVertex( *eIt1, true );
528 VV2[0] = TopExp::FirstVertex( *eIt2, true );
529 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
531 InsertAssociation( theShape1, theShape2, theMap, bidirect );
534 // ----------------------------------------------------------------------
535 case TopAbs_SHELL: // TopAbs_SHELL, TopAbs_SOLID
537 // ----------------------------------------------------------------------
538 TopoDS_Vertex VV1[2], VV2[2];
539 // try to find a not closed edge of shape1 both vertices of which are associated
541 TopExp_Explorer exp ( theShape1, TopAbs_EDGE );
542 for ( ; VV2[ 1 ].IsNull() && exp.More(); exp.Next() ) {
543 edge1 = TopoDS::Edge( exp.Current() );
544 if ( edge1.Orientation() >= TopAbs_INTERNAL ) edge1.Orientation( TopAbs_FORWARD );
545 TopExp::Vertices( edge1 , VV1[0], VV1[1] );
546 if ( theMap.IsBound( VV1[0] )) {
547 VV2[ 0 ] = TopoDS::Vertex( theMap( VV1[0] ));
548 if ( theMap.IsBound( VV1[1] ) && !VV1[0].IsSame( VV1[1] ))
549 VV2[ 1 ] = TopoDS::Vertex( theMap( VV1[1] ));
552 if ( VV2[ 1 ].IsNull() ) // 2 bound vertices not found
553 RETURN_BAD_RESULT("2 bound vertices not found" );
554 // get an edge2 of theShape2 corresponding to edge1
555 TopoDS_Edge edge2 = GetEdgeByVertices( theMesh2, VV2[ 0 ], VV2[ 1 ]);
556 if ( edge2.IsNull() )
557 RETURN_BAD_RESULT("GetEdgeByVertices() failed");
559 // build map of edge to faces if shapes are not subshapes of main ones
560 bool isSubOfMain = false;
561 if ( SMESHDS_SubMesh * sm = theMesh1->GetMeshDS()->MeshElements( theShape1 ))
562 isSubOfMain = !sm->IsComplexSubmesh();
564 isSubOfMain = theMesh1->GetMeshDS()->ShapeToIndex( theShape1 );
565 TAncestorMap e2f1, e2f2;
566 const TAncestorMap& edgeToFace1 = isSubOfMain ? theMesh1->GetAncestorMap() : e2f1;
567 const TAncestorMap& edgeToFace2 = isSubOfMain ? theMesh2->GetAncestorMap() : e2f2;
569 TopExp::MapShapesAndAncestors( theShape1, TopAbs_EDGE, TopAbs_FACE, e2f1 );
570 TopExp::MapShapesAndAncestors( theShape2, TopAbs_EDGE, TopAbs_FACE, e2f2 );
571 if ( !edgeToFace1.Contains( edge1 ))
572 RETURN_BAD_RESULT("edge1 does not belong to theShape1");
573 if ( !edgeToFace2.Contains( edge2 ))
574 RETURN_BAD_RESULT("edge2 does not belong to theShape2");
577 // Look for 2 corresponing faces:
581 // get a face sharing edge1 (F1)
583 TopTools_ListIteratorOfListOfShape ancestIt1( edgeToFace1.FindFromKey( edge1 ));
584 for ( ; F1.IsNull() && ancestIt1.More(); ancestIt1.Next() )
585 if ( ancestIt1.Value().ShapeType() == TopAbs_FACE )
586 F1 = ancestIt1.Value().Oriented( TopAbs_FORWARD );
588 RETURN_BAD_RESULT(" Face1 not found");
590 // get 2 faces sharing edge2 (one of them is F2)
591 TopTools_ListIteratorOfListOfShape ancestIt2( edgeToFace2.FindFromKey( edge2 ));
592 for ( int i = 0; FF2[1].IsNull() && ancestIt2.More(); ancestIt2.Next() )
593 if ( ancestIt2.Value().ShapeType() == TopAbs_FACE )
594 FF2[ i++ ] = ancestIt2.Value().Oriented( TopAbs_FORWARD );
596 // get oriented edge1 and edge2 from F1 and FF2[0]
597 for ( exp.Init( F1, TopAbs_EDGE ); exp.More(); exp.Next() )
598 if ( edge1.IsSame( exp.Current() )) {
599 edge1 = TopoDS::Edge( exp.Current() );
602 for ( exp.Init( FF2[ 0 ], TopAbs_EDGE ); exp.More(); exp.Next() )
603 if ( edge2.IsSame( exp.Current() )) {
604 edge2 = TopoDS::Edge( exp.Current() );
608 // compare first vertices of edge1 and edge2
609 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
610 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
611 F2 = FF2[ 0 ]; // (F2 !)
612 if ( !VV1[ 0 ].IsSame( theMap( VV2[ 0 ]))) {
614 if ( FF2[ 1 ].IsNull() )
620 TopTools_MapOfShape boundEdges;
622 // association of face subshapes and neighbour faces
623 list< pair < TopoDS_Face, TopoDS_Edge > > FE1, FE2;
624 list< pair < TopoDS_Face, TopoDS_Edge > >::iterator fe1, fe2;
625 FE1.push_back( make_pair( TopoDS::Face( F1 ), edge1 ));
626 FE2.push_back( make_pair( TopoDS::Face( F2 ), edge2 ));
627 for ( fe1 = FE1.begin(), fe2 = FE2.begin(); fe1 != FE1.end(); ++fe1, ++fe2 )
629 const TopoDS_Face& face1 = fe1->first;
630 if ( theMap.IsBound( face1 ) ) continue;
631 const TopoDS_Face& face2 = fe2->first;
634 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
635 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
636 list< TopoDS_Edge > edges1, edges2;
637 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
638 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
639 InsertAssociation( face1, face2, theMap, bidirect); // assoc faces
640 MESSAGE("Assoc FACE " << theMesh1->GetMeshDS()->ShapeToIndex( face1 )<<
641 " to " << theMesh2->GetMeshDS()->ShapeToIndex( face2 ));
642 if ( nbE == 2 && (edge1.IsSame( edges1.front())) != (edge2.IsSame( edges2.front())))
644 Reverse( edges2, nbE );
646 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
647 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
648 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
650 if ( !boundEdges.Add( *eIt1 )) continue; // already associated
651 InsertAssociation( *eIt1, *eIt2, theMap, bidirect); // assoc edges
652 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( *eIt1 )<<
653 " to " << theMesh2->GetMeshDS()->ShapeToIndex( *eIt2 ));
654 VV1[0] = TopExp::FirstVertex( *eIt1, true );
655 VV2[0] = TopExp::FirstVertex( *eIt2, true );
656 InsertAssociation( VV1[0], VV2[0], theMap, bidirect); // assoc vertices
657 MESSAGE("Assoc vertex " << theMesh1->GetMeshDS()->ShapeToIndex( VV1[0] )<<
658 " to " << theMesh2->GetMeshDS()->ShapeToIndex( VV2[0] ));
660 // add adjacent faces to process
661 TopoDS_Face nextFace1 = GetNextFace( edgeToFace1, *eIt1, face1 );
662 TopoDS_Face nextFace2 = GetNextFace( edgeToFace2, *eIt2, face2 );
663 if ( !nextFace1.IsNull() && !nextFace2.IsNull() ) {
664 FE1.push_back( make_pair( nextFace1, *eIt1 ));
665 FE2.push_back( make_pair( nextFace2, *eIt2 ));
669 InsertAssociation( theShape1, theShape2, theMap, bidirect );
672 // ----------------------------------------------------------------------
673 case TopAbs_COMPOUND: { // GROUP
674 // ----------------------------------------------------------------------
675 // Maybe groups contain only one member
676 TopoDS_Iterator it1( theShape1 ), it2( theShape2 );
677 TopAbs_ShapeEnum memberType = it1.Value().ShapeType();
678 int nbMembers = Count( theShape1, memberType, true );
679 if ( nbMembers == 0 ) return true;
680 if ( nbMembers == 1 ) {
681 return FindSubShapeAssociation( it1.Value(), theMesh1, it2.Value(), theMesh2, theMap );
683 // Try to make shells of faces
685 BRep_Builder builder;
686 TopoDS_Shell shell1, shell2;
687 builder.MakeShell(shell1); builder.MakeShell(shell2);
688 if ( memberType == TopAbs_FACE ) {
689 // just add faces of groups to shells
690 for (; it1.More(); it1.Next(), it2.Next() )
691 builder.Add( shell1, it1.Value() ), builder.Add( shell2, it2.Value() );
693 else if ( memberType == TopAbs_EDGE ) {
694 // Try to add faces sharing more than one edge of a group or
695 // sharing all its vertices with the group
696 TopTools_IndexedMapOfShape groupVertices[2];
697 TopExp::MapShapes( theShape1, TopAbs_VERTEX, groupVertices[0]);
698 TopExp::MapShapes( theShape2, TopAbs_VERTEX, groupVertices[1]);
700 TopTools_MapOfShape groupEdges[2], addedFaces[2];
701 bool hasInitAssoc = (!theMap.IsEmpty()), initAssocOK = !hasInitAssoc;
702 for (; it1.More(); it1.Next(), it2.Next() ) {
703 groupEdges[0].Add( it1.Value() );
704 groupEdges[1].Add( it2.Value() );
705 if ( !initAssocOK ) {
706 // for shell association there must be an edge with both vertices bound
707 TopoDS_Vertex v1, v2;
708 TopExp::Vertices( TopoDS::Edge( it1.Value().Oriented(TopAbs_FORWARD)), v1, v2 );
709 initAssocOK = ( theMap.IsBound( v1 ) && theMap.IsBound( v2 ));
712 for (int is2ndGroup = 0; initAssocOK && is2ndGroup < 2; ++is2ndGroup) {
713 const TopoDS_Shape& group = is2ndGroup ? theShape2: theShape1;
714 SMESH_Mesh* mesh = is2ndGroup ? theMesh2 : theMesh1;
715 TopoDS_Shell& shell = is2ndGroup ? shell2 : shell1;
716 for ( TopoDS_Iterator it( group ); it.More(); it.Next() ) {
717 const TopoDS_Edge& edge = TopoDS::Edge( it.Value() );
719 for ( int iF = 0; iF < 2; ++iF ) { // loop on 2 faces sharing edge
720 face = GetNextFace(mesh->GetAncestorMap(), edge, face);
721 if ( !face.IsNull() ) {
722 int nbGroupEdges = 0;
723 for ( TopExp_Explorer f( face, TopAbs_EDGE ); f.More(); f.Next())
724 if ( groupEdges[ is2ndGroup ].Contains( f.Current() ))
725 if ( ++nbGroupEdges > 1 )
727 bool add = (nbGroupEdges > 1 || Count( face, TopAbs_EDGE, true ) == 1 );
730 for ( TopExp_Explorer v( face, TopAbs_VERTEX ); add && v.More(); v.Next())
731 add = groupVertices[ is2ndGroup ].Contains( v.Current() );
733 if ( add && addedFaces[ is2ndGroup ].Add( face ))
734 builder.Add( shell, face );
740 RETURN_BAD_RESULT("Unexpected group type");
744 int nbFaces1 = Count( shell1, TopAbs_FACE, 0 );
745 int nbFaces2 = Count( shell2, TopAbs_FACE, 0 );
746 if ( nbFaces1 != nbFaces2 )
747 RETURN_BAD_RESULT("Different nb of faces found for shells");
748 if ( nbFaces1 > 0 ) {
750 if ( nbFaces1 == 1 ) {
751 TopoDS_Shape F1 = TopoDS_Iterator( shell1 ).Value();
752 TopoDS_Shape F2 = TopoDS_Iterator( shell2 ).Value();
753 ok = FindSubShapeAssociation( F1, theMesh1, F2, theMesh2, theMap );
756 ok = FindSubShapeAssociation(shell1, theMesh1, shell2, theMesh2, theMap );
758 // Check if all members are mapped
760 TopTools_MapOfShape boundMembers[2];
762 for ( mIt.Initialize( theShape1 ); mIt.More(); mIt.Next())
763 if ( theMap.IsBound( mIt.Value() )) {
764 boundMembers[0].Add( mIt.Value() );
765 boundMembers[1].Add( theMap( mIt.Value() ));
767 if ( boundMembers[0].Extent() != nbMembers ) {
768 // make compounds of not bound members
769 TopoDS_Compound comp[2];
770 for ( int is2ndGroup = 0; is2ndGroup < 2; ++is2ndGroup ) {
771 builder.MakeCompound( comp[is2ndGroup] );
772 for ( mIt.Initialize( is2ndGroup ? theShape2:theShape1 ); mIt.More(); mIt.Next())
773 if ( ! boundMembers[ is2ndGroup ].Contains( mIt.Value() ))
774 builder.Add( comp[ is2ndGroup ], mIt.Value() );
776 // check if theMap contains initial association for the comp's
777 bool hasInitialAssoc = false;
778 if ( memberType == TopAbs_EDGE ) {
779 for ( TopExp_Explorer v( comp[0], TopAbs_VERTEX ); v.More(); v.Next())
780 if ( theMap.IsBound( v.Current() )) {
781 hasInitialAssoc = true;
785 if ( hasInitialAssoc == bool( !theMap.IsEmpty() ))
786 ok = FindSubShapeAssociation( comp[0], theMesh1, comp[1], theMesh2, theMap );
788 TShapeShapeMap tmpMap;
789 ok = FindSubShapeAssociation( comp[0], theMesh1, comp[1], theMesh2, tmpMap );
791 TopTools_DataMapIteratorOfDataMapOfShapeShape mapIt( tmpMap );
792 for ( ; mapIt.More(); mapIt.Next() )
793 theMap.Bind( mapIt.Key(), mapIt.Value());
800 // Each edge of an edge group is shared by own faces
801 // ------------------------------------------------------------------
803 // map vertices to edges sharing them, avoid doubling edges in lists
804 TopTools_DataMapOfShapeListOfShape v2e[2];
805 for (int isFirst = 0; isFirst < 2; ++isFirst ) {
806 const TopoDS_Shape& group = isFirst ? theShape1 : theShape2;
807 TopTools_DataMapOfShapeListOfShape& veMap = v2e[ isFirst ? 0 : 1 ];
808 TopTools_MapOfShape addedEdges;
809 for ( TopExp_Explorer e( group, TopAbs_EDGE ); e.More(); e.Next() ) {
810 const TopoDS_Shape& edge = e.Current();
811 if ( addedEdges.Add( edge )) {
812 for ( TopExp_Explorer v( edge, TopAbs_VERTEX ); v.More(); v.Next()) {
813 const TopoDS_Shape& vertex = v.Current();
814 if ( !veMap.IsBound( vertex )) {
815 TopTools_ListOfShape l;
816 veMap.Bind( vertex, l );
818 veMap( vertex ).Append( edge );
823 while ( !v2e[0].IsEmpty() )
825 // find a bound vertex
827 TopTools_DataMapIteratorOfDataMapOfShapeListOfShape v2eIt( v2e[0] );
828 for ( ; v2eIt.More(); v2eIt.Next())
829 if ( theMap.IsBound( v2eIt.Key() )) {
830 V[0] = TopoDS::Vertex( v2eIt.Key() );
831 V[1] = TopoDS::Vertex( theMap( V[0] ));
835 RETURN_BAD_RESULT("No more bound vertices");
837 while ( !V[0].IsNull() && v2e[0].IsBound( V[0] )) {
838 TopTools_ListOfShape& edges0 = v2e[0]( V[0] );
839 TopTools_ListOfShape& edges1 = v2e[1]( V[1] );
840 int nbE0 = edges0.Extent(), nbE1 = edges1.Extent();
842 RETURN_BAD_RESULT("Different nb of edges: "<< nbE0 << " != " << nbE1);
846 TopoDS_Edge e0 = TopoDS::Edge( edges0.First() );
847 TopoDS_Edge e1 = TopoDS::Edge( edges1.First() );
848 v2e[0].UnBind( V[0] );
849 v2e[1].UnBind( V[1] );
850 InsertAssociation( e0, e1, theMap, bidirect );
851 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( e0 )<<
852 " to " << theMesh2->GetMeshDS()->ShapeToIndex( e1 ));
853 V[0] = GetNextVertex( e0, V[0] );
854 V[1] = GetNextVertex( e1, V[1] );
855 if ( !V[0].IsNull() ) {
856 InsertAssociation( V[0], V[1], theMap, bidirect );
857 MESSAGE("Assoc vertex " << theMesh1->GetMeshDS()->ShapeToIndex( V[0] )<<
858 " to " << theMesh2->GetMeshDS()->ShapeToIndex( V[1] ));
861 else if ( nbE0 == 2 )
863 // one of edges must have both ends bound
864 TopoDS_Vertex v0e0 = GetNextVertex( TopoDS::Edge( edges0.First() ), V[0] );
865 TopoDS_Vertex v1e0 = GetNextVertex( TopoDS::Edge( edges0.Last() ), V[0] );
866 TopoDS_Vertex v0e1 = GetNextVertex( TopoDS::Edge( edges1.First() ), V[1] );
867 TopoDS_Vertex v1e1 = GetNextVertex( TopoDS::Edge( edges1.Last() ), V[1] );
868 TopoDS_Shape e0b, e1b, e0n, e1n, v1b; // bound and not-bound
869 TopoDS_Vertex v0n, v1n;
870 if ( theMap.IsBound( v0e0 )) {
871 v0n = v1e0; e0b = edges0.First(); e0n = edges0.Last(); v1b = theMap( v0e0 );
872 } else if ( theMap.IsBound( v1e0 )) {
873 v0n = v0e0; e0n = edges0.First(); e0b = edges0.Last(); v1b = theMap( v1e0 );
875 RETURN_BAD_RESULT("None of vertices bound");
877 if ( v1b.IsSame( v1e1 )) {
878 v1n = v0e1; e1n = edges1.First(); e1b = edges1.Last();
880 v1n = v1e1; e1b = edges1.First(); e1n = edges1.Last();
882 InsertAssociation( e0b, e1b, theMap, bidirect );
883 InsertAssociation( e0n, e1n, theMap, bidirect );
884 InsertAssociation( v0n, v1n, theMap, bidirect );
885 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( e0b )<<
886 " to " << theMesh2->GetMeshDS()->ShapeToIndex( e1b ));
887 MESSAGE("Assoc edge " << theMesh1->GetMeshDS()->ShapeToIndex( e0n )<<
888 " to " << theMesh2->GetMeshDS()->ShapeToIndex( e1n ));
889 MESSAGE("Assoc vertex " << theMesh1->GetMeshDS()->ShapeToIndex( v0n )<<
890 " to " << theMesh2->GetMeshDS()->ShapeToIndex( v1n ));
891 v2e[0].UnBind( V[0] );
892 v2e[1].UnBind( V[1] );
897 RETURN_BAD_RESULT("Not implemented");
900 } //while ( !v2e[0].IsEmpty() )
905 RETURN_BAD_RESULT("Unexpected shape type");
907 } // end switch by shape type
908 } // end case of available initial vertex association
910 //======================================================================
911 // 4) NO INITIAL VERTEX ASSOCIATION
912 //======================================================================
914 switch ( theShape1.ShapeType() ) {
917 // ----------------------------------------------------------------------
918 TopoDS_Edge edge1 = TopoDS::Edge( theShape1 );
919 TopoDS_Edge edge2 = TopoDS::Edge( theShape2 );
920 if ( IsPropagationPossible( theMesh1, theMesh2 ))
922 TopoDS_Edge prpEdge = GetPropagationEdge( theMesh1, edge2, edge1 ).second;
923 if ( !prpEdge.IsNull() )
925 TopoDS_Vertex VV1[2], VV2[2];
926 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
927 TopExp::Vertices( prpEdge, VV2[0], VV2[1], true );
928 InsertAssociation( VV1[ 0 ], VV2[ 0 ], theMap, bidirect);
929 InsertAssociation( VV1[ 1 ], VV2[ 1 ], theMap, bidirect);
930 if ( VV1[0].IsSame( VV1[1] ) || // one of edges is closed
931 VV2[0].IsSame( VV2[1] ) )
933 InsertAssociation( edge1, prpEdge, theMap, bidirect); // insert with a proper orientation
935 InsertAssociation( theShape1, theShape2, theMap, bidirect );
939 if ( IsClosedEdge( edge1 ) && IsClosedEdge( edge2 ))
941 // TODO: find out a proper orientation (is it possible?)
942 InsertAssociation( edge1, edge2, theMap, bidirect); // insert with a proper orientation
943 InsertAssociation( TopExp::FirstVertex(edge1), TopExp::FirstVertex(edge2),
945 InsertAssociation( theShape1, theShape2, theMap, bidirect );
948 break; // try by vertex closeness
952 // ----------------------------------------------------------------------
953 if ( IsPropagationPossible( theMesh1, theMesh2 )) // try by propagation in one mesh
955 TopoDS_Face face1 = TopoDS::Face(theShape1);
956 TopoDS_Face face2 = TopoDS::Face(theShape2);
957 if ( face1.Orientation() >= TopAbs_INTERNAL ) face1.Orientation( TopAbs_FORWARD );
958 if ( face2.Orientation() >= TopAbs_INTERNAL ) face2.Orientation( TopAbs_FORWARD );
959 TopoDS_Edge edge1, edge2;
960 // get outer edge of theShape1
961 edge1 = TopoDS::Edge( OuterShape( face1, TopAbs_EDGE ));
962 // find out if any edge of face2 is a propagation edge of outer edge1
963 map<int,TopoDS_Edge> propag_edges; // use map to find the closest propagation edge
964 for ( TopExp_Explorer exp( face2, TopAbs_EDGE ); exp.More(); exp.Next() ) {
965 edge2 = TopoDS::Edge( exp.Current() );
966 pair<int,TopoDS_Edge> step_edge = GetPropagationEdge( theMesh1, edge2, edge1 );
967 if ( !step_edge.second.IsNull() ) { // propagation found
968 propag_edges.insert( step_edge );
969 if ( step_edge.first == 1 ) break; // most close found
972 if ( !propag_edges.empty() ) // propagation found
974 edge2 = propag_edges.begin()->second;
975 TopoDS_Vertex VV1[2], VV2[2];
976 TopExp::Vertices( edge1, VV1[0], VV1[1], true );
977 TopExp::Vertices( edge2, VV2[0], VV2[1], true );
978 list< TopoDS_Edge > edges1, edges2;
979 int nbE = FindFaceAssociation( face1, VV1, face2, VV2, edges1, edges2 );
980 if ( !nbE ) RETURN_BAD_RESULT("FindFaceAssociation() failed");
981 if ( nbE == 2 ) // only 2 edges
983 // take care of proper association of propagated edges
984 bool same1 = edge1.IsSame( edges1.front() );
985 bool same2 = edge2.IsSame( edges2.front() );
986 if ( same1 != same2 )
987 Reverse(edges2, nbE);
990 list< TopoDS_Edge >::iterator eIt1 = edges1.begin();
991 list< TopoDS_Edge >::iterator eIt2 = edges2.begin();
992 for ( ; eIt1 != edges1.end(); ++eIt1, ++eIt2 )
994 InsertAssociation( *eIt1, *eIt2, theMap, bidirect);
995 VV1[0] = TopExp::FirstVertex( *eIt1, true );
996 VV2[0] = TopExp::FirstVertex( *eIt2, true );
997 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
999 InsertAssociation( theShape1, theShape2, theMap, bidirect );
1003 break; // try by vertex closeness
1005 case TopAbs_COMPOUND: {
1006 // ----------------------------------------------------------------------
1007 if ( IsPropagationPossible( theMesh1, theMesh2 )) {
1009 // try to accosiate all using propagation
1010 if ( AssocGroupsByPropagation( theShape1, theShape2, *theMesh1, theMap ))
1013 // find a boundary edge for theShape1
1015 for(TopExp_Explorer exp(theShape1, TopAbs_EDGE); exp.More(); exp.Next() ) {
1016 E = TopoDS::Edge( exp.Current() );
1017 if ( IsBoundaryEdge( E, theShape1, *theMesh1 ))
1023 break; // try by vertex closeness
1025 // find association for vertices of edge E
1026 TopoDS_Vertex VV1[2], VV2[2];
1027 for(TopExp_Explorer eexp(E, TopAbs_VERTEX); eexp.More(); eexp.Next()) {
1028 TopoDS_Vertex V1 = TopoDS::Vertex( eexp.Current() );
1029 // look for an edge ending in E whose one vertex is in theShape1
1030 // and the other, in theShape2
1031 const TopTools_ListOfShape& Ancestors = theMesh1->GetAncestors(V1);
1032 TopTools_ListIteratorOfListOfShape ita(Ancestors);
1033 for(; ita.More(); ita.Next()) {
1034 if( ita.Value().ShapeType() != TopAbs_EDGE ) continue;
1035 TopoDS_Edge edge = TopoDS::Edge(ita.Value());
1036 bool FromShape1 = false;
1037 for(TopExp_Explorer expe(theShape1, TopAbs_EDGE); expe.More(); expe.Next() ) {
1038 if(edge.IsSame(expe.Current())) {
1044 // is it an edge between theShape1 and theShape2?
1045 TopExp_Explorer expv(edge, TopAbs_VERTEX);
1046 TopoDS_Vertex V2 = TopoDS::Vertex( expv.Current() );
1049 V2 = TopoDS::Vertex( expv.Current() );
1051 bool FromShape2 = false;
1052 for ( expv.Init( theShape2, TopAbs_VERTEX ); expv.More(); expv.Next()) {
1053 if ( V2.IsSame( expv.Current() )) {
1059 if ( VV1[0].IsNull() )
1060 VV1[0] = V1, VV2[0] = V2;
1062 VV1[1] = V1, VV2[1] = V2;
1063 break; // from loop on ancestors of V1
1068 if ( !VV1[1].IsNull() ) {
1069 InsertAssociation( VV1[0], VV2[0], theMap, bidirect);
1070 InsertAssociation( VV1[1], VV2[1], theMap, bidirect);
1071 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap);
1074 break; // try by vertex closeness
1079 // Find association by closeness of vertices
1080 // ------------------------------------------
1082 TopTools_IndexedMapOfShape vMap1, vMap2;
1083 TopExp::MapShapes( theShape1, TopAbs_VERTEX, vMap1 );
1084 TopExp::MapShapes( theShape2, TopAbs_VERTEX, vMap2 );
1085 TopoDS_Vertex VV1[2], VV2[2];
1087 if ( vMap1.Extent() != vMap2.Extent() )
1088 RETURN_BAD_RESULT("Different nb of vertices");
1090 if ( vMap1.Extent() == 1 ) {
1091 InsertAssociation( vMap1(1), vMap2(1), theMap, bidirect);
1092 if ( theShape1.ShapeType() == TopAbs_EDGE ) {
1093 InsertAssociation( theShape1, theShape2, theMap, bidirect );
1096 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap);
1099 // Try to associate by common vertices of an edge
1100 for ( int i = 1; i <= vMap1.Extent(); ++i )
1102 const TopoDS_Shape& v1 = vMap1(i);
1103 if ( vMap2.Contains( v1 ))
1105 // find an egde sharing v1 and sharing at the same time another common vertex
1106 PShapeIteratorPtr edgeIt = SMESH_MesherHelper::GetAncestors( v1, *theMesh1, TopAbs_EDGE);
1107 bool edgeFound = false;
1108 while ( edgeIt->more() && !edgeFound )
1110 TopoDS_Edge edge = TopoDS::Edge( edgeIt->next()->Oriented(TopAbs_FORWARD));
1111 TopExp::Vertices(edge, VV1[0], VV1[1]);
1112 if ( !VV1[0].IsSame( VV1[1] ))
1113 edgeFound = ( vMap2.Contains( VV1[ v1.IsSame(VV1[0]) ? 1:0]));
1117 InsertAssociation( VV1[0], VV1[0], theMap, bidirect );
1118 InsertAssociation( VV1[1], VV1[1], theMap, bidirect );
1119 if (FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap ))
1125 // Find transformation to make the shapes be of similar size at same location
1128 for ( int i = 1; i <= vMap1.Extent(); ++i ) {
1129 box[ 0 ].Add( BRep_Tool::Pnt ( TopoDS::Vertex( vMap1( i ))));
1130 box[ 1 ].Add( BRep_Tool::Pnt ( TopoDS::Vertex( vMap2( i ))));
1133 gp_Pnt gc[2]; // box center
1134 double x0,y0,z0, x1,y1,z1;
1135 box[0].Get( x0,y0,z0, x1,y1,z1 );
1136 gc[0] = 0.5 * ( gp_XYZ( x0,y0,z0 ) + gp_XYZ( x1,y1,z1 ));
1137 box[1].Get( x0,y0,z0, x1,y1,z1 );
1138 gc[1] = 0.5 * ( gp_XYZ( x0,y0,z0 ) + gp_XYZ( x1,y1,z1 ));
1141 gp_Vec vec01( gc[0], gc[1] );
1142 double scale = sqrt( box[1].SquareExtent() / box[0].SquareExtent() );
1144 // Find 2 closest vertices
1146 // get 2 linked vertices of shape 1 not belonging to an inner wire of a face
1147 TopoDS_Shape edge = theShape1;
1148 TopExp_Explorer expF( theShape1, TopAbs_FACE ), expE;
1149 if ( expF.More() ) {
1150 for ( ; expF.More(); expF.Next() ) {
1152 TopoDS_Shape wire = OuterShape( TopoDS::Face( expF.Current() ), TopAbs_WIRE );
1153 for ( expE.Init( wire, TopAbs_EDGE ); edge.IsNull() && expE.More(); expE.Next() )
1154 if ( !IsClosedEdge( TopoDS::Edge( expE.Current() )))
1155 edge = expE.Current();
1156 if ( !edge.IsNull() )
1159 } else if (edge.ShapeType() != TopAbs_EDGE) { // no faces
1161 for ( expE.Init( theShape1, TopAbs_EDGE ); edge.IsNull() && expE.More(); expE.Next() )
1162 if ( !IsClosedEdge( TopoDS::Edge( expE.Current() )))
1163 edge = expE.Current();
1165 if ( edge.IsNull() || edge.ShapeType() != TopAbs_EDGE )
1166 RETURN_BAD_RESULT("Edge not found");
1168 TopExp::Vertices( TopoDS::Edge( edge.Oriented(TopAbs_FORWARD)), VV1[0], VV1[1]);
1169 if ( VV1[0].IsSame( VV1[1] ))
1170 RETURN_BAD_RESULT("Only closed edges");
1172 // find vertices closest to 2 linked vertices of shape 1
1173 for ( int i1 = 0; i1 < 2; ++i1 )
1175 double dist2 = DBL_MAX;
1176 gp_Pnt p1 = BRep_Tool::Pnt( VV1[ i1 ]);
1177 p1.Translate( vec01 );
1178 p1.Scale( gc[1], scale );
1179 for ( int i2 = 1; i2 <= vMap2.Extent(); ++i2 )
1181 TopoDS_Vertex V2 = TopoDS::Vertex( vMap2( i2 ));
1182 gp_Pnt p2 = BRep_Tool::Pnt ( V2 );
1183 double d2 = p1.SquareDistance( p2 );
1184 if ( d2 < dist2 && !V2.IsSame( VV2[ 0 ])) {
1185 VV2[ i1 ] = V2; dist2 = d2;
1190 InsertAssociation( VV1[ 0 ], VV2[ 0 ], theMap, bidirect);
1191 InsertAssociation( VV1[ 1 ], VV2[ 1 ], theMap, bidirect);
1192 MESSAGE("Initial assoc VERT " << theMesh1->GetMeshDS()->ShapeToIndex( VV1[ 0 ] )<<
1193 " to " << theMesh2->GetMeshDS()->ShapeToIndex( VV2[ 0 ] )<<
1194 "\nand VERT " << theMesh1->GetMeshDS()->ShapeToIndex( VV1[ 1 ] )<<
1195 " to " << theMesh2->GetMeshDS()->ShapeToIndex( VV2[ 1 ] ));
1196 if ( theShape1.ShapeType() == TopAbs_EDGE ) {
1197 InsertAssociation( theShape1, theShape2, theMap, bidirect );
1201 return FindSubShapeAssociation( theShape1, theMesh1, theShape2, theMesh2, theMap );
1204 //================================================================================
1206 * \brief Find association of edges of faces
1207 * \param face1 - face 1
1208 * \param VV1 - vertices of face 1
1209 * \param face2 - face 2
1210 * \param VV2 - vertices of face 2 associated with ones of face 1
1211 * \param edges1 - out list of edges of face 1
1212 * \param edges2 - out list of edges of face 2
1213 * \retval int - nb of edges in an outer wire in a success case, else zero
1215 //================================================================================
1217 int StdMeshers_ProjectionUtils::FindFaceAssociation(const TopoDS_Face& face1,
1218 TopoDS_Vertex VV1[2],
1219 const TopoDS_Face& face2,
1220 TopoDS_Vertex VV2[2],
1221 list< TopoDS_Edge > & edges1,
1222 list< TopoDS_Edge > & edges2)
1225 list< int > nbEInW1, nbEInW2;
1226 int i_ok_wire_algo = -1;
1227 for ( int outer_wire_algo = 0; outer_wire_algo < 2 && !OK; ++outer_wire_algo )
1232 if ( SMESH_Block::GetOrderedEdges( face1, VV1[0], edges1, nbEInW1, outer_wire_algo) !=
1233 SMESH_Block::GetOrderedEdges( face2, VV2[0], edges2, nbEInW2, outer_wire_algo) )
1234 CONT_BAD_RESULT("Different number of wires in faces ");
1236 if ( nbEInW1 != nbEInW2 )
1237 CONT_BAD_RESULT("Different number of edges in faces: " <<
1238 nbEInW1.front() << " != " << nbEInW2.front());
1240 i_ok_wire_algo = outer_wire_algo;
1242 // Define if we need to reverse one of wires to make edges in lists match each other
1244 bool reverse = false;
1246 list< TopoDS_Edge >::iterator edgeIt;
1247 if ( !VV1[1].IsSame( TopExp::LastVertex( edges1.front(), true ))) {
1249 edgeIt = --edges1.end();
1250 // check if the second vertex belongs to the first or last edge in the wire
1251 if ( !VV1[1].IsSame( TopExp::FirstVertex( *edgeIt, true ))) {
1252 bool KO = true; // belongs to none
1253 if ( nbEInW1.size() > 1 ) { // several wires
1254 edgeIt = edges1.begin();
1255 std::advance( edgeIt, nbEInW1.front()-1 );
1256 KO = !VV1[1].IsSame( TopExp::FirstVertex( *edgeIt, true ));
1259 CONT_BAD_RESULT("GetOrderedEdges() failed");
1262 edgeIt = --edges2.end();
1263 if ( !VV2[1].IsSame( TopExp::LastVertex( edges2.front(), true ))) {
1265 // check if the second vertex belongs to the first or last edge in the wire
1266 if ( !VV2[1].IsSame( TopExp::FirstVertex( *edgeIt, true ))) {
1267 bool KO = true; // belongs to none
1268 if ( nbEInW2.size() > 1 ) { // several wires
1269 edgeIt = edges2.begin();
1270 std::advance( edgeIt, nbEInW2.front()-1 );
1271 KO = !VV2[1].IsSame( TopExp::FirstVertex( *edgeIt, true ));
1274 CONT_BAD_RESULT("GetOrderedEdges() failed");
1279 Reverse( edges2 , nbEInW2.front());
1280 if (( VV1[1].IsSame( TopExp::LastVertex( edges1.front(), true ))) !=
1281 ( VV2[1].IsSame( TopExp::LastVertex( edges2.front(), true ))))
1282 CONT_BAD_RESULT("GetOrderedEdges() failed");
1286 } // loop algos getting an outer wire
1288 // Try to orient all (if !OK) or only internal wires (issue 0020996) by UV similarity
1289 if (( !OK || nbEInW1.size() > 1 ) && i_ok_wire_algo > -1 )
1291 // Check that Vec(VV1[0],VV1[1]) in 2D on face1 is the same
1292 // as Vec(VV2[0],VV2[1]) on face2
1293 double vTol = BRep_Tool::Tolerance( VV1[0] );
1294 BRepAdaptor_Surface surface1( face1, false );
1296 surface1.UResolution( vTol ) + surface1.VResolution( vTol ); // let's be tolerant
1297 gp_Pnt2d v0f1UV = BRep_Tool::Parameters( VV1[0], face1 );
1298 gp_Pnt2d v0f2UV = BRep_Tool::Parameters( VV2[0], face2 );
1299 gp_Pnt2d v1f1UV = BRep_Tool::Parameters( VV1[1], face1 );
1300 gp_Pnt2d v1f2UV = BRep_Tool::Parameters( VV2[1], face2 );
1301 gp_Vec2d v01f1Vec( v0f1UV, v1f1UV );
1302 gp_Vec2d v01f2Vec( v0f2UV, v1f2UV );
1303 if ( Abs( v01f1Vec.X()-v01f2Vec.X()) < vTolUV && Abs( v01f1Vec.Y()-v01f2Vec.Y()) < vTolUV )
1305 if ( i_ok_wire_algo != 1 )
1309 SMESH_Block::GetOrderedEdges( face1, VV1[0], edges1, nbEInW1, i_ok_wire_algo);
1310 SMESH_Block::GetOrderedEdges( face2, VV2[0], edges2, nbEInW2, i_ok_wire_algo);
1312 gp_XY dUV = v0f2UV.XY() - v0f1UV.XY(); // UV shift between 2 faces
1313 // skip edges of the outer wire (if the outer wire is OK)
1314 list< int >::iterator nbEInW = nbEInW1.begin();
1315 list< TopoDS_Edge >::iterator edge1Beg = edges1.begin(), edge2Beg = edges2.begin();
1318 for ( int i = 0; i < *nbEInW; ++i )
1319 ++edge1Beg, ++edge2Beg;
1322 for ( ; nbEInW != nbEInW1.end(); ++nbEInW ) // loop on wires
1324 // reach an end of edges of a current wire
1325 list< TopoDS_Edge >::iterator edge1End = edge1Beg, edge2End = edge2Beg;
1326 for ( int i = 0; i < *nbEInW; ++i )
1327 ++edge1End, ++edge2End;
1328 // rotate edges2 untill coincident with edges1 in 2D
1329 v0f1UV = BRep_Tool::Parameters( TopExp::FirstVertex(*edge1Beg,true), face1 );
1330 v1f1UV = BRep_Tool::Parameters( TopExp::LastVertex (*edge1Beg,true), face1 );
1331 v0f1UV.ChangeCoord() += dUV;
1332 v1f1UV.ChangeCoord() += dUV;
1334 while ( --i > 0 && !sameVertexUV( *edge2Beg, face2, 0, v0f1UV, vTolUV ))
1335 edges2.splice( edge2End, edges2, edge2Beg++ ); // move edge2Beg to place before edge2End
1336 if ( sameVertexUV( *edge2Beg, face2, 0, v0f1UV, vTolUV ))
1338 if ( nbEInW == nbEInW1.begin() )
1339 OK = true; // OK is for the first wire
1340 // reverse edges2 if needed
1341 if ( !sameVertexUV( *edge2Beg, face2, 1, v1f1UV, vTolUV ))
1343 Reverse( edges2 , *nbEInW, distance( edges2.begin(),edge2Beg ));
1344 // set correct edge2End
1345 edge2End = edges2.begin();
1346 std::advance( edge2End, std::accumulate( nbEInW1.begin(), nbEInW, *nbEInW));
1349 // prepare to the next wire loop
1350 edge1Beg = edge1End, edge2Beg = edge2End;
1355 return OK ? nbEInW1.front() : 0;
1358 //=======================================================================
1359 //function : InitVertexAssociation
1361 //=======================================================================
1363 void StdMeshers_ProjectionUtils::InitVertexAssociation( const SMESH_Hypothesis* theHyp,
1364 TShapeShapeMap & theAssociationMap,
1365 const TopoDS_Shape& theTargetShape)
1367 string hypName = theHyp->GetName();
1368 if ( hypName == "ProjectionSource1D" ) {
1369 const StdMeshers_ProjectionSource1D * hyp =
1370 static_cast<const StdMeshers_ProjectionSource1D*>( theHyp );
1371 if ( hyp->HasVertexAssociation() )
1372 InsertAssociation( hyp->GetSourceVertex(),hyp->GetTargetVertex(),theAssociationMap);
1374 else if ( hypName == "ProjectionSource2D" ) {
1375 const StdMeshers_ProjectionSource2D * hyp =
1376 static_cast<const StdMeshers_ProjectionSource2D*>( theHyp );
1377 if ( hyp->HasVertexAssociation() ) {
1378 InsertAssociation( hyp->GetSourceVertex(1),hyp->GetTargetVertex(1),theAssociationMap);
1379 InsertAssociation( hyp->GetSourceVertex(2),hyp->GetTargetVertex(2),theAssociationMap);
1382 else if ( hypName == "ProjectionSource3D" ) {
1383 const StdMeshers_ProjectionSource3D * hyp =
1384 static_cast<const StdMeshers_ProjectionSource3D*>( theHyp );
1385 if ( hyp->HasVertexAssociation() ) {
1386 InsertAssociation( hyp->GetSourceVertex(1),hyp->GetTargetVertex(1),theAssociationMap);
1387 InsertAssociation( hyp->GetSourceVertex(2),hyp->GetTargetVertex(2),theAssociationMap);
1392 //=======================================================================
1394 * \brief Inserts association theShape1 <-> theShape2 to TShapeShapeMap
1395 * \param theShape1 - shape 1
1396 * \param theShape2 - shape 2
1397 * \param theAssociationMap - association map
1398 * \retval bool - true if there was no association for these shapes before
1400 //=======================================================================
1402 bool StdMeshers_ProjectionUtils::InsertAssociation( const TopoDS_Shape& theShape1,
1403 const TopoDS_Shape& theShape2,
1404 TShapeShapeMap & theAssociationMap,
1405 const bool theBidirectional)
1407 if ( !theShape1.IsNull() && !theShape2.IsNull() ) {
1408 SHOW_SHAPE(theShape1,"Assoc ");
1409 SHOW_SHAPE(theShape2," to ");
1410 bool isNew = ( theAssociationMap.Bind( theShape1, theShape2 ));
1411 if ( theBidirectional )
1412 theAssociationMap.Bind( theShape2, theShape1 );
1416 throw SALOME_Exception("StdMeshers_ProjectionUtils: attempt to associate NULL shape");
1421 //=======================================================================
1423 * \brief Finds an edge by its vertices in a main shape of the mesh
1424 * \param aMesh - the mesh
1425 * \param V1 - vertex 1
1426 * \param V2 - vertex 2
1427 * \retval TopoDS_Edge - found edge
1429 //=======================================================================
1431 TopoDS_Edge StdMeshers_ProjectionUtils::GetEdgeByVertices( SMESH_Mesh* theMesh,
1432 const TopoDS_Vertex& theV1,
1433 const TopoDS_Vertex& theV2)
1435 if ( theMesh && !theV1.IsNull() && !theV2.IsNull() )
1437 TopTools_ListIteratorOfListOfShape ancestorIt( theMesh->GetAncestors( theV1 ));
1438 for ( ; ancestorIt.More(); ancestorIt.Next() )
1439 if ( ancestorIt.Value().ShapeType() == TopAbs_EDGE )
1440 for ( TopExp_Explorer expV ( ancestorIt.Value(), TopAbs_VERTEX );
1443 if ( theV2.IsSame( expV.Current() ))
1444 return TopoDS::Edge( ancestorIt.Value() );
1446 return TopoDS_Edge();
1449 //================================================================================
1451 * \brief Return another face sharing an edge
1452 * \param edgeToFaces - data map of descendants to ancestors
1453 * \param edge - edge
1454 * \param face - face
1455 * \retval TopoDS_Face - found face
1457 //================================================================================
1459 TopoDS_Face StdMeshers_ProjectionUtils::GetNextFace( const TAncestorMap& edgeToFaces,
1460 const TopoDS_Edge& edge,
1461 const TopoDS_Face& face)
1463 // if ( !edge.IsNull() && !face.IsNull() && edgeToFaces.Contains( edge ))
1464 if ( !edge.IsNull() && edgeToFaces.Contains( edge )) // PAL16202
1466 TopTools_ListIteratorOfListOfShape ancestorIt( edgeToFaces.FindFromKey( edge ));
1467 for ( ; ancestorIt.More(); ancestorIt.Next() )
1468 if ( ancestorIt.Value().ShapeType() == TopAbs_FACE &&
1469 !face.IsSame( ancestorIt.Value() ))
1470 return TopoDS::Face( ancestorIt.Value() );
1472 return TopoDS_Face();
1475 //================================================================================
1477 * \brief Return other vertex of an edge
1479 //================================================================================
1481 TopoDS_Vertex StdMeshers_ProjectionUtils::GetNextVertex(const TopoDS_Edge& edge,
1482 const TopoDS_Vertex& vertex)
1484 TopoDS_Vertex vF,vL;
1485 TopExp::Vertices(edge,vF,vL);
1486 if ( vF.IsSame( vL ))
1487 return TopoDS_Vertex();
1488 return vertex.IsSame( vF ) ? vL : vF;
1491 //================================================================================
1493 * \brief Return a propagation edge
1494 * \param aMesh - mesh
1495 * \param theEdge - edge to find by propagation
1496 * \param fromEdge - start edge for propagation
1497 * \retval pair<int,TopoDS_Edge> - propagation step and found edge
1499 //================================================================================
1501 pair<int,TopoDS_Edge>
1502 StdMeshers_ProjectionUtils::GetPropagationEdge( SMESH_Mesh* aMesh,
1503 const TopoDS_Edge& theEdge,
1504 const TopoDS_Edge& fromEdge)
1506 SMESH_IndexedMapOfShape aChain;
1509 // List of edges, added to chain on the previous cycle pass
1510 TopTools_ListOfShape listPrevEdges;
1511 listPrevEdges.Append(fromEdge);
1513 // Collect all edges pass by pass
1514 while (listPrevEdges.Extent() > 0) {
1516 // List of edges, added to chain on this cycle pass
1517 TopTools_ListOfShape listCurEdges;
1519 // Find the next portion of edges
1520 TopTools_ListIteratorOfListOfShape itE (listPrevEdges);
1521 for (; itE.More(); itE.Next()) {
1522 TopoDS_Shape anE = itE.Value();
1524 // Iterate on faces, having edge <anE>
1525 TopTools_ListIteratorOfListOfShape itA (aMesh->GetAncestors(anE));
1526 for (; itA.More(); itA.Next()) {
1527 TopoDS_Shape aW = itA.Value();
1529 // There are objects of different type among the ancestors of edge
1530 if (aW.ShapeType() == TopAbs_WIRE) {
1531 TopoDS_Shape anOppE;
1533 BRepTools_WireExplorer aWE (TopoDS::Wire(aW));
1534 Standard_Integer nb = 1, found = 0;
1535 TopTools_Array1OfShape anEdges (1,4);
1536 for (; aWE.More(); aWE.Next(), nb++) {
1541 anEdges(nb) = aWE.Current();
1542 if (anEdges(nb).IsSame(anE)) found = nb;
1545 if (nb == 5 && found > 0) {
1546 // Quadrangle face found, get an opposite edge
1547 Standard_Integer opp = found + 2;
1548 if (opp > 4) opp -= 4;
1549 anOppE = anEdges(opp);
1551 // add anOppE to aChain if ...
1552 if (!aChain.Contains(anOppE)) { // ... anOppE is not in aChain
1553 // Add found edge to the chain oriented so that to
1554 // have it co-directed with a forward MainEdge
1555 TopAbs_Orientation ori = anE.Orientation();
1556 if ( anEdges(opp).Orientation() == anEdges(found).Orientation() )
1557 ori = TopAbs::Reverse( ori );
1558 anOppE.Orientation( ori );
1559 if ( anOppE.IsSame( theEdge ))
1560 return make_pair( step, TopoDS::Edge( anOppE ));
1562 listCurEdges.Append(anOppE);
1564 } // if (nb == 5 && found > 0)
1565 } // if (aF.ShapeType() == TopAbs_WIRE)
1566 } // for (; itF.More(); itF.Next())
1567 } // for (; itE.More(); itE.Next())
1569 listPrevEdges = listCurEdges;
1570 } // while (listPrevEdges.Extent() > 0)
1572 return make_pair( INT_MAX, TopoDS_Edge());
1575 //================================================================================
1577 * \brief Find corresponding nodes on two faces
1578 * \param face1 - the first face
1579 * \param mesh1 - mesh containing elements on the first face
1580 * \param face2 - the second face
1581 * \param mesh2 - mesh containing elements on the second face
1582 * \param assocMap - map associating subshapes of the faces
1583 * \param node1To2Map - map containing found matching nodes
1584 * \retval bool - is a success
1586 //================================================================================
1588 bool StdMeshers_ProjectionUtils::
1589 FindMatchingNodesOnFaces( const TopoDS_Face& face1,
1591 const TopoDS_Face& face2,
1593 const TShapeShapeMap & assocMap,
1594 TNodeNodeMap & node1To2Map)
1596 SMESHDS_Mesh* meshDS1 = mesh1->GetMeshDS();
1597 SMESHDS_Mesh* meshDS2 = mesh2->GetMeshDS();
1599 SMESH_MesherHelper helper1( *mesh1 );
1600 SMESH_MesherHelper helper2( *mesh2 );
1602 // Get corresponding submeshes and roughly check match of meshes
1604 SMESHDS_SubMesh * SM2 = meshDS2->MeshElements( face2 );
1605 SMESHDS_SubMesh * SM1 = meshDS1->MeshElements( face1 );
1607 RETURN_BAD_RESULT("Empty submeshes");
1608 if ( SM2->NbNodes() != SM1->NbNodes() ||
1609 SM2->NbElements() != SM1->NbElements() )
1610 RETURN_BAD_RESULT("Different meshes on corresponding faces "
1611 << meshDS1->ShapeToIndex( face1 ) << " and "
1612 << meshDS2->ShapeToIndex( face2 ));
1613 if ( SM2->NbElements() == 0 )
1614 RETURN_BAD_RESULT("Empty submeshes");
1616 helper1.SetSubShape( face1 );
1617 helper2.SetSubShape( face2 );
1618 if ( helper1.HasSeam() != helper2.HasSeam() )
1619 RETURN_BAD_RESULT("Different faces' geometry");
1621 // Data to call SMESH_MeshEditor::FindMatchingNodes():
1623 // 1. Nodes of corresponding links:
1625 // get 2 matching edges, try to find not seam ones
1626 TopoDS_Edge edge1, edge2, seam1, seam2, anyEdge1, anyEdge2;
1627 TopExp_Explorer eE( OuterShape( face2, TopAbs_WIRE ), TopAbs_EDGE );
1630 TopoDS_Edge e2 = TopoDS::Edge( eE.Current() );
1633 if ( !assocMap.IsBound( e2 ))
1634 RETURN_BAD_RESULT("Association not found for edge " << meshDS2->ShapeToIndex( e2 ));
1635 TopoDS_Edge e1 = TopoDS::Edge( assocMap( e2 ));
1636 if ( !helper1.IsSubShape( e1, face1 ))
1637 RETURN_BAD_RESULT("Wrong association, edge " << meshDS1->ShapeToIndex( e1 ) <<
1638 " isn't a subshape of face " << meshDS1->ShapeToIndex( face1 ));
1639 // check that there are nodes on edges
1640 SMESHDS_SubMesh * eSM1 = meshDS1->MeshElements( e1 );
1641 SMESHDS_SubMesh * eSM2 = meshDS2->MeshElements( e2 );
1642 bool nodesOnEdges = ( eSM1 && eSM2 && eSM1->NbNodes() && eSM2->NbNodes() );
1643 // check that the nodes on edges belong to faces
1644 // (as NETGEN ignores nodes on the degenerated geom edge)
1645 bool nodesOfFaces = false;
1646 if ( nodesOnEdges ) {
1647 const SMDS_MeshNode* n1 = eSM1->GetNodes()->next();
1648 const SMDS_MeshNode* n2 = eSM2->GetNodes()->next();
1649 nodesOfFaces = ( n1->GetInverseElementIterator(SMDSAbs_Face)->more() &&
1650 n2->GetInverseElementIterator(SMDSAbs_Face)->more() );
1654 if ( helper2.IsRealSeam( e2 )) {
1655 seam1 = e1; seam2 = e2;
1658 edge1 = e1; edge2 = e2;
1662 anyEdge1 = e1; anyEdge2 = e2;
1664 } while ( edge2.IsNull() && eE.More() );
1666 if ( edge2.IsNull() ) {
1667 edge1 = seam1; edge2 = seam2;
1669 bool hasNodesOnEdge = (! edge2.IsNull() );
1670 if ( !hasNodesOnEdge ) {
1671 // 0020338 - nb segments == 1
1672 edge1 = anyEdge1; edge2 = anyEdge2;
1675 // get 2 matching vertices
1676 TopoDS_Vertex V2 = TopExp::FirstVertex( TopoDS::Edge( edge2 ));
1677 if ( !assocMap.IsBound( V2 ))
1678 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
1679 TopoDS_Vertex V1 = TopoDS::Vertex( assocMap( V2 ));
1681 // nodes on vertices
1682 const SMDS_MeshNode* vNode1 = SMESH_Algo::VertexNode( V1, meshDS1 );
1683 const SMDS_MeshNode* vNode2 = SMESH_Algo::VertexNode( V2, meshDS2 );
1684 if ( !vNode1 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
1685 if ( !vNode2 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
1687 // nodes on edges linked with nodes on vertices
1688 const SMDS_MeshNode* nullNode = 0;
1689 vector< const SMDS_MeshNode*> eNode1( 2, nullNode );
1690 vector< const SMDS_MeshNode*> eNode2( 2, nullNode );
1691 if ( hasNodesOnEdge )
1693 int nbNodeToGet = 1;
1694 if ( IsClosedEdge( edge1 ) || IsClosedEdge( edge2 ) )
1696 for ( int is2 = 0; is2 < 2; ++is2 )
1698 TopoDS_Edge & edge = is2 ? edge2 : edge1;
1699 SMESHDS_Mesh * smDS = is2 ? meshDS2 : meshDS1;
1700 SMESHDS_SubMesh* edgeSM = smDS->MeshElements( edge );
1701 // nodes linked with ones on vertices
1702 const SMDS_MeshNode* vNode = is2 ? vNode2 : vNode1;
1703 vector< const SMDS_MeshNode*>& eNode = is2 ? eNode2 : eNode1;
1705 SMDS_ElemIteratorPtr vElem = vNode->GetInverseElementIterator(SMDSAbs_Edge);
1706 while ( vElem->more() && nbGotNode != nbNodeToGet ) {
1707 const SMDS_MeshElement* elem = vElem->next();
1708 if ( edgeSM->Contains( elem ))
1709 eNode[ nbGotNode++ ] =
1710 ( elem->GetNode(0) == vNode ) ? elem->GetNode(1) : elem->GetNode(0);
1712 if ( nbGotNode > 1 ) // sort found nodes by param on edge
1714 SMESH_MesherHelper* helper = is2 ? &helper2 : &helper1;
1715 double u0 = helper->GetNodeU( edge, eNode[ 0 ]);
1716 double u1 = helper->GetNodeU( edge, eNode[ 1 ]);
1717 if ( u0 > u1 ) std::swap( eNode[ 0 ], eNode[ 1 ]);
1719 if ( nbGotNode == 0 )
1720 RETURN_BAD_RESULT("Found no nodes on edge " << smDS->ShapeToIndex( edge ) <<
1721 " linked to " << vNode );
1724 else // 0020338 - nb segments == 1
1726 // get 2 other matching vertices
1727 V2 = TopExp::LastVertex( TopoDS::Edge( edge2 ));
1728 if ( !assocMap.IsBound( V2 ))
1729 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
1730 V1 = TopoDS::Vertex( assocMap( V2 ));
1732 // nodes on vertices
1733 eNode1[0] = SMESH_Algo::VertexNode( V1, meshDS1 );
1734 eNode2[0] = SMESH_Algo::VertexNode( V2, meshDS2 );
1735 if ( !eNode1[0] ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
1736 if ( !eNode2[0] ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
1741 set<const SMDS_MeshElement*> Elems1, Elems2;
1742 for ( int is2 = 0; is2 < 2; ++is2 )
1744 set<const SMDS_MeshElement*> & elems = is2 ? Elems2 : Elems1;
1745 SMESHDS_SubMesh* sm = is2 ? SM2 : SM1;
1746 SMESH_MesherHelper* helper = is2 ? &helper2 : &helper1;
1747 const TopoDS_Face & face = is2 ? face2 : face1;
1748 SMDS_ElemIteratorPtr eIt = sm->GetElements();
1750 if ( !helper->IsRealSeam( is2 ? edge2 : edge1 ))
1752 while ( eIt->more() ) elems.insert( eIt->next() );
1756 // the only suitable edge is seam, i.e. it is a sphere.
1757 // FindMatchingNodes() will not know which way to go from any edge.
1758 // So we ignore all faces having nodes on edges or vertices except
1759 // one of faces sharing current start nodes
1761 // find a face to keep
1762 const SMDS_MeshElement* faceToKeep = 0;
1763 const SMDS_MeshNode* vNode = is2 ? vNode2 : vNode1;
1764 const SMDS_MeshNode* eNode = is2 ? eNode2[0] : eNode1[0];
1765 TIDSortedElemSet inSet, notInSet;
1767 const SMDS_MeshElement* f1 =
1768 SMESH_MeshEditor::FindFaceInSet( vNode, eNode, inSet, notInSet );
1769 if ( !f1 ) RETURN_BAD_RESULT("The first face on seam not found");
1770 notInSet.insert( f1 );
1772 const SMDS_MeshElement* f2 =
1773 SMESH_MeshEditor::FindFaceInSet( vNode, eNode, inSet, notInSet );
1774 if ( !f2 ) RETURN_BAD_RESULT("The second face on seam not found");
1776 // select a face with less UV of vNode
1777 const SMDS_MeshNode* notSeamNode[2] = {0, 0};
1778 for ( int iF = 0; iF < 2; ++iF ) {
1779 const SMDS_MeshElement* f = ( iF ? f2 : f1 );
1780 for ( int i = 0; !notSeamNode[ iF ] && i < f->NbNodes(); ++i ) {
1781 const SMDS_MeshNode* node = f->GetNode( i );
1782 if ( !helper->IsSeamShape( node->getshapeId() ))
1783 notSeamNode[ iF ] = node;
1786 gp_Pnt2d uv1 = helper->GetNodeUV( face, vNode, notSeamNode[0] );
1787 gp_Pnt2d uv2 = helper->GetNodeUV( face, vNode, notSeamNode[1] );
1788 if ( uv1.X() + uv1.Y() > uv2.X() + uv2.Y() )
1794 elems.insert( faceToKeep );
1795 while ( eIt->more() ) {
1796 const SMDS_MeshElement* f = eIt->next();
1797 int nbNodes = f->NbNodes();
1798 if ( f->IsQuadratic() )
1801 for ( int i = 0; !onBnd && i < nbNodes; ++i ) {
1802 const SMDS_MeshNode* node = f->GetNode( i );
1803 onBnd = ( node->GetPosition()->GetTypeOfPosition() != SMDS_TOP_FACE);
1808 // add also faces adjacent to faceToKeep
1809 int nbNodes = faceToKeep->NbNodes();
1810 if ( faceToKeep->IsQuadratic() ) nbNodes /= 2;
1811 notInSet.insert( f1 );
1812 notInSet.insert( f2 );
1813 for ( int i = 0; i < nbNodes; ++i ) {
1814 const SMDS_MeshNode* n1 = faceToKeep->GetNode( i );
1815 const SMDS_MeshNode* n2 = faceToKeep->GetNode( i+1 % nbNodes );
1816 f1 = SMESH_MeshEditor::FindFaceInSet( n1, n2, inSet, notInSet );
1820 } // case on a sphere
1821 } // loop on 2 faces
1823 // int quadFactor = (*Elems1.begin())->IsQuadratic() ? 2 : 1;
1825 node1To2Map.clear();
1826 int res = SMESH_MeshEditor::FindMatchingNodes( Elems1, Elems2,
1828 eNode1[0], eNode2[0],
1830 if ( res != SMESH_MeshEditor::SEW_OK )
1831 RETURN_BAD_RESULT("FindMatchingNodes() result " << res );
1833 // On a sphere, add matching nodes on the edge
1835 if ( helper1.IsRealSeam( edge1 ))
1837 // sort nodes on edges by param on edge
1838 map< double, const SMDS_MeshNode* > u2nodesMaps[2];
1839 for ( int is2 = 0; is2 < 2; ++is2 )
1841 TopoDS_Edge & edge = is2 ? edge2 : edge1;
1842 SMESHDS_Mesh * smDS = is2 ? meshDS2 : meshDS1;
1843 SMESHDS_SubMesh* edgeSM = smDS->MeshElements( edge );
1844 map< double, const SMDS_MeshNode* > & pos2nodes = u2nodesMaps[ is2 ];
1846 SMDS_NodeIteratorPtr nIt = edgeSM->GetNodes();
1847 while ( nIt->more() ) {
1848 const SMDS_MeshNode* node = nIt->next();
1849 const SMDS_EdgePosition* pos =
1850 static_cast<const SMDS_EdgePosition*>(node->GetPosition());
1851 pos2nodes.insert( make_pair( pos->GetUParameter(), node ));
1853 if ( pos2nodes.size() != edgeSM->NbNodes() )
1854 RETURN_BAD_RESULT("Equal params of nodes on edge "
1855 << smDS->ShapeToIndex( edge ) << " of face " << is2 );
1857 if ( u2nodesMaps[0].size() != u2nodesMaps[1].size() )
1858 RETURN_BAD_RESULT("Different nb of new nodes on edges or wrong params");
1860 // compare edge orientation
1861 double u1 = helper1.GetNodeU( edge1, vNode1 );
1862 double u2 = helper2.GetNodeU( edge2, vNode2 );
1863 bool isFirst1 = ( u1 < u2nodesMaps[0].begin()->first );
1864 bool isFirst2 = ( u2 < u2nodesMaps[1].begin()->first );
1865 bool reverse ( isFirst1 != isFirst2 );
1867 // associate matching nodes
1868 map< double, const SMDS_MeshNode* >::iterator u_Node1, u_Node2, end1;
1869 map< double, const SMDS_MeshNode* >::reverse_iterator uR_Node2;
1870 u_Node1 = u2nodesMaps[0].begin();
1871 u_Node2 = u2nodesMaps[1].begin();
1872 uR_Node2 = u2nodesMaps[1].rbegin();
1873 end1 = u2nodesMaps[0].end();
1874 for ( ; u_Node1 != end1; ++u_Node1 ) {
1875 const SMDS_MeshNode* n1 = u_Node1->second;
1876 const SMDS_MeshNode* n2 = ( reverse ? (uR_Node2++)->second : (u_Node2++)->second );
1877 node1To2Map.insert( make_pair( n1, n2 ));
1880 // associate matching nodes on the last vertices
1881 V2 = TopExp::LastVertex( TopoDS::Edge( edge2 ));
1882 if ( !assocMap.IsBound( V2 ))
1883 RETURN_BAD_RESULT("Association not found for vertex " << meshDS2->ShapeToIndex( V2 ));
1884 V1 = TopoDS::Vertex( assocMap( V2 ));
1885 vNode1 = SMESH_Algo::VertexNode( V1, meshDS1 );
1886 vNode2 = SMESH_Algo::VertexNode( V2, meshDS2 );
1887 if ( !vNode1 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS1->ShapeToIndex( V1 ));
1888 if ( !vNode2 ) RETURN_BAD_RESULT("No node on vertex #" << meshDS2->ShapeToIndex( V2 ));
1889 node1To2Map.insert( make_pair( vNode1, vNode2 ));
1892 // don't know why this condition is usually true :(
1893 // if ( node1To2Map.size() * quadFactor < SM1->NbNodes() )
1894 // MESSAGE("FindMatchingNodes() found too few node pairs starting from nodes ("
1895 // << vNode1->GetID() << " - " << eNode1[0]->GetID() << ") ("
1896 // << vNode2->GetID() << " - " << eNode2[0]->GetID() << "):"
1897 // << node1To2Map.size() * quadFactor << " < " << SM1->NbNodes());
1902 //================================================================================
1904 * \brief Check if the first and last vertices of an edge are the same
1905 * \param anEdge - the edge to check
1906 * \retval bool - true if same
1908 //================================================================================
1910 bool StdMeshers_ProjectionUtils::IsClosedEdge( const TopoDS_Edge& anEdge )
1912 return TopExp::FirstVertex( anEdge ).IsSame( TopExp::LastVertex( anEdge ));
1915 //================================================================================
1917 * \brief Return any subshape of a face belonging to the outer wire
1918 * \param face - the face
1919 * \param type - type of subshape to return
1920 * \retval TopoDS_Shape - the found subshape
1922 //================================================================================
1924 TopoDS_Shape StdMeshers_ProjectionUtils::OuterShape( const TopoDS_Face& face,
1925 TopAbs_ShapeEnum type)
1927 TopExp_Explorer exp( BRepTools::OuterWire( face ), type );
1929 return exp.Current();
1930 return TopoDS_Shape();
1933 //================================================================================
1935 * \brief Check that submesh is computed and try to compute it if is not
1936 * \param sm - submesh to compute
1937 * \param iterationNb - int used to stop infinite recursive call
1938 * \retval bool - true if computed
1940 //================================================================================
1942 bool StdMeshers_ProjectionUtils::MakeComputed(SMESH_subMesh * sm, const int iterationNb)
1944 if ( iterationNb > 10 )
1945 RETURN_BAD_RESULT("Infinite recursive projection");
1947 RETURN_BAD_RESULT("NULL submesh");
1948 if ( sm->IsMeshComputed() )
1951 SMESH_Mesh* mesh = sm->GetFather();
1952 SMESH_Gen* gen = mesh->GetGen();
1953 SMESH_Algo* algo = gen->GetAlgo( *mesh, sm->GetSubShape() );
1956 if ( sm->GetSubShape().ShapeType() != TopAbs_COMPOUND )
1957 RETURN_BAD_RESULT("No algo assigned to submesh " << sm->GetId());
1959 bool computed = true;
1960 for ( TopoDS_Iterator grMember( sm->GetSubShape() ); grMember.More(); grMember.Next())
1961 if ( SMESH_subMesh* grSub = mesh->GetSubMesh( grMember.Value() ))
1962 if ( !MakeComputed( grSub, iterationNb + 1 ))
1967 string algoType = algo->GetName();
1968 if ( algoType.substr(0, 11) != "Projection_")
1969 return gen->Compute( *mesh, sm->GetSubShape() );
1971 // try to compute source mesh
1973 const list <const SMESHDS_Hypothesis *> & hyps =
1974 algo->GetUsedHypothesis( *mesh, sm->GetSubShape() );
1976 TopoDS_Shape srcShape;
1977 SMESH_Mesh* srcMesh = 0;
1978 list <const SMESHDS_Hypothesis*>::const_iterator hIt = hyps.begin();
1979 for ( ; srcShape.IsNull() && hIt != hyps.end(); ++hIt ) {
1980 string hypName = (*hIt)->GetName();
1981 if ( hypName == "ProjectionSource1D" ) {
1982 const StdMeshers_ProjectionSource1D * hyp =
1983 static_cast<const StdMeshers_ProjectionSource1D*>( *hIt );
1984 srcShape = hyp->GetSourceEdge();
1985 srcMesh = hyp->GetSourceMesh();
1987 else if ( hypName == "ProjectionSource2D" ) {
1988 const StdMeshers_ProjectionSource2D * hyp =
1989 static_cast<const StdMeshers_ProjectionSource2D*>( *hIt );
1990 srcShape = hyp->GetSourceFace();
1991 srcMesh = hyp->GetSourceMesh();
1993 else if ( hypName == "ProjectionSource3D" ) {
1994 const StdMeshers_ProjectionSource3D * hyp =
1995 static_cast<const StdMeshers_ProjectionSource3D*>( *hIt );
1996 srcShape = hyp->GetSource3DShape();
1997 srcMesh = hyp->GetSourceMesh();
2000 if ( srcShape.IsNull() ) // no projection source defined
2001 return gen->Compute( *mesh, sm->GetSubShape() );
2003 if ( srcShape.IsSame( sm->GetSubShape() ))
2004 RETURN_BAD_RESULT("Projection from self");
2009 if ( MakeComputed( srcMesh->GetSubMesh( srcShape ), iterationNb + 1 ))
2010 return gen->Compute( *mesh, sm->GetSubShape() );
2015 //================================================================================
2017 * \brief Count nb of subshapes
2018 * \param shape - the shape
2019 * \param type - the type of subshapes to count
2020 * \retval int - the calculated number
2022 //================================================================================
2024 int StdMeshers_ProjectionUtils::Count(const TopoDS_Shape& shape,
2025 const TopAbs_ShapeEnum type,
2026 const bool ignoreSame)
2029 TopTools_IndexedMapOfShape map;
2030 TopExp::MapShapes( shape, type, map );
2031 return map.Extent();
2035 for ( TopExp_Explorer exp( shape, type ); exp.More(); exp.Next() )
2041 //================================================================================
2043 * \brief Return true if edge is a boundary of edgeContainer
2045 //================================================================================
2047 bool StdMeshers_ProjectionUtils::IsBoundaryEdge(const TopoDS_Edge& edge,
2048 const TopoDS_Shape& edgeContainer,
2051 TopTools_IndexedMapOfShape facesOfEdgeContainer, facesNearEdge;
2052 TopExp::MapShapes( edgeContainer, TopAbs_FACE, facesOfEdgeContainer );
2054 const TopTools_ListOfShape& EAncestors = mesh.GetAncestors(edge);
2055 TopTools_ListIteratorOfListOfShape itea(EAncestors);
2056 for(; itea.More(); itea.Next()) {
2057 if( itea.Value().ShapeType() == TopAbs_FACE &&
2058 facesOfEdgeContainer.Contains( itea.Value() ))
2060 facesNearEdge.Add( itea.Value() );
2061 if ( facesNearEdge.Extent() > 1 )
2065 return ( facesNearEdge.Extent() == 1 );
2071 SMESH_subMeshEventListener* GetSrcSubMeshListener();
2073 //================================================================================
2075 * \brief Listener that resets an event listener on source submesh when
2076 * "ProjectionSource*D" hypothesis is modified
2078 //================================================================================
2080 struct HypModifWaiter: SMESH_subMeshEventListener
2082 HypModifWaiter():SMESH_subMeshEventListener(0){} // won't be deleted by submesh
2084 void ProcessEvent(const int event, const int eventType, SMESH_subMesh* subMesh,
2085 EventListenerData*, const SMESH_Hypothesis*)
2087 if ( event == SMESH_subMesh::MODIF_HYP &&
2088 eventType == SMESH_subMesh::ALGO_EVENT)
2090 // delete current source listener
2091 subMesh->DeleteEventListener( GetSrcSubMeshListener() );
2092 // let algo set a new one
2093 SMESH_Gen* gen = subMesh->GetFather()->GetGen();
2094 if ( SMESH_Algo* algo = gen->GetAlgo( *subMesh->GetFather(),
2095 subMesh->GetSubShape() ))
2096 algo->SetEventListener( subMesh );
2100 //================================================================================
2102 * \brief return static HypModifWaiter
2104 //================================================================================
2106 SMESH_subMeshEventListener* GetHypModifWaiter() {
2107 static HypModifWaiter aHypModifWaiter;
2108 return &aHypModifWaiter;
2110 //================================================================================
2112 * \brief return static listener for source shape submeshes
2114 //================================================================================
2116 SMESH_subMeshEventListener* GetSrcSubMeshListener() {
2117 static SMESH_subMeshEventListener srcListener(0); // won't be deleted by submesh
2118 return &srcListener;
2122 //================================================================================
2124 * \brief Set event listeners to submesh with projection algo
2125 * \param subMesh - submesh with projection algo
2126 * \param srcShape - source shape
2127 * \param srcMesh - source mesh
2129 //================================================================================
2131 void StdMeshers_ProjectionUtils::SetEventListener(SMESH_subMesh* subMesh,
2132 TopoDS_Shape srcShape,
2133 SMESH_Mesh* srcMesh)
2135 // Set listener that resets an event listener on source submesh when
2136 // "ProjectionSource*D" hypothesis is modified since source shape can be changed
2137 subMesh->SetEventListener( GetHypModifWaiter(),0,subMesh);
2139 // Set an event listener to submesh of the source shape
2140 if ( !srcShape.IsNull() )
2143 srcMesh = subMesh->GetFather();
2145 SMESH_subMesh* srcShapeSM = srcMesh->GetSubMesh( srcShape );
2147 if ( srcShapeSM != subMesh ) {
2148 if ( srcShapeSM->GetSubMeshDS() &&
2149 srcShapeSM->GetSubMeshDS()->IsComplexSubmesh() )
2150 { // source shape is a group
2151 TopExp_Explorer it(srcShapeSM->GetSubShape(), // explore the group into subshapes...
2152 subMesh->GetSubShape().ShapeType()); // ...of target shape type
2153 for (; it.More(); it.Next())
2155 SMESH_subMesh* srcSM = srcMesh->GetSubMesh( it.Current() );
2156 if ( srcSM != subMesh )
2158 SMESH_subMeshEventListenerData* data =
2159 srcSM->GetEventListenerData(GetSrcSubMeshListener());
2161 data->mySubMeshes.push_back( subMesh );
2163 data = SMESH_subMeshEventListenerData::MakeData( subMesh );
2164 subMesh->SetEventListener ( GetSrcSubMeshListener(), data, srcSM );
2170 subMesh->SetEventListener( GetSrcSubMeshListener(),
2171 SMESH_subMeshEventListenerData::MakeData( subMesh ),