1 // Copyright (C) 2003 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
2 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
4 // This library is free software; you can redistribute it and/or
5 // modify it under the terms of the GNU Lesser General Public
6 // License as published by the Free Software Foundation; either
7 // version 2.1 of the License.
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 // Lesser General Public License for more details.
14 // You should have received a copy of the GNU Lesser General Public
15 // License along with this library; if not, write to the Free Software
16 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18 // See http://www.opencascade.org/SALOME/ or email : webmaster.salome@opencascade.org
20 #include "SMESH_ControlsDef.hxx"
24 #include <BRep_Tool.hxx>
26 #include <gp_Cylinder.hxx>
32 #include <Geom_Plane.hxx>
33 #include <Geom_CylindricalSurface.hxx>
34 #include <Precision.hxx>
35 #include <TColgp_Array1OfXYZ.hxx>
36 #include <TColStd_MapOfInteger.hxx>
37 #include <TColStd_SequenceOfAsciiString.hxx>
38 #include <TColStd_MapIteratorOfMapOfInteger.hxx>
41 #include <TopoDS_Face.hxx>
42 #include <TopoDS_Shape.hxx>
44 #include "SMDS_Mesh.hxx"
45 #include "SMDS_Iterator.hxx"
46 #include "SMDS_MeshElement.hxx"
47 #include "SMDS_MeshNode.hxx"
48 #include "SMDS_VolumeTool.hxx"
49 #include "SMDS_QuadraticFaceOfNodes.hxx"
50 #include "SMDS_QuadraticEdge.hxx"
58 inline double getAngle( const gp_XYZ& P1, const gp_XYZ& P2, const gp_XYZ& P3 )
60 gp_Vec v1( P1 - P2 ), v2( P3 - P2 );
62 return v1.Magnitude() < gp::Resolution() ||
63 v2.Magnitude() < gp::Resolution() ? 0 : v1.Angle( v2 );
66 inline double getArea( const gp_XYZ& P1, const gp_XYZ& P2, const gp_XYZ& P3 )
68 gp_Vec aVec1( P2 - P1 );
69 gp_Vec aVec2( P3 - P1 );
70 return ( aVec1 ^ aVec2 ).Magnitude() * 0.5;
73 inline double getArea( const gp_Pnt& P1, const gp_Pnt& P2, const gp_Pnt& P3 )
75 return getArea( P1.XYZ(), P2.XYZ(), P3.XYZ() );
80 inline double getDistance( const gp_XYZ& P1, const gp_XYZ& P2 )
82 double aDist = gp_Pnt( P1 ).Distance( gp_Pnt( P2 ) );
86 int getNbMultiConnection( const SMDS_Mesh* theMesh, const int theId )
91 const SMDS_MeshElement* anEdge = theMesh->FindElement( theId );
92 if ( anEdge == 0 || anEdge->GetType() != SMDSAbs_Edge/* || anEdge->NbNodes() != 2 */)
95 // for each pair of nodes in anEdge (there are 2 pairs in a quadratic edge)
96 // count elements containing both nodes of the pair.
97 // Note that there may be such cases for a quadratic edge (a horizontal line):
102 // +-----+------+ +-----+------+
105 // result sould be 2 in both cases
107 int aResult0 = 0, aResult1 = 0;
108 // last node, it is a medium one in a quadratic edge
109 const SMDS_MeshNode* aLastNode = anEdge->GetNode( anEdge->NbNodes() - 1 );
110 const SMDS_MeshNode* aNode0 = anEdge->GetNode( 0 );
111 const SMDS_MeshNode* aNode1 = anEdge->GetNode( 1 );
112 if ( aNode1 == aLastNode ) aNode1 = 0;
114 SMDS_ElemIteratorPtr anElemIter = aLastNode->GetInverseElementIterator();
115 while( anElemIter->more() ) {
116 const SMDS_MeshElement* anElem = anElemIter->next();
117 if ( anElem != 0 && anElem->GetType() != SMDSAbs_Edge ) {
118 SMDS_ElemIteratorPtr anIter = anElem->nodesIterator();
119 while ( anIter->more() ) {
120 if ( const SMDS_MeshElement* anElemNode = anIter->next() ) {
121 if ( anElemNode == aNode0 ) {
123 if ( !aNode1 ) break; // not a quadratic edge
125 else if ( anElemNode == aNode1 )
131 int aResult = max ( aResult0, aResult1 );
133 // TColStd_MapOfInteger aMap;
135 // SMDS_ElemIteratorPtr anIter = anEdge->nodesIterator();
136 // if ( anIter != 0 ) {
137 // while( anIter->more() ) {
138 // const SMDS_MeshNode* aNode = (SMDS_MeshNode*)anIter->next();
141 // SMDS_ElemIteratorPtr anElemIter = aNode->GetInverseElementIterator();
142 // while( anElemIter->more() ) {
143 // const SMDS_MeshElement* anElem = anElemIter->next();
144 // if ( anElem != 0 && anElem->GetType() != SMDSAbs_Edge ) {
145 // int anId = anElem->GetID();
147 // if ( anIter->more() ) // i.e. first node
149 // else if ( aMap.Contains( anId ) )
163 using namespace SMESH::Controls;
170 Class : NumericalFunctor
171 Description : Base class for numerical functors
173 NumericalFunctor::NumericalFunctor():
179 void NumericalFunctor::SetMesh( const SMDS_Mesh* theMesh )
184 bool NumericalFunctor::GetPoints(const int theId,
185 TSequenceOfXYZ& theRes ) const
192 return GetPoints( myMesh->FindElement( theId ), theRes );
195 bool NumericalFunctor::GetPoints(const SMDS_MeshElement* anElem,
196 TSequenceOfXYZ& theRes )
203 theRes.reserve( anElem->NbNodes() );
205 // Get nodes of the element
206 SMDS_ElemIteratorPtr anIter;
208 if ( anElem->IsQuadratic() ) {
209 switch ( anElem->GetType() ) {
211 anIter = static_cast<const SMDS_QuadraticEdge*>
212 (anElem)->interlacedNodesElemIterator();
215 anIter = static_cast<const SMDS_QuadraticFaceOfNodes*>
216 (anElem)->interlacedNodesElemIterator();
219 anIter = anElem->nodesIterator();
224 anIter = anElem->nodesIterator();
228 while( anIter->more() ) {
229 if ( const SMDS_MeshNode* aNode = static_cast<const SMDS_MeshNode*>( anIter->next() ))
230 theRes.push_back( gp_XYZ( aNode->X(), aNode->Y(), aNode->Z() ) );
237 long NumericalFunctor::GetPrecision() const
242 void NumericalFunctor::SetPrecision( const long thePrecision )
244 myPrecision = thePrecision;
247 double NumericalFunctor::GetValue( long theId )
249 myCurrElement = myMesh->FindElement( theId );
251 if ( GetPoints( theId, P ))
253 double aVal = GetValue( P );
254 if ( myPrecision >= 0 )
256 double prec = pow( 10., (double)( myPrecision ) );
257 aVal = floor( aVal * prec + 0.5 ) / prec;
265 //=======================================================================
266 //function : GetValue
268 //=======================================================================
270 double Volume::GetValue( long theElementId )
272 if ( theElementId && myMesh ) {
273 SMDS_VolumeTool aVolumeTool;
274 if ( aVolumeTool.Set( myMesh->FindElement( theElementId )))
275 return aVolumeTool.GetSize();
280 //=======================================================================
281 //function : GetBadRate
282 //purpose : meaningless as it is not quality control functor
283 //=======================================================================
285 double Volume::GetBadRate( double Value, int /*nbNodes*/ ) const
290 //=======================================================================
293 //=======================================================================
295 SMDSAbs_ElementType Volume::GetType() const
297 return SMDSAbs_Volume;
303 Description : Functor for calculation of minimum angle
306 double MinimumAngle::GetValue( const TSequenceOfXYZ& P )
313 aMin = getAngle(P( P.size() ), P( 1 ), P( 2 ));
314 aMin = Min(aMin,getAngle(P( P.size()-1 ), P( P.size() ), P( 1 )));
316 for (int i=2; i<P.size();i++){
317 double A0 = getAngle( P( i-1 ), P( i ), P( i+1 ) );
321 return aMin * 180.0 / PI;
324 double MinimumAngle::GetBadRate( double Value, int nbNodes ) const
326 //const double aBestAngle = PI / nbNodes;
327 const double aBestAngle = 180.0 - ( 360.0 / double(nbNodes) );
328 return ( fabs( aBestAngle - Value ));
331 SMDSAbs_ElementType MinimumAngle::GetType() const
339 Description : Functor for calculating aspect ratio
341 double AspectRatio::GetValue( const TSequenceOfXYZ& P )
343 // According to "Mesh quality control" by Nadir Bouhamau referring to
344 // Pascal Jean Frey and Paul-Louis George. Maillages, applications aux elements finis.
345 // Hermes Science publications, Paris 1999 ISBN 2-7462-0024-4
348 int nbNodes = P.size();
353 // Compute lengths of the sides
355 vector< double > aLen (nbNodes);
357 for ( int i = 0; i < nbNodes - 1; i++ )
358 aLen[ i ] = getDistance( P( i + 1 ), P( i + 2 ) );
359 aLen[ nbNodes - 1 ] = getDistance( P( 1 ), P( nbNodes ) );
361 // Compute aspect ratio
365 // Q = alfa * h * p / S, where
367 // alfa = sqrt( 3 ) / 6
368 // h - length of the longest edge
369 // p - half perimeter
370 // S - triangle surface
372 const double alfa = sqrt( 3. ) / 6.;
373 double maxLen = Max( aLen[ 0 ], Max( aLen[ 1 ], aLen[ 2 ] ) );
374 double half_perimeter = ( aLen[0] + aLen[1] + aLen[2] ) / 2.;
375 double anArea = getArea( P( 1 ), P( 2 ), P( 3 ) );
376 if ( anArea <= Precision::Confusion() )
379 return alfa * maxLen * half_perimeter / anArea;
383 // return aspect ratio of the worst triange which can be built
384 // taking three nodes of the quadrangle
385 TSequenceOfXYZ triaPnts(3);
386 // triangle on nodes 1 3 2
390 double ar = GetValue( triaPnts );
391 // triangle on nodes 1 3 4
393 ar = Max ( ar, GetValue( triaPnts ));
394 // triangle on nodes 1 2 4
396 ar = Max ( ar, GetValue( triaPnts ));
397 // triangle on nodes 3 2 4
399 ar = Max ( ar, GetValue( triaPnts ));
405 double AspectRatio::GetBadRate( double Value, int /*nbNodes*/ ) const
407 // the aspect ratio is in the range [1.0,infinity]
410 return Value / 1000.;
413 SMDSAbs_ElementType AspectRatio::GetType() const
420 Class : AspectRatio3D
421 Description : Functor for calculating aspect ratio
425 inline double getHalfPerimeter(double theTria[3]){
426 return (theTria[0] + theTria[1] + theTria[2])/2.0;
429 inline double getArea(double theHalfPerim, double theTria[3]){
430 return sqrt(theHalfPerim*
431 (theHalfPerim-theTria[0])*
432 (theHalfPerim-theTria[1])*
433 (theHalfPerim-theTria[2]));
436 inline double getVolume(double theLen[6]){
437 double a2 = theLen[0]*theLen[0];
438 double b2 = theLen[1]*theLen[1];
439 double c2 = theLen[2]*theLen[2];
440 double d2 = theLen[3]*theLen[3];
441 double e2 = theLen[4]*theLen[4];
442 double f2 = theLen[5]*theLen[5];
443 double P = 4.0*a2*b2*d2;
444 double Q = a2*(b2+d2-e2)-b2*(a2+d2-f2)-d2*(a2+b2-c2);
445 double R = (b2+d2-e2)*(a2+d2-f2)*(a2+d2-f2);
446 return sqrt(P-Q+R)/12.0;
449 inline double getVolume2(double theLen[6]){
450 double a2 = theLen[0]*theLen[0];
451 double b2 = theLen[1]*theLen[1];
452 double c2 = theLen[2]*theLen[2];
453 double d2 = theLen[3]*theLen[3];
454 double e2 = theLen[4]*theLen[4];
455 double f2 = theLen[5]*theLen[5];
457 double P = a2*e2*(b2+c2+d2+f2-a2-e2);
458 double Q = b2*f2*(a2+c2+d2+e2-b2-f2);
459 double R = c2*d2*(a2+b2+e2+f2-c2-d2);
460 double S = a2*b2*d2+b2*c2*e2+a2*c2*f2+d2*e2*f2;
462 return sqrt(P+Q+R-S)/12.0;
465 inline double getVolume(const TSequenceOfXYZ& P){
466 gp_Vec aVec1( P( 2 ) - P( 1 ) );
467 gp_Vec aVec2( P( 3 ) - P( 1 ) );
468 gp_Vec aVec3( P( 4 ) - P( 1 ) );
469 gp_Vec anAreaVec( aVec1 ^ aVec2 );
470 return fabs(aVec3 * anAreaVec) / 6.0;
473 inline double getMaxHeight(double theLen[6])
475 double aHeight = max(theLen[0],theLen[1]);
476 aHeight = max(aHeight,theLen[2]);
477 aHeight = max(aHeight,theLen[3]);
478 aHeight = max(aHeight,theLen[4]);
479 aHeight = max(aHeight,theLen[5]);
485 double AspectRatio3D::GetValue( const TSequenceOfXYZ& P )
487 double aQuality = 0.0;
488 if(myCurrElement->IsPoly()) return aQuality;
489 int nbNodes = P.size();
493 getDistance(P( 1 ),P( 2 )), // a
494 getDistance(P( 2 ),P( 3 )), // b
495 getDistance(P( 3 ),P( 1 )), // c
496 getDistance(P( 2 ),P( 4 )), // d
497 getDistance(P( 3 ),P( 4 )), // e
498 getDistance(P( 1 ),P( 4 )) // f
500 double aTria[4][3] = {
501 {aLen[0],aLen[1],aLen[2]}, // abc
502 {aLen[0],aLen[3],aLen[5]}, // adf
503 {aLen[1],aLen[3],aLen[4]}, // bde
504 {aLen[2],aLen[4],aLen[5]} // cef
506 double aSumArea = 0.0;
507 double aHalfPerimeter = getHalfPerimeter(aTria[0]);
508 double anArea = getArea(aHalfPerimeter,aTria[0]);
510 aHalfPerimeter = getHalfPerimeter(aTria[1]);
511 anArea = getArea(aHalfPerimeter,aTria[1]);
513 aHalfPerimeter = getHalfPerimeter(aTria[2]);
514 anArea = getArea(aHalfPerimeter,aTria[2]);
516 aHalfPerimeter = getHalfPerimeter(aTria[3]);
517 anArea = getArea(aHalfPerimeter,aTria[3]);
519 double aVolume = getVolume(P);
520 //double aVolume = getVolume(aLen);
521 double aHeight = getMaxHeight(aLen);
522 static double aCoeff = sqrt(2.0)/12.0;
523 aQuality = aCoeff*aHeight*aSumArea/aVolume;
528 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 3 ),P( 5 )};
529 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
532 gp_XYZ aXYZ[4] = {P( 1 ),P( 3 ),P( 4 ),P( 5 )};
533 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
536 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 5 )};
537 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
540 gp_XYZ aXYZ[4] = {P( 2 ),P( 3 ),P( 4 ),P( 5 )};
541 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
547 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 6 )};
548 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
551 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 3 )};
552 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
555 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 6 )};
556 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
559 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 3 )};
560 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
563 gp_XYZ aXYZ[4] = {P( 2 ),P( 5 ),P( 4 ),P( 6 )};
564 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
567 gp_XYZ aXYZ[4] = {P( 2 ),P( 5 ),P( 4 ),P( 3 )};
568 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
574 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 3 )};
575 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
578 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 4 )};
579 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
582 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 7 )};
583 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
586 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 8 )};
587 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
590 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 3 )};
591 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
594 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 4 )};
595 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
598 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 7 )};
599 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
602 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 8 )};
603 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
606 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 3 )};
607 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
610 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 4 )};
611 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
614 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 7 )};
615 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
618 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 8 )};
619 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
622 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 1 )};
623 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
626 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 2 )};
627 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
630 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 5 )};
631 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
634 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 6 )};
635 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
638 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 1 )};
639 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
642 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 2 )};
643 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
646 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 5 )};
647 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
650 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 6 )};
651 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
654 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 1 )};
655 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
658 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 2 )};
659 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
662 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 5 )};
663 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
666 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 6 )};
667 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
670 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 2 )};
671 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
674 gp_XYZ aXYZ[4] = {P( 4 ),P( 5 ),P( 8 ),P( 2 )};
675 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
678 gp_XYZ aXYZ[4] = {P( 1 ),P( 4 ),P( 5 ),P( 3 )};
679 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
682 gp_XYZ aXYZ[4] = {P( 3 ),P( 6 ),P( 7 ),P( 1 )};
683 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
686 gp_XYZ aXYZ[4] = {P( 2 ),P( 3 ),P( 6 ),P( 4 )};
687 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
690 gp_XYZ aXYZ[4] = {P( 5 ),P( 6 ),P( 8 ),P( 3 )};
691 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
694 gp_XYZ aXYZ[4] = {P( 7 ),P( 8 ),P( 6 ),P( 1 )};
695 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
698 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 7 )};
699 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
702 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 2 ),P( 5 )};
703 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
709 // avaluate aspect ratio of quadranle faces
710 AspectRatio aspect2D;
711 SMDS_VolumeTool::VolumeType type = SMDS_VolumeTool::GetType( nbNodes );
712 int nbFaces = SMDS_VolumeTool::NbFaces( type );
713 TSequenceOfXYZ points(4);
714 for ( int i = 0; i < nbFaces; ++i ) { // loop on faces of a volume
715 if ( SMDS_VolumeTool::NbFaceNodes( type, i ) != 4 )
717 const int* pInd = SMDS_VolumeTool::GetFaceNodesIndices( type, i, true );
718 for ( int p = 0; p < 4; ++p ) // loop on nodes of a quadranle face
719 points( p + 1 ) = P( pInd[ p ] + 1 );
720 aQuality = max( aQuality, aspect2D.GetValue( points ));
726 double AspectRatio3D::GetBadRate( double Value, int /*nbNodes*/ ) const
728 // the aspect ratio is in the range [1.0,infinity]
731 return Value / 1000.;
734 SMDSAbs_ElementType AspectRatio3D::GetType() const
736 return SMDSAbs_Volume;
742 Description : Functor for calculating warping
744 double Warping::GetValue( const TSequenceOfXYZ& P )
749 gp_XYZ G = ( P( 1 ) + P( 2 ) + P( 3 ) + P( 4 ) ) / 4;
751 double A1 = ComputeA( P( 1 ), P( 2 ), P( 3 ), G );
752 double A2 = ComputeA( P( 2 ), P( 3 ), P( 4 ), G );
753 double A3 = ComputeA( P( 3 ), P( 4 ), P( 1 ), G );
754 double A4 = ComputeA( P( 4 ), P( 1 ), P( 2 ), G );
756 return Max( Max( A1, A2 ), Max( A3, A4 ) );
759 double Warping::ComputeA( const gp_XYZ& thePnt1,
760 const gp_XYZ& thePnt2,
761 const gp_XYZ& thePnt3,
762 const gp_XYZ& theG ) const
764 double aLen1 = gp_Pnt( thePnt1 ).Distance( gp_Pnt( thePnt2 ) );
765 double aLen2 = gp_Pnt( thePnt2 ).Distance( gp_Pnt( thePnt3 ) );
766 double L = Min( aLen1, aLen2 ) * 0.5;
767 if ( L < Precision::Confusion())
770 gp_XYZ GI = ( thePnt2 + thePnt1 ) / 2. - theG;
771 gp_XYZ GJ = ( thePnt3 + thePnt2 ) / 2. - theG;
772 gp_XYZ N = GI.Crossed( GJ );
774 if ( N.Modulus() < gp::Resolution() )
779 double H = ( thePnt2 - theG ).Dot( N );
780 return asin( fabs( H / L ) ) * 180 / PI;
783 double Warping::GetBadRate( double Value, int /*nbNodes*/ ) const
785 // the warp is in the range [0.0,PI/2]
786 // 0.0 = good (no warp)
787 // PI/2 = bad (face pliee)
791 SMDSAbs_ElementType Warping::GetType() const
799 Description : Functor for calculating taper
801 double Taper::GetValue( const TSequenceOfXYZ& P )
807 double J1 = getArea( P( 4 ), P( 1 ), P( 2 ) ) / 2;
808 double J2 = getArea( P( 3 ), P( 1 ), P( 2 ) ) / 2;
809 double J3 = getArea( P( 2 ), P( 3 ), P( 4 ) ) / 2;
810 double J4 = getArea( P( 3 ), P( 4 ), P( 1 ) ) / 2;
812 double JA = 0.25 * ( J1 + J2 + J3 + J4 );
813 if ( JA <= Precision::Confusion() )
816 double T1 = fabs( ( J1 - JA ) / JA );
817 double T2 = fabs( ( J2 - JA ) / JA );
818 double T3 = fabs( ( J3 - JA ) / JA );
819 double T4 = fabs( ( J4 - JA ) / JA );
821 return Max( Max( T1, T2 ), Max( T3, T4 ) );
824 double Taper::GetBadRate( double Value, int /*nbNodes*/ ) const
826 // the taper is in the range [0.0,1.0]
827 // 0.0 = good (no taper)
828 // 1.0 = bad (les cotes opposes sont allignes)
832 SMDSAbs_ElementType Taper::GetType() const
840 Description : Functor for calculating skew in degrees
842 static inline double skewAngle( const gp_XYZ& p1, const gp_XYZ& p2, const gp_XYZ& p3 )
844 gp_XYZ p12 = ( p2 + p1 ) / 2;
845 gp_XYZ p23 = ( p3 + p2 ) / 2;
846 gp_XYZ p31 = ( p3 + p1 ) / 2;
848 gp_Vec v1( p31 - p2 ), v2( p12 - p23 );
850 return v1.Magnitude() < gp::Resolution() || v2.Magnitude() < gp::Resolution() ? 0 : v1.Angle( v2 );
853 double Skew::GetValue( const TSequenceOfXYZ& P )
855 if ( P.size() != 3 && P.size() != 4 )
859 static double PI2 = PI / 2;
862 double A0 = fabs( PI2 - skewAngle( P( 3 ), P( 1 ), P( 2 ) ) );
863 double A1 = fabs( PI2 - skewAngle( P( 1 ), P( 2 ), P( 3 ) ) );
864 double A2 = fabs( PI2 - skewAngle( P( 2 ), P( 3 ), P( 1 ) ) );
866 return Max( A0, Max( A1, A2 ) ) * 180 / PI;
870 gp_XYZ p12 = ( P( 1 ) + P( 2 ) ) / 2;
871 gp_XYZ p23 = ( P( 2 ) + P( 3 ) ) / 2;
872 gp_XYZ p34 = ( P( 3 ) + P( 4 ) ) / 2;
873 gp_XYZ p41 = ( P( 4 ) + P( 1 ) ) / 2;
875 gp_Vec v1( p34 - p12 ), v2( p23 - p41 );
876 double A = v1.Magnitude() <= gp::Resolution() || v2.Magnitude() <= gp::Resolution()
877 ? 0 : fabs( PI2 - v1.Angle( v2 ) );
883 double Skew::GetBadRate( double Value, int /*nbNodes*/ ) const
885 // the skew is in the range [0.0,PI/2].
891 SMDSAbs_ElementType Skew::GetType() const
899 Description : Functor for calculating area
901 double Area::GetValue( const TSequenceOfXYZ& P )
903 gp_Vec aVec1( P(2) - P(1) );
904 gp_Vec aVec2( P(3) - P(1) );
905 gp_Vec SumVec = aVec1 ^ aVec2;
906 for (int i=4; i<=P.size(); i++) {
907 gp_Vec aVec1( P(i-1) - P(1) );
908 gp_Vec aVec2( P(i) - P(1) );
909 gp_Vec tmp = aVec1 ^ aVec2;
912 return SumVec.Magnitude() * 0.5;
915 double Area::GetBadRate( double Value, int /*nbNodes*/ ) const
917 // meaningless as it is not a quality control functor
921 SMDSAbs_ElementType Area::GetType() const
929 Description : Functor for calculating length off edge
931 double Length::GetValue( const TSequenceOfXYZ& P )
933 switch ( P.size() ) {
934 case 2: return getDistance( P( 1 ), P( 2 ) );
935 case 3: return getDistance( P( 1 ), P( 2 ) ) + getDistance( P( 2 ), P( 3 ) );
940 double Length::GetBadRate( double Value, int /*nbNodes*/ ) const
942 // meaningless as it is not quality control functor
946 SMDSAbs_ElementType Length::GetType() const
953 Description : Functor for calculating length of edge
956 double Length2D::GetValue( long theElementId)
960 //cout<<"Length2D::GetValue"<<endl;
961 if (GetPoints(theElementId,P)){
962 //for(int jj=1; jj<=P.size(); jj++)
963 // cout<<"jj="<<jj<<" P("<<P(jj).X()<<","<<P(jj).Y()<<","<<P(jj).Z()<<")"<<endl;
965 double aVal;// = GetValue( P );
966 const SMDS_MeshElement* aElem = myMesh->FindElement( theElementId );
967 SMDSAbs_ElementType aType = aElem->GetType();
976 aVal = getDistance( P( 1 ), P( 2 ) );
979 else if (len == 3){ // quadratic edge
980 aVal = getDistance(P( 1 ),P( 3 )) + getDistance(P( 3 ),P( 2 ));
984 if (len == 3){ // triangles
985 double L1 = getDistance(P( 1 ),P( 2 ));
986 double L2 = getDistance(P( 2 ),P( 3 ));
987 double L3 = getDistance(P( 3 ),P( 1 ));
988 aVal = Max(L1,Max(L2,L3));
991 else if (len == 4){ // quadrangles
992 double L1 = getDistance(P( 1 ),P( 2 ));
993 double L2 = getDistance(P( 2 ),P( 3 ));
994 double L3 = getDistance(P( 3 ),P( 4 ));
995 double L4 = getDistance(P( 4 ),P( 1 ));
996 aVal = Max(Max(L1,L2),Max(L3,L4));
999 if (len == 6){ // quadratic triangles
1000 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
1001 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1002 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 1 ));
1003 aVal = Max(L1,Max(L2,L3));
1004 //cout<<"L1="<<L1<<" L2="<<L2<<"L3="<<L3<<" aVal="<<aVal<<endl;
1007 else if (len == 8){ // quadratic quadrangles
1008 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
1009 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1010 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 7 ));
1011 double L4 = getDistance(P( 7 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
1012 aVal = Max(Max(L1,L2),Max(L3,L4));
1015 case SMDSAbs_Volume:
1016 if (len == 4){ // tetraidrs
1017 double L1 = getDistance(P( 1 ),P( 2 ));
1018 double L2 = getDistance(P( 2 ),P( 3 ));
1019 double L3 = getDistance(P( 3 ),P( 1 ));
1020 double L4 = getDistance(P( 1 ),P( 4 ));
1021 double L5 = getDistance(P( 2 ),P( 4 ));
1022 double L6 = getDistance(P( 3 ),P( 4 ));
1023 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1026 else if (len == 5){ // piramids
1027 double L1 = getDistance(P( 1 ),P( 2 ));
1028 double L2 = getDistance(P( 2 ),P( 3 ));
1029 double L3 = getDistance(P( 3 ),P( 1 ));
1030 double L4 = getDistance(P( 4 ),P( 1 ));
1031 double L5 = getDistance(P( 1 ),P( 5 ));
1032 double L6 = getDistance(P( 2 ),P( 5 ));
1033 double L7 = getDistance(P( 3 ),P( 5 ));
1034 double L8 = getDistance(P( 4 ),P( 5 ));
1036 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1037 aVal = Max(aVal,Max(L7,L8));
1040 else if (len == 6){ // pentaidres
1041 double L1 = getDistance(P( 1 ),P( 2 ));
1042 double L2 = getDistance(P( 2 ),P( 3 ));
1043 double L3 = getDistance(P( 3 ),P( 1 ));
1044 double L4 = getDistance(P( 4 ),P( 5 ));
1045 double L5 = getDistance(P( 5 ),P( 6 ));
1046 double L6 = getDistance(P( 6 ),P( 4 ));
1047 double L7 = getDistance(P( 1 ),P( 4 ));
1048 double L8 = getDistance(P( 2 ),P( 5 ));
1049 double L9 = getDistance(P( 3 ),P( 6 ));
1051 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1052 aVal = Max(aVal,Max(Max(L7,L8),L9));
1055 else if (len == 8){ // hexaider
1056 double L1 = getDistance(P( 1 ),P( 2 ));
1057 double L2 = getDistance(P( 2 ),P( 3 ));
1058 double L3 = getDistance(P( 3 ),P( 4 ));
1059 double L4 = getDistance(P( 4 ),P( 1 ));
1060 double L5 = getDistance(P( 5 ),P( 6 ));
1061 double L6 = getDistance(P( 6 ),P( 7 ));
1062 double L7 = getDistance(P( 7 ),P( 8 ));
1063 double L8 = getDistance(P( 8 ),P( 5 ));
1064 double L9 = getDistance(P( 1 ),P( 5 ));
1065 double L10= getDistance(P( 2 ),P( 6 ));
1066 double L11= getDistance(P( 3 ),P( 7 ));
1067 double L12= getDistance(P( 4 ),P( 8 ));
1069 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1070 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
1071 aVal = Max(aVal,Max(L11,L12));
1076 if (len == 10){ // quadratic tetraidrs
1077 double L1 = getDistance(P( 1 ),P( 5 )) + getDistance(P( 5 ),P( 2 ));
1078 double L2 = getDistance(P( 2 ),P( 6 )) + getDistance(P( 6 ),P( 3 ));
1079 double L3 = getDistance(P( 3 ),P( 7 )) + getDistance(P( 7 ),P( 1 ));
1080 double L4 = getDistance(P( 1 ),P( 8 )) + getDistance(P( 8 ),P( 4 ));
1081 double L5 = getDistance(P( 2 ),P( 9 )) + getDistance(P( 9 ),P( 4 ));
1082 double L6 = getDistance(P( 3 ),P( 10 )) + getDistance(P( 10 ),P( 4 ));
1083 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1086 else if (len == 13){ // quadratic piramids
1087 double L1 = getDistance(P( 1 ),P( 6 )) + getDistance(P( 6 ),P( 2 ));
1088 double L2 = getDistance(P( 2 ),P( 7 )) + getDistance(P( 7 ),P( 3 ));
1089 double L3 = getDistance(P( 3 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
1090 double L4 = getDistance(P( 4 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1091 double L5 = getDistance(P( 1 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1092 double L6 = getDistance(P( 2 ),P( 11 )) + getDistance(P( 11 ),P( 5 ));
1093 double L7 = getDistance(P( 3 ),P( 12 )) + getDistance(P( 12 ),P( 5 ));
1094 double L8 = getDistance(P( 4 ),P( 13 )) + getDistance(P( 13 ),P( 5 ));
1095 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1096 aVal = Max(aVal,Max(L7,L8));
1099 else if (len == 15){ // quadratic pentaidres
1100 double L1 = getDistance(P( 1 ),P( 7 )) + getDistance(P( 7 ),P( 2 ));
1101 double L2 = getDistance(P( 2 ),P( 8 )) + getDistance(P( 8 ),P( 3 ));
1102 double L3 = getDistance(P( 3 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1103 double L4 = getDistance(P( 4 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1104 double L5 = getDistance(P( 5 ),P( 11 )) + getDistance(P( 11 ),P( 6 ));
1105 double L6 = getDistance(P( 6 ),P( 12 )) + getDistance(P( 12 ),P( 4 ));
1106 double L7 = getDistance(P( 1 ),P( 13 )) + getDistance(P( 13 ),P( 4 ));
1107 double L8 = getDistance(P( 2 ),P( 14 )) + getDistance(P( 14 ),P( 5 ));
1108 double L9 = getDistance(P( 3 ),P( 15 )) + getDistance(P( 15 ),P( 6 ));
1109 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1110 aVal = Max(aVal,Max(Max(L7,L8),L9));
1113 else if (len == 20){ // quadratic hexaider
1114 double L1 = getDistance(P( 1 ),P( 9 )) + getDistance(P( 9 ),P( 2 ));
1115 double L2 = getDistance(P( 2 ),P( 10 )) + getDistance(P( 10 ),P( 3 ));
1116 double L3 = getDistance(P( 3 ),P( 11 )) + getDistance(P( 11 ),P( 4 ));
1117 double L4 = getDistance(P( 4 ),P( 12 )) + getDistance(P( 12 ),P( 1 ));
1118 double L5 = getDistance(P( 5 ),P( 13 )) + getDistance(P( 13 ),P( 6 ));
1119 double L6 = getDistance(P( 6 ),P( 14 )) + getDistance(P( 14 ),P( 7 ));
1120 double L7 = getDistance(P( 7 ),P( 15 )) + getDistance(P( 15 ),P( 8 ));
1121 double L8 = getDistance(P( 8 ),P( 16 )) + getDistance(P( 16 ),P( 5 ));
1122 double L9 = getDistance(P( 1 ),P( 17 )) + getDistance(P( 17 ),P( 5 ));
1123 double L10= getDistance(P( 2 ),P( 18 )) + getDistance(P( 18 ),P( 6 ));
1124 double L11= getDistance(P( 3 ),P( 19 )) + getDistance(P( 19 ),P( 7 ));
1125 double L12= getDistance(P( 4 ),P( 20 )) + getDistance(P( 20 ),P( 8 ));
1126 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1127 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
1128 aVal = Max(aVal,Max(L11,L12));
1140 if ( myPrecision >= 0 )
1142 double prec = pow( 10., (double)( myPrecision ) );
1143 aVal = floor( aVal * prec + 0.5 ) / prec;
1152 double Length2D::GetBadRate( double Value, int /*nbNodes*/ ) const
1154 // meaningless as it is not quality control functor
1158 SMDSAbs_ElementType Length2D::GetType() const
1160 return SMDSAbs_Face;
1163 Length2D::Value::Value(double theLength,long thePntId1, long thePntId2):
1166 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1167 if(thePntId1 > thePntId2){
1168 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1172 bool Length2D::Value::operator<(const Length2D::Value& x) const{
1173 if(myPntId[0] < x.myPntId[0]) return true;
1174 if(myPntId[0] == x.myPntId[0])
1175 if(myPntId[1] < x.myPntId[1]) return true;
1179 void Length2D::GetValues(TValues& theValues){
1181 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1182 for(; anIter->more(); ){
1183 const SMDS_MeshFace* anElem = anIter->next();
1185 if(anElem->IsQuadratic()) {
1186 const SMDS_QuadraticFaceOfNodes* F =
1187 static_cast<const SMDS_QuadraticFaceOfNodes*>(anElem);
1188 // use special nodes iterator
1189 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
1194 const SMDS_MeshElement* aNode;
1196 aNode = anIter->next();
1197 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1198 P[0] = P[1] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1199 aNodeId[0] = aNodeId[1] = aNode->GetID();
1202 for(; anIter->more(); ){
1203 const SMDS_MeshNode* N1 = static_cast<const SMDS_MeshNode*> (anIter->next());
1204 P[2] = gp_Pnt(N1->X(),N1->Y(),N1->Z());
1205 aNodeId[2] = N1->GetID();
1206 aLength = P[1].Distance(P[2]);
1207 if(!anIter->more()) break;
1208 const SMDS_MeshNode* N2 = static_cast<const SMDS_MeshNode*> (anIter->next());
1209 P[3] = gp_Pnt(N2->X(),N2->Y(),N2->Z());
1210 aNodeId[3] = N2->GetID();
1211 aLength += P[2].Distance(P[3]);
1212 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
1213 Value aValue2(aLength,aNodeId[2],aNodeId[3]);
1215 aNodeId[1] = aNodeId[3];
1216 theValues.insert(aValue1);
1217 theValues.insert(aValue2);
1219 aLength += P[2].Distance(P[0]);
1220 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
1221 Value aValue2(aLength,aNodeId[2],aNodeId[0]);
1222 theValues.insert(aValue1);
1223 theValues.insert(aValue2);
1226 SMDS_ElemIteratorPtr aNodesIter = anElem->nodesIterator();
1231 const SMDS_MeshElement* aNode;
1232 if(aNodesIter->more()){
1233 aNode = aNodesIter->next();
1234 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1235 P[0] = P[1] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1236 aNodeId[0] = aNodeId[1] = aNode->GetID();
1239 for(; aNodesIter->more(); ){
1240 aNode = aNodesIter->next();
1241 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1242 long anId = aNode->GetID();
1244 P[2] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1246 aLength = P[1].Distance(P[2]);
1248 Value aValue(aLength,aNodeId[1],anId);
1251 theValues.insert(aValue);
1254 aLength = P[0].Distance(P[1]);
1256 Value aValue(aLength,aNodeId[0],aNodeId[1]);
1257 theValues.insert(aValue);
1263 Class : MultiConnection
1264 Description : Functor for calculating number of faces conneted to the edge
1266 double MultiConnection::GetValue( const TSequenceOfXYZ& P )
1270 double MultiConnection::GetValue( long theId )
1272 return getNbMultiConnection( myMesh, theId );
1275 double MultiConnection::GetBadRate( double Value, int /*nbNodes*/ ) const
1277 // meaningless as it is not quality control functor
1281 SMDSAbs_ElementType MultiConnection::GetType() const
1283 return SMDSAbs_Edge;
1287 Class : MultiConnection2D
1288 Description : Functor for calculating number of faces conneted to the edge
1290 double MultiConnection2D::GetValue( const TSequenceOfXYZ& P )
1295 double MultiConnection2D::GetValue( long theElementId )
1299 const SMDS_MeshElement* aFaceElem = myMesh->FindElement(theElementId);
1300 SMDSAbs_ElementType aType = aFaceElem->GetType();
1305 int i = 0, len = aFaceElem->NbNodes();
1306 SMDS_ElemIteratorPtr anIter = aFaceElem->nodesIterator();
1309 const SMDS_MeshNode *aNode, *aNode0;
1310 TColStd_MapOfInteger aMap, aMapPrev;
1312 for (i = 0; i <= len; i++) {
1317 if (anIter->more()) {
1318 aNode = (SMDS_MeshNode*)anIter->next();
1326 if (i == 0) aNode0 = aNode;
1328 SMDS_ElemIteratorPtr anElemIter = aNode->GetInverseElementIterator();
1329 while (anElemIter->more()) {
1330 const SMDS_MeshElement* anElem = anElemIter->next();
1331 if (anElem != 0 && anElem->GetType() == SMDSAbs_Face) {
1332 int anId = anElem->GetID();
1335 if (aMapPrev.Contains(anId)) {
1340 aResult = Max(aResult, aNb);
1351 double MultiConnection2D::GetBadRate( double Value, int /*nbNodes*/ ) const
1353 // meaningless as it is not quality control functor
1357 SMDSAbs_ElementType MultiConnection2D::GetType() const
1359 return SMDSAbs_Face;
1362 MultiConnection2D::Value::Value(long thePntId1, long thePntId2)
1364 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1365 if(thePntId1 > thePntId2){
1366 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1370 bool MultiConnection2D::Value::operator<(const MultiConnection2D::Value& x) const{
1371 if(myPntId[0] < x.myPntId[0]) return true;
1372 if(myPntId[0] == x.myPntId[0])
1373 if(myPntId[1] < x.myPntId[1]) return true;
1377 void MultiConnection2D::GetValues(MValues& theValues){
1378 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1379 for(; anIter->more(); ){
1380 const SMDS_MeshFace* anElem = anIter->next();
1381 SMDS_ElemIteratorPtr aNodesIter;
1382 if ( anElem->IsQuadratic() )
1383 aNodesIter = static_cast<const SMDS_QuadraticFaceOfNodes*>
1384 (anElem)->interlacedNodesElemIterator();
1386 aNodesIter = anElem->nodesIterator();
1389 //int aNbConnects=0;
1390 const SMDS_MeshNode* aNode0;
1391 const SMDS_MeshNode* aNode1;
1392 const SMDS_MeshNode* aNode2;
1393 if(aNodesIter->more()){
1394 aNode0 = (SMDS_MeshNode*) aNodesIter->next();
1396 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode1;
1397 aNodeId[0] = aNodeId[1] = aNodes->GetID();
1399 for(; aNodesIter->more(); ) {
1400 aNode2 = (SMDS_MeshNode*) aNodesIter->next();
1401 long anId = aNode2->GetID();
1404 Value aValue(aNodeId[1],aNodeId[2]);
1405 MValues::iterator aItr = theValues.find(aValue);
1406 if (aItr != theValues.end()){
1411 theValues[aValue] = 1;
1414 //cout << "NodeIds: "<<aNodeId[1]<<","<<aNodeId[2]<<" nbconn="<<aNbConnects<<endl;
1415 aNodeId[1] = aNodeId[2];
1418 Value aValue(aNodeId[0],aNodeId[2]);
1419 MValues::iterator aItr = theValues.find(aValue);
1420 if (aItr != theValues.end()) {
1425 theValues[aValue] = 1;
1428 //cout << "NodeIds: "<<aNodeId[0]<<","<<aNodeId[2]<<" nbconn="<<aNbConnects<<endl;
1438 Class : BadOrientedVolume
1439 Description : Predicate bad oriented volumes
1442 BadOrientedVolume::BadOrientedVolume()
1447 void BadOrientedVolume::SetMesh( const SMDS_Mesh* theMesh )
1452 bool BadOrientedVolume::IsSatisfy( long theId )
1457 SMDS_VolumeTool vTool( myMesh->FindElement( theId ));
1458 return !vTool.IsForward();
1461 SMDSAbs_ElementType BadOrientedVolume::GetType() const
1463 return SMDSAbs_Volume;
1470 Description : Predicate for free borders
1473 FreeBorders::FreeBorders()
1478 void FreeBorders::SetMesh( const SMDS_Mesh* theMesh )
1483 bool FreeBorders::IsSatisfy( long theId )
1485 return getNbMultiConnection( myMesh, theId ) == 1;
1488 SMDSAbs_ElementType FreeBorders::GetType() const
1490 return SMDSAbs_Edge;
1496 Description : Predicate for free Edges
1498 FreeEdges::FreeEdges()
1503 void FreeEdges::SetMesh( const SMDS_Mesh* theMesh )
1508 bool FreeEdges::IsFreeEdge( const SMDS_MeshNode** theNodes, const int theFaceId )
1510 TColStd_MapOfInteger aMap;
1511 for ( int i = 0; i < 2; i++ )
1513 SMDS_ElemIteratorPtr anElemIter = theNodes[ i ]->GetInverseElementIterator();
1514 while( anElemIter->more() )
1516 const SMDS_MeshElement* anElem = anElemIter->next();
1517 if ( anElem != 0 && anElem->GetType() == SMDSAbs_Face )
1519 int anId = anElem->GetID();
1523 else if ( aMap.Contains( anId ) && anId != theFaceId )
1531 bool FreeEdges::IsSatisfy( long theId )
1536 const SMDS_MeshElement* aFace = myMesh->FindElement( theId );
1537 if ( aFace == 0 || aFace->GetType() != SMDSAbs_Face || aFace->NbNodes() < 3 )
1540 SMDS_ElemIteratorPtr anIter;
1541 if ( aFace->IsQuadratic() ) {
1542 anIter = static_cast<const SMDS_QuadraticFaceOfNodes*>
1543 (aFace)->interlacedNodesElemIterator();
1546 anIter = aFace->nodesIterator();
1551 int i = 0, nbNodes = aFace->NbNodes();
1552 vector <const SMDS_MeshNode*> aNodes( nbNodes+1 );
1553 while( anIter->more() )
1555 const SMDS_MeshNode* aNode = (SMDS_MeshNode*)anIter->next();
1558 aNodes[ i++ ] = aNode;
1560 aNodes[ nbNodes ] = aNodes[ 0 ];
1562 for ( i = 0; i < nbNodes; i++ )
1563 if ( IsFreeEdge( &aNodes[ i ], theId ) )
1569 SMDSAbs_ElementType FreeEdges::GetType() const
1571 return SMDSAbs_Face;
1574 FreeEdges::Border::Border(long theElemId, long thePntId1, long thePntId2):
1577 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1578 if(thePntId1 > thePntId2){
1579 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1583 bool FreeEdges::Border::operator<(const FreeEdges::Border& x) const{
1584 if(myPntId[0] < x.myPntId[0]) return true;
1585 if(myPntId[0] == x.myPntId[0])
1586 if(myPntId[1] < x.myPntId[1]) return true;
1590 inline void UpdateBorders(const FreeEdges::Border& theBorder,
1591 FreeEdges::TBorders& theRegistry,
1592 FreeEdges::TBorders& theContainer)
1594 if(theRegistry.find(theBorder) == theRegistry.end()){
1595 theRegistry.insert(theBorder);
1596 theContainer.insert(theBorder);
1598 theContainer.erase(theBorder);
1602 void FreeEdges::GetBoreders(TBorders& theBorders)
1605 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1606 for(; anIter->more(); ){
1607 const SMDS_MeshFace* anElem = anIter->next();
1608 long anElemId = anElem->GetID();
1609 SMDS_ElemIteratorPtr aNodesIter;
1610 if ( anElem->IsQuadratic() )
1611 aNodesIter = static_cast<const SMDS_QuadraticFaceOfNodes*>(anElem)->
1612 interlacedNodesElemIterator();
1614 aNodesIter = anElem->nodesIterator();
1616 const SMDS_MeshElement* aNode;
1617 if(aNodesIter->more()){
1618 aNode = aNodesIter->next();
1619 aNodeId[0] = aNodeId[1] = aNode->GetID();
1621 for(; aNodesIter->more(); ){
1622 aNode = aNodesIter->next();
1623 long anId = aNode->GetID();
1624 Border aBorder(anElemId,aNodeId[1],anId);
1626 //std::cout<<aBorder.myPntId[0]<<"; "<<aBorder.myPntId[1]<<"; "<<aBorder.myElemId<<endl;
1627 UpdateBorders(aBorder,aRegistry,theBorders);
1629 Border aBorder(anElemId,aNodeId[0],aNodeId[1]);
1630 //std::cout<<aBorder.myPntId[0]<<"; "<<aBorder.myPntId[1]<<"; "<<aBorder.myElemId<<endl;
1631 UpdateBorders(aBorder,aRegistry,theBorders);
1633 //std::cout<<"theBorders.size() = "<<theBorders.size()<<endl;
1638 Description : Predicate for Range of Ids.
1639 Range may be specified with two ways.
1640 1. Using AddToRange method
1641 2. With SetRangeStr method. Parameter of this method is a string
1642 like as "1,2,3,50-60,63,67,70-"
1645 //=======================================================================
1646 // name : RangeOfIds
1647 // Purpose : Constructor
1648 //=======================================================================
1649 RangeOfIds::RangeOfIds()
1652 myType = SMDSAbs_All;
1655 //=======================================================================
1657 // Purpose : Set mesh
1658 //=======================================================================
1659 void RangeOfIds::SetMesh( const SMDS_Mesh* theMesh )
1664 //=======================================================================
1665 // name : AddToRange
1666 // Purpose : Add ID to the range
1667 //=======================================================================
1668 bool RangeOfIds::AddToRange( long theEntityId )
1670 myIds.Add( theEntityId );
1674 //=======================================================================
1675 // name : GetRangeStr
1676 // Purpose : Get range as a string.
1677 // Example: "1,2,3,50-60,63,67,70-"
1678 //=======================================================================
1679 void RangeOfIds::GetRangeStr( TCollection_AsciiString& theResStr )
1683 TColStd_SequenceOfInteger anIntSeq;
1684 TColStd_SequenceOfAsciiString aStrSeq;
1686 TColStd_MapIteratorOfMapOfInteger anIter( myIds );
1687 for ( ; anIter.More(); anIter.Next() )
1689 int anId = anIter.Key();
1690 TCollection_AsciiString aStr( anId );
1691 anIntSeq.Append( anId );
1692 aStrSeq.Append( aStr );
1695 for ( int i = 1, n = myMin.Length(); i <= n; i++ )
1697 int aMinId = myMin( i );
1698 int aMaxId = myMax( i );
1700 TCollection_AsciiString aStr;
1701 if ( aMinId != IntegerFirst() )
1706 if ( aMaxId != IntegerLast() )
1709 // find position of the string in result sequence and insert string in it
1710 if ( anIntSeq.Length() == 0 )
1712 anIntSeq.Append( aMinId );
1713 aStrSeq.Append( aStr );
1717 if ( aMinId < anIntSeq.First() )
1719 anIntSeq.Prepend( aMinId );
1720 aStrSeq.Prepend( aStr );
1722 else if ( aMinId > anIntSeq.Last() )
1724 anIntSeq.Append( aMinId );
1725 aStrSeq.Append( aStr );
1728 for ( int j = 1, k = anIntSeq.Length(); j <= k; j++ )
1729 if ( aMinId < anIntSeq( j ) )
1731 anIntSeq.InsertBefore( j, aMinId );
1732 aStrSeq.InsertBefore( j, aStr );
1738 if ( aStrSeq.Length() == 0 )
1741 theResStr = aStrSeq( 1 );
1742 for ( int j = 2, k = aStrSeq.Length(); j <= k; j++ )
1745 theResStr += aStrSeq( j );
1749 //=======================================================================
1750 // name : SetRangeStr
1751 // Purpose : Define range with string
1752 // Example of entry string: "1,2,3,50-60,63,67,70-"
1753 //=======================================================================
1754 bool RangeOfIds::SetRangeStr( const TCollection_AsciiString& theStr )
1760 TCollection_AsciiString aStr = theStr;
1761 aStr.RemoveAll( ' ' );
1762 aStr.RemoveAll( '\t' );
1764 for ( int aPos = aStr.Search( ",," ); aPos != -1; aPos = aStr.Search( ",," ) )
1765 aStr.Remove( aPos, 2 );
1767 TCollection_AsciiString tmpStr = aStr.Token( ",", 1 );
1769 while ( tmpStr != "" )
1771 tmpStr = aStr.Token( ",", i++ );
1772 int aPos = tmpStr.Search( '-' );
1776 if ( tmpStr.IsIntegerValue() )
1777 myIds.Add( tmpStr.IntegerValue() );
1783 TCollection_AsciiString aMaxStr = tmpStr.Split( aPos );
1784 TCollection_AsciiString aMinStr = tmpStr;
1786 while ( aMinStr.Search( "-" ) != -1 ) aMinStr.RemoveAll( '-' );
1787 while ( aMaxStr.Search( "-" ) != -1 ) aMaxStr.RemoveAll( '-' );
1789 if ( !aMinStr.IsEmpty() && !aMinStr.IsIntegerValue() ||
1790 !aMaxStr.IsEmpty() && !aMaxStr.IsIntegerValue() )
1793 myMin.Append( aMinStr.IsEmpty() ? IntegerFirst() : aMinStr.IntegerValue() );
1794 myMax.Append( aMaxStr.IsEmpty() ? IntegerLast() : aMaxStr.IntegerValue() );
1801 //=======================================================================
1803 // Purpose : Get type of supported entities
1804 //=======================================================================
1805 SMDSAbs_ElementType RangeOfIds::GetType() const
1810 //=======================================================================
1812 // Purpose : Set type of supported entities
1813 //=======================================================================
1814 void RangeOfIds::SetType( SMDSAbs_ElementType theType )
1819 //=======================================================================
1821 // Purpose : Verify whether entity satisfies to this rpedicate
1822 //=======================================================================
1823 bool RangeOfIds::IsSatisfy( long theId )
1828 if ( myType == SMDSAbs_Node )
1830 if ( myMesh->FindNode( theId ) == 0 )
1835 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
1836 if ( anElem == 0 || myType != anElem->GetType() && myType != SMDSAbs_All )
1840 if ( myIds.Contains( theId ) )
1843 for ( int i = 1, n = myMin.Length(); i <= n; i++ )
1844 if ( theId >= myMin( i ) && theId <= myMax( i ) )
1852 Description : Base class for comparators
1854 Comparator::Comparator():
1858 Comparator::~Comparator()
1861 void Comparator::SetMesh( const SMDS_Mesh* theMesh )
1864 myFunctor->SetMesh( theMesh );
1867 void Comparator::SetMargin( double theValue )
1869 myMargin = theValue;
1872 void Comparator::SetNumFunctor( NumericalFunctorPtr theFunct )
1874 myFunctor = theFunct;
1877 SMDSAbs_ElementType Comparator::GetType() const
1879 return myFunctor ? myFunctor->GetType() : SMDSAbs_All;
1882 double Comparator::GetMargin()
1890 Description : Comparator "<"
1892 bool LessThan::IsSatisfy( long theId )
1894 return myFunctor && myFunctor->GetValue( theId ) < myMargin;
1900 Description : Comparator ">"
1902 bool MoreThan::IsSatisfy( long theId )
1904 return myFunctor && myFunctor->GetValue( theId ) > myMargin;
1910 Description : Comparator "="
1913 myToler(Precision::Confusion())
1916 bool EqualTo::IsSatisfy( long theId )
1918 return myFunctor && fabs( myFunctor->GetValue( theId ) - myMargin ) < myToler;
1921 void EqualTo::SetTolerance( double theToler )
1926 double EqualTo::GetTolerance()
1933 Description : Logical NOT predicate
1935 LogicalNOT::LogicalNOT()
1938 LogicalNOT::~LogicalNOT()
1941 bool LogicalNOT::IsSatisfy( long theId )
1943 return myPredicate && !myPredicate->IsSatisfy( theId );
1946 void LogicalNOT::SetMesh( const SMDS_Mesh* theMesh )
1949 myPredicate->SetMesh( theMesh );
1952 void LogicalNOT::SetPredicate( PredicatePtr thePred )
1954 myPredicate = thePred;
1957 SMDSAbs_ElementType LogicalNOT::GetType() const
1959 return myPredicate ? myPredicate->GetType() : SMDSAbs_All;
1964 Class : LogicalBinary
1965 Description : Base class for binary logical predicate
1967 LogicalBinary::LogicalBinary()
1970 LogicalBinary::~LogicalBinary()
1973 void LogicalBinary::SetMesh( const SMDS_Mesh* theMesh )
1976 myPredicate1->SetMesh( theMesh );
1979 myPredicate2->SetMesh( theMesh );
1982 void LogicalBinary::SetPredicate1( PredicatePtr thePredicate )
1984 myPredicate1 = thePredicate;
1987 void LogicalBinary::SetPredicate2( PredicatePtr thePredicate )
1989 myPredicate2 = thePredicate;
1992 SMDSAbs_ElementType LogicalBinary::GetType() const
1994 if ( !myPredicate1 || !myPredicate2 )
1997 SMDSAbs_ElementType aType1 = myPredicate1->GetType();
1998 SMDSAbs_ElementType aType2 = myPredicate2->GetType();
2000 return aType1 == aType2 ? aType1 : SMDSAbs_All;
2006 Description : Logical AND
2008 bool LogicalAND::IsSatisfy( long theId )
2013 myPredicate1->IsSatisfy( theId ) &&
2014 myPredicate2->IsSatisfy( theId );
2020 Description : Logical OR
2022 bool LogicalOR::IsSatisfy( long theId )
2027 myPredicate1->IsSatisfy( theId ) ||
2028 myPredicate2->IsSatisfy( theId );
2042 void Filter::SetPredicate( PredicatePtr thePredicate )
2044 myPredicate = thePredicate;
2047 template<class TElement, class TIterator, class TPredicate>
2048 inline void FillSequence(const TIterator& theIterator,
2049 TPredicate& thePredicate,
2050 Filter::TIdSequence& theSequence)
2052 if ( theIterator ) {
2053 while( theIterator->more() ) {
2054 TElement anElem = theIterator->next();
2055 long anId = anElem->GetID();
2056 if ( thePredicate->IsSatisfy( anId ) )
2057 theSequence.push_back( anId );
2064 GetElementsId( const SMDS_Mesh* theMesh,
2065 PredicatePtr thePredicate,
2066 TIdSequence& theSequence )
2068 theSequence.clear();
2070 if ( !theMesh || !thePredicate )
2073 thePredicate->SetMesh( theMesh );
2075 SMDSAbs_ElementType aType = thePredicate->GetType();
2078 FillSequence<const SMDS_MeshNode*>(theMesh->nodesIterator(),thePredicate,theSequence);
2081 FillSequence<const SMDS_MeshElement*>(theMesh->edgesIterator(),thePredicate,theSequence);
2084 FillSequence<const SMDS_MeshElement*>(theMesh->facesIterator(),thePredicate,theSequence);
2086 case SMDSAbs_Volume:
2087 FillSequence<const SMDS_MeshElement*>(theMesh->volumesIterator(),thePredicate,theSequence);
2090 FillSequence<const SMDS_MeshElement*>(theMesh->edgesIterator(),thePredicate,theSequence);
2091 FillSequence<const SMDS_MeshElement*>(theMesh->facesIterator(),thePredicate,theSequence);
2092 FillSequence<const SMDS_MeshElement*>(theMesh->volumesIterator(),thePredicate,theSequence);
2098 Filter::GetElementsId( const SMDS_Mesh* theMesh,
2099 Filter::TIdSequence& theSequence )
2101 GetElementsId(theMesh,myPredicate,theSequence);
2108 typedef std::set<SMDS_MeshFace*> TMapOfFacePtr;
2114 ManifoldPart::Link::Link( SMDS_MeshNode* theNode1,
2115 SMDS_MeshNode* theNode2 )
2121 ManifoldPart::Link::~Link()
2127 bool ManifoldPart::Link::IsEqual( const ManifoldPart::Link& theLink ) const
2129 if ( myNode1 == theLink.myNode1 &&
2130 myNode2 == theLink.myNode2 )
2132 else if ( myNode1 == theLink.myNode2 &&
2133 myNode2 == theLink.myNode1 )
2139 bool ManifoldPart::Link::operator<( const ManifoldPart::Link& x ) const
2141 if(myNode1 < x.myNode1) return true;
2142 if(myNode1 == x.myNode1)
2143 if(myNode2 < x.myNode2) return true;
2147 bool ManifoldPart::IsEqual( const ManifoldPart::Link& theLink1,
2148 const ManifoldPart::Link& theLink2 )
2150 return theLink1.IsEqual( theLink2 );
2153 ManifoldPart::ManifoldPart()
2156 myAngToler = Precision::Angular();
2157 myIsOnlyManifold = true;
2160 ManifoldPart::~ManifoldPart()
2165 void ManifoldPart::SetMesh( const SMDS_Mesh* theMesh )
2171 SMDSAbs_ElementType ManifoldPart::GetType() const
2172 { return SMDSAbs_Face; }
2174 bool ManifoldPart::IsSatisfy( long theElementId )
2176 return myMapIds.Contains( theElementId );
2179 void ManifoldPart::SetAngleTolerance( const double theAngToler )
2180 { myAngToler = theAngToler; }
2182 double ManifoldPart::GetAngleTolerance() const
2183 { return myAngToler; }
2185 void ManifoldPart::SetIsOnlyManifold( const bool theIsOnly )
2186 { myIsOnlyManifold = theIsOnly; }
2188 void ManifoldPart::SetStartElem( const long theStartId )
2189 { myStartElemId = theStartId; }
2191 bool ManifoldPart::process()
2194 myMapBadGeomIds.Clear();
2196 myAllFacePtr.clear();
2197 myAllFacePtrIntDMap.clear();
2201 // collect all faces into own map
2202 SMDS_FaceIteratorPtr anFaceItr = myMesh->facesIterator();
2203 for (; anFaceItr->more(); )
2205 SMDS_MeshFace* aFacePtr = (SMDS_MeshFace*)anFaceItr->next();
2206 myAllFacePtr.push_back( aFacePtr );
2207 myAllFacePtrIntDMap[aFacePtr] = myAllFacePtr.size()-1;
2210 SMDS_MeshFace* aStartFace = (SMDS_MeshFace*)myMesh->FindElement( myStartElemId );
2214 // the map of non manifold links and bad geometry
2215 TMapOfLink aMapOfNonManifold;
2216 TColStd_MapOfInteger aMapOfTreated;
2218 // begin cycle on faces from start index and run on vector till the end
2219 // and from begin to start index to cover whole vector
2220 const int aStartIndx = myAllFacePtrIntDMap[aStartFace];
2221 bool isStartTreat = false;
2222 for ( int fi = aStartIndx; !isStartTreat || fi != aStartIndx ; fi++ )
2224 if ( fi == aStartIndx )
2225 isStartTreat = true;
2226 // as result next time when fi will be equal to aStartIndx
2228 SMDS_MeshFace* aFacePtr = myAllFacePtr[ fi ];
2229 if ( aMapOfTreated.Contains( aFacePtr->GetID() ) )
2232 aMapOfTreated.Add( aFacePtr->GetID() );
2233 TColStd_MapOfInteger aResFaces;
2234 if ( !findConnected( myAllFacePtrIntDMap, aFacePtr,
2235 aMapOfNonManifold, aResFaces ) )
2237 TColStd_MapIteratorOfMapOfInteger anItr( aResFaces );
2238 for ( ; anItr.More(); anItr.Next() )
2240 int aFaceId = anItr.Key();
2241 aMapOfTreated.Add( aFaceId );
2242 myMapIds.Add( aFaceId );
2245 if ( fi == ( myAllFacePtr.size() - 1 ) )
2247 } // end run on vector of faces
2248 return !myMapIds.IsEmpty();
2251 static void getLinks( const SMDS_MeshFace* theFace,
2252 ManifoldPart::TVectorOfLink& theLinks )
2254 int aNbNode = theFace->NbNodes();
2255 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
2257 SMDS_MeshNode* aNode = 0;
2258 for ( ; aNodeItr->more() && i <= aNbNode; )
2261 SMDS_MeshNode* aN1 = (SMDS_MeshNode*)aNodeItr->next();
2265 SMDS_MeshNode* aN2 = ( i >= aNbNode ) ? aNode : (SMDS_MeshNode*)aNodeItr->next();
2267 ManifoldPart::Link aLink( aN1, aN2 );
2268 theLinks.push_back( aLink );
2272 static gp_XYZ getNormale( const SMDS_MeshFace* theFace )
2275 int aNbNode = theFace->NbNodes();
2276 TColgp_Array1OfXYZ anArrOfXYZ(1,4);
2277 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
2279 for ( ; aNodeItr->more() && i <= 4; i++ ) {
2280 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
2281 anArrOfXYZ.SetValue(i, gp_XYZ( aNode->X(), aNode->Y(), aNode->Z() ) );
2284 gp_XYZ q1 = anArrOfXYZ.Value(2) - anArrOfXYZ.Value(1);
2285 gp_XYZ q2 = anArrOfXYZ.Value(3) - anArrOfXYZ.Value(1);
2287 if ( aNbNode > 3 ) {
2288 gp_XYZ q3 = anArrOfXYZ.Value(4) - anArrOfXYZ.Value(1);
2291 double len = n.Modulus();
2298 bool ManifoldPart::findConnected
2299 ( const ManifoldPart::TDataMapFacePtrInt& theAllFacePtrInt,
2300 SMDS_MeshFace* theStartFace,
2301 ManifoldPart::TMapOfLink& theNonManifold,
2302 TColStd_MapOfInteger& theResFaces )
2304 theResFaces.Clear();
2305 if ( !theAllFacePtrInt.size() )
2308 if ( getNormale( theStartFace ).SquareModulus() <= gp::Resolution() )
2310 myMapBadGeomIds.Add( theStartFace->GetID() );
2314 ManifoldPart::TMapOfLink aMapOfBoundary, aMapToSkip;
2315 ManifoldPart::TVectorOfLink aSeqOfBoundary;
2316 theResFaces.Add( theStartFace->GetID() );
2317 ManifoldPart::TDataMapOfLinkFacePtr aDMapLinkFace;
2319 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
2320 aDMapLinkFace, theNonManifold, theStartFace );
2322 bool isDone = false;
2323 while ( !isDone && aMapOfBoundary.size() != 0 )
2325 bool isToReset = false;
2326 ManifoldPart::TVectorOfLink::iterator pLink = aSeqOfBoundary.begin();
2327 for ( ; !isToReset && pLink != aSeqOfBoundary.end(); ++pLink )
2329 ManifoldPart::Link aLink = *pLink;
2330 if ( aMapToSkip.find( aLink ) != aMapToSkip.end() )
2332 // each link could be treated only once
2333 aMapToSkip.insert( aLink );
2335 ManifoldPart::TVectorOfFacePtr aFaces;
2337 if ( myIsOnlyManifold &&
2338 (theNonManifold.find( aLink ) != theNonManifold.end()) )
2342 getFacesByLink( aLink, aFaces );
2343 // filter the element to keep only indicated elements
2344 ManifoldPart::TVectorOfFacePtr aFiltered;
2345 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
2346 for ( ; pFace != aFaces.end(); ++pFace )
2348 SMDS_MeshFace* aFace = *pFace;
2349 if ( myAllFacePtrIntDMap.find( aFace ) != myAllFacePtrIntDMap.end() )
2350 aFiltered.push_back( aFace );
2353 if ( aFaces.size() < 2 ) // no neihgbour faces
2355 else if ( myIsOnlyManifold && aFaces.size() > 2 ) // non manifold case
2357 theNonManifold.insert( aLink );
2362 // compare normal with normals of neighbor element
2363 SMDS_MeshFace* aPrevFace = aDMapLinkFace[ aLink ];
2364 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
2365 for ( ; pFace != aFaces.end(); ++pFace )
2367 SMDS_MeshFace* aNextFace = *pFace;
2368 if ( aPrevFace == aNextFace )
2370 int anNextFaceID = aNextFace->GetID();
2371 if ( myIsOnlyManifold && theResFaces.Contains( anNextFaceID ) )
2372 // should not be with non manifold restriction. probably bad topology
2374 // check if face was treated and skipped
2375 if ( myMapBadGeomIds.Contains( anNextFaceID ) ||
2376 !isInPlane( aPrevFace, aNextFace ) )
2378 // add new element to connected and extend the boundaries.
2379 theResFaces.Add( anNextFaceID );
2380 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
2381 aDMapLinkFace, theNonManifold, aNextFace );
2385 isDone = !isToReset;
2388 return !theResFaces.IsEmpty();
2391 bool ManifoldPart::isInPlane( const SMDS_MeshFace* theFace1,
2392 const SMDS_MeshFace* theFace2 )
2394 gp_Dir aNorm1 = gp_Dir( getNormale( theFace1 ) );
2395 gp_XYZ aNorm2XYZ = getNormale( theFace2 );
2396 if ( aNorm2XYZ.SquareModulus() <= gp::Resolution() )
2398 myMapBadGeomIds.Add( theFace2->GetID() );
2401 if ( aNorm1.IsParallel( gp_Dir( aNorm2XYZ ), myAngToler ) )
2407 void ManifoldPart::expandBoundary
2408 ( ManifoldPart::TMapOfLink& theMapOfBoundary,
2409 ManifoldPart::TVectorOfLink& theSeqOfBoundary,
2410 ManifoldPart::TDataMapOfLinkFacePtr& theDMapLinkFacePtr,
2411 ManifoldPart::TMapOfLink& theNonManifold,
2412 SMDS_MeshFace* theNextFace ) const
2414 ManifoldPart::TVectorOfLink aLinks;
2415 getLinks( theNextFace, aLinks );
2416 int aNbLink = (int)aLinks.size();
2417 for ( int i = 0; i < aNbLink; i++ )
2419 ManifoldPart::Link aLink = aLinks[ i ];
2420 if ( myIsOnlyManifold && (theNonManifold.find( aLink ) != theNonManifold.end()) )
2422 if ( theMapOfBoundary.find( aLink ) != theMapOfBoundary.end() )
2424 if ( myIsOnlyManifold )
2426 // remove from boundary
2427 theMapOfBoundary.erase( aLink );
2428 ManifoldPart::TVectorOfLink::iterator pLink = theSeqOfBoundary.begin();
2429 for ( ; pLink != theSeqOfBoundary.end(); ++pLink )
2431 ManifoldPart::Link aBoundLink = *pLink;
2432 if ( aBoundLink.IsEqual( aLink ) )
2434 theSeqOfBoundary.erase( pLink );
2442 theMapOfBoundary.insert( aLink );
2443 theSeqOfBoundary.push_back( aLink );
2444 theDMapLinkFacePtr[ aLink ] = theNextFace;
2449 void ManifoldPart::getFacesByLink( const ManifoldPart::Link& theLink,
2450 ManifoldPart::TVectorOfFacePtr& theFaces ) const
2452 SMDS_Mesh::SetOfFaces aSetOfFaces;
2453 // take all faces that shared first node
2454 SMDS_ElemIteratorPtr anItr = theLink.myNode1->facesIterator();
2455 for ( ; anItr->more(); )
2457 SMDS_MeshFace* aFace = (SMDS_MeshFace*)anItr->next();
2460 aSetOfFaces.Add( aFace );
2462 // take all faces that shared second node
2463 anItr = theLink.myNode2->facesIterator();
2464 // find the common part of two sets
2465 for ( ; anItr->more(); )
2467 SMDS_MeshFace* aFace = (SMDS_MeshFace*)anItr->next();
2468 if ( aSetOfFaces.Contains( aFace ) )
2469 theFaces.push_back( aFace );
2478 ElementsOnSurface::ElementsOnSurface()
2482 myType = SMDSAbs_All;
2484 myToler = Precision::Confusion();
2487 ElementsOnSurface::~ElementsOnSurface()
2492 void ElementsOnSurface::SetMesh( const SMDS_Mesh* theMesh )
2494 if ( myMesh == theMesh )
2501 bool ElementsOnSurface::IsSatisfy( long theElementId )
2503 return myIds.Contains( theElementId );
2506 SMDSAbs_ElementType ElementsOnSurface::GetType() const
2509 void ElementsOnSurface::SetTolerance( const double theToler )
2510 { myToler = theToler; }
2512 double ElementsOnSurface::GetTolerance() const
2517 void ElementsOnSurface::SetSurface( const TopoDS_Shape& theShape,
2518 const SMDSAbs_ElementType theType )
2522 if ( theShape.IsNull() || theShape.ShapeType() != TopAbs_FACE )
2527 TopoDS_Face aFace = TopoDS::Face( theShape );
2528 mySurf = BRep_Tool::Surface( aFace );
2531 void ElementsOnSurface::process()
2534 if ( mySurf.IsNull() )
2540 if ( myType == SMDSAbs_Face || myType == SMDSAbs_All )
2542 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
2543 for(; anIter->more(); )
2544 process( anIter->next() );
2547 if ( myType == SMDSAbs_Edge || myType == SMDSAbs_All )
2549 SMDS_EdgeIteratorPtr anIter = myMesh->edgesIterator();
2550 for(; anIter->more(); )
2551 process( anIter->next() );
2554 if ( myType == SMDSAbs_Node )
2556 SMDS_NodeIteratorPtr anIter = myMesh->nodesIterator();
2557 for(; anIter->more(); )
2558 process( anIter->next() );
2562 void ElementsOnSurface::process( const SMDS_MeshElement* theElemPtr )
2564 SMDS_ElemIteratorPtr aNodeItr = theElemPtr->nodesIterator();
2565 bool isSatisfy = true;
2566 for ( ; aNodeItr->more(); )
2568 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
2569 if ( !isOnSurface( aNode ) )
2576 myIds.Add( theElemPtr->GetID() );
2579 bool ElementsOnSurface::isOnSurface( const SMDS_MeshNode* theNode ) const
2581 if ( mySurf.IsNull() )
2584 gp_Pnt aPnt( theNode->X(), theNode->Y(), theNode->Z() );
2585 double aToler2 = myToler * myToler;
2586 if ( mySurf->IsKind(STANDARD_TYPE(Geom_Plane)))
2588 gp_Pln aPln = Handle(Geom_Plane)::DownCast(mySurf)->Pln();
2589 if ( aPln.SquareDistance( aPnt ) > aToler2 )
2592 else if ( mySurf->IsKind(STANDARD_TYPE(Geom_CylindricalSurface)))
2594 gp_Cylinder aCyl = Handle(Geom_CylindricalSurface)::DownCast(mySurf)->Cylinder();
2595 double aRad = aCyl.Radius();
2596 gp_Ax3 anAxis = aCyl.Position();
2597 gp_XYZ aLoc = aCyl.Location().XYZ();
2598 double aXDist = anAxis.XDirection().XYZ() * ( aPnt.XYZ() - aLoc );
2599 double aYDist = anAxis.YDirection().XYZ() * ( aPnt.XYZ() - aLoc );
2600 if ( fabs(aXDist*aXDist + aYDist*aYDist - aRad*aRad) > aToler2 )