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.salome-platform.org/ or email : webmaster.salome@opencascade.com
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 ) );
880 if ( A < Precision::Angular() )
883 return A * 180. / PI;
887 double Skew::GetBadRate( double Value, int /*nbNodes*/ ) const
889 // the skew is in the range [0.0,PI/2].
895 SMDSAbs_ElementType Skew::GetType() const
903 Description : Functor for calculating area
905 double Area::GetValue( const TSequenceOfXYZ& P )
907 gp_Vec aVec1( P(2) - P(1) );
908 gp_Vec aVec2( P(3) - P(1) );
909 gp_Vec SumVec = aVec1 ^ aVec2;
910 for (int i=4; i<=P.size(); i++) {
911 gp_Vec aVec1( P(i-1) - P(1) );
912 gp_Vec aVec2( P(i) - P(1) );
913 gp_Vec tmp = aVec1 ^ aVec2;
916 return SumVec.Magnitude() * 0.5;
919 double Area::GetBadRate( double Value, int /*nbNodes*/ ) const
921 // meaningless as it is not a quality control functor
925 SMDSAbs_ElementType Area::GetType() const
933 Description : Functor for calculating length off edge
935 double Length::GetValue( const TSequenceOfXYZ& P )
937 switch ( P.size() ) {
938 case 2: return getDistance( P( 1 ), P( 2 ) );
939 case 3: return getDistance( P( 1 ), P( 2 ) ) + getDistance( P( 2 ), P( 3 ) );
944 double Length::GetBadRate( double Value, int /*nbNodes*/ ) const
946 // meaningless as it is not quality control functor
950 SMDSAbs_ElementType Length::GetType() const
957 Description : Functor for calculating length of edge
960 double Length2D::GetValue( long theElementId)
964 //cout<<"Length2D::GetValue"<<endl;
965 if (GetPoints(theElementId,P)){
966 //for(int jj=1; jj<=P.size(); jj++)
967 // cout<<"jj="<<jj<<" P("<<P(jj).X()<<","<<P(jj).Y()<<","<<P(jj).Z()<<")"<<endl;
969 double aVal;// = GetValue( P );
970 const SMDS_MeshElement* aElem = myMesh->FindElement( theElementId );
971 SMDSAbs_ElementType aType = aElem->GetType();
980 aVal = getDistance( P( 1 ), P( 2 ) );
983 else if (len == 3){ // quadratic edge
984 aVal = getDistance(P( 1 ),P( 3 )) + getDistance(P( 3 ),P( 2 ));
988 if (len == 3){ // triangles
989 double L1 = getDistance(P( 1 ),P( 2 ));
990 double L2 = getDistance(P( 2 ),P( 3 ));
991 double L3 = getDistance(P( 3 ),P( 1 ));
992 aVal = Max(L1,Max(L2,L3));
995 else if (len == 4){ // quadrangles
996 double L1 = getDistance(P( 1 ),P( 2 ));
997 double L2 = getDistance(P( 2 ),P( 3 ));
998 double L3 = getDistance(P( 3 ),P( 4 ));
999 double L4 = getDistance(P( 4 ),P( 1 ));
1000 aVal = Max(Max(L1,L2),Max(L3,L4));
1003 if (len == 6){ // quadratic triangles
1004 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
1005 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1006 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 1 ));
1007 aVal = Max(L1,Max(L2,L3));
1008 //cout<<"L1="<<L1<<" L2="<<L2<<"L3="<<L3<<" aVal="<<aVal<<endl;
1011 else if (len == 8){ // quadratic quadrangles
1012 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
1013 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1014 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 7 ));
1015 double L4 = getDistance(P( 7 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
1016 aVal = Max(Max(L1,L2),Max(L3,L4));
1019 case SMDSAbs_Volume:
1020 if (len == 4){ // tetraidrs
1021 double L1 = getDistance(P( 1 ),P( 2 ));
1022 double L2 = getDistance(P( 2 ),P( 3 ));
1023 double L3 = getDistance(P( 3 ),P( 1 ));
1024 double L4 = getDistance(P( 1 ),P( 4 ));
1025 double L5 = getDistance(P( 2 ),P( 4 ));
1026 double L6 = getDistance(P( 3 ),P( 4 ));
1027 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1030 else if (len == 5){ // piramids
1031 double L1 = getDistance(P( 1 ),P( 2 ));
1032 double L2 = getDistance(P( 2 ),P( 3 ));
1033 double L3 = getDistance(P( 3 ),P( 1 ));
1034 double L4 = getDistance(P( 4 ),P( 1 ));
1035 double L5 = getDistance(P( 1 ),P( 5 ));
1036 double L6 = getDistance(P( 2 ),P( 5 ));
1037 double L7 = getDistance(P( 3 ),P( 5 ));
1038 double L8 = getDistance(P( 4 ),P( 5 ));
1040 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1041 aVal = Max(aVal,Max(L7,L8));
1044 else if (len == 6){ // pentaidres
1045 double L1 = getDistance(P( 1 ),P( 2 ));
1046 double L2 = getDistance(P( 2 ),P( 3 ));
1047 double L3 = getDistance(P( 3 ),P( 1 ));
1048 double L4 = getDistance(P( 4 ),P( 5 ));
1049 double L5 = getDistance(P( 5 ),P( 6 ));
1050 double L6 = getDistance(P( 6 ),P( 4 ));
1051 double L7 = getDistance(P( 1 ),P( 4 ));
1052 double L8 = getDistance(P( 2 ),P( 5 ));
1053 double L9 = getDistance(P( 3 ),P( 6 ));
1055 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1056 aVal = Max(aVal,Max(Max(L7,L8),L9));
1059 else if (len == 8){ // hexaider
1060 double L1 = getDistance(P( 1 ),P( 2 ));
1061 double L2 = getDistance(P( 2 ),P( 3 ));
1062 double L3 = getDistance(P( 3 ),P( 4 ));
1063 double L4 = getDistance(P( 4 ),P( 1 ));
1064 double L5 = getDistance(P( 5 ),P( 6 ));
1065 double L6 = getDistance(P( 6 ),P( 7 ));
1066 double L7 = getDistance(P( 7 ),P( 8 ));
1067 double L8 = getDistance(P( 8 ),P( 5 ));
1068 double L9 = getDistance(P( 1 ),P( 5 ));
1069 double L10= getDistance(P( 2 ),P( 6 ));
1070 double L11= getDistance(P( 3 ),P( 7 ));
1071 double L12= getDistance(P( 4 ),P( 8 ));
1073 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1074 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
1075 aVal = Max(aVal,Max(L11,L12));
1080 if (len == 10){ // quadratic tetraidrs
1081 double L1 = getDistance(P( 1 ),P( 5 )) + getDistance(P( 5 ),P( 2 ));
1082 double L2 = getDistance(P( 2 ),P( 6 )) + getDistance(P( 6 ),P( 3 ));
1083 double L3 = getDistance(P( 3 ),P( 7 )) + getDistance(P( 7 ),P( 1 ));
1084 double L4 = getDistance(P( 1 ),P( 8 )) + getDistance(P( 8 ),P( 4 ));
1085 double L5 = getDistance(P( 2 ),P( 9 )) + getDistance(P( 9 ),P( 4 ));
1086 double L6 = getDistance(P( 3 ),P( 10 )) + getDistance(P( 10 ),P( 4 ));
1087 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1090 else if (len == 13){ // quadratic piramids
1091 double L1 = getDistance(P( 1 ),P( 6 )) + getDistance(P( 6 ),P( 2 ));
1092 double L2 = getDistance(P( 2 ),P( 7 )) + getDistance(P( 7 ),P( 3 ));
1093 double L3 = getDistance(P( 3 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
1094 double L4 = getDistance(P( 4 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1095 double L5 = getDistance(P( 1 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1096 double L6 = getDistance(P( 2 ),P( 11 )) + getDistance(P( 11 ),P( 5 ));
1097 double L7 = getDistance(P( 3 ),P( 12 )) + getDistance(P( 12 ),P( 5 ));
1098 double L8 = getDistance(P( 4 ),P( 13 )) + getDistance(P( 13 ),P( 5 ));
1099 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1100 aVal = Max(aVal,Max(L7,L8));
1103 else if (len == 15){ // quadratic pentaidres
1104 double L1 = getDistance(P( 1 ),P( 7 )) + getDistance(P( 7 ),P( 2 ));
1105 double L2 = getDistance(P( 2 ),P( 8 )) + getDistance(P( 8 ),P( 3 ));
1106 double L3 = getDistance(P( 3 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1107 double L4 = getDistance(P( 4 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1108 double L5 = getDistance(P( 5 ),P( 11 )) + getDistance(P( 11 ),P( 6 ));
1109 double L6 = getDistance(P( 6 ),P( 12 )) + getDistance(P( 12 ),P( 4 ));
1110 double L7 = getDistance(P( 1 ),P( 13 )) + getDistance(P( 13 ),P( 4 ));
1111 double L8 = getDistance(P( 2 ),P( 14 )) + getDistance(P( 14 ),P( 5 ));
1112 double L9 = getDistance(P( 3 ),P( 15 )) + getDistance(P( 15 ),P( 6 ));
1113 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1114 aVal = Max(aVal,Max(Max(L7,L8),L9));
1117 else if (len == 20){ // quadratic hexaider
1118 double L1 = getDistance(P( 1 ),P( 9 )) + getDistance(P( 9 ),P( 2 ));
1119 double L2 = getDistance(P( 2 ),P( 10 )) + getDistance(P( 10 ),P( 3 ));
1120 double L3 = getDistance(P( 3 ),P( 11 )) + getDistance(P( 11 ),P( 4 ));
1121 double L4 = getDistance(P( 4 ),P( 12 )) + getDistance(P( 12 ),P( 1 ));
1122 double L5 = getDistance(P( 5 ),P( 13 )) + getDistance(P( 13 ),P( 6 ));
1123 double L6 = getDistance(P( 6 ),P( 14 )) + getDistance(P( 14 ),P( 7 ));
1124 double L7 = getDistance(P( 7 ),P( 15 )) + getDistance(P( 15 ),P( 8 ));
1125 double L8 = getDistance(P( 8 ),P( 16 )) + getDistance(P( 16 ),P( 5 ));
1126 double L9 = getDistance(P( 1 ),P( 17 )) + getDistance(P( 17 ),P( 5 ));
1127 double L10= getDistance(P( 2 ),P( 18 )) + getDistance(P( 18 ),P( 6 ));
1128 double L11= getDistance(P( 3 ),P( 19 )) + getDistance(P( 19 ),P( 7 ));
1129 double L12= getDistance(P( 4 ),P( 20 )) + getDistance(P( 20 ),P( 8 ));
1130 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
1131 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
1132 aVal = Max(aVal,Max(L11,L12));
1144 if ( myPrecision >= 0 )
1146 double prec = pow( 10., (double)( myPrecision ) );
1147 aVal = floor( aVal * prec + 0.5 ) / prec;
1156 double Length2D::GetBadRate( double Value, int /*nbNodes*/ ) const
1158 // meaningless as it is not quality control functor
1162 SMDSAbs_ElementType Length2D::GetType() const
1164 return SMDSAbs_Face;
1167 Length2D::Value::Value(double theLength,long thePntId1, long thePntId2):
1170 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1171 if(thePntId1 > thePntId2){
1172 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1176 bool Length2D::Value::operator<(const Length2D::Value& x) const{
1177 if(myPntId[0] < x.myPntId[0]) return true;
1178 if(myPntId[0] == x.myPntId[0])
1179 if(myPntId[1] < x.myPntId[1]) return true;
1183 void Length2D::GetValues(TValues& theValues){
1185 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1186 for(; anIter->more(); ){
1187 const SMDS_MeshFace* anElem = anIter->next();
1189 if(anElem->IsQuadratic()) {
1190 const SMDS_QuadraticFaceOfNodes* F =
1191 static_cast<const SMDS_QuadraticFaceOfNodes*>(anElem);
1192 // use special nodes iterator
1193 SMDS_NodeIteratorPtr anIter = F->interlacedNodesIterator();
1198 const SMDS_MeshElement* aNode;
1200 aNode = anIter->next();
1201 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1202 P[0] = P[1] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1203 aNodeId[0] = aNodeId[1] = aNode->GetID();
1206 for(; anIter->more(); ){
1207 const SMDS_MeshNode* N1 = static_cast<const SMDS_MeshNode*> (anIter->next());
1208 P[2] = gp_Pnt(N1->X(),N1->Y(),N1->Z());
1209 aNodeId[2] = N1->GetID();
1210 aLength = P[1].Distance(P[2]);
1211 if(!anIter->more()) break;
1212 const SMDS_MeshNode* N2 = static_cast<const SMDS_MeshNode*> (anIter->next());
1213 P[3] = gp_Pnt(N2->X(),N2->Y(),N2->Z());
1214 aNodeId[3] = N2->GetID();
1215 aLength += P[2].Distance(P[3]);
1216 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
1217 Value aValue2(aLength,aNodeId[2],aNodeId[3]);
1219 aNodeId[1] = aNodeId[3];
1220 theValues.insert(aValue1);
1221 theValues.insert(aValue2);
1223 aLength += P[2].Distance(P[0]);
1224 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
1225 Value aValue2(aLength,aNodeId[2],aNodeId[0]);
1226 theValues.insert(aValue1);
1227 theValues.insert(aValue2);
1230 SMDS_ElemIteratorPtr aNodesIter = anElem->nodesIterator();
1235 const SMDS_MeshElement* aNode;
1236 if(aNodesIter->more()){
1237 aNode = aNodesIter->next();
1238 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1239 P[0] = P[1] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1240 aNodeId[0] = aNodeId[1] = aNode->GetID();
1243 for(; aNodesIter->more(); ){
1244 aNode = aNodesIter->next();
1245 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode;
1246 long anId = aNode->GetID();
1248 P[2] = gp_Pnt(aNodes->X(),aNodes->Y(),aNodes->Z());
1250 aLength = P[1].Distance(P[2]);
1252 Value aValue(aLength,aNodeId[1],anId);
1255 theValues.insert(aValue);
1258 aLength = P[0].Distance(P[1]);
1260 Value aValue(aLength,aNodeId[0],aNodeId[1]);
1261 theValues.insert(aValue);
1267 Class : MultiConnection
1268 Description : Functor for calculating number of faces conneted to the edge
1270 double MultiConnection::GetValue( const TSequenceOfXYZ& P )
1274 double MultiConnection::GetValue( long theId )
1276 return getNbMultiConnection( myMesh, theId );
1279 double MultiConnection::GetBadRate( double Value, int /*nbNodes*/ ) const
1281 // meaningless as it is not quality control functor
1285 SMDSAbs_ElementType MultiConnection::GetType() const
1287 return SMDSAbs_Edge;
1291 Class : MultiConnection2D
1292 Description : Functor for calculating number of faces conneted to the edge
1294 double MultiConnection2D::GetValue( const TSequenceOfXYZ& P )
1299 double MultiConnection2D::GetValue( long theElementId )
1303 const SMDS_MeshElement* aFaceElem = myMesh->FindElement(theElementId);
1304 SMDSAbs_ElementType aType = aFaceElem->GetType();
1309 int i = 0, len = aFaceElem->NbNodes();
1310 SMDS_ElemIteratorPtr anIter = aFaceElem->nodesIterator();
1313 const SMDS_MeshNode *aNode, *aNode0;
1314 TColStd_MapOfInteger aMap, aMapPrev;
1316 for (i = 0; i <= len; i++) {
1321 if (anIter->more()) {
1322 aNode = (SMDS_MeshNode*)anIter->next();
1330 if (i == 0) aNode0 = aNode;
1332 SMDS_ElemIteratorPtr anElemIter = aNode->GetInverseElementIterator();
1333 while (anElemIter->more()) {
1334 const SMDS_MeshElement* anElem = anElemIter->next();
1335 if (anElem != 0 && anElem->GetType() == SMDSAbs_Face) {
1336 int anId = anElem->GetID();
1339 if (aMapPrev.Contains(anId)) {
1344 aResult = Max(aResult, aNb);
1355 double MultiConnection2D::GetBadRate( double Value, int /*nbNodes*/ ) const
1357 // meaningless as it is not quality control functor
1361 SMDSAbs_ElementType MultiConnection2D::GetType() const
1363 return SMDSAbs_Face;
1366 MultiConnection2D::Value::Value(long thePntId1, long thePntId2)
1368 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1369 if(thePntId1 > thePntId2){
1370 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1374 bool MultiConnection2D::Value::operator<(const MultiConnection2D::Value& x) const{
1375 if(myPntId[0] < x.myPntId[0]) return true;
1376 if(myPntId[0] == x.myPntId[0])
1377 if(myPntId[1] < x.myPntId[1]) return true;
1381 void MultiConnection2D::GetValues(MValues& theValues){
1382 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1383 for(; anIter->more(); ){
1384 const SMDS_MeshFace* anElem = anIter->next();
1385 SMDS_ElemIteratorPtr aNodesIter;
1386 if ( anElem->IsQuadratic() )
1387 aNodesIter = static_cast<const SMDS_QuadraticFaceOfNodes*>
1388 (anElem)->interlacedNodesElemIterator();
1390 aNodesIter = anElem->nodesIterator();
1393 //int aNbConnects=0;
1394 const SMDS_MeshNode* aNode0;
1395 const SMDS_MeshNode* aNode1;
1396 const SMDS_MeshNode* aNode2;
1397 if(aNodesIter->more()){
1398 aNode0 = (SMDS_MeshNode*) aNodesIter->next();
1400 const SMDS_MeshNode* aNodes = (SMDS_MeshNode*) aNode1;
1401 aNodeId[0] = aNodeId[1] = aNodes->GetID();
1403 for(; aNodesIter->more(); ) {
1404 aNode2 = (SMDS_MeshNode*) aNodesIter->next();
1405 long anId = aNode2->GetID();
1408 Value aValue(aNodeId[1],aNodeId[2]);
1409 MValues::iterator aItr = theValues.find(aValue);
1410 if (aItr != theValues.end()){
1415 theValues[aValue] = 1;
1418 //cout << "NodeIds: "<<aNodeId[1]<<","<<aNodeId[2]<<" nbconn="<<aNbConnects<<endl;
1419 aNodeId[1] = aNodeId[2];
1422 Value aValue(aNodeId[0],aNodeId[2]);
1423 MValues::iterator aItr = theValues.find(aValue);
1424 if (aItr != theValues.end()) {
1429 theValues[aValue] = 1;
1432 //cout << "NodeIds: "<<aNodeId[0]<<","<<aNodeId[2]<<" nbconn="<<aNbConnects<<endl;
1442 Class : BadOrientedVolume
1443 Description : Predicate bad oriented volumes
1446 BadOrientedVolume::BadOrientedVolume()
1451 void BadOrientedVolume::SetMesh( const SMDS_Mesh* theMesh )
1456 bool BadOrientedVolume::IsSatisfy( long theId )
1461 SMDS_VolumeTool vTool( myMesh->FindElement( theId ));
1462 return !vTool.IsForward();
1465 SMDSAbs_ElementType BadOrientedVolume::GetType() const
1467 return SMDSAbs_Volume;
1474 Description : Predicate for free borders
1477 FreeBorders::FreeBorders()
1482 void FreeBorders::SetMesh( const SMDS_Mesh* theMesh )
1487 bool FreeBorders::IsSatisfy( long theId )
1489 return getNbMultiConnection( myMesh, theId ) == 1;
1492 SMDSAbs_ElementType FreeBorders::GetType() const
1494 return SMDSAbs_Edge;
1500 Description : Predicate for free Edges
1502 FreeEdges::FreeEdges()
1507 void FreeEdges::SetMesh( const SMDS_Mesh* theMesh )
1512 bool FreeEdges::IsFreeEdge( const SMDS_MeshNode** theNodes, const int theFaceId )
1514 TColStd_MapOfInteger aMap;
1515 for ( int i = 0; i < 2; i++ )
1517 SMDS_ElemIteratorPtr anElemIter = theNodes[ i ]->GetInverseElementIterator();
1518 while( anElemIter->more() )
1520 const SMDS_MeshElement* anElem = anElemIter->next();
1521 if ( anElem != 0 && anElem->GetType() == SMDSAbs_Face )
1523 int anId = anElem->GetID();
1527 else if ( aMap.Contains( anId ) && anId != theFaceId )
1535 bool FreeEdges::IsSatisfy( long theId )
1540 const SMDS_MeshElement* aFace = myMesh->FindElement( theId );
1541 if ( aFace == 0 || aFace->GetType() != SMDSAbs_Face || aFace->NbNodes() < 3 )
1544 SMDS_ElemIteratorPtr anIter;
1545 if ( aFace->IsQuadratic() ) {
1546 anIter = static_cast<const SMDS_QuadraticFaceOfNodes*>
1547 (aFace)->interlacedNodesElemIterator();
1550 anIter = aFace->nodesIterator();
1555 int i = 0, nbNodes = aFace->NbNodes();
1556 vector <const SMDS_MeshNode*> aNodes( nbNodes+1 );
1557 while( anIter->more() )
1559 const SMDS_MeshNode* aNode = (SMDS_MeshNode*)anIter->next();
1562 aNodes[ i++ ] = aNode;
1564 aNodes[ nbNodes ] = aNodes[ 0 ];
1566 for ( i = 0; i < nbNodes; i++ )
1567 if ( IsFreeEdge( &aNodes[ i ], theId ) )
1573 SMDSAbs_ElementType FreeEdges::GetType() const
1575 return SMDSAbs_Face;
1578 FreeEdges::Border::Border(long theElemId, long thePntId1, long thePntId2):
1581 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1582 if(thePntId1 > thePntId2){
1583 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1587 bool FreeEdges::Border::operator<(const FreeEdges::Border& x) const{
1588 if(myPntId[0] < x.myPntId[0]) return true;
1589 if(myPntId[0] == x.myPntId[0])
1590 if(myPntId[1] < x.myPntId[1]) return true;
1594 inline void UpdateBorders(const FreeEdges::Border& theBorder,
1595 FreeEdges::TBorders& theRegistry,
1596 FreeEdges::TBorders& theContainer)
1598 if(theRegistry.find(theBorder) == theRegistry.end()){
1599 theRegistry.insert(theBorder);
1600 theContainer.insert(theBorder);
1602 theContainer.erase(theBorder);
1606 void FreeEdges::GetBoreders(TBorders& theBorders)
1609 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
1610 for(; anIter->more(); ){
1611 const SMDS_MeshFace* anElem = anIter->next();
1612 long anElemId = anElem->GetID();
1613 SMDS_ElemIteratorPtr aNodesIter;
1614 if ( anElem->IsQuadratic() )
1615 aNodesIter = static_cast<const SMDS_QuadraticFaceOfNodes*>(anElem)->
1616 interlacedNodesElemIterator();
1618 aNodesIter = anElem->nodesIterator();
1620 const SMDS_MeshElement* aNode;
1621 if(aNodesIter->more()){
1622 aNode = aNodesIter->next();
1623 aNodeId[0] = aNodeId[1] = aNode->GetID();
1625 for(; aNodesIter->more(); ){
1626 aNode = aNodesIter->next();
1627 long anId = aNode->GetID();
1628 Border aBorder(anElemId,aNodeId[1],anId);
1630 //std::cout<<aBorder.myPntId[0]<<"; "<<aBorder.myPntId[1]<<"; "<<aBorder.myElemId<<endl;
1631 UpdateBorders(aBorder,aRegistry,theBorders);
1633 Border aBorder(anElemId,aNodeId[0],aNodeId[1]);
1634 //std::cout<<aBorder.myPntId[0]<<"; "<<aBorder.myPntId[1]<<"; "<<aBorder.myElemId<<endl;
1635 UpdateBorders(aBorder,aRegistry,theBorders);
1637 //std::cout<<"theBorders.size() = "<<theBorders.size()<<endl;
1642 Description : Predicate for Range of Ids.
1643 Range may be specified with two ways.
1644 1. Using AddToRange method
1645 2. With SetRangeStr method. Parameter of this method is a string
1646 like as "1,2,3,50-60,63,67,70-"
1649 //=======================================================================
1650 // name : RangeOfIds
1651 // Purpose : Constructor
1652 //=======================================================================
1653 RangeOfIds::RangeOfIds()
1656 myType = SMDSAbs_All;
1659 //=======================================================================
1661 // Purpose : Set mesh
1662 //=======================================================================
1663 void RangeOfIds::SetMesh( const SMDS_Mesh* theMesh )
1668 //=======================================================================
1669 // name : AddToRange
1670 // Purpose : Add ID to the range
1671 //=======================================================================
1672 bool RangeOfIds::AddToRange( long theEntityId )
1674 myIds.Add( theEntityId );
1678 //=======================================================================
1679 // name : GetRangeStr
1680 // Purpose : Get range as a string.
1681 // Example: "1,2,3,50-60,63,67,70-"
1682 //=======================================================================
1683 void RangeOfIds::GetRangeStr( TCollection_AsciiString& theResStr )
1687 TColStd_SequenceOfInteger anIntSeq;
1688 TColStd_SequenceOfAsciiString aStrSeq;
1690 TColStd_MapIteratorOfMapOfInteger anIter( myIds );
1691 for ( ; anIter.More(); anIter.Next() )
1693 int anId = anIter.Key();
1694 TCollection_AsciiString aStr( anId );
1695 anIntSeq.Append( anId );
1696 aStrSeq.Append( aStr );
1699 for ( int i = 1, n = myMin.Length(); i <= n; i++ )
1701 int aMinId = myMin( i );
1702 int aMaxId = myMax( i );
1704 TCollection_AsciiString aStr;
1705 if ( aMinId != IntegerFirst() )
1710 if ( aMaxId != IntegerLast() )
1713 // find position of the string in result sequence and insert string in it
1714 if ( anIntSeq.Length() == 0 )
1716 anIntSeq.Append( aMinId );
1717 aStrSeq.Append( aStr );
1721 if ( aMinId < anIntSeq.First() )
1723 anIntSeq.Prepend( aMinId );
1724 aStrSeq.Prepend( aStr );
1726 else if ( aMinId > anIntSeq.Last() )
1728 anIntSeq.Append( aMinId );
1729 aStrSeq.Append( aStr );
1732 for ( int j = 1, k = anIntSeq.Length(); j <= k; j++ )
1733 if ( aMinId < anIntSeq( j ) )
1735 anIntSeq.InsertBefore( j, aMinId );
1736 aStrSeq.InsertBefore( j, aStr );
1742 if ( aStrSeq.Length() == 0 )
1745 theResStr = aStrSeq( 1 );
1746 for ( int j = 2, k = aStrSeq.Length(); j <= k; j++ )
1749 theResStr += aStrSeq( j );
1753 //=======================================================================
1754 // name : SetRangeStr
1755 // Purpose : Define range with string
1756 // Example of entry string: "1,2,3,50-60,63,67,70-"
1757 //=======================================================================
1758 bool RangeOfIds::SetRangeStr( const TCollection_AsciiString& theStr )
1764 TCollection_AsciiString aStr = theStr;
1765 aStr.RemoveAll( ' ' );
1766 aStr.RemoveAll( '\t' );
1768 for ( int aPos = aStr.Search( ",," ); aPos != -1; aPos = aStr.Search( ",," ) )
1769 aStr.Remove( aPos, 2 );
1771 TCollection_AsciiString tmpStr = aStr.Token( ",", 1 );
1773 while ( tmpStr != "" )
1775 tmpStr = aStr.Token( ",", i++ );
1776 int aPos = tmpStr.Search( '-' );
1780 if ( tmpStr.IsIntegerValue() )
1781 myIds.Add( tmpStr.IntegerValue() );
1787 TCollection_AsciiString aMaxStr = tmpStr.Split( aPos );
1788 TCollection_AsciiString aMinStr = tmpStr;
1790 while ( aMinStr.Search( "-" ) != -1 ) aMinStr.RemoveAll( '-' );
1791 while ( aMaxStr.Search( "-" ) != -1 ) aMaxStr.RemoveAll( '-' );
1793 if ( !aMinStr.IsEmpty() && !aMinStr.IsIntegerValue() ||
1794 !aMaxStr.IsEmpty() && !aMaxStr.IsIntegerValue() )
1797 myMin.Append( aMinStr.IsEmpty() ? IntegerFirst() : aMinStr.IntegerValue() );
1798 myMax.Append( aMaxStr.IsEmpty() ? IntegerLast() : aMaxStr.IntegerValue() );
1805 //=======================================================================
1807 // Purpose : Get type of supported entities
1808 //=======================================================================
1809 SMDSAbs_ElementType RangeOfIds::GetType() const
1814 //=======================================================================
1816 // Purpose : Set type of supported entities
1817 //=======================================================================
1818 void RangeOfIds::SetType( SMDSAbs_ElementType theType )
1823 //=======================================================================
1825 // Purpose : Verify whether entity satisfies to this rpedicate
1826 //=======================================================================
1827 bool RangeOfIds::IsSatisfy( long theId )
1832 if ( myType == SMDSAbs_Node )
1834 if ( myMesh->FindNode( theId ) == 0 )
1839 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
1840 if ( anElem == 0 || myType != anElem->GetType() && myType != SMDSAbs_All )
1844 if ( myIds.Contains( theId ) )
1847 for ( int i = 1, n = myMin.Length(); i <= n; i++ )
1848 if ( theId >= myMin( i ) && theId <= myMax( i ) )
1856 Description : Base class for comparators
1858 Comparator::Comparator():
1862 Comparator::~Comparator()
1865 void Comparator::SetMesh( const SMDS_Mesh* theMesh )
1868 myFunctor->SetMesh( theMesh );
1871 void Comparator::SetMargin( double theValue )
1873 myMargin = theValue;
1876 void Comparator::SetNumFunctor( NumericalFunctorPtr theFunct )
1878 myFunctor = theFunct;
1881 SMDSAbs_ElementType Comparator::GetType() const
1883 return myFunctor ? myFunctor->GetType() : SMDSAbs_All;
1886 double Comparator::GetMargin()
1894 Description : Comparator "<"
1896 bool LessThan::IsSatisfy( long theId )
1898 return myFunctor && myFunctor->GetValue( theId ) < myMargin;
1904 Description : Comparator ">"
1906 bool MoreThan::IsSatisfy( long theId )
1908 return myFunctor && myFunctor->GetValue( theId ) > myMargin;
1914 Description : Comparator "="
1917 myToler(Precision::Confusion())
1920 bool EqualTo::IsSatisfy( long theId )
1922 return myFunctor && fabs( myFunctor->GetValue( theId ) - myMargin ) < myToler;
1925 void EqualTo::SetTolerance( double theToler )
1930 double EqualTo::GetTolerance()
1937 Description : Logical NOT predicate
1939 LogicalNOT::LogicalNOT()
1942 LogicalNOT::~LogicalNOT()
1945 bool LogicalNOT::IsSatisfy( long theId )
1947 return myPredicate && !myPredicate->IsSatisfy( theId );
1950 void LogicalNOT::SetMesh( const SMDS_Mesh* theMesh )
1953 myPredicate->SetMesh( theMesh );
1956 void LogicalNOT::SetPredicate( PredicatePtr thePred )
1958 myPredicate = thePred;
1961 SMDSAbs_ElementType LogicalNOT::GetType() const
1963 return myPredicate ? myPredicate->GetType() : SMDSAbs_All;
1968 Class : LogicalBinary
1969 Description : Base class for binary logical predicate
1971 LogicalBinary::LogicalBinary()
1974 LogicalBinary::~LogicalBinary()
1977 void LogicalBinary::SetMesh( const SMDS_Mesh* theMesh )
1980 myPredicate1->SetMesh( theMesh );
1983 myPredicate2->SetMesh( theMesh );
1986 void LogicalBinary::SetPredicate1( PredicatePtr thePredicate )
1988 myPredicate1 = thePredicate;
1991 void LogicalBinary::SetPredicate2( PredicatePtr thePredicate )
1993 myPredicate2 = thePredicate;
1996 SMDSAbs_ElementType LogicalBinary::GetType() const
1998 if ( !myPredicate1 || !myPredicate2 )
2001 SMDSAbs_ElementType aType1 = myPredicate1->GetType();
2002 SMDSAbs_ElementType aType2 = myPredicate2->GetType();
2004 return aType1 == aType2 ? aType1 : SMDSAbs_All;
2010 Description : Logical AND
2012 bool LogicalAND::IsSatisfy( long theId )
2017 myPredicate1->IsSatisfy( theId ) &&
2018 myPredicate2->IsSatisfy( theId );
2024 Description : Logical OR
2026 bool LogicalOR::IsSatisfy( long theId )
2031 myPredicate1->IsSatisfy( theId ) ||
2032 myPredicate2->IsSatisfy( theId );
2046 void Filter::SetPredicate( PredicatePtr thePredicate )
2048 myPredicate = thePredicate;
2051 template<class TElement, class TIterator, class TPredicate>
2052 inline void FillSequence(const TIterator& theIterator,
2053 TPredicate& thePredicate,
2054 Filter::TIdSequence& theSequence)
2056 if ( theIterator ) {
2057 while( theIterator->more() ) {
2058 TElement anElem = theIterator->next();
2059 long anId = anElem->GetID();
2060 if ( thePredicate->IsSatisfy( anId ) )
2061 theSequence.push_back( anId );
2068 GetElementsId( const SMDS_Mesh* theMesh,
2069 PredicatePtr thePredicate,
2070 TIdSequence& theSequence )
2072 theSequence.clear();
2074 if ( !theMesh || !thePredicate )
2077 thePredicate->SetMesh( theMesh );
2079 SMDSAbs_ElementType aType = thePredicate->GetType();
2082 FillSequence<const SMDS_MeshNode*>(theMesh->nodesIterator(),thePredicate,theSequence);
2085 FillSequence<const SMDS_MeshElement*>(theMesh->edgesIterator(),thePredicate,theSequence);
2088 FillSequence<const SMDS_MeshElement*>(theMesh->facesIterator(),thePredicate,theSequence);
2090 case SMDSAbs_Volume:
2091 FillSequence<const SMDS_MeshElement*>(theMesh->volumesIterator(),thePredicate,theSequence);
2094 FillSequence<const SMDS_MeshElement*>(theMesh->edgesIterator(),thePredicate,theSequence);
2095 FillSequence<const SMDS_MeshElement*>(theMesh->facesIterator(),thePredicate,theSequence);
2096 FillSequence<const SMDS_MeshElement*>(theMesh->volumesIterator(),thePredicate,theSequence);
2102 Filter::GetElementsId( const SMDS_Mesh* theMesh,
2103 Filter::TIdSequence& theSequence )
2105 GetElementsId(theMesh,myPredicate,theSequence);
2112 typedef std::set<SMDS_MeshFace*> TMapOfFacePtr;
2118 ManifoldPart::Link::Link( SMDS_MeshNode* theNode1,
2119 SMDS_MeshNode* theNode2 )
2125 ManifoldPart::Link::~Link()
2131 bool ManifoldPart::Link::IsEqual( const ManifoldPart::Link& theLink ) const
2133 if ( myNode1 == theLink.myNode1 &&
2134 myNode2 == theLink.myNode2 )
2136 else if ( myNode1 == theLink.myNode2 &&
2137 myNode2 == theLink.myNode1 )
2143 bool ManifoldPart::Link::operator<( const ManifoldPart::Link& x ) const
2145 if(myNode1 < x.myNode1) return true;
2146 if(myNode1 == x.myNode1)
2147 if(myNode2 < x.myNode2) return true;
2151 bool ManifoldPart::IsEqual( const ManifoldPart::Link& theLink1,
2152 const ManifoldPart::Link& theLink2 )
2154 return theLink1.IsEqual( theLink2 );
2157 ManifoldPart::ManifoldPart()
2160 myAngToler = Precision::Angular();
2161 myIsOnlyManifold = true;
2164 ManifoldPart::~ManifoldPart()
2169 void ManifoldPart::SetMesh( const SMDS_Mesh* theMesh )
2175 SMDSAbs_ElementType ManifoldPart::GetType() const
2176 { return SMDSAbs_Face; }
2178 bool ManifoldPart::IsSatisfy( long theElementId )
2180 return myMapIds.Contains( theElementId );
2183 void ManifoldPart::SetAngleTolerance( const double theAngToler )
2184 { myAngToler = theAngToler; }
2186 double ManifoldPart::GetAngleTolerance() const
2187 { return myAngToler; }
2189 void ManifoldPart::SetIsOnlyManifold( const bool theIsOnly )
2190 { myIsOnlyManifold = theIsOnly; }
2192 void ManifoldPart::SetStartElem( const long theStartId )
2193 { myStartElemId = theStartId; }
2195 bool ManifoldPart::process()
2198 myMapBadGeomIds.Clear();
2200 myAllFacePtr.clear();
2201 myAllFacePtrIntDMap.clear();
2205 // collect all faces into own map
2206 SMDS_FaceIteratorPtr anFaceItr = myMesh->facesIterator();
2207 for (; anFaceItr->more(); )
2209 SMDS_MeshFace* aFacePtr = (SMDS_MeshFace*)anFaceItr->next();
2210 myAllFacePtr.push_back( aFacePtr );
2211 myAllFacePtrIntDMap[aFacePtr] = myAllFacePtr.size()-1;
2214 SMDS_MeshFace* aStartFace = (SMDS_MeshFace*)myMesh->FindElement( myStartElemId );
2218 // the map of non manifold links and bad geometry
2219 TMapOfLink aMapOfNonManifold;
2220 TColStd_MapOfInteger aMapOfTreated;
2222 // begin cycle on faces from start index and run on vector till the end
2223 // and from begin to start index to cover whole vector
2224 const int aStartIndx = myAllFacePtrIntDMap[aStartFace];
2225 bool isStartTreat = false;
2226 for ( int fi = aStartIndx; !isStartTreat || fi != aStartIndx ; fi++ )
2228 if ( fi == aStartIndx )
2229 isStartTreat = true;
2230 // as result next time when fi will be equal to aStartIndx
2232 SMDS_MeshFace* aFacePtr = myAllFacePtr[ fi ];
2233 if ( aMapOfTreated.Contains( aFacePtr->GetID() ) )
2236 aMapOfTreated.Add( aFacePtr->GetID() );
2237 TColStd_MapOfInteger aResFaces;
2238 if ( !findConnected( myAllFacePtrIntDMap, aFacePtr,
2239 aMapOfNonManifold, aResFaces ) )
2241 TColStd_MapIteratorOfMapOfInteger anItr( aResFaces );
2242 for ( ; anItr.More(); anItr.Next() )
2244 int aFaceId = anItr.Key();
2245 aMapOfTreated.Add( aFaceId );
2246 myMapIds.Add( aFaceId );
2249 if ( fi == ( myAllFacePtr.size() - 1 ) )
2251 } // end run on vector of faces
2252 return !myMapIds.IsEmpty();
2255 static void getLinks( const SMDS_MeshFace* theFace,
2256 ManifoldPart::TVectorOfLink& theLinks )
2258 int aNbNode = theFace->NbNodes();
2259 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
2261 SMDS_MeshNode* aNode = 0;
2262 for ( ; aNodeItr->more() && i <= aNbNode; )
2265 SMDS_MeshNode* aN1 = (SMDS_MeshNode*)aNodeItr->next();
2269 SMDS_MeshNode* aN2 = ( i >= aNbNode ) ? aNode : (SMDS_MeshNode*)aNodeItr->next();
2271 ManifoldPart::Link aLink( aN1, aN2 );
2272 theLinks.push_back( aLink );
2276 static gp_XYZ getNormale( const SMDS_MeshFace* theFace )
2279 int aNbNode = theFace->NbNodes();
2280 TColgp_Array1OfXYZ anArrOfXYZ(1,4);
2281 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
2283 for ( ; aNodeItr->more() && i <= 4; i++ ) {
2284 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
2285 anArrOfXYZ.SetValue(i, gp_XYZ( aNode->X(), aNode->Y(), aNode->Z() ) );
2288 gp_XYZ q1 = anArrOfXYZ.Value(2) - anArrOfXYZ.Value(1);
2289 gp_XYZ q2 = anArrOfXYZ.Value(3) - anArrOfXYZ.Value(1);
2291 if ( aNbNode > 3 ) {
2292 gp_XYZ q3 = anArrOfXYZ.Value(4) - anArrOfXYZ.Value(1);
2295 double len = n.Modulus();
2302 bool ManifoldPart::findConnected
2303 ( const ManifoldPart::TDataMapFacePtrInt& theAllFacePtrInt,
2304 SMDS_MeshFace* theStartFace,
2305 ManifoldPart::TMapOfLink& theNonManifold,
2306 TColStd_MapOfInteger& theResFaces )
2308 theResFaces.Clear();
2309 if ( !theAllFacePtrInt.size() )
2312 if ( getNormale( theStartFace ).SquareModulus() <= gp::Resolution() )
2314 myMapBadGeomIds.Add( theStartFace->GetID() );
2318 ManifoldPart::TMapOfLink aMapOfBoundary, aMapToSkip;
2319 ManifoldPart::TVectorOfLink aSeqOfBoundary;
2320 theResFaces.Add( theStartFace->GetID() );
2321 ManifoldPart::TDataMapOfLinkFacePtr aDMapLinkFace;
2323 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
2324 aDMapLinkFace, theNonManifold, theStartFace );
2326 bool isDone = false;
2327 while ( !isDone && aMapOfBoundary.size() != 0 )
2329 bool isToReset = false;
2330 ManifoldPart::TVectorOfLink::iterator pLink = aSeqOfBoundary.begin();
2331 for ( ; !isToReset && pLink != aSeqOfBoundary.end(); ++pLink )
2333 ManifoldPart::Link aLink = *pLink;
2334 if ( aMapToSkip.find( aLink ) != aMapToSkip.end() )
2336 // each link could be treated only once
2337 aMapToSkip.insert( aLink );
2339 ManifoldPart::TVectorOfFacePtr aFaces;
2341 if ( myIsOnlyManifold &&
2342 (theNonManifold.find( aLink ) != theNonManifold.end()) )
2346 getFacesByLink( aLink, aFaces );
2347 // filter the element to keep only indicated elements
2348 ManifoldPart::TVectorOfFacePtr aFiltered;
2349 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
2350 for ( ; pFace != aFaces.end(); ++pFace )
2352 SMDS_MeshFace* aFace = *pFace;
2353 if ( myAllFacePtrIntDMap.find( aFace ) != myAllFacePtrIntDMap.end() )
2354 aFiltered.push_back( aFace );
2357 if ( aFaces.size() < 2 ) // no neihgbour faces
2359 else if ( myIsOnlyManifold && aFaces.size() > 2 ) // non manifold case
2361 theNonManifold.insert( aLink );
2366 // compare normal with normals of neighbor element
2367 SMDS_MeshFace* aPrevFace = aDMapLinkFace[ aLink ];
2368 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
2369 for ( ; pFace != aFaces.end(); ++pFace )
2371 SMDS_MeshFace* aNextFace = *pFace;
2372 if ( aPrevFace == aNextFace )
2374 int anNextFaceID = aNextFace->GetID();
2375 if ( myIsOnlyManifold && theResFaces.Contains( anNextFaceID ) )
2376 // should not be with non manifold restriction. probably bad topology
2378 // check if face was treated and skipped
2379 if ( myMapBadGeomIds.Contains( anNextFaceID ) ||
2380 !isInPlane( aPrevFace, aNextFace ) )
2382 // add new element to connected and extend the boundaries.
2383 theResFaces.Add( anNextFaceID );
2384 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
2385 aDMapLinkFace, theNonManifold, aNextFace );
2389 isDone = !isToReset;
2392 return !theResFaces.IsEmpty();
2395 bool ManifoldPart::isInPlane( const SMDS_MeshFace* theFace1,
2396 const SMDS_MeshFace* theFace2 )
2398 gp_Dir aNorm1 = gp_Dir( getNormale( theFace1 ) );
2399 gp_XYZ aNorm2XYZ = getNormale( theFace2 );
2400 if ( aNorm2XYZ.SquareModulus() <= gp::Resolution() )
2402 myMapBadGeomIds.Add( theFace2->GetID() );
2405 if ( aNorm1.IsParallel( gp_Dir( aNorm2XYZ ), myAngToler ) )
2411 void ManifoldPart::expandBoundary
2412 ( ManifoldPart::TMapOfLink& theMapOfBoundary,
2413 ManifoldPart::TVectorOfLink& theSeqOfBoundary,
2414 ManifoldPart::TDataMapOfLinkFacePtr& theDMapLinkFacePtr,
2415 ManifoldPart::TMapOfLink& theNonManifold,
2416 SMDS_MeshFace* theNextFace ) const
2418 ManifoldPart::TVectorOfLink aLinks;
2419 getLinks( theNextFace, aLinks );
2420 int aNbLink = (int)aLinks.size();
2421 for ( int i = 0; i < aNbLink; i++ )
2423 ManifoldPart::Link aLink = aLinks[ i ];
2424 if ( myIsOnlyManifold && (theNonManifold.find( aLink ) != theNonManifold.end()) )
2426 if ( theMapOfBoundary.find( aLink ) != theMapOfBoundary.end() )
2428 if ( myIsOnlyManifold )
2430 // remove from boundary
2431 theMapOfBoundary.erase( aLink );
2432 ManifoldPart::TVectorOfLink::iterator pLink = theSeqOfBoundary.begin();
2433 for ( ; pLink != theSeqOfBoundary.end(); ++pLink )
2435 ManifoldPart::Link aBoundLink = *pLink;
2436 if ( aBoundLink.IsEqual( aLink ) )
2438 theSeqOfBoundary.erase( pLink );
2446 theMapOfBoundary.insert( aLink );
2447 theSeqOfBoundary.push_back( aLink );
2448 theDMapLinkFacePtr[ aLink ] = theNextFace;
2453 void ManifoldPart::getFacesByLink( const ManifoldPart::Link& theLink,
2454 ManifoldPart::TVectorOfFacePtr& theFaces ) const
2456 SMDS_Mesh::SetOfFaces aSetOfFaces;
2457 // take all faces that shared first node
2458 SMDS_ElemIteratorPtr anItr = theLink.myNode1->facesIterator();
2459 for ( ; anItr->more(); )
2461 SMDS_MeshFace* aFace = (SMDS_MeshFace*)anItr->next();
2464 aSetOfFaces.Add( aFace );
2466 // take all faces that shared second node
2467 anItr = theLink.myNode2->facesIterator();
2468 // find the common part of two sets
2469 for ( ; anItr->more(); )
2471 SMDS_MeshFace* aFace = (SMDS_MeshFace*)anItr->next();
2472 if ( aSetOfFaces.Contains( aFace ) )
2473 theFaces.push_back( aFace );
2482 ElementsOnSurface::ElementsOnSurface()
2486 myType = SMDSAbs_All;
2488 myToler = Precision::Confusion();
2491 ElementsOnSurface::~ElementsOnSurface()
2496 void ElementsOnSurface::SetMesh( const SMDS_Mesh* theMesh )
2498 if ( myMesh == theMesh )
2505 bool ElementsOnSurface::IsSatisfy( long theElementId )
2507 return myIds.Contains( theElementId );
2510 SMDSAbs_ElementType ElementsOnSurface::GetType() const
2513 void ElementsOnSurface::SetTolerance( const double theToler )
2514 { myToler = theToler; }
2516 double ElementsOnSurface::GetTolerance() const
2521 void ElementsOnSurface::SetSurface( const TopoDS_Shape& theShape,
2522 const SMDSAbs_ElementType theType )
2526 if ( theShape.IsNull() || theShape.ShapeType() != TopAbs_FACE )
2531 TopoDS_Face aFace = TopoDS::Face( theShape );
2532 mySurf = BRep_Tool::Surface( aFace );
2535 void ElementsOnSurface::process()
2538 if ( mySurf.IsNull() )
2544 if ( myType == SMDSAbs_Face || myType == SMDSAbs_All )
2546 SMDS_FaceIteratorPtr anIter = myMesh->facesIterator();
2547 for(; anIter->more(); )
2548 process( anIter->next() );
2551 if ( myType == SMDSAbs_Edge || myType == SMDSAbs_All )
2553 SMDS_EdgeIteratorPtr anIter = myMesh->edgesIterator();
2554 for(; anIter->more(); )
2555 process( anIter->next() );
2558 if ( myType == SMDSAbs_Node )
2560 SMDS_NodeIteratorPtr anIter = myMesh->nodesIterator();
2561 for(; anIter->more(); )
2562 process( anIter->next() );
2566 void ElementsOnSurface::process( const SMDS_MeshElement* theElemPtr )
2568 SMDS_ElemIteratorPtr aNodeItr = theElemPtr->nodesIterator();
2569 bool isSatisfy = true;
2570 for ( ; aNodeItr->more(); )
2572 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
2573 if ( !isOnSurface( aNode ) )
2580 myIds.Add( theElemPtr->GetID() );
2583 bool ElementsOnSurface::isOnSurface( const SMDS_MeshNode* theNode ) const
2585 if ( mySurf.IsNull() )
2588 gp_Pnt aPnt( theNode->X(), theNode->Y(), theNode->Z() );
2589 double aToler2 = myToler * myToler;
2590 if ( mySurf->IsKind(STANDARD_TYPE(Geom_Plane)))
2592 gp_Pln aPln = Handle(Geom_Plane)::DownCast(mySurf)->Pln();
2593 if ( aPln.SquareDistance( aPnt ) > aToler2 )
2596 else if ( mySurf->IsKind(STANDARD_TYPE(Geom_CylindricalSurface)))
2598 gp_Cylinder aCyl = Handle(Geom_CylindricalSurface)::DownCast(mySurf)->Cylinder();
2599 double aRad = aCyl.Radius();
2600 gp_Ax3 anAxis = aCyl.Position();
2601 gp_XYZ aLoc = aCyl.Location().XYZ();
2602 double aXDist = anAxis.XDirection().XYZ() * ( aPnt.XYZ() - aLoc );
2603 double aYDist = anAxis.YDirection().XYZ() * ( aPnt.XYZ() - aLoc );
2604 if ( fabs(aXDist*aXDist + aYDist*aYDist - aRad*aRad) > aToler2 )