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 )
250 if ( GetPoints( theId, P ))
252 double aVal = GetValue( P );
253 if ( myPrecision >= 0 )
255 double prec = pow( 10., (double)( myPrecision ) );
256 aVal = floor( aVal * prec + 0.5 ) / prec;
264 //=======================================================================
265 //function : GetValue
267 //=======================================================================
269 double Volume::GetValue( long theElementId )
271 if ( theElementId && myMesh ) {
272 SMDS_VolumeTool aVolumeTool;
273 if ( aVolumeTool.Set( myMesh->FindElement( theElementId )))
274 return aVolumeTool.GetSize();
279 //=======================================================================
280 //function : GetBadRate
281 //purpose : meaningless as it is not quality control functor
282 //=======================================================================
284 double Volume::GetBadRate( double Value, int /*nbNodes*/ ) const
289 //=======================================================================
292 //=======================================================================
294 SMDSAbs_ElementType Volume::GetType() const
296 return SMDSAbs_Volume;
302 Description : Functor for calculation of minimum angle
305 double MinimumAngle::GetValue( const TSequenceOfXYZ& P )
312 aMin = getAngle(P( P.size() ), P( 1 ), P( 2 ));
313 aMin = Min(aMin,getAngle(P( P.size()-1 ), P( P.size() ), P( 1 )));
315 for (int i=2; i<P.size();i++){
316 double A0 = getAngle( P( i-1 ), P( i ), P( i+1 ) );
320 return aMin * 180.0 / PI;
323 double MinimumAngle::GetBadRate( double Value, int nbNodes ) const
325 //const double aBestAngle = PI / nbNodes;
326 const double aBestAngle = 180.0 - ( 360.0 / double(nbNodes) );
327 return ( fabs( aBestAngle - Value ));
330 SMDSAbs_ElementType MinimumAngle::GetType() const
338 Description : Functor for calculating aspect ratio
340 double AspectRatio::GetValue( const TSequenceOfXYZ& P )
342 // According to "Mesh quality control" by Nadir Bouhamau referring to
343 // Pascal Jean Frey and Paul-Louis George. Maillages, applications aux elements finis.
344 // Hermes Science publications, Paris 1999 ISBN 2-7462-0024-4
347 int nbNodes = P.size();
352 // Compute lengths of the sides
354 vector< double > aLen (nbNodes);
356 for ( int i = 0; i < nbNodes - 1; i++ )
357 aLen[ i ] = getDistance( P( i + 1 ), P( i + 2 ) );
358 aLen[ nbNodes - 1 ] = getDistance( P( 1 ), P( nbNodes ) );
360 // Compute aspect ratio
364 // Q = alfa * h * p / S, where
366 // alfa = sqrt( 3 ) / 6
367 // h - length of the longest edge
368 // p - half perimeter
369 // S - triangle surface
371 const double alfa = sqrt( 3. ) / 6.;
372 double maxLen = Max( aLen[ 0 ], Max( aLen[ 1 ], aLen[ 2 ] ) );
373 double half_perimeter = ( aLen[0] + aLen[1] + aLen[2] ) / 2.;
374 double anArea = getArea( P( 1 ), P( 2 ), P( 3 ) );
375 if ( anArea <= Precision::Confusion() )
378 return alfa * maxLen * half_perimeter / anArea;
382 // return aspect ratio of the worst triange which can be built
383 // taking three nodes of the quadrangle
384 TSequenceOfXYZ triaPnts(3);
385 // triangle on nodes 1 3 2
389 double ar = GetValue( triaPnts );
390 // triangle on nodes 1 3 4
392 ar = Max ( ar, GetValue( triaPnts ));
393 // triangle on nodes 1 2 4
395 ar = Max ( ar, GetValue( triaPnts ));
396 // triangle on nodes 3 2 4
398 ar = Max ( ar, GetValue( triaPnts ));
404 double AspectRatio::GetBadRate( double Value, int /*nbNodes*/ ) const
406 // the aspect ratio is in the range [1.0,infinity]
409 return Value / 1000.;
412 SMDSAbs_ElementType AspectRatio::GetType() const
419 Class : AspectRatio3D
420 Description : Functor for calculating aspect ratio
424 inline double getHalfPerimeter(double theTria[3]){
425 return (theTria[0] + theTria[1] + theTria[2])/2.0;
428 inline double getArea(double theHalfPerim, double theTria[3]){
429 return sqrt(theHalfPerim*
430 (theHalfPerim-theTria[0])*
431 (theHalfPerim-theTria[1])*
432 (theHalfPerim-theTria[2]));
435 inline double getVolume(double theLen[6]){
436 double a2 = theLen[0]*theLen[0];
437 double b2 = theLen[1]*theLen[1];
438 double c2 = theLen[2]*theLen[2];
439 double d2 = theLen[3]*theLen[3];
440 double e2 = theLen[4]*theLen[4];
441 double f2 = theLen[5]*theLen[5];
442 double P = 4.0*a2*b2*d2;
443 double Q = a2*(b2+d2-e2)-b2*(a2+d2-f2)-d2*(a2+b2-c2);
444 double R = (b2+d2-e2)*(a2+d2-f2)*(a2+d2-f2);
445 return sqrt(P-Q+R)/12.0;
448 inline double getVolume2(double theLen[6]){
449 double a2 = theLen[0]*theLen[0];
450 double b2 = theLen[1]*theLen[1];
451 double c2 = theLen[2]*theLen[2];
452 double d2 = theLen[3]*theLen[3];
453 double e2 = theLen[4]*theLen[4];
454 double f2 = theLen[5]*theLen[5];
456 double P = a2*e2*(b2+c2+d2+f2-a2-e2);
457 double Q = b2*f2*(a2+c2+d2+e2-b2-f2);
458 double R = c2*d2*(a2+b2+e2+f2-c2-d2);
459 double S = a2*b2*d2+b2*c2*e2+a2*c2*f2+d2*e2*f2;
461 return sqrt(P+Q+R-S)/12.0;
464 inline double getVolume(const TSequenceOfXYZ& P){
465 gp_Vec aVec1( P( 2 ) - P( 1 ) );
466 gp_Vec aVec2( P( 3 ) - P( 1 ) );
467 gp_Vec aVec3( P( 4 ) - P( 1 ) );
468 gp_Vec anAreaVec( aVec1 ^ aVec2 );
469 return fabs(aVec3 * anAreaVec) / 6.0;
472 inline double getMaxHeight(double theLen[6])
474 double aHeight = max(theLen[0],theLen[1]);
475 aHeight = max(aHeight,theLen[2]);
476 aHeight = max(aHeight,theLen[3]);
477 aHeight = max(aHeight,theLen[4]);
478 aHeight = max(aHeight,theLen[5]);
484 double AspectRatio3D::GetValue( const TSequenceOfXYZ& P )
486 double aQuality = 0.0;
487 int nbNodes = P.size();
491 getDistance(P( 1 ),P( 2 )), // a
492 getDistance(P( 2 ),P( 3 )), // b
493 getDistance(P( 3 ),P( 1 )), // c
494 getDistance(P( 2 ),P( 4 )), // d
495 getDistance(P( 3 ),P( 4 )), // e
496 getDistance(P( 1 ),P( 4 )) // f
498 double aTria[4][3] = {
499 {aLen[0],aLen[1],aLen[2]}, // abc
500 {aLen[0],aLen[3],aLen[5]}, // adf
501 {aLen[1],aLen[3],aLen[4]}, // bde
502 {aLen[2],aLen[4],aLen[5]} // cef
504 double aSumArea = 0.0;
505 double aHalfPerimeter = getHalfPerimeter(aTria[0]);
506 double anArea = getArea(aHalfPerimeter,aTria[0]);
508 aHalfPerimeter = getHalfPerimeter(aTria[1]);
509 anArea = getArea(aHalfPerimeter,aTria[1]);
511 aHalfPerimeter = getHalfPerimeter(aTria[2]);
512 anArea = getArea(aHalfPerimeter,aTria[2]);
514 aHalfPerimeter = getHalfPerimeter(aTria[3]);
515 anArea = getArea(aHalfPerimeter,aTria[3]);
517 double aVolume = getVolume(P);
518 //double aVolume = getVolume(aLen);
519 double aHeight = getMaxHeight(aLen);
520 static double aCoeff = sqrt(2.0)/12.0;
521 aQuality = aCoeff*aHeight*aSumArea/aVolume;
526 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 3 ),P( 5 )};
527 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
530 gp_XYZ aXYZ[4] = {P( 1 ),P( 3 ),P( 4 ),P( 5 )};
531 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
534 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 5 )};
535 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
538 gp_XYZ aXYZ[4] = {P( 2 ),P( 3 ),P( 4 ),P( 5 )};
539 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
545 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 6 )};
546 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
549 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 3 )};
550 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
553 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 6 )};
554 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
557 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 3 )};
558 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
561 gp_XYZ aXYZ[4] = {P( 2 ),P( 5 ),P( 4 ),P( 6 )};
562 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
565 gp_XYZ aXYZ[4] = {P( 2 ),P( 5 ),P( 4 ),P( 3 )};
566 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
572 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 3 )};
573 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
576 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 4 )};
577 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
580 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 7 )};
581 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
584 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 8 )};
585 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
588 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 3 )};
589 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
592 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 4 )};
593 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
596 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 7 )};
597 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
600 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 8 )};
601 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
604 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 3 )};
605 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
608 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 4 )};
609 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
612 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 7 )};
613 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
616 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 8 )};
617 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
620 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 1 )};
621 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
624 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 2 )};
625 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
628 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 5 )};
629 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
632 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 6 )};
633 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
636 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 1 )};
637 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
640 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 2 )};
641 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
644 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 5 )};
645 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
648 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 6 )};
649 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
652 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 1 )};
653 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
656 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 2 )};
657 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
660 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 5 )};
661 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
664 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 6 )};
665 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
668 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 2 )};
669 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
672 gp_XYZ aXYZ[4] = {P( 4 ),P( 5 ),P( 8 ),P( 2 )};
673 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
676 gp_XYZ aXYZ[4] = {P( 1 ),P( 4 ),P( 5 ),P( 3 )};
677 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
680 gp_XYZ aXYZ[4] = {P( 3 ),P( 6 ),P( 7 ),P( 1 )};
681 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
684 gp_XYZ aXYZ[4] = {P( 2 ),P( 3 ),P( 6 ),P( 4 )};
685 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
688 gp_XYZ aXYZ[4] = {P( 5 ),P( 6 ),P( 8 ),P( 3 )};
689 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
692 gp_XYZ aXYZ[4] = {P( 7 ),P( 8 ),P( 6 ),P( 1 )};
693 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
696 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 7 )};
697 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
700 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 2 ),P( 5 )};
701 aQuality = max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
707 // avaluate aspect ratio of quadranle faces
708 AspectRatio aspect2D;
709 SMDS_VolumeTool::VolumeType type = SMDS_VolumeTool::GetType( nbNodes );
710 int nbFaces = SMDS_VolumeTool::NbFaces( type );
711 TSequenceOfXYZ points(4);
712 for ( int i = 0; i < nbFaces; ++i ) { // loop on faces of a volume
713 if ( SMDS_VolumeTool::NbFaceNodes( type, i ) != 4 )
715 const int* pInd = SMDS_VolumeTool::GetFaceNodesIndices( type, i, true );
716 for ( int p = 0; p < 4; ++p ) // loop on nodes of a quadranle face
717 points( p + 1 ) = P( pInd[ p ] + 1 );
718 aQuality = max( aQuality, aspect2D.GetValue( points ));
724 double AspectRatio3D::GetBadRate( double Value, int /*nbNodes*/ ) const
726 // the aspect ratio is in the range [1.0,infinity]
729 return Value / 1000.;
732 SMDSAbs_ElementType AspectRatio3D::GetType() const
734 return SMDSAbs_Volume;
740 Description : Functor for calculating warping
742 double Warping::GetValue( const TSequenceOfXYZ& P )
747 gp_XYZ G = ( P( 1 ) + P( 2 ) + P( 3 ) + P( 4 ) ) / 4;
749 double A1 = ComputeA( P( 1 ), P( 2 ), P( 3 ), G );
750 double A2 = ComputeA( P( 2 ), P( 3 ), P( 4 ), G );
751 double A3 = ComputeA( P( 3 ), P( 4 ), P( 1 ), G );
752 double A4 = ComputeA( P( 4 ), P( 1 ), P( 2 ), G );
754 return Max( Max( A1, A2 ), Max( A3, A4 ) );
757 double Warping::ComputeA( const gp_XYZ& thePnt1,
758 const gp_XYZ& thePnt2,
759 const gp_XYZ& thePnt3,
760 const gp_XYZ& theG ) const
762 double aLen1 = gp_Pnt( thePnt1 ).Distance( gp_Pnt( thePnt2 ) );
763 double aLen2 = gp_Pnt( thePnt2 ).Distance( gp_Pnt( thePnt3 ) );
764 double L = Min( aLen1, aLen2 ) * 0.5;
765 if ( L < Precision::Confusion())
768 gp_XYZ GI = ( thePnt2 + thePnt1 ) / 2. - theG;
769 gp_XYZ GJ = ( thePnt3 + thePnt2 ) / 2. - theG;
770 gp_XYZ N = GI.Crossed( GJ );
772 if ( N.Modulus() < gp::Resolution() )
777 double H = ( thePnt2 - theG ).Dot( N );
778 return asin( fabs( H / L ) ) * 180 / PI;
781 double Warping::GetBadRate( double Value, int /*nbNodes*/ ) const
783 // the warp is in the range [0.0,PI/2]
784 // 0.0 = good (no warp)
785 // PI/2 = bad (face pliee)
789 SMDSAbs_ElementType Warping::GetType() const
797 Description : Functor for calculating taper
799 double Taper::GetValue( const TSequenceOfXYZ& P )
805 double J1 = getArea( P( 4 ), P( 1 ), P( 2 ) ) / 2;
806 double J2 = getArea( P( 3 ), P( 1 ), P( 2 ) ) / 2;
807 double J3 = getArea( P( 2 ), P( 3 ), P( 4 ) ) / 2;
808 double J4 = getArea( P( 3 ), P( 4 ), P( 1 ) ) / 2;
810 double JA = 0.25 * ( J1 + J2 + J3 + J4 );
811 if ( JA <= Precision::Confusion() )
814 double T1 = fabs( ( J1 - JA ) / JA );
815 double T2 = fabs( ( J2 - JA ) / JA );
816 double T3 = fabs( ( J3 - JA ) / JA );
817 double T4 = fabs( ( J4 - JA ) / JA );
819 return Max( Max( T1, T2 ), Max( T3, T4 ) );
822 double Taper::GetBadRate( double Value, int /*nbNodes*/ ) const
824 // the taper is in the range [0.0,1.0]
825 // 0.0 = good (no taper)
826 // 1.0 = bad (les cotes opposes sont allignes)
830 SMDSAbs_ElementType Taper::GetType() const
838 Description : Functor for calculating skew in degrees
840 static inline double skewAngle( const gp_XYZ& p1, const gp_XYZ& p2, const gp_XYZ& p3 )
842 gp_XYZ p12 = ( p2 + p1 ) / 2;
843 gp_XYZ p23 = ( p3 + p2 ) / 2;
844 gp_XYZ p31 = ( p3 + p1 ) / 2;
846 gp_Vec v1( p31 - p2 ), v2( p12 - p23 );
848 return v1.Magnitude() < gp::Resolution() || v2.Magnitude() < gp::Resolution() ? 0 : v1.Angle( v2 );
851 double Skew::GetValue( const TSequenceOfXYZ& P )
853 if ( P.size() != 3 && P.size() != 4 )
857 static double PI2 = PI / 2;
860 double A0 = fabs( PI2 - skewAngle( P( 3 ), P( 1 ), P( 2 ) ) );
861 double A1 = fabs( PI2 - skewAngle( P( 1 ), P( 2 ), P( 3 ) ) );
862 double A2 = fabs( PI2 - skewAngle( P( 2 ), P( 3 ), P( 1 ) ) );
864 return Max( A0, Max( A1, A2 ) ) * 180 / PI;
868 gp_XYZ p12 = ( P( 1 ) + P( 2 ) ) / 2;
869 gp_XYZ p23 = ( P( 2 ) + P( 3 ) ) / 2;
870 gp_XYZ p34 = ( P( 3 ) + P( 4 ) ) / 2;
871 gp_XYZ p41 = ( P( 4 ) + P( 1 ) ) / 2;
873 gp_Vec v1( p34 - p12 ), v2( p23 - p41 );
874 double A = v1.Magnitude() <= gp::Resolution() || v2.Magnitude() <= gp::Resolution()
875 ? 0 : fabs( PI2 - v1.Angle( v2 ) );
881 double Skew::GetBadRate( double Value, int /*nbNodes*/ ) const
883 // the skew is in the range [0.0,PI/2].
889 SMDSAbs_ElementType Skew::GetType() const
897 Description : Functor for calculating area
899 double Area::GetValue( const TSequenceOfXYZ& P )
901 gp_Vec aVec1( P(2) - P(1) );
902 gp_Vec aVec2( P(3) - P(1) );
903 gp_Vec SumVec = aVec1 ^ aVec2;
904 for (int i=4; i<=P.size(); i++) {
905 gp_Vec aVec1( P(i-1) - P(1) );
906 gp_Vec aVec2( P(i) - P(1) );
907 gp_Vec tmp = aVec1 ^ aVec2;
910 return SumVec.Magnitude() * 0.5;
913 double Area::GetBadRate( double Value, int /*nbNodes*/ ) const
915 // meaningless as it is not a quality control functor
919 SMDSAbs_ElementType Area::GetType() const
927 Description : Functor for calculating length off edge
929 double Length::GetValue( const TSequenceOfXYZ& P )
931 switch ( P.size() ) {
932 case 2: return getDistance( P( 1 ), P( 2 ) );
933 case 3: return getDistance( P( 1 ), P( 2 ) ) + getDistance( P( 2 ), P( 3 ) );
938 double Length::GetBadRate( double Value, int /*nbNodes*/ ) const
940 // meaningless as it is not quality control functor
944 SMDSAbs_ElementType Length::GetType() const
951 Description : Functor for calculating length of edge
954 double Length2D::GetValue( long theElementId)
958 //cout<<"Length2D::GetValue"<<endl;
959 if (GetPoints(theElementId,P)){
960 //for(int jj=1; jj<=P.size(); jj++)
961 // cout<<"jj="<<jj<<" P("<<P(jj).X()<<","<<P(jj).Y()<<","<<P(jj).Z()<<")"<<endl;
963 double aVal;// = GetValue( P );
964 const SMDS_MeshElement* aElem = myMesh->FindElement( theElementId );
965 SMDSAbs_ElementType aType = aElem->GetType();
974 aVal = getDistance( P( 1 ), P( 2 ) );
977 else if (len == 3){ // quadratic edge
978 aVal = getDistance(P( 1 ),P( 3 )) + getDistance(P( 3 ),P( 2 ));
982 if (len == 3){ // triangles
983 double L1 = getDistance(P( 1 ),P( 2 ));
984 double L2 = getDistance(P( 2 ),P( 3 ));
985 double L3 = getDistance(P( 3 ),P( 1 ));
986 aVal = Max(L1,Max(L2,L3));
989 else if (len == 4){ // quadrangles
990 double L1 = getDistance(P( 1 ),P( 2 ));
991 double L2 = getDistance(P( 2 ),P( 3 ));
992 double L3 = getDistance(P( 3 ),P( 4 ));
993 double L4 = getDistance(P( 4 ),P( 1 ));
994 aVal = Max(Max(L1,L2),Max(L3,L4));
997 if (len == 6){ // quadratic triangles
998 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
999 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1000 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 1 ));
1001 aVal = Max(L1,Max(L2,L3));
1002 //cout<<"L1="<<L1<<" L2="<<L2<<"L3="<<L3<<" aVal="<<aVal<<endl;
1005 else if (len == 8){ // quadratic quadrangles
1006 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
1007 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1008 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 7 ));
1009 double L4 = getDistance(P( 7 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
1010 aVal = Max(Max(L1,L2),Max(L3,L4));
1013 case SMDSAbs_Volume:
1014 if (len == 4){ // tetraidrs
1015 double L1 = getDistance(P( 1 ),P( 2 ));
1016 double L2 = getDistance(P( 2 ),P( 3 ));
1017 double L3 = getDistance(P( 3 ),P( 1 ));
1018 double L4 = getDistance(P( 1 ),P( 4 ));
1019 double L5 = getDistance(P( 2 ),P( 4 ));
1020 double L6 = getDistance(P( 3 ),P( 4 ));
1021 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1024 else if (len == 5){ // piramids
1025 double L1 = getDistance(P( 1 ),P( 2 ));
1026 double L2 = getDistance(P( 2 ),P( 3 ));
1027 double L3 = getDistance(P( 3 ),P( 1 ));
1028 double L4 = getDistance(P( 4 ),P( 1 ));
1029 double L5 = getDistance(P( 1 ),P( 5 ));
1030 double L6 = getDistance(P( 2 ),P( 5 ));
1031 double L7 = getDistance(P( 3 ),P( 5 ));
1032 double L8 = getDistance(P( 4 ),P( 5 ));
1034 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1035 aVal = Max(aVal,Max(L7,L8));
1038 else if (len == 6){ // pentaidres
1039 double L1 = getDistance(P( 1 ),P( 2 ));
1040 double L2 = getDistance(P( 2 ),P( 3 ));
1041 double L3 = getDistance(P( 3 ),P( 1 ));
1042 double L4 = getDistance(P( 4 ),P( 5 ));
1043 double L5 = getDistance(P( 5 ),P( 6 ));
1044 double L6 = getDistance(P( 6 ),P( 4 ));
1045 double L7 = getDistance(P( 1 ),P( 4 ));
1046 double L8 = getDistance(P( 2 ),P( 5 ));
1047 double L9 = getDistance(P( 3 ),P( 6 ));
1049 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1050 aVal = Max(aVal,Max(Max(L7,L8),L9));
1053 else if (len == 8){ // hexaider
1054 double L1 = getDistance(P( 1 ),P( 2 ));
1055 double L2 = getDistance(P( 2 ),P( 3 ));
1056 double L3 = getDistance(P( 3 ),P( 4 ));
1057 double L4 = getDistance(P( 4 ),P( 1 ));
1058 double L5 = getDistance(P( 5 ),P( 6 ));
1059 double L6 = getDistance(P( 6 ),P( 7 ));
1060 double L7 = getDistance(P( 7 ),P( 8 ));
1061 double L8 = getDistance(P( 8 ),P( 5 ));
1062 double L9 = getDistance(P( 1 ),P( 5 ));
1063 double L10= getDistance(P( 2 ),P( 6 ));
1064 double L11= getDistance(P( 3 ),P( 7 ));
1065 double L12= getDistance(P( 4 ),P( 8 ));
1067 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1068 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
1069 aVal = Max(aVal,Max(L11,L12));
1074 if (len == 10){ // quadratic tetraidrs
1075 double L1 = getDistance(P( 1 ),P( 5 )) + getDistance(P( 5 ),P( 2 ));
1076 double L2 = getDistance(P( 2 ),P( 6 )) + getDistance(P( 6 ),P( 3 ));
1077 double L3 = getDistance(P( 3 ),P( 7 )) + getDistance(P( 7 ),P( 1 ));
1078 double L4 = getDistance(P( 1 ),P( 8 )) + getDistance(P( 8 ),P( 4 ));
1079 double L5 = getDistance(P( 2 ),P( 9 )) + getDistance(P( 9 ),P( 4 ));
1080 double L6 = getDistance(P( 3 ),P( 10 )) + getDistance(P( 10 ),P( 4 ));
1081 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1084 else if (len == 13){ // quadratic piramids
1085 double L1 = getDistance(P( 1 ),P( 6 )) + getDistance(P( 6 ),P( 2 ));
1086 double L2 = getDistance(P( 2 ),P( 7 )) + getDistance(P( 7 ),P( 3 ));
1087 double L3 = getDistance(P( 3 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
1088 double L4 = getDistance(P( 4 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1089 double L5 = getDistance(P( 1 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1090 double L6 = getDistance(P( 2 ),P( 11 )) + getDistance(P( 11 ),P( 5 ));
1091 double L7 = getDistance(P( 3 ),P( 12 )) + getDistance(P( 12 ),P( 5 ));
1092 double L8 = getDistance(P( 4 ),P( 13 )) + getDistance(P( 13 ),P( 5 ));
1093 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1094 aVal = Max(aVal,Max(L7,L8));
1097 else if (len == 15){ // quadratic pentaidres
1098 double L1 = getDistance(P( 1 ),P( 7 )) + getDistance(P( 7 ),P( 2 ));
1099 double L2 = getDistance(P( 2 ),P( 8 )) + getDistance(P( 8 ),P( 3 ));
1100 double L3 = getDistance(P( 3 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1101 double L4 = getDistance(P( 4 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1102 double L5 = getDistance(P( 5 ),P( 11 )) + getDistance(P( 11 ),P( 6 ));
1103 double L6 = getDistance(P( 6 ),P( 12 )) + getDistance(P( 12 ),P( 4 ));
1104 double L7 = getDistance(P( 1 ),P( 13 )) + getDistance(P( 13 ),P( 4 ));
1105 double L8 = getDistance(P( 2 ),P( 14 )) + getDistance(P( 14 ),P( 5 ));
1106 double L9 = getDistance(P( 3 ),P( 15 )) + getDistance(P( 15 ),P( 6 ));
1107 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1108 aVal = Max(aVal,Max(Max(L7,L8),L9));
1111 else if (len == 20){ // quadratic hexaider
1112 double L1 = getDistance(P( 1 ),P( 9 )) + getDistance(P( 9 ),P( 2 ));
1113 double L2 = getDistance(P( 2 ),P( 10 )) + getDistance(P( 10 ),P( 3 ));
1114 double L3 = getDistance(P( 3 ),P( 11 )) + getDistance(P( 11 ),P( 4 ));
1115 double L4 = getDistance(P( 4 ),P( 12 )) + getDistance(P( 12 ),P( 1 ));
1116 double L5 = getDistance(P( 5 ),P( 13 )) + getDistance(P( 13 ),P( 6 ));
1117 double L6 = getDistance(P( 6 ),P( 14 )) + getDistance(P( 14 ),P( 7 ));
1118 double L7 = getDistance(P( 7 ),P( 15 )) + getDistance(P( 15 ),P( 8 ));
1119 double L8 = getDistance(P( 8 ),P( 16 )) + getDistance(P( 16 ),P( 5 ));
1120 double L9 = getDistance(P( 1 ),P( 17 )) + getDistance(P( 17 ),P( 5 ));
1121 double L10= getDistance(P( 2 ),P( 18 )) + getDistance(P( 18 ),P( 6 ));
1122 double L11= getDistance(P( 3 ),P( 19 )) + getDistance(P( 19 ),P( 7 ));
1123 double L12= getDistance(P( 4 ),P( 20 )) + getDistance(P( 20 ),P( 8 ));
1124 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1125 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
1126 aVal = Max(aVal,Max(L11,L12));
1138 if ( myPrecision >= 0 )
1140 double prec = pow( 10., (double)( myPrecision ) );
1141 aVal = floor( aVal * prec + 0.5 ) / prec;
1150 double Length2D::GetBadRate( double Value, int /*nbNodes*/ ) const
1152 // meaningless as it is not quality control functor
1156 SMDSAbs_ElementType Length2D::GetType() const
1158 return SMDSAbs_Face;
1161 Length2D::Value::Value(double theLength,long thePntId1, long thePntId2):
1164 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1165 if(thePntId1 > thePntId2){
1166 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1170 bool Length2D::Value::operator<(const Length2D::Value& x) const{
1171 if(myPntId[0] < x.myPntId[0]) return true;
1172 if(myPntId[0] == x.myPntId[0])
1173 if(myPntId[1] < x.myPntId[1]) return true;
1177 void Length2D::GetValues(TValues& theValues){
1179 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1180 for(; anIter->more(); ){
1181 const SMDS_MeshFace* anElem = anIter->next();
1183 if(anElem->IsQuadratic()) {
1184 const SMDS_QuadraticFaceOfNodes* F =
1185 static_cast<const SMDS_QuadraticFaceOfNodes*>(anElem);
1186 // use special nodes iterator
1187 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
1192 const SMDS_MeshElement* aNode;
1194 aNode = anIter->next();
1195 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1196 P[0] = P[1] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1197 aNodeId[0] = aNodeId[1] = aNode->GetID();
1200 for(; anIter->more(); ){
1201 const SMDS_MeshNode* N1 = static_cast<const SMDS_MeshNode*> (anIter->next());
1202 P[2] = gp_Pnt(N1->X(),N1->Y(),N1->Z());
1203 aNodeId[2] = N1->GetID();
1204 aLength = P[1].Distance(P[2]);
1205 if(!anIter->more()) break;
1206 const SMDS_MeshNode* N2 = static_cast<const SMDS_MeshNode*> (anIter->next());
1207 P[3] = gp_Pnt(N2->X(),N2->Y(),N2->Z());
1208 aNodeId[3] = N2->GetID();
1209 aLength += P[2].Distance(P[3]);
1210 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
1211 Value aValue2(aLength,aNodeId[2],aNodeId[3]);
1213 aNodeId[1] = aNodeId[3];
1214 theValues.insert(aValue1);
1215 theValues.insert(aValue2);
1217 aLength += P[2].Distance(P[0]);
1218 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
1219 Value aValue2(aLength,aNodeId[2],aNodeId[0]);
1220 theValues.insert(aValue1);
1221 theValues.insert(aValue2);
1224 SMDS_ElemIteratorPtr aNodesIter = anElem->nodesIterator();
1229 const SMDS_MeshElement* aNode;
1230 if(aNodesIter->more()){
1231 aNode = aNodesIter->next();
1232 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1233 P[0] = P[1] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1234 aNodeId[0] = aNodeId[1] = aNode->GetID();
1237 for(; aNodesIter->more(); ){
1238 aNode = aNodesIter->next();
1239 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1240 long anId = aNode->GetID();
1242 P[2] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1244 aLength = P[1].Distance(P[2]);
1246 Value aValue(aLength,aNodeId[1],anId);
1249 theValues.insert(aValue);
1252 aLength = P[0].Distance(P[1]);
1254 Value aValue(aLength,aNodeId[0],aNodeId[1]);
1255 theValues.insert(aValue);
1261 Class : MultiConnection
1262 Description : Functor for calculating number of faces conneted to the edge
1264 double MultiConnection::GetValue( const TSequenceOfXYZ& P )
1268 double MultiConnection::GetValue( long theId )
1270 return getNbMultiConnection( myMesh, theId );
1273 double MultiConnection::GetBadRate( double Value, int /*nbNodes*/ ) const
1275 // meaningless as it is not quality control functor
1279 SMDSAbs_ElementType MultiConnection::GetType() const
1281 return SMDSAbs_Edge;
1285 Class : MultiConnection2D
1286 Description : Functor for calculating number of faces conneted to the edge
1288 double MultiConnection2D::GetValue( const TSequenceOfXYZ& P )
1293 double MultiConnection2D::GetValue( long theElementId )
1298 if (GetPoints(theElementId,P)){
1299 const SMDS_MeshElement* anFaceElem = myMesh->FindElement( theElementId );
1300 SMDSAbs_ElementType aType = anFaceElem->GetType();
1304 TColStd_MapOfInteger aMap;
1312 if (len == 3){ // triangles
1313 int Nb[3] = {0,0,0};
1316 SMDS_ElemIteratorPtr anIter = anFaceElem->nodesIterator();
1317 if ( anIter != 0 ) {
1318 while( anIter->more() ) {
1319 const SMDS_MeshNode* aNode = (SMDS_MeshNode*)anIter->next();
1323 SMDS_ElemIteratorPtr anElemIter = aNode->GetInverseElementIterator();
1324 while( anElemIter->more() ) {
1325 const SMDS_MeshElement* anElem = anElemIter->next();
1326 if ( anElem != 0 && anElem->GetType() != SMDSAbs_Edge ) {
1327 int anId = anElem->GetID();
1329 if ( anIter->more() ) // i.e. first node
1331 else if ( aMap.Contains( anId ) ){
1335 else if ( anElem != 0 && anElem->GetType() == SMDSAbs_Edge ) i++;
1340 aResult = Max(Max(Nb[0],Nb[1]),Nb[2]);
1343 case SMDSAbs_Volume:
1348 return aResult;//getNbMultiConnection( myMesh, theId );
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 = anElem->nodesIterator();
1384 //int aNbConnects=0;
1385 const SMDS_MeshNode* aNode0;
1386 const SMDS_MeshNode* aNode1;
1387 const SMDS_MeshNode* aNode2;
1388 if(aNodesIter->more()){
1389 aNode0 = (SMDS_MeshNode*) aNodesIter->next();
1391 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode1;
1392 aNodeId[0] = aNodeId[1] = aNodes->GetID();
1394 for(; aNodesIter->more(); ) {
1395 aNode2 = (SMDS_MeshNode*) aNodesIter->next();
1396 long anId = aNode2->GetID();
1399 Value aValue(aNodeId[1],aNodeId[2]);
1400 MValues::iterator aItr = theValues.find(aValue);
1401 if (aItr != theValues.end()){
1406 theValues[aValue] = 1;
1409 //cout << "NodeIds: "<<aNodeId[1]<<","<<aNodeId[2]<<" nbconn="<<aNbConnects<<endl;
1410 aNodeId[1] = aNodeId[2];
1413 Value aValue(aNodeId[0],aNodeId[2]);
1414 MValues::iterator aItr = theValues.find(aValue);
1415 if (aItr != theValues.end()) {
1420 theValues[aValue] = 1;
1423 //cout << "NodeIds: "<<aNodeId[0]<<","<<aNodeId[2]<<" nbconn="<<aNbConnects<<endl;
1433 Class : BadOrientedVolume
1434 Description : Predicate bad oriented volumes
1437 BadOrientedVolume::BadOrientedVolume()
1442 void BadOrientedVolume::SetMesh( const SMDS_Mesh* theMesh )
1447 bool BadOrientedVolume::IsSatisfy( long theId )
1452 SMDS_VolumeTool vTool( myMesh->FindElement( theId ));
1453 return !vTool.IsForward();
1456 SMDSAbs_ElementType BadOrientedVolume::GetType() const
1458 return SMDSAbs_Volume;
1465 Description : Predicate for free borders
1468 FreeBorders::FreeBorders()
1473 void FreeBorders::SetMesh( const SMDS_Mesh* theMesh )
1478 bool FreeBorders::IsSatisfy( long theId )
1480 return getNbMultiConnection( myMesh, theId ) == 1;
1483 SMDSAbs_ElementType FreeBorders::GetType() const
1485 return SMDSAbs_Edge;
1491 Description : Predicate for free Edges
1493 FreeEdges::FreeEdges()
1498 void FreeEdges::SetMesh( const SMDS_Mesh* theMesh )
1503 bool FreeEdges::IsFreeEdge( const SMDS_MeshNode** theNodes, const int theFaceId )
1505 TColStd_MapOfInteger aMap;
1506 for ( int i = 0; i < 2; i++ )
1508 SMDS_ElemIteratorPtr anElemIter = theNodes[ i ]->GetInverseElementIterator();
1509 while( anElemIter->more() )
1511 const SMDS_MeshElement* anElem = anElemIter->next();
1512 if ( anElem != 0 && anElem->GetType() == SMDSAbs_Face )
1514 int anId = anElem->GetID();
1518 else if ( aMap.Contains( anId ) && anId != theFaceId )
1526 bool FreeEdges::IsSatisfy( long theId )
1531 const SMDS_MeshElement* aFace = myMesh->FindElement( theId );
1532 if ( aFace == 0 || aFace->GetType() != SMDSAbs_Face || aFace->NbNodes() < 3 )
1535 SMDS_ElemIteratorPtr anIter;
1536 if ( aFace->IsQuadratic() ) {
1537 anIter = static_cast<const SMDS_QuadraticFaceOfNodes*>
1538 (aFace)->interlacedNodesElemIterator();
1541 anIter = aFace->nodesIterator();
1546 int i = 0, nbNodes = aFace->NbNodes();
1547 vector <const SMDS_MeshNode*> aNodes( nbNodes+1 );
1548 while( anIter->more() )
1550 const SMDS_MeshNode* aNode = (SMDS_MeshNode*)anIter->next();
1553 aNodes[ i++ ] = aNode;
1555 aNodes[ nbNodes ] = aNodes[ 0 ];
1557 for ( i = 0; i < nbNodes; i++ )
1558 if ( IsFreeEdge( &aNodes[ i ], theId ) )
1564 SMDSAbs_ElementType FreeEdges::GetType() const
1566 return SMDSAbs_Face;
1569 FreeEdges::Border::Border(long theElemId, long thePntId1, long thePntId2):
1572 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1573 if(thePntId1 > thePntId2){
1574 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1578 bool FreeEdges::Border::operator<(const FreeEdges::Border& x) const{
1579 if(myPntId[0] < x.myPntId[0]) return true;
1580 if(myPntId[0] == x.myPntId[0])
1581 if(myPntId[1] < x.myPntId[1]) return true;
1585 inline void UpdateBorders(const FreeEdges::Border& theBorder,
1586 FreeEdges::TBorders& theRegistry,
1587 FreeEdges::TBorders& theContainer)
1589 if(theRegistry.find(theBorder) == theRegistry.end()){
1590 theRegistry.insert(theBorder);
1591 theContainer.insert(theBorder);
1593 theContainer.erase(theBorder);
1597 void FreeEdges::GetBoreders(TBorders& theBorders)
1600 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1601 for(; anIter->more(); ){
1602 const SMDS_MeshFace* anElem = anIter->next();
1603 long anElemId = anElem->GetID();
1604 SMDS_ElemIteratorPtr aNodesIter = anElem->nodesIterator();
1606 const SMDS_MeshElement* aNode;
1607 if(aNodesIter->more()){
1608 aNode = aNodesIter->next();
1609 aNodeId[0] = aNodeId[1] = aNode->GetID();
1611 for(; aNodesIter->more(); ){
1612 aNode = aNodesIter->next();
1613 long anId = aNode->GetID();
1614 Border aBorder(anElemId,aNodeId[1],anId);
1616 //std::cout<<aBorder.myPntId[0]<<"; "<<aBorder.myPntId[1]<<"; "<<aBorder.myElemId<<endl;
1617 UpdateBorders(aBorder,aRegistry,theBorders);
1619 Border aBorder(anElemId,aNodeId[0],aNodeId[1]);
1620 //std::cout<<aBorder.myPntId[0]<<"; "<<aBorder.myPntId[1]<<"; "<<aBorder.myElemId<<endl;
1621 UpdateBorders(aBorder,aRegistry,theBorders);
1623 //std::cout<<"theBorders.size() = "<<theBorders.size()<<endl;
1628 Description : Predicate for Range of Ids.
1629 Range may be specified with two ways.
1630 1. Using AddToRange method
1631 2. With SetRangeStr method. Parameter of this method is a string
1632 like as "1,2,3,50-60,63,67,70-"
1635 //=======================================================================
1636 // name : RangeOfIds
1637 // Purpose : Constructor
1638 //=======================================================================
1639 RangeOfIds::RangeOfIds()
1642 myType = SMDSAbs_All;
1645 //=======================================================================
1647 // Purpose : Set mesh
1648 //=======================================================================
1649 void RangeOfIds::SetMesh( const SMDS_Mesh* theMesh )
1654 //=======================================================================
1655 // name : AddToRange
1656 // Purpose : Add ID to the range
1657 //=======================================================================
1658 bool RangeOfIds::AddToRange( long theEntityId )
1660 myIds.Add( theEntityId );
1664 //=======================================================================
1665 // name : GetRangeStr
1666 // Purpose : Get range as a string.
1667 // Example: "1,2,3,50-60,63,67,70-"
1668 //=======================================================================
1669 void RangeOfIds::GetRangeStr( TCollection_AsciiString& theResStr )
1673 TColStd_SequenceOfInteger anIntSeq;
1674 TColStd_SequenceOfAsciiString aStrSeq;
1676 TColStd_MapIteratorOfMapOfInteger anIter( myIds );
1677 for ( ; anIter.More(); anIter.Next() )
1679 int anId = anIter.Key();
1680 TCollection_AsciiString aStr( anId );
1681 anIntSeq.Append( anId );
1682 aStrSeq.Append( aStr );
1685 for ( int i = 1, n = myMin.Length(); i <= n; i++ )
1687 int aMinId = myMin( i );
1688 int aMaxId = myMax( i );
1690 TCollection_AsciiString aStr;
1691 if ( aMinId != IntegerFirst() )
1696 if ( aMaxId != IntegerLast() )
1699 // find position of the string in result sequence and insert string in it
1700 if ( anIntSeq.Length() == 0 )
1702 anIntSeq.Append( aMinId );
1703 aStrSeq.Append( aStr );
1707 if ( aMinId < anIntSeq.First() )
1709 anIntSeq.Prepend( aMinId );
1710 aStrSeq.Prepend( aStr );
1712 else if ( aMinId > anIntSeq.Last() )
1714 anIntSeq.Append( aMinId );
1715 aStrSeq.Append( aStr );
1718 for ( int j = 1, k = anIntSeq.Length(); j <= k; j++ )
1719 if ( aMinId < anIntSeq( j ) )
1721 anIntSeq.InsertBefore( j, aMinId );
1722 aStrSeq.InsertBefore( j, aStr );
1728 if ( aStrSeq.Length() == 0 )
1731 theResStr = aStrSeq( 1 );
1732 for ( int j = 2, k = aStrSeq.Length(); j <= k; j++ )
1735 theResStr += aStrSeq( j );
1739 //=======================================================================
1740 // name : SetRangeStr
1741 // Purpose : Define range with string
1742 // Example of entry string: "1,2,3,50-60,63,67,70-"
1743 //=======================================================================
1744 bool RangeOfIds::SetRangeStr( const TCollection_AsciiString& theStr )
1750 TCollection_AsciiString aStr = theStr;
1751 aStr.RemoveAll( ' ' );
1752 aStr.RemoveAll( '\t' );
1754 for ( int aPos = aStr.Search( ",," ); aPos != -1; aPos = aStr.Search( ",," ) )
1755 aStr.Remove( aPos, 2 );
1757 TCollection_AsciiString tmpStr = aStr.Token( ",", 1 );
1759 while ( tmpStr != "" )
1761 tmpStr = aStr.Token( ",", i++ );
1762 int aPos = tmpStr.Search( '-' );
1766 if ( tmpStr.IsIntegerValue() )
1767 myIds.Add( tmpStr.IntegerValue() );
1773 TCollection_AsciiString aMaxStr = tmpStr.Split( aPos );
1774 TCollection_AsciiString aMinStr = tmpStr;
1776 while ( aMinStr.Search( "-" ) != -1 ) aMinStr.RemoveAll( '-' );
1777 while ( aMaxStr.Search( "-" ) != -1 ) aMaxStr.RemoveAll( '-' );
1779 if ( !aMinStr.IsEmpty() && !aMinStr.IsIntegerValue() ||
1780 !aMaxStr.IsEmpty() && !aMaxStr.IsIntegerValue() )
1783 myMin.Append( aMinStr.IsEmpty() ? IntegerFirst() : aMinStr.IntegerValue() );
1784 myMax.Append( aMaxStr.IsEmpty() ? IntegerLast() : aMaxStr.IntegerValue() );
1791 //=======================================================================
1793 // Purpose : Get type of supported entities
1794 //=======================================================================
1795 SMDSAbs_ElementType RangeOfIds::GetType() const
1800 //=======================================================================
1802 // Purpose : Set type of supported entities
1803 //=======================================================================
1804 void RangeOfIds::SetType( SMDSAbs_ElementType theType )
1809 //=======================================================================
1811 // Purpose : Verify whether entity satisfies to this rpedicate
1812 //=======================================================================
1813 bool RangeOfIds::IsSatisfy( long theId )
1818 if ( myType == SMDSAbs_Node )
1820 if ( myMesh->FindNode( theId ) == 0 )
1825 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
1826 if ( anElem == 0 || myType != anElem->GetType() && myType != SMDSAbs_All )
1830 if ( myIds.Contains( theId ) )
1833 for ( int i = 1, n = myMin.Length(); i <= n; i++ )
1834 if ( theId >= myMin( i ) && theId <= myMax( i ) )
1842 Description : Base class for comparators
1844 Comparator::Comparator():
1848 Comparator::~Comparator()
1851 void Comparator::SetMesh( const SMDS_Mesh* theMesh )
1854 myFunctor->SetMesh( theMesh );
1857 void Comparator::SetMargin( double theValue )
1859 myMargin = theValue;
1862 void Comparator::SetNumFunctor( NumericalFunctorPtr theFunct )
1864 myFunctor = theFunct;
1867 SMDSAbs_ElementType Comparator::GetType() const
1869 return myFunctor ? myFunctor->GetType() : SMDSAbs_All;
1872 double Comparator::GetMargin()
1880 Description : Comparator "<"
1882 bool LessThan::IsSatisfy( long theId )
1884 return myFunctor && myFunctor->GetValue( theId ) < myMargin;
1890 Description : Comparator ">"
1892 bool MoreThan::IsSatisfy( long theId )
1894 return myFunctor && myFunctor->GetValue( theId ) > myMargin;
1900 Description : Comparator "="
1903 myToler(Precision::Confusion())
1906 bool EqualTo::IsSatisfy( long theId )
1908 return myFunctor && fabs( myFunctor->GetValue( theId ) - myMargin ) < myToler;
1911 void EqualTo::SetTolerance( double theToler )
1916 double EqualTo::GetTolerance()
1923 Description : Logical NOT predicate
1925 LogicalNOT::LogicalNOT()
1928 LogicalNOT::~LogicalNOT()
1931 bool LogicalNOT::IsSatisfy( long theId )
1933 return myPredicate && !myPredicate->IsSatisfy( theId );
1936 void LogicalNOT::SetMesh( const SMDS_Mesh* theMesh )
1939 myPredicate->SetMesh( theMesh );
1942 void LogicalNOT::SetPredicate( PredicatePtr thePred )
1944 myPredicate = thePred;
1947 SMDSAbs_ElementType LogicalNOT::GetType() const
1949 return myPredicate ? myPredicate->GetType() : SMDSAbs_All;
1954 Class : LogicalBinary
1955 Description : Base class for binary logical predicate
1957 LogicalBinary::LogicalBinary()
1960 LogicalBinary::~LogicalBinary()
1963 void LogicalBinary::SetMesh( const SMDS_Mesh* theMesh )
1966 myPredicate1->SetMesh( theMesh );
1969 myPredicate2->SetMesh( theMesh );
1972 void LogicalBinary::SetPredicate1( PredicatePtr thePredicate )
1974 myPredicate1 = thePredicate;
1977 void LogicalBinary::SetPredicate2( PredicatePtr thePredicate )
1979 myPredicate2 = thePredicate;
1982 SMDSAbs_ElementType LogicalBinary::GetType() const
1984 if ( !myPredicate1 || !myPredicate2 )
1987 SMDSAbs_ElementType aType1 = myPredicate1->GetType();
1988 SMDSAbs_ElementType aType2 = myPredicate2->GetType();
1990 return aType1 == aType2 ? aType1 : SMDSAbs_All;
1996 Description : Logical AND
1998 bool LogicalAND::IsSatisfy( long theId )
2003 myPredicate1->IsSatisfy( theId ) &&
2004 myPredicate2->IsSatisfy( theId );
2010 Description : Logical OR
2012 bool LogicalOR::IsSatisfy( long theId )
2017 myPredicate1->IsSatisfy( theId ) ||
2018 myPredicate2->IsSatisfy( theId );
2032 void Filter::SetPredicate( PredicatePtr thePredicate )
2034 myPredicate = thePredicate;
2037 template<class TElement, class TIterator, class TPredicate>
2038 inline void FillSequence(const TIterator& theIterator,
2039 TPredicate& thePredicate,
2040 Filter::TIdSequence& theSequence)
2042 if ( theIterator ) {
2043 while( theIterator->more() ) {
2044 TElement anElem = theIterator->next();
2045 long anId = anElem->GetID();
2046 if ( thePredicate->IsSatisfy( anId ) )
2047 theSequence.push_back( anId );
2054 GetElementsId( const SMDS_Mesh* theMesh,
2055 PredicatePtr thePredicate,
2056 TIdSequence& theSequence )
2058 theSequence.clear();
2060 if ( !theMesh || !thePredicate )
2063 thePredicate->SetMesh( theMesh );
2065 SMDSAbs_ElementType aType = thePredicate->GetType();
2068 FillSequence<const SMDS_MeshNode*>(theMesh->nodesIterator(),thePredicate,theSequence);
2071 FillSequence<const SMDS_MeshElement*>(theMesh->edgesIterator(),thePredicate,theSequence);
2074 FillSequence<const SMDS_MeshElement*>(theMesh->facesIterator(),thePredicate,theSequence);
2076 case SMDSAbs_Volume:
2077 FillSequence<const SMDS_MeshElement*>(theMesh->volumesIterator(),thePredicate,theSequence);
2080 FillSequence<const SMDS_MeshElement*>(theMesh->edgesIterator(),thePredicate,theSequence);
2081 FillSequence<const SMDS_MeshElement*>(theMesh->facesIterator(),thePredicate,theSequence);
2082 FillSequence<const SMDS_MeshElement*>(theMesh->volumesIterator(),thePredicate,theSequence);
2088 Filter::GetElementsId( const SMDS_Mesh* theMesh,
2089 Filter::TIdSequence& theSequence )
2091 GetElementsId(theMesh,myPredicate,theSequence);
2098 typedef std::set<SMDS_MeshFace*> TMapOfFacePtr;
2104 ManifoldPart::Link::Link( SMDS_MeshNode* theNode1,
2105 SMDS_MeshNode* theNode2 )
2111 ManifoldPart::Link::~Link()
2117 bool ManifoldPart::Link::IsEqual( const ManifoldPart::Link& theLink ) const
2119 if ( myNode1 == theLink.myNode1 &&
2120 myNode2 == theLink.myNode2 )
2122 else if ( myNode1 == theLink.myNode2 &&
2123 myNode2 == theLink.myNode1 )
2129 bool ManifoldPart::Link::operator<( const ManifoldPart::Link& x ) const
2131 if(myNode1 < x.myNode1) return true;
2132 if(myNode1 == x.myNode1)
2133 if(myNode2 < x.myNode2) return true;
2137 bool ManifoldPart::IsEqual( const ManifoldPart::Link& theLink1,
2138 const ManifoldPart::Link& theLink2 )
2140 return theLink1.IsEqual( theLink2 );
2143 ManifoldPart::ManifoldPart()
2146 myAngToler = Precision::Angular();
2147 myIsOnlyManifold = true;
2150 ManifoldPart::~ManifoldPart()
2155 void ManifoldPart::SetMesh( const SMDS_Mesh* theMesh )
2161 SMDSAbs_ElementType ManifoldPart::GetType() const
2162 { return SMDSAbs_Face; }
2164 bool ManifoldPart::IsSatisfy( long theElementId )
2166 return myMapIds.Contains( theElementId );
2169 void ManifoldPart::SetAngleTolerance( const double theAngToler )
2170 { myAngToler = theAngToler; }
2172 double ManifoldPart::GetAngleTolerance() const
2173 { return myAngToler; }
2175 void ManifoldPart::SetIsOnlyManifold( const bool theIsOnly )
2176 { myIsOnlyManifold = theIsOnly; }
2178 void ManifoldPart::SetStartElem( const long theStartId )
2179 { myStartElemId = theStartId; }
2181 bool ManifoldPart::process()
2184 myMapBadGeomIds.Clear();
2186 myAllFacePtr.clear();
2187 myAllFacePtrIntDMap.clear();
2191 // collect all faces into own map
2192 SMDS_FaceIteratorPtr anFaceItr = myMesh->facesIterator();
2193 for (; anFaceItr->more(); )
2195 SMDS_MeshFace* aFacePtr = (SMDS_MeshFace*)anFaceItr->next();
2196 myAllFacePtr.push_back( aFacePtr );
2197 myAllFacePtrIntDMap[aFacePtr] = myAllFacePtr.size()-1;
2200 SMDS_MeshFace* aStartFace = (SMDS_MeshFace*)myMesh->FindElement( myStartElemId );
2204 // the map of non manifold links and bad geometry
2205 TMapOfLink aMapOfNonManifold;
2206 TColStd_MapOfInteger aMapOfTreated;
2208 // begin cycle on faces from start index and run on vector till the end
2209 // and from begin to start index to cover whole vector
2210 const int aStartIndx = myAllFacePtrIntDMap[aStartFace];
2211 bool isStartTreat = false;
2212 for ( int fi = aStartIndx; !isStartTreat || fi != aStartIndx ; fi++ )
2214 if ( fi == aStartIndx )
2215 isStartTreat = true;
2216 // as result next time when fi will be equal to aStartIndx
2218 SMDS_MeshFace* aFacePtr = myAllFacePtr[ fi ];
2219 if ( aMapOfTreated.Contains( aFacePtr->GetID() ) )
2222 aMapOfTreated.Add( aFacePtr->GetID() );
2223 TColStd_MapOfInteger aResFaces;
2224 if ( !findConnected( myAllFacePtrIntDMap, aFacePtr,
2225 aMapOfNonManifold, aResFaces ) )
2227 TColStd_MapIteratorOfMapOfInteger anItr( aResFaces );
2228 for ( ; anItr.More(); anItr.Next() )
2230 int aFaceId = anItr.Key();
2231 aMapOfTreated.Add( aFaceId );
2232 myMapIds.Add( aFaceId );
2235 if ( fi == ( myAllFacePtr.size() - 1 ) )
2237 } // end run on vector of faces
2238 return !myMapIds.IsEmpty();
2241 static void getLinks( const SMDS_MeshFace* theFace,
2242 ManifoldPart::TVectorOfLink& theLinks )
2244 int aNbNode = theFace->NbNodes();
2245 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
2247 SMDS_MeshNode* aNode = 0;
2248 for ( ; aNodeItr->more() && i <= aNbNode; )
2251 SMDS_MeshNode* aN1 = (SMDS_MeshNode*)aNodeItr->next();
2255 SMDS_MeshNode* aN2 = ( i >= aNbNode ) ? aNode : (SMDS_MeshNode*)aNodeItr->next();
2257 ManifoldPart::Link aLink( aN1, aN2 );
2258 theLinks.push_back( aLink );
2262 static gp_XYZ getNormale( const SMDS_MeshFace* theFace )
2265 int aNbNode = theFace->NbNodes();
2266 TColgp_Array1OfXYZ anArrOfXYZ(1,4);
2267 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
2269 for ( ; aNodeItr->more() && i <= 4; i++ ) {
2270 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
2271 anArrOfXYZ.SetValue(i, gp_XYZ( aNode->X(), aNode->Y(), aNode->Z() ) );
2274 gp_XYZ q1 = anArrOfXYZ.Value(2) - anArrOfXYZ.Value(1);
2275 gp_XYZ q2 = anArrOfXYZ.Value(3) - anArrOfXYZ.Value(1);
2277 if ( aNbNode > 3 ) {
2278 gp_XYZ q3 = anArrOfXYZ.Value(4) - anArrOfXYZ.Value(1);
2281 double len = n.Modulus();
2288 bool ManifoldPart::findConnected
2289 ( const ManifoldPart::TDataMapFacePtrInt& theAllFacePtrInt,
2290 SMDS_MeshFace* theStartFace,
2291 ManifoldPart::TMapOfLink& theNonManifold,
2292 TColStd_MapOfInteger& theResFaces )
2294 theResFaces.Clear();
2295 if ( !theAllFacePtrInt.size() )
2298 if ( getNormale( theStartFace ).SquareModulus() <= gp::Resolution() )
2300 myMapBadGeomIds.Add( theStartFace->GetID() );
2304 ManifoldPart::TMapOfLink aMapOfBoundary, aMapToSkip;
2305 ManifoldPart::TVectorOfLink aSeqOfBoundary;
2306 theResFaces.Add( theStartFace->GetID() );
2307 ManifoldPart::TDataMapOfLinkFacePtr aDMapLinkFace;
2309 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
2310 aDMapLinkFace, theNonManifold, theStartFace );
2312 bool isDone = false;
2313 while ( !isDone && aMapOfBoundary.size() != 0 )
2315 bool isToReset = false;
2316 ManifoldPart::TVectorOfLink::iterator pLink = aSeqOfBoundary.begin();
2317 for ( ; !isToReset && pLink != aSeqOfBoundary.end(); ++pLink )
2319 ManifoldPart::Link aLink = *pLink;
2320 if ( aMapToSkip.find( aLink ) != aMapToSkip.end() )
2322 // each link could be treated only once
2323 aMapToSkip.insert( aLink );
2325 ManifoldPart::TVectorOfFacePtr aFaces;
2327 if ( myIsOnlyManifold &&
2328 (theNonManifold.find( aLink ) != theNonManifold.end()) )
2332 getFacesByLink( aLink, aFaces );
2333 // filter the element to keep only indicated elements
2334 ManifoldPart::TVectorOfFacePtr aFiltered;
2335 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
2336 for ( ; pFace != aFaces.end(); ++pFace )
2338 SMDS_MeshFace* aFace = *pFace;
2339 if ( myAllFacePtrIntDMap.find( aFace ) != myAllFacePtrIntDMap.end() )
2340 aFiltered.push_back( aFace );
2343 if ( aFaces.size() < 2 ) // no neihgbour faces
2345 else if ( myIsOnlyManifold && aFaces.size() > 2 ) // non manifold case
2347 theNonManifold.insert( aLink );
2352 // compare normal with normals of neighbor element
2353 SMDS_MeshFace* aPrevFace = aDMapLinkFace[ aLink ];
2354 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
2355 for ( ; pFace != aFaces.end(); ++pFace )
2357 SMDS_MeshFace* aNextFace = *pFace;
2358 if ( aPrevFace == aNextFace )
2360 int anNextFaceID = aNextFace->GetID();
2361 if ( myIsOnlyManifold && theResFaces.Contains( anNextFaceID ) )
2362 // should not be with non manifold restriction. probably bad topology
2364 // check if face was treated and skipped
2365 if ( myMapBadGeomIds.Contains( anNextFaceID ) ||
2366 !isInPlane( aPrevFace, aNextFace ) )
2368 // add new element to connected and extend the boundaries.
2369 theResFaces.Add( anNextFaceID );
2370 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
2371 aDMapLinkFace, theNonManifold, aNextFace );
2375 isDone = !isToReset;
2378 return !theResFaces.IsEmpty();
2381 bool ManifoldPart::isInPlane( const SMDS_MeshFace* theFace1,
2382 const SMDS_MeshFace* theFace2 )
2384 gp_Dir aNorm1 = gp_Dir( getNormale( theFace1 ) );
2385 gp_XYZ aNorm2XYZ = getNormale( theFace2 );
2386 if ( aNorm2XYZ.SquareModulus() <= gp::Resolution() )
2388 myMapBadGeomIds.Add( theFace2->GetID() );
2391 if ( aNorm1.IsParallel( gp_Dir( aNorm2XYZ ), myAngToler ) )
2397 void ManifoldPart::expandBoundary
2398 ( ManifoldPart::TMapOfLink& theMapOfBoundary,
2399 ManifoldPart::TVectorOfLink& theSeqOfBoundary,
2400 ManifoldPart::TDataMapOfLinkFacePtr& theDMapLinkFacePtr,
2401 ManifoldPart::TMapOfLink& theNonManifold,
2402 SMDS_MeshFace* theNextFace ) const
2404 ManifoldPart::TVectorOfLink aLinks;
2405 getLinks( theNextFace, aLinks );
2406 int aNbLink = (int)aLinks.size();
2407 for ( int i = 0; i < aNbLink; i++ )
2409 ManifoldPart::Link aLink = aLinks[ i ];
2410 if ( myIsOnlyManifold && (theNonManifold.find( aLink ) != theNonManifold.end()) )
2412 if ( theMapOfBoundary.find( aLink ) != theMapOfBoundary.end() )
2414 if ( myIsOnlyManifold )
2416 // remove from boundary
2417 theMapOfBoundary.erase( aLink );
2418 ManifoldPart::TVectorOfLink::iterator pLink = theSeqOfBoundary.begin();
2419 for ( ; pLink != theSeqOfBoundary.end(); ++pLink )
2421 ManifoldPart::Link aBoundLink = *pLink;
2422 if ( aBoundLink.IsEqual( aLink ) )
2424 theSeqOfBoundary.erase( pLink );
2432 theMapOfBoundary.insert( aLink );
2433 theSeqOfBoundary.push_back( aLink );
2434 theDMapLinkFacePtr[ aLink ] = theNextFace;
2439 void ManifoldPart::getFacesByLink( const ManifoldPart::Link& theLink,
2440 ManifoldPart::TVectorOfFacePtr& theFaces ) const
2442 SMDS_Mesh::SetOfFaces aSetOfFaces;
2443 // take all faces that shared first node
2444 SMDS_ElemIteratorPtr anItr = theLink.myNode1->facesIterator();
2445 for ( ; anItr->more(); )
2447 SMDS_MeshFace* aFace = (SMDS_MeshFace*)anItr->next();
2450 aSetOfFaces.Add( aFace );
2452 // take all faces that shared second node
2453 anItr = theLink.myNode2->facesIterator();
2454 // find the common part of two sets
2455 for ( ; anItr->more(); )
2457 SMDS_MeshFace* aFace = (SMDS_MeshFace*)anItr->next();
2458 if ( aSetOfFaces.Contains( aFace ) )
2459 theFaces.push_back( aFace );
2468 ElementsOnSurface::ElementsOnSurface()
2472 myType = SMDSAbs_All;
2474 myToler = Precision::Confusion();
2477 ElementsOnSurface::~ElementsOnSurface()
2482 void ElementsOnSurface::SetMesh( const SMDS_Mesh* theMesh )
2484 if ( myMesh == theMesh )
2491 bool ElementsOnSurface::IsSatisfy( long theElementId )
2493 return myIds.Contains( theElementId );
2496 SMDSAbs_ElementType ElementsOnSurface::GetType() const
2499 void ElementsOnSurface::SetTolerance( const double theToler )
2500 { myToler = theToler; }
2502 double ElementsOnSurface::GetTolerance() const
2507 void ElementsOnSurface::SetSurface( const TopoDS_Shape& theShape,
2508 const SMDSAbs_ElementType theType )
2512 if ( theShape.IsNull() || theShape.ShapeType() != TopAbs_FACE )
2517 TopoDS_Face aFace = TopoDS::Face( theShape );
2518 mySurf = BRep_Tool::Surface( aFace );
2521 void ElementsOnSurface::process()
2524 if ( mySurf.IsNull() )
2530 if ( myType == SMDSAbs_Face || myType == SMDSAbs_All )
2532 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
2533 for(; anIter->more(); )
2534 process( anIter->next() );
2537 if ( myType == SMDSAbs_Edge || myType == SMDSAbs_All )
2539 SMDS_EdgeIteratorPtr anIter = myMesh->edgesIterator();
2540 for(; anIter->more(); )
2541 process( anIter->next() );
2544 if ( myType == SMDSAbs_Node )
2546 SMDS_NodeIteratorPtr anIter = myMesh->nodesIterator();
2547 for(; anIter->more(); )
2548 process( anIter->next() );
2552 void ElementsOnSurface::process( const SMDS_MeshElement* theElemPtr )
2554 SMDS_ElemIteratorPtr aNodeItr = theElemPtr->nodesIterator();
2555 bool isSatisfy = true;
2556 for ( ; aNodeItr->more(); )
2558 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
2559 if ( !isOnSurface( aNode ) )
2566 myIds.Add( theElemPtr->GetID() );
2569 bool ElementsOnSurface::isOnSurface( const SMDS_MeshNode* theNode ) const
2571 if ( mySurf.IsNull() )
2574 gp_Pnt aPnt( theNode->X(), theNode->Y(), theNode->Z() );
2575 double aToler2 = myToler * myToler;
2576 if ( mySurf->IsKind(STANDARD_TYPE(Geom_Plane)))
2578 gp_Pln aPln = Handle(Geom_Plane)::DownCast(mySurf)->Pln();
2579 if ( aPln.SquareDistance( aPnt ) > aToler2 )
2582 else if ( mySurf->IsKind(STANDARD_TYPE(Geom_CylindricalSurface)))
2584 gp_Cylinder aCyl = Handle(Geom_CylindricalSurface)::DownCast(mySurf)->Cylinder();
2585 double aRad = aCyl.Radius();
2586 gp_Ax3 anAxis = aCyl.Position();
2587 gp_XYZ aLoc = aCyl.Location().XYZ();
2588 double aXDist = anAxis.XDirection().XYZ() * ( aPnt.XYZ() - aLoc );
2589 double aYDist = anAxis.YDirection().XYZ() * ( aPnt.XYZ() - aLoc );
2590 if ( fabs(aXDist*aXDist + aYDist*aYDist - aRad*aRad) > aToler2 )