1 // Copyright (C) 2007-2015 CEA/DEN, EDF R&D, OPEN CASCADE
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
19 // File : SMESH_FreeBorders.cxx
20 // Created : Tue Sep 8 17:08:39 2015
21 // Author : Edward AGAPOV (eap)
23 //================================================================================
24 // Implementation of SMESH_MeshAlgos::FindCoincidentFreeBorders()
25 //================================================================================
27 #include "SMESH_MeshAlgos.hxx"
29 #include "SMDS_LinearEdge.hxx"
30 #include "SMDS_Mesh.hxx"
31 #include "SMDS_SetIterator.hxx"
38 #include <NCollection_DataMap.hxx>
41 using namespace SMESH_MeshAlgos;
48 * \brief Node on a free border
50 struct BNode : public SMESH_TNodeXYZ
52 mutable std::vector< BEdge* > myLinkedEdges;
53 mutable std::vector< std::pair < BEdge*, double > > myCloseEdges; // edge & U
55 BNode(const SMDS_MeshNode * node): SMESH_TNodeXYZ( node ) {}
56 const SMDS_MeshNode * Node() const { return _node; }
57 void AddLinked( BEdge* e ) const;
58 void AddClose ( const BEdge* e, double u ) const;
59 BEdge* GetCloseEdge( size_t i ) const { return myCloseEdges[i].first; }
60 double GetCloseU( size_t i ) const { return myCloseEdges[i].second; }
61 BEdge* GetCloseEdgeOfBorder( int borderID, double * u = 0 ) const;
62 bool IsCloseEdge( const BEdge* ) const;
63 bool operator<(const BNode& other) const { return Node()->GetID() < other.Node()->GetID(); }
66 * \brief Edge of a free border
68 struct BEdge : public SMDS_LinearEdge
70 const BNode* myBNode1;
71 const BNode* myBNode2;
73 int myID; // within a border
76 const SMDS_MeshElement* myFace;
77 std::set< int > myCloseBorders;
80 BEdge():SMDS_LinearEdge( 0, 0 ), myBorderID(-1), myID(-1), myPrev(0), myNext(0), myInGroup(-1) {}
82 void Set( const BNode * node1,
84 const SMDS_MeshElement* face,
89 myNodes[0] = node1->Node();
90 myNodes[1] = node2->Node();
92 setId( ID ); // mesh element ID
94 bool IsInGroup() const
96 return myInGroup >= 0;
98 bool Contains( const BNode* n ) const
100 return ( n == myBNode1 || n == myBNode2 );
102 void AddLinked( BEdge* e )
104 if ( e->Contains( myBNode1 )) myPrev = e;
107 void RemoveLinked( BEdge* e )
109 if ( myPrev == e ) myPrev = 0;
110 if ( myNext == e ) myNext = 0;
114 std::swap( myBNode1, myBNode2 );
115 myNodes[0] = myBNode1->Node();
116 myNodes[1] = myBNode2->Node();
120 if (( myPrev && !myPrev->Contains( myBNode1 )) ||
121 ( myNext && !myNext->Contains( myBNode2 )))
122 std::swap( myPrev, myNext );
123 if ( myPrev && myPrev->myBNode2 != myBNode1 ) myPrev->Reverse();
124 if ( myNext && myNext->myBNode1 != myBNode2 ) myNext->Reverse();
132 myNext->SetID( id + 1 );
135 bool IsOut( const gp_XYZ& point, const double tol, double& u ) const
137 gp_XYZ me = *myBNode2 - *myBNode1;
138 gp_XYZ n1p = point - *myBNode1;
139 u = ( me * n1p ) / me.SquareModulus(); // param [0,1] on this
140 if ( u < 0. ) return ( n1p.SquareModulus() > tol * tol );
141 if ( u > 1. ) return ( ( point - *myBNode2 ).SquareModulus() > tol * tol );
143 gp_XYZ proj = ( 1. - u ) * *myBNode1 + u * *myBNode2; // projection of the point on this
144 double dist2 = ( point - proj ).SquareModulus();
145 return ( dist2 > tol * tol );
147 bool IsOverlappingProjection( const BEdge* toE, const double u, bool is1st ) const
149 // is1st shows which end of toE is projected on this at u
151 const double eps = 0.1;
152 if ( toE == myBNode1->GetCloseEdgeOfBorder( toE->myBorderID, &u2 ) ||
153 toE == myBNode2->GetCloseEdgeOfBorder( toE->myBorderID, &u2 ))
154 return (( 0 < u2 && u2 < 1 ) && // u2 is proj param of myBNode's on toE
155 ( Abs( u2 - int( !is1st )) > eps ));
157 const BNode* n = is1st ? toE->myBNode2 : toE->myBNode1;
158 if ( this == n->GetCloseEdgeOfBorder( this->myBorderID, &u2 ))
159 return Abs( u - u2 ) > eps;
162 bool GetRangeOfSameCloseBorders(BEdge* eRange[2], const std::set< int >& bordIDs)
164 if ( this->myCloseBorders != bordIDs )
168 while ( eRange[0]->myPrev && eRange[0]->myPrev->myCloseBorders == bordIDs )
170 if ( eRange[0]->myPrev == this /*|| eRange[0]->myPrev->myInGroup*/ )
172 eRange[0] = eRange[0]->myPrev;
176 if ( eRange[0]->myPrev != this ) // not closed range
177 while ( eRange[1]->myNext && eRange[1]->myNext->myCloseBorders == bordIDs )
179 if ( eRange[1]->myNext == this /*|| eRange[1]->myNext->myInGroup*/ )
181 eRange[1] = eRange[1]->myNext;
184 return ( eRange[0] != eRange[1] );
188 void extendPart( BEdge* & e1, BEdge* & e2, const std::set< int >& bordIDs, int groupID )
190 if (( e1->myPrev == e2 ) ||
191 ( e1 == e2 && e1->myPrev && e1->myPrev->myInGroup == groupID ))
192 return; // full free border already
196 std::set<int>::const_iterator bord;
199 for ( bord = bordIDs.begin(); bord != bordIDs.end(); ++bord )
200 if (( *bord != e1->myBorderID ) &&
201 (( be = e1->myBNode1->GetCloseEdgeOfBorder( *bord, &u ))) &&
202 ( be->myInGroup == groupID ) &&
203 ( 0 < u && u < 1 ) &&
204 ( be->IsOverlappingProjection( e1->myPrev, u, false )))
212 for ( bord = bordIDs.begin(); bord != bordIDs.end(); ++bord )
213 if (( *bord != e2->myBorderID ) &&
214 (( be = e2->myBNode2->GetCloseEdgeOfBorder( *bord, &u ))) &&
215 ( be->myInGroup == groupID ) &&
216 ( 0 < u && u < 1 ) &&
217 ( be->IsOverlappingProjection( e2->myNext, u, true )))
225 void BNode::AddLinked( BEdge* e ) const
227 myLinkedEdges.reserve(2);
228 myLinkedEdges.push_back( e );
229 if ( myLinkedEdges.size() < 2 ) return;
231 if ( myLinkedEdges.size() == 2 )
233 myLinkedEdges[0]->AddLinked( myLinkedEdges[1] );
234 myLinkedEdges[1]->AddLinked( myLinkedEdges[0] );
238 for ( size_t i = 0; i < myLinkedEdges.size(); ++i )
239 for ( size_t j = 0; j < myLinkedEdges.size(); ++j )
241 myLinkedEdges[i]->RemoveLinked( myLinkedEdges[j] );
244 void BNode::AddClose ( const BEdge* e, double u ) const
246 if ( ! e->Contains( this ))
247 myCloseEdges.push_back( make_pair( const_cast< BEdge* >( e ), u ));
249 BEdge* BNode::GetCloseEdgeOfBorder( int borderID, double * uPtr ) const
253 for ( size_t i = 0; i < myCloseEdges.size(); ++i )
254 if ( borderID == GetCloseEdge( i )->myBorderID )
256 if ( e && Abs( u - 0.5 ) < Abs( GetCloseU( i ) - 0.5 ))
259 e = GetCloseEdge ( i );
261 if ( uPtr ) *uPtr = u;
264 bool BNode::IsCloseEdge( const BEdge* e ) const
266 for ( size_t i = 0; i < myCloseEdges.size(); ++i )
267 if ( e == GetCloseEdge( i ) )
272 /// Accessor to SMDS_MeshElement* inherited by BEdge
275 static const SMDS_MeshElement* value( std::vector< BEdge >::const_iterator it)
280 /// Iterator over a vector of BEdge's
281 static SMDS_ElemIteratorPtr getElemIterator( const std::vector< BEdge > & bedges )
283 typedef SMDS_SetIterator
284 < const SMDS_MeshElement*, std::vector< BEdge >::const_iterator, ElemAcess > BEIter;
285 return SMDS_ElemIteratorPtr( new BEIter( bedges.begin(), bedges.end() ));
290 // struct needed for NCollection_Map
293 static int HashCode(const SMESH_TLink& link, int aLimit)
295 return ::HashCode( link.node1()->GetID() + link.node2()->GetID(), aLimit );
297 static Standard_Boolean IsEqual(const SMESH_TLink& l1, const SMESH_TLink& l2)
299 return ( l1.node1() == l2.node1() && l1.node2() == l2.node2() );
303 //================================================================================
305 * Returns groups of TFreeBorder's coincident within the given tolerance.
306 * If the tolerance <= 0.0 then one tenth of an average size of elements adjacent
307 * to free borders being compared is used.
309 //================================================================================
311 void SMESH_MeshAlgos::FindCoincidentFreeBorders(SMDS_Mesh& mesh,
313 CoincidentFreeBorders & foundFreeBordes)
316 typedef NCollection_DataMap<SMESH_TLink, const SMDS_MeshElement*, TLinkHasher > TLink2FaceMap;
317 TLink2FaceMap linkMap;
318 SMDS_FaceIteratorPtr faceIt = mesh.facesIterator();
319 while ( faceIt->more() )
321 const SMDS_MeshElement* face = faceIt->next();
322 if ( !face ) continue;
324 const SMDS_MeshNode* n0 = face->GetNode( face->NbNodes() - 1 );
325 SMDS_NodeIteratorPtr nodeIt = face->interlacedNodesIterator();
326 while ( nodeIt->more() )
328 const SMDS_MeshNode* n1 = nodeIt->next();
329 SMESH_TLink link( n0, n1 );
330 if ( !linkMap.Bind( link, face ))
331 linkMap.UnBind( link );
335 if ( linkMap.IsEmpty() )
339 std::set < BNode > bNodes;
340 std::vector< BEdge > bEdges( linkMap.Extent() );
342 TLink2FaceMap::Iterator linkIt( linkMap );
343 for ( int iEdge = 0; linkIt.More(); linkIt.Next(), ++iEdge )
345 const SMESH_TLink & link = linkIt.Key();
346 std::set< BNode >::iterator n1 = bNodes.insert( BNode( link.node1() )).first;
347 std::set< BNode >::iterator n2 = bNodes.insert( BNode( link.node2() )).first;
348 bEdges[ iEdge ].Set( &*n1, &*n2, linkIt.Value(), iEdge+1 );
349 n1->AddLinked( & bEdges[ iEdge ] );
350 n2->AddLinked( & bEdges[ iEdge ] );
354 // assign IDs to borders
355 std::vector< BEdge* > borders; // 1st of connected (via myPrev and myNext) edges
356 std::set< BNode >::iterator bn = bNodes.begin();
357 for ( ; bn != bNodes.end(); ++bn )
359 for ( size_t i = 0; i < bn->myLinkedEdges.size(); ++i )
361 if ( bn->myLinkedEdges[i]->myBorderID < 0 )
363 BEdge* be = bn->myLinkedEdges[i];
364 int borderID = borders.size();
365 borders.push_back( be );
366 for ( ; be && be->myBorderID < 0; be = be->myNext )
368 be->myBorderID = borderID;
371 bool isClosed = ( be == bn->myLinkedEdges[i] );
372 be = bn->myLinkedEdges[i]->myPrev;
373 for ( ; be && be->myBorderID < 0; be = be->myPrev )
375 be->myBorderID = borderID;
379 while ( borders.back()->myPrev )
380 borders.back() = borders.back()->myPrev;
382 borders.back()->SetID( 0 ); // set IDs to all edges of the border
387 // compute tolerance of each border
388 double maxTolerance = tolerance;
389 std::vector< double > bordToler( borders.size(), tolerance );
390 if ( maxTolerance < std::numeric_limits< double >::min() )
392 // no tolerance provided by the user; compute tolerance of each border
393 // as one tenth of an average size of faces adjacent to a border
394 for ( size_t i = 0; i < borders.size(); ++i )
396 double avgFaceSize = 0;
398 BEdge* be = borders[ i ];
400 double facePerimeter = 0;
401 gp_Pnt p0 = SMESH_TNodeXYZ( be->myFace->GetNode( be->myFace->NbNodes() - 1 ));
402 SMDS_NodeIteratorPtr nodeIt = be->myFace->interlacedNodesIterator();
403 while ( nodeIt->more() )
405 gp_Pnt p1 = SMESH_TNodeXYZ( nodeIt->next() );
406 facePerimeter += p0.Distance( p1 );
409 avgFaceSize += ( facePerimeter / be->myFace->NbCornerNodes() );
414 while ( be && be != borders[i] );
416 bordToler[ i ] = 0.1 * avgFaceSize / nbFaces;
417 maxTolerance = Max( maxTolerance, bordToler[ i ]);
421 // for every border node find close border edges
422 SMESH_ElementSearcher* searcher =
423 GetElementSearcher( mesh, getElemIterator( bEdges ), maxTolerance );
424 SMESHUtils::Deleter< SMESH_ElementSearcher > searcherDeleter( searcher );
425 std::vector< const SMDS_MeshElement* > candidateEdges;
426 for ( bn = bNodes.begin(); bn != bNodes.end(); ++bn )
428 searcher->FindElementsByPoint( *bn, SMDSAbs_Edge, candidateEdges );
429 if ( candidateEdges.size() <= bn->myLinkedEdges.size() )
432 double nodeTol = 0, u;
433 for ( size_t i = 0; i < bn->myLinkedEdges.size(); ++i )
434 nodeTol = Max( nodeTol, bordToler[ bn->myLinkedEdges[ i ]->myBorderID ]);
436 for ( size_t i = 0; i < candidateEdges.size(); ++i )
438 const BEdge* be = static_cast< const BEdge* >( candidateEdges[ i ]);
439 double tol = Max( nodeTol, bordToler[ be->myBorderID ]);
440 if ( !be->IsOut( *bn, tol, u ))
441 bn->AddClose( be, u );
445 // for every border edge find close borders
447 std::vector< BEdge* > closeEdges;
448 for ( size_t i = 0; i < bEdges.size(); ++i )
450 BEdge& be = bEdges[i];
451 if ( be.myBNode1->myCloseEdges.empty() ||
452 be.myBNode2->myCloseEdges.empty() )
456 for ( size_t iE1 = 0; iE1 < be.myBNode1->myCloseEdges.size(); ++iE1 )
458 // find edges of the same border close to both nodes of the edge
459 BEdge* closeE1 = be.myBNode1->GetCloseEdge( iE1 );
460 BEdge* closeE2 = be.myBNode2->GetCloseEdgeOfBorder( closeE1->myBorderID );
463 // check that edges connecting closeE1 and closeE2 (if any) are also close to 'be'
464 if ( closeE1 != closeE2 )
467 for ( int j = 0; j < 2; ++j ) // move closeE1 -> closeE2 or inversely
471 coincide = ( ce->myBNode2->GetCloseEdgeOfBorder( be.myBorderID ));
473 } while ( coincide && ce && ce != closeE2 );
475 if ( coincide && ce == closeE2 )
478 std::swap( closeE1, closeE2 );
483 closeEdges.push_back( closeE1 );
484 closeEdges.push_back( closeE2 );
488 closeEdges.push_back( closeE1 );
490 be.myCloseBorders.insert( closeE1->myBorderID );
492 if ( !closeEdges.empty() )
494 be.myCloseBorders.insert( be.myBorderID );
495 // for ( size_t iB = 0; iB < closeEdges.size(); ++iB )
496 // closeEdges[ iB ]->myCloseBorders.insert( be.myCloseBorders.begin(),
497 // be.myCloseBorders.end() );
501 // Fill in CoincidentFreeBorders
503 // save nodes of free borders
504 foundFreeBordes._borders.resize( borders.size() );
505 for ( size_t i = 0; i < borders.size(); ++i )
507 BEdge* be = borders[i];
508 foundFreeBordes._borders[i].push_back( be->myBNode1->Node() );
510 foundFreeBordes._borders[i].push_back( be->myBNode2->Node() );
513 while ( be && be != borders[i] );
516 // form groups of coincident parts of free borders
518 TFreeBorderPart part;
519 TCoincidentGroup group;
520 vector< BEdge* > ranges; // couples of edges delimiting parts
521 BEdge* be = 0; // a current edge
522 int skipGroup = bEdges.size(); // a group ID used to avoid repeating treatment of edges
524 for ( int i = 0, nbBords = borders.size(); i < nbBords; i += bool(!be) )
529 // look for an edge close to other borders
531 if ( !be->IsInGroup() && !be->myCloseBorders.empty() )
534 } while ( be && be != borders[i] );
536 if ( !be || be->IsInGroup() || be->myCloseBorders.empty() )
539 continue; // all edges of a border are treated or non-coincident
544 // look for the 1st and last edge of a coincident group
546 if ( !be->GetRangeOfSameCloseBorders( beRange, be->myCloseBorders ))
548 be->myInGroup = skipGroup;
553 ranges.push_back( beRange[0] );
554 ranges.push_back( beRange[1] );
556 int groupID = foundFreeBordes._coincidentGroups.size();
558 be->myInGroup = groupID;
559 while ( be != beRange[1] )
561 be->myInGroup = groupID;
564 beRange[1]->myInGroup = groupID;
566 // add parts of other borders
568 BEdge* be1st = beRange[0];
570 std::set<int>::iterator closeBord = be1st->myCloseBorders.begin();
571 for ( ; closeBord != be1st->myCloseBorders.end(); ++closeBord )
572 closeEdges.push_back( be1st->myBNode2->GetCloseEdgeOfBorder( *closeBord ));
574 for ( size_t iE = 0; iE < closeEdges.size(); ++iE )
576 be = closeEdges[ iE ];
579 bool ok = be->GetRangeOfSameCloseBorders( beRange, be->myCloseBorders );
580 if ( !ok && be->myPrev )
581 ok = be->myPrev->GetRangeOfSameCloseBorders( beRange, be1st->myCloseBorders );
582 if ( !ok && be->myNext )
583 ok = be->myNext->GetRangeOfSameCloseBorders( beRange, be1st->myCloseBorders );
588 if ( be->myCloseBorders != be1st->myCloseBorders )
590 //add missing edges to closeEdges
591 closeBord = be->myCloseBorders.begin();
592 for ( ; closeBord != be->myCloseBorders.end(); ++closeBord )
593 if ( !be1st->myCloseBorders.count( *closeBord ))
594 closeEdges.push_back( be->myBNode2->GetCloseEdgeOfBorder( *closeBord ));
597 ranges.push_back( beRange[0] );
598 ranges.push_back( beRange[1] );
600 be->myInGroup = groupID;
601 while ( be != beRange[1] )
603 be->myInGroup = groupID;
606 beRange[1]->myInGroup = groupID;
609 if ( ranges.size() > 2 )
611 for ( size_t iR = 1; iR < ranges.size(); iR += 2 )
612 extendPart( ranges[ iR-1 ], ranges[ iR ], be1st->myCloseBorders, groupID );
615 beRange[0] = ranges[0];
616 beRange[1] = ranges[1];
619 part._node1 = beRange[0]->myID;
620 part._node2 = beRange[0]->myID + 1;
621 part._nodeLast = beRange[1]->myID + 1;
622 group.push_back( part );
625 for ( size_t iR = 3; iR < ranges.size(); iR += 2 )
627 beRange[0] = ranges[iR-1];
628 beRange[1] = ranges[iR-0];
630 // find out mutual orientation of borders
632 be1st ->IsOut( *beRange[ 0 ]->myBNode1, maxTolerance, u1 );
633 beRange[ 0 ]->IsOut( *be1st->myBNode1, maxTolerance, u2 );
634 bool reverse = (( u1 < 0 || u1 > 1 ) && ( u2 < 0 || u2 > 1 ));
637 part._border = beRange[0]->myBorderID;
639 part._node1 = beRange[1]->myID + 1;
640 part._node2 = beRange[1]->myID;
641 part._nodeLast = beRange[0]->myID;
644 part._node1 = beRange[0]->myID;
645 part._node2 = beRange[0]->myID + 1;
646 part._nodeLast = beRange[1]->myID + 1;
648 group.push_back( part );
650 foundFreeBordes._coincidentGroups.push_back( group );
654 beRange[0] = ranges[0];
655 beRange[1] = ranges[1];
658 be->myInGroup = skipGroup;
659 while ( be != beRange[1] )
661 be->myInGroup = skipGroup;
664 beRange[1]->myInGroup = skipGroup;
669 } // loop on free borders
673 } // SMESH_MeshAlgos::FindCoincidentFreeBorders()