1 // Copyright (C) 2007-2021 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
23 #include "SMESH_ControlsDef.hxx"
25 #include "SMDS_BallElement.hxx"
26 #include "SMDS_FacePosition.hxx"
27 #include "SMDS_Iterator.hxx"
28 #include "SMDS_Mesh.hxx"
29 #include "SMDS_MeshElement.hxx"
30 #include "SMDS_MeshNode.hxx"
31 #include "SMDS_VolumeTool.hxx"
32 #include "SMESHDS_GroupBase.hxx"
33 #include "SMESHDS_GroupOnFilter.hxx"
34 #include "SMESHDS_Mesh.hxx"
35 #include "SMESH_MeshAlgos.hxx"
36 #include "SMESH_OctreeNode.hxx"
37 #include "SMESH_Comment.hxx"
39 #include <GEOMUtils.hxx>
40 #include <Basics_Utils.hxx>
42 #include <BRepAdaptor_Surface.hxx>
43 #include <BRepBndLib.hxx>
44 #include <BRepBuilderAPI_Copy.hxx>
45 #include <BRepClass3d_SolidClassifier.hxx>
46 #include <BRepClass_FaceClassifier.hxx>
47 #include <BRep_Tool.hxx>
48 #include <GeomLib_IsPlanarSurface.hxx>
49 #include <Geom_CylindricalSurface.hxx>
50 #include <Geom_Plane.hxx>
51 #include <Geom_Surface.hxx>
52 #include <NCollection_Map.hxx>
53 #include <Precision.hxx>
54 #include <ShapeAnalysis_Surface.hxx>
55 #include <TColStd_MapIteratorOfMapOfInteger.hxx>
56 #include <TColStd_MapOfInteger.hxx>
57 #include <TColStd_SequenceOfAsciiString.hxx>
58 #include <TColgp_Array1OfXYZ.hxx>
62 #include <TopoDS_Edge.hxx>
63 #include <TopoDS_Face.hxx>
64 #include <TopoDS_Iterator.hxx>
65 #include <TopoDS_Shape.hxx>
66 #include <TopoDS_Vertex.hxx>
68 #include <gp_Cylinder.hxx>
75 #include <vtkMeshQuality.h>
86 const double theEps = 1e-100;
87 const double theInf = 1e+100;
89 inline gp_XYZ gpXYZ(const SMDS_MeshNode* aNode )
91 return gp_XYZ(aNode->X(), aNode->Y(), aNode->Z() );
94 inline double getAngle( const gp_XYZ& P1, const gp_XYZ& P2, const gp_XYZ& P3 )
96 gp_Vec v1( P1 - P2 ), v2( P3 - P2 );
98 return v1.Magnitude() < gp::Resolution() ||
99 v2.Magnitude() < gp::Resolution() ? 0 : v1.Angle( v2 );
102 inline double getCos2( const gp_XYZ& P1, const gp_XYZ& P2, const gp_XYZ& P3 )
104 gp_Vec v1( P1 - P2 ), v2( P3 - P2 );
105 double dot = v1 * v2, len1 = v1.SquareMagnitude(), len2 = v2.SquareMagnitude();
107 return ( dot < 0 || len1 < gp::Resolution() || len2 < gp::Resolution() ? -1 :
108 dot * dot / len1 / len2 );
111 inline double getArea( const gp_XYZ& P1, const gp_XYZ& P2, const gp_XYZ& P3 )
113 gp_Vec aVec1( P2 - P1 );
114 gp_Vec aVec2( P3 - P1 );
115 return ( aVec1 ^ aVec2 ).Magnitude() * 0.5;
118 inline double getArea( const gp_Pnt& P1, const gp_Pnt& P2, const gp_Pnt& P3 )
120 return getArea( P1.XYZ(), P2.XYZ(), P3.XYZ() );
125 inline double getDistance( const gp_XYZ& P1, const gp_XYZ& P2 )
127 double aDist = gp_Pnt( P1 ).Distance( gp_Pnt( P2 ) );
131 int getNbMultiConnection( const SMDS_Mesh* theMesh, const smIdType theId )
136 const SMDS_MeshElement* anEdge = theMesh->FindElement( theId );
137 if ( anEdge == 0 || anEdge->GetType() != SMDSAbs_Edge/* || anEdge->NbNodes() != 2 */)
140 // for each pair of nodes in anEdge (there are 2 pairs in a quadratic edge)
141 // count elements containing both nodes of the pair.
142 // Note that there may be such cases for a quadratic edge (a horizontal line):
147 // +-----+------+ +-----+------+
150 // result should be 2 in both cases
152 int aResult0 = 0, aResult1 = 0;
153 // last node, it is a medium one in a quadratic edge
154 const SMDS_MeshNode* aLastNode = anEdge->GetNode( anEdge->NbNodes() - 1 );
155 const SMDS_MeshNode* aNode0 = anEdge->GetNode( 0 );
156 const SMDS_MeshNode* aNode1 = anEdge->GetNode( 1 );
157 if ( aNode1 == aLastNode ) aNode1 = 0;
159 SMDS_ElemIteratorPtr anElemIter = aLastNode->GetInverseElementIterator();
160 while( anElemIter->more() ) {
161 const SMDS_MeshElement* anElem = anElemIter->next();
162 if ( anElem != 0 && anElem->GetType() != SMDSAbs_Edge ) {
163 SMDS_ElemIteratorPtr anIter = anElem->nodesIterator();
164 while ( anIter->more() ) {
165 if ( const SMDS_MeshElement* anElemNode = anIter->next() ) {
166 if ( anElemNode == aNode0 ) {
168 if ( !aNode1 ) break; // not a quadratic edge
170 else if ( anElemNode == aNode1 )
176 int aResult = std::max ( aResult0, aResult1 );
181 gp_XYZ getNormale( const SMDS_MeshFace* theFace, bool* ok=0 )
183 int aNbNode = theFace->NbNodes();
185 gp_XYZ q1 = gpXYZ( theFace->GetNode(1)) - gpXYZ( theFace->GetNode(0));
186 gp_XYZ q2 = gpXYZ( theFace->GetNode(2)) - gpXYZ( theFace->GetNode(0));
189 gp_XYZ q3 = gpXYZ( theFace->GetNode(3)) - gpXYZ( theFace->GetNode(0));
192 double len = n.Modulus();
193 bool zeroLen = ( len <= std::numeric_limits<double>::min());
197 if (ok) *ok = !zeroLen;
205 using namespace SMESH::Controls;
211 //================================================================================
213 Class : NumericalFunctor
214 Description : Base class for numerical functors
216 //================================================================================
218 NumericalFunctor::NumericalFunctor():
224 void NumericalFunctor::SetMesh( const SMDS_Mesh* theMesh )
229 bool NumericalFunctor::GetPoints(const smIdType theId,
230 TSequenceOfXYZ& theRes ) const
237 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
238 if ( !IsApplicable( anElem ))
241 return GetPoints( anElem, theRes );
244 bool NumericalFunctor::GetPoints(const SMDS_MeshElement* anElem,
245 TSequenceOfXYZ& theRes )
252 theRes.reserve( anElem->NbNodes() );
253 theRes.setElement( anElem );
255 // Get nodes of the element
256 SMDS_NodeIteratorPtr anIter= anElem->interlacedNodesIterator();
259 while( anIter->more() ) {
260 if ( p.Set( anIter->next() ))
261 theRes.push_back( p );
268 long NumericalFunctor::GetPrecision() const
273 void NumericalFunctor::SetPrecision( const long thePrecision )
275 myPrecision = thePrecision;
276 myPrecisionValue = pow( 10., (double)( myPrecision ) );
279 double NumericalFunctor::GetValue( long theId )
283 myCurrElement = myMesh->FindElement( theId );
286 if ( GetPoints( theId, P )) // elem type is checked here
287 aVal = Round( GetValue( P ));
292 double NumericalFunctor::Round( const double & aVal )
294 return ( myPrecision >= 0 ) ? floor( aVal * myPrecisionValue + 0.5 ) / myPrecisionValue : aVal;
297 //================================================================================
299 * \brief Return true if a value can be computed for a given element.
300 * Some NumericalFunctor's are meaningful for elements of a certain
303 //================================================================================
305 bool NumericalFunctor::IsApplicable( const SMDS_MeshElement* element ) const
307 return element && element->GetType() == this->GetType();
310 bool NumericalFunctor::IsApplicable( long theElementId ) const
312 return IsApplicable( myMesh->FindElement( theElementId ));
315 //================================================================================
317 * \brief Return histogram of functor values
318 * \param nbIntervals - number of intervals
319 * \param nbEvents - number of mesh elements having values within i-th interval
320 * \param funValues - boundaries of intervals
321 * \param elements - elements to check vulue of; empty list means "of all"
322 * \param minmax - boundaries of diapason of values to divide into intervals
324 //================================================================================
326 void NumericalFunctor::GetHistogram(int nbIntervals,
327 std::vector<int>& nbEvents,
328 std::vector<double>& funValues,
329 const std::vector<smIdType>& elements,
330 const double* minmax,
331 const bool isLogarithmic)
333 if ( nbIntervals < 1 ||
335 !myMesh->GetMeshInfo().NbElements( GetType() ))
337 nbEvents.resize( nbIntervals, 0 );
338 funValues.resize( nbIntervals+1 );
340 // get all values sorted
341 std::multiset< double > values;
342 if ( elements.empty() )
344 SMDS_ElemIteratorPtr elemIt = myMesh->elementsIterator( GetType() );
345 while ( elemIt->more() )
346 values.insert( GetValue( elemIt->next()->GetID() ));
350 std::vector<smIdType>::const_iterator id = elements.begin();
351 for ( ; id != elements.end(); ++id )
352 values.insert( GetValue( *id ));
357 funValues[0] = minmax[0];
358 funValues[nbIntervals] = minmax[1];
362 funValues[0] = *values.begin();
363 funValues[nbIntervals] = *values.rbegin();
365 // case nbIntervals == 1
366 if ( nbIntervals == 1 )
368 nbEvents[0] = values.size();
372 if (funValues.front() == funValues.back())
374 nbEvents.resize( 1 );
375 nbEvents[0] = values.size();
376 funValues[1] = funValues.back();
377 funValues.resize( 2 );
380 std::multiset< double >::iterator min = values.begin(), max;
381 for ( int i = 0; i < nbIntervals; ++i )
383 // find end value of i-th interval
384 double r = (i+1) / double(nbIntervals);
385 if (isLogarithmic && funValues.front() > 1e-07 && funValues.back() > 1e-07) {
386 double logmin = log10(funValues.front());
387 double lval = logmin + r * (log10(funValues.back()) - logmin);
388 funValues[i+1] = pow(10.0, lval);
391 funValues[i+1] = funValues.front() * (1-r) + funValues.back() * r;
394 // count values in the i-th interval if there are any
395 if ( min != values.end() && *min <= funValues[i+1] )
397 // find the first value out of the interval
398 max = values.upper_bound( funValues[i+1] ); // max is greater than funValues[i+1], or end()
399 nbEvents[i] = std::distance( min, max );
403 // add values larger than minmax[1]
404 nbEvents.back() += std::distance( min, values.end() );
407 //=======================================================================
410 Description : Functor calculating volume of a 3D element
412 //================================================================================
414 double Volume::GetValue( long theElementId )
416 if ( theElementId && myMesh ) {
417 SMDS_VolumeTool aVolumeTool;
418 if ( aVolumeTool.Set( myMesh->FindElement( theElementId )))
419 return aVolumeTool.GetSize();
424 double Volume::GetBadRate( double Value, int /*nbNodes*/ ) const
429 SMDSAbs_ElementType Volume::GetType() const
431 return SMDSAbs_Volume;
434 //=======================================================================
436 Class : MaxElementLength2D
437 Description : Functor calculating maximum length of 2D element
439 //================================================================================
441 double MaxElementLength2D::GetValue( const TSequenceOfXYZ& P )
447 if( len == 3 ) { // triangles
448 double L1 = getDistance(P( 1 ),P( 2 ));
449 double L2 = getDistance(P( 2 ),P( 3 ));
450 double L3 = getDistance(P( 3 ),P( 1 ));
451 aVal = Max(L1,Max(L2,L3));
453 else if( len == 4 ) { // quadrangles
454 double L1 = getDistance(P( 1 ),P( 2 ));
455 double L2 = getDistance(P( 2 ),P( 3 ));
456 double L3 = getDistance(P( 3 ),P( 4 ));
457 double L4 = getDistance(P( 4 ),P( 1 ));
458 double D1 = getDistance(P( 1 ),P( 3 ));
459 double D2 = getDistance(P( 2 ),P( 4 ));
460 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(D1,D2));
462 else if( len == 6 ) { // quadratic triangles
463 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
464 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
465 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 1 ));
466 aVal = Max(L1,Max(L2,L3));
468 else if( len == 8 || len == 9 ) { // quadratic quadrangles
469 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
470 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
471 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 7 ));
472 double L4 = getDistance(P( 7 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
473 double D1 = getDistance(P( 1 ),P( 5 ));
474 double D2 = getDistance(P( 3 ),P( 7 ));
475 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(D1,D2));
477 // Diagonals are undefined for concave polygons
478 // else if ( P.getElementEntity() == SMDSEntity_Quad_Polygon && P.size() > 2 ) // quad polygon
481 // aVal = getDistance( P( 1 ), P( P.size() )) + getDistance( P( P.size() ), P( P.size()-1 ));
482 // for ( size_t i = 1; i < P.size()-1; i += 2 )
484 // double L = getDistance( P( i ), P( i+1 )) + getDistance( P( i+1 ), P( i+2 ));
485 // aVal = Max( aVal, L );
488 // for ( int i = P.size()-5; i > 0; i -= 2 )
489 // for ( int j = i + 4; j < P.size() + i - 2; i += 2 )
491 // double D = getDistance( P( i ), P( j ));
492 // aVal = Max( aVal, D );
499 if( myPrecision >= 0 )
501 double prec = pow( 10., (double)myPrecision );
502 aVal = floor( aVal * prec + 0.5 ) / prec;
507 double MaxElementLength2D::GetValue( long theElementId )
510 return GetPoints( theElementId, P ) ? GetValue(P) : 0.0;
513 double MaxElementLength2D::GetBadRate( double Value, int /*nbNodes*/ ) const
518 SMDSAbs_ElementType MaxElementLength2D::GetType() const
523 //=======================================================================
525 Class : MaxElementLength3D
526 Description : Functor calculating maximum length of 3D element
528 //================================================================================
530 double MaxElementLength3D::GetValue( long theElementId )
533 if( GetPoints( theElementId, P ) ) {
535 const SMDS_MeshElement* aElem = myMesh->FindElement( theElementId );
536 SMDSAbs_EntityType aType = aElem->GetEntityType();
539 case SMDSEntity_Tetra: { // tetras
540 double L1 = getDistance(P( 1 ),P( 2 ));
541 double L2 = getDistance(P( 2 ),P( 3 ));
542 double L3 = getDistance(P( 3 ),P( 1 ));
543 double L4 = getDistance(P( 1 ),P( 4 ));
544 double L5 = getDistance(P( 2 ),P( 4 ));
545 double L6 = getDistance(P( 3 ),P( 4 ));
546 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
549 case SMDSEntity_Pyramid: { // pyramids
550 double L1 = getDistance(P( 1 ),P( 2 ));
551 double L2 = getDistance(P( 2 ),P( 3 ));
552 double L3 = getDistance(P( 3 ),P( 4 ));
553 double L4 = getDistance(P( 4 ),P( 1 ));
554 double L5 = getDistance(P( 1 ),P( 5 ));
555 double L6 = getDistance(P( 2 ),P( 5 ));
556 double L7 = getDistance(P( 3 ),P( 5 ));
557 double L8 = getDistance(P( 4 ),P( 5 ));
558 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
559 aVal = Max(aVal,Max(L7,L8));
562 case SMDSEntity_Penta: { // pentas
563 double L1 = getDistance(P( 1 ),P( 2 ));
564 double L2 = getDistance(P( 2 ),P( 3 ));
565 double L3 = getDistance(P( 3 ),P( 1 ));
566 double L4 = getDistance(P( 4 ),P( 5 ));
567 double L5 = getDistance(P( 5 ),P( 6 ));
568 double L6 = getDistance(P( 6 ),P( 4 ));
569 double L7 = getDistance(P( 1 ),P( 4 ));
570 double L8 = getDistance(P( 2 ),P( 5 ));
571 double L9 = getDistance(P( 3 ),P( 6 ));
572 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
573 aVal = Max(aVal,Max(Max(L7,L8),L9));
576 case SMDSEntity_Hexa: { // hexas
577 double L1 = getDistance(P( 1 ),P( 2 ));
578 double L2 = getDistance(P( 2 ),P( 3 ));
579 double L3 = getDistance(P( 3 ),P( 4 ));
580 double L4 = getDistance(P( 4 ),P( 1 ));
581 double L5 = getDistance(P( 5 ),P( 6 ));
582 double L6 = getDistance(P( 6 ),P( 7 ));
583 double L7 = getDistance(P( 7 ),P( 8 ));
584 double L8 = getDistance(P( 8 ),P( 5 ));
585 double L9 = getDistance(P( 1 ),P( 5 ));
586 double L10= getDistance(P( 2 ),P( 6 ));
587 double L11= getDistance(P( 3 ),P( 7 ));
588 double L12= getDistance(P( 4 ),P( 8 ));
589 double D1 = getDistance(P( 1 ),P( 7 ));
590 double D2 = getDistance(P( 2 ),P( 8 ));
591 double D3 = getDistance(P( 3 ),P( 5 ));
592 double D4 = getDistance(P( 4 ),P( 6 ));
593 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
594 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
595 aVal = Max(aVal,Max(L11,L12));
596 aVal = Max(aVal,Max(Max(D1,D2),Max(D3,D4)));
599 case SMDSEntity_Hexagonal_Prism: { // hexagonal prism
600 for ( int i1 = 1; i1 < 12; ++i1 )
601 for ( int i2 = i1+1; i1 <= 12; ++i1 )
602 aVal = Max( aVal, getDistance(P( i1 ),P( i2 )));
605 case SMDSEntity_Quad_Tetra: { // quadratic tetras
606 double L1 = getDistance(P( 1 ),P( 5 )) + getDistance(P( 5 ),P( 2 ));
607 double L2 = getDistance(P( 2 ),P( 6 )) + getDistance(P( 6 ),P( 3 ));
608 double L3 = getDistance(P( 3 ),P( 7 )) + getDistance(P( 7 ),P( 1 ));
609 double L4 = getDistance(P( 1 ),P( 8 )) + getDistance(P( 8 ),P( 4 ));
610 double L5 = getDistance(P( 2 ),P( 9 )) + getDistance(P( 9 ),P( 4 ));
611 double L6 = getDistance(P( 3 ),P( 10 )) + getDistance(P( 10 ),P( 4 ));
612 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
615 case SMDSEntity_Quad_Pyramid: { // quadratic pyramids
616 double L1 = getDistance(P( 1 ),P( 6 )) + getDistance(P( 6 ),P( 2 ));
617 double L2 = getDistance(P( 2 ),P( 7 )) + getDistance(P( 7 ),P( 3 ));
618 double L3 = getDistance(P( 3 ),P( 8 )) + getDistance(P( 8 ),P( 4 ));
619 double L4 = getDistance(P( 4 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
620 double L5 = getDistance(P( 1 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
621 double L6 = getDistance(P( 2 ),P( 11 )) + getDistance(P( 11 ),P( 5 ));
622 double L7 = getDistance(P( 3 ),P( 12 )) + getDistance(P( 12 ),P( 5 ));
623 double L8 = getDistance(P( 4 ),P( 13 )) + getDistance(P( 13 ),P( 5 ));
624 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
625 aVal = Max(aVal,Max(L7,L8));
628 case SMDSEntity_Quad_Penta:
629 case SMDSEntity_BiQuad_Penta: { // quadratic pentas
630 double L1 = getDistance(P( 1 ),P( 7 )) + getDistance(P( 7 ),P( 2 ));
631 double L2 = getDistance(P( 2 ),P( 8 )) + getDistance(P( 8 ),P( 3 ));
632 double L3 = getDistance(P( 3 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
633 double L4 = getDistance(P( 4 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
634 double L5 = getDistance(P( 5 ),P( 11 )) + getDistance(P( 11 ),P( 6 ));
635 double L6 = getDistance(P( 6 ),P( 12 )) + getDistance(P( 12 ),P( 4 ));
636 double L7 = getDistance(P( 1 ),P( 13 )) + getDistance(P( 13 ),P( 4 ));
637 double L8 = getDistance(P( 2 ),P( 14 )) + getDistance(P( 14 ),P( 5 ));
638 double L9 = getDistance(P( 3 ),P( 15 )) + getDistance(P( 15 ),P( 6 ));
639 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
640 aVal = Max(aVal,Max(Max(L7,L8),L9));
643 case SMDSEntity_Quad_Hexa:
644 case SMDSEntity_TriQuad_Hexa: { // quadratic hexas
645 double L1 = getDistance(P( 1 ),P( 9 )) + getDistance(P( 9 ),P( 2 ));
646 double L2 = getDistance(P( 2 ),P( 10 )) + getDistance(P( 10 ),P( 3 ));
647 double L3 = getDistance(P( 3 ),P( 11 )) + getDistance(P( 11 ),P( 4 ));
648 double L4 = getDistance(P( 4 ),P( 12 )) + getDistance(P( 12 ),P( 1 ));
649 double L5 = getDistance(P( 5 ),P( 13 )) + getDistance(P( 13 ),P( 6 ));
650 double L6 = getDistance(P( 6 ),P( 14 )) + getDistance(P( 14 ),P( 7 ));
651 double L7 = getDistance(P( 7 ),P( 15 )) + getDistance(P( 15 ),P( 8 ));
652 double L8 = getDistance(P( 8 ),P( 16 )) + getDistance(P( 16 ),P( 5 ));
653 double L9 = getDistance(P( 1 ),P( 17 )) + getDistance(P( 17 ),P( 5 ));
654 double L10= getDistance(P( 2 ),P( 18 )) + getDistance(P( 18 ),P( 6 ));
655 double L11= getDistance(P( 3 ),P( 19 )) + getDistance(P( 19 ),P( 7 ));
656 double L12= getDistance(P( 4 ),P( 20 )) + getDistance(P( 20 ),P( 8 ));
657 double D1 = getDistance(P( 1 ),P( 7 ));
658 double D2 = getDistance(P( 2 ),P( 8 ));
659 double D3 = getDistance(P( 3 ),P( 5 ));
660 double D4 = getDistance(P( 4 ),P( 6 ));
661 aVal = Max(Max(Max(L1,L2),Max(L3,L4)),Max(L5,L6));
662 aVal = Max(aVal,Max(Max(L7,L8),Max(L9,L10)));
663 aVal = Max(aVal,Max(L11,L12));
664 aVal = Max(aVal,Max(Max(D1,D2),Max(D3,D4)));
667 case SMDSEntity_Quad_Polyhedra:
668 case SMDSEntity_Polyhedra: { // polys
669 // get the maximum distance between all pairs of nodes
670 for( int i = 1; i <= len; i++ ) {
671 for( int j = 1; j <= len; j++ ) {
672 if( j > i ) { // optimization of the loop
673 double D = getDistance( P(i), P(j) );
674 aVal = Max( aVal, D );
680 case SMDSEntity_Node:
682 case SMDSEntity_Edge:
683 case SMDSEntity_Quad_Edge:
684 case SMDSEntity_Triangle:
685 case SMDSEntity_Quad_Triangle:
686 case SMDSEntity_BiQuad_Triangle:
687 case SMDSEntity_Quadrangle:
688 case SMDSEntity_Quad_Quadrangle:
689 case SMDSEntity_BiQuad_Quadrangle:
690 case SMDSEntity_Polygon:
691 case SMDSEntity_Quad_Polygon:
692 case SMDSEntity_Ball:
693 case SMDSEntity_Last: return 0;
694 } // switch ( aType )
696 if( myPrecision >= 0 )
698 double prec = pow( 10., (double)myPrecision );
699 aVal = floor( aVal * prec + 0.5 ) / prec;
706 double MaxElementLength3D::GetBadRate( double Value, int /*nbNodes*/ ) const
711 SMDSAbs_ElementType MaxElementLength3D::GetType() const
713 return SMDSAbs_Volume;
716 //=======================================================================
719 Description : Functor for calculation of minimum angle
721 //================================================================================
723 double MinimumAngle::GetValue( const TSequenceOfXYZ& P )
730 aMaxCos2 = getCos2( P( P.size() ), P( 1 ), P( 2 ));
731 aMaxCos2 = Max( aMaxCos2, getCos2( P( P.size()-1 ), P( P.size() ), P( 1 )));
733 for ( size_t i = 2; i < P.size(); i++ )
735 double A0 = getCos2( P( i-1 ), P( i ), P( i+1 ) );
736 aMaxCos2 = Max( aMaxCos2, A0 );
739 return 0; // all nodes coincide
741 double cos = sqrt( aMaxCos2 );
742 if ( cos >= 1 ) return 0;
743 return acos( cos ) * 180.0 / M_PI;
746 double MinimumAngle::GetBadRate( double Value, int nbNodes ) const
748 //const double aBestAngle = PI / nbNodes;
749 const double aBestAngle = 180.0 - ( 360.0 / double(nbNodes) );
750 return ( fabs( aBestAngle - Value ));
753 SMDSAbs_ElementType MinimumAngle::GetType() const
759 //================================================================================
762 Description : Functor for calculating aspect ratio
764 //================================================================================
766 double AspectRatio::GetValue( long theId )
769 myCurrElement = myMesh->FindElement( theId );
771 if ( GetPoints( myCurrElement, P ))
772 aVal = Round( GetValue( P ));
776 double AspectRatio::GetValue( const TSequenceOfXYZ& P )
778 // According to "Mesh quality control" by Nadir Bouhamau referring to
779 // Pascal Jean Frey and Paul-Louis George. Maillages, applications aux elements finis.
780 // Hermes Science publications, Paris 1999 ISBN 2-7462-0024-4
783 int nbNodes = P.size();
788 // Compute aspect ratio
790 if ( nbNodes == 3 ) {
791 // Compute lengths of the sides
792 double aLen1 = getDistance( P( 1 ), P( 2 ));
793 double aLen2 = getDistance( P( 2 ), P( 3 ));
794 double aLen3 = getDistance( P( 3 ), P( 1 ));
795 // Q = alfa * h * p / S, where
797 // alfa = sqrt( 3 ) / 6
798 // h - length of the longest edge
799 // p - half perimeter
800 // S - triangle surface
801 const double alfa = sqrt( 3. ) / 6.;
802 double maxLen = Max( aLen1, Max( aLen2, aLen3 ));
803 double half_perimeter = ( aLen1 + aLen2 + aLen3 ) / 2.;
804 double anArea = getArea( P( 1 ), P( 2 ), P( 3 ));
805 if ( anArea <= theEps )
807 return alfa * maxLen * half_perimeter / anArea;
809 else if ( nbNodes == 6 ) { // quadratic triangles
810 // Compute lengths of the sides
811 double aLen1 = getDistance( P( 1 ), P( 3 ));
812 double aLen2 = getDistance( P( 3 ), P( 5 ));
813 double aLen3 = getDistance( P( 5 ), P( 1 ));
814 // algo same as for the linear triangle
815 const double alfa = sqrt( 3. ) / 6.;
816 double maxLen = Max( aLen1, Max( aLen2, aLen3 ));
817 double half_perimeter = ( aLen1 + aLen2 + aLen3 ) / 2.;
818 double anArea = getArea( P( 1 ), P( 3 ), P( 5 ));
819 if ( anArea <= theEps )
821 return alfa * maxLen * half_perimeter / anArea;
823 else if( nbNodes == 4 ) { // quadrangle
824 // Compute lengths of the sides
826 aLen[0] = getDistance( P(1), P(2) );
827 aLen[1] = getDistance( P(2), P(3) );
828 aLen[2] = getDistance( P(3), P(4) );
829 aLen[3] = getDistance( P(4), P(1) );
830 // Compute lengths of the diagonals
832 aDia[0] = getDistance( P(1), P(3) );
833 aDia[1] = getDistance( P(2), P(4) );
834 // Compute areas of all triangles which can be built
835 // taking three nodes of the quadrangle
837 anArea[0] = getArea( P(1), P(2), P(3) );
838 anArea[1] = getArea( P(1), P(2), P(4) );
839 anArea[2] = getArea( P(1), P(3), P(4) );
840 anArea[3] = getArea( P(2), P(3), P(4) );
841 // Q = alpha * L * C1 / C2, where
843 // alpha = sqrt( 1/32 )
844 // L = max( L1, L2, L3, L4, D1, D2 )
845 // C1 = sqrt( L1^2 + L1^2 + L1^2 + L1^2 )
846 // C2 = min( S1, S2, S3, S4 )
847 // Li - lengths of the edges
848 // Di - lengths of the diagonals
849 // Si - areas of the triangles
850 const double alpha = sqrt( 1 / 32. );
851 double L = Max( aLen[ 0 ],
855 Max( aDia[ 0 ], aDia[ 1 ] ) ) ) ) );
856 double C1 = sqrt( aLen[0] * aLen[0] +
860 double C2 = Min( anArea[ 0 ],
862 Min( anArea[ 2 ], anArea[ 3 ] ) ) );
865 return alpha * L * C1 / C2;
867 else if( nbNodes == 8 || nbNodes == 9 ) { // nbNodes==8 - quadratic quadrangle
868 // Compute lengths of the sides
870 aLen[0] = getDistance( P(1), P(3) );
871 aLen[1] = getDistance( P(3), P(5) );
872 aLen[2] = getDistance( P(5), P(7) );
873 aLen[3] = getDistance( P(7), P(1) );
874 // Compute lengths of the diagonals
876 aDia[0] = getDistance( P(1), P(5) );
877 aDia[1] = getDistance( P(3), P(7) );
878 // Compute areas of all triangles which can be built
879 // taking three nodes of the quadrangle
881 anArea[0] = getArea( P(1), P(3), P(5) );
882 anArea[1] = getArea( P(1), P(3), P(7) );
883 anArea[2] = getArea( P(1), P(5), P(7) );
884 anArea[3] = getArea( P(3), P(5), P(7) );
885 // Q = alpha * L * C1 / C2, where
887 // alpha = sqrt( 1/32 )
888 // L = max( L1, L2, L3, L4, D1, D2 )
889 // C1 = sqrt( L1^2 + L1^2 + L1^2 + L1^2 )
890 // C2 = min( S1, S2, S3, S4 )
891 // Li - lengths of the edges
892 // Di - lengths of the diagonals
893 // Si - areas of the triangles
894 const double alpha = sqrt( 1 / 32. );
895 double L = Max( aLen[ 0 ],
899 Max( aDia[ 0 ], aDia[ 1 ] ) ) ) ) );
900 double C1 = sqrt( aLen[0] * aLen[0] +
904 double C2 = Min( anArea[ 0 ],
906 Min( anArea[ 2 ], anArea[ 3 ] ) ) );
909 return alpha * L * C1 / C2;
914 bool AspectRatio::IsApplicable( const SMDS_MeshElement* element ) const
916 return ( NumericalFunctor::IsApplicable( element ) && !element->IsPoly() );
919 double AspectRatio::GetBadRate( double Value, int /*nbNodes*/ ) const
921 // the aspect ratio is in the range [1.0,infinity]
922 // < 1.0 = very bad, zero area
925 return ( Value < 0.9 ) ? 1000 : Value / 1000.;
928 SMDSAbs_ElementType AspectRatio::GetType() const
934 //================================================================================
936 Class : AspectRatio3D
937 Description : Functor for calculating aspect ratio
939 //================================================================================
943 inline double getHalfPerimeter(double theTria[3]){
944 return (theTria[0] + theTria[1] + theTria[2])/2.0;
947 inline double getArea(double theHalfPerim, double theTria[3]){
948 return sqrt(theHalfPerim*
949 (theHalfPerim-theTria[0])*
950 (theHalfPerim-theTria[1])*
951 (theHalfPerim-theTria[2]));
954 inline double getVolume(double theLen[6]){
955 double a2 = theLen[0]*theLen[0];
956 double b2 = theLen[1]*theLen[1];
957 double c2 = theLen[2]*theLen[2];
958 double d2 = theLen[3]*theLen[3];
959 double e2 = theLen[4]*theLen[4];
960 double f2 = theLen[5]*theLen[5];
961 double P = 4.0*a2*b2*d2;
962 double Q = a2*(b2+d2-e2)-b2*(a2+d2-f2)-d2*(a2+b2-c2);
963 double R = (b2+d2-e2)*(a2+d2-f2)*(a2+d2-f2);
964 return sqrt(P-Q+R)/12.0;
967 inline double getVolume2(double theLen[6]){
968 double a2 = theLen[0]*theLen[0];
969 double b2 = theLen[1]*theLen[1];
970 double c2 = theLen[2]*theLen[2];
971 double d2 = theLen[3]*theLen[3];
972 double e2 = theLen[4]*theLen[4];
973 double f2 = theLen[5]*theLen[5];
975 double P = a2*e2*(b2+c2+d2+f2-a2-e2);
976 double Q = b2*f2*(a2+c2+d2+e2-b2-f2);
977 double R = c2*d2*(a2+b2+e2+f2-c2-d2);
978 double S = a2*b2*d2+b2*c2*e2+a2*c2*f2+d2*e2*f2;
980 return sqrt(P+Q+R-S)/12.0;
983 inline double getVolume(const TSequenceOfXYZ& P){
984 gp_Vec aVec1( P( 2 ) - P( 1 ) );
985 gp_Vec aVec2( P( 3 ) - P( 1 ) );
986 gp_Vec aVec3( P( 4 ) - P( 1 ) );
987 gp_Vec anAreaVec( aVec1 ^ aVec2 );
988 return fabs(aVec3 * anAreaVec) / 6.0;
991 inline double getMaxHeight(double theLen[6])
993 double aHeight = std::max(theLen[0],theLen[1]);
994 aHeight = std::max(aHeight,theLen[2]);
995 aHeight = std::max(aHeight,theLen[3]);
996 aHeight = std::max(aHeight,theLen[4]);
997 aHeight = std::max(aHeight,theLen[5]);
1001 //================================================================================
1003 * \brief Standard quality of a tetrahedron but not normalized
1005 //================================================================================
1007 double tetQualityByHomardMethod( const gp_XYZ & p1,
1013 edgeVec[0] = ( p1 - p2 );
1014 edgeVec[1] = ( p2 - p3 );
1015 edgeVec[2] = ( p3 - p1 );
1016 edgeVec[3] = ( p4 - p1 );
1017 edgeVec[4] = ( p4 - p2 );
1018 edgeVec[5] = ( p4 - p3 );
1020 double maxEdgeLen2 = edgeVec[0].SquareModulus();
1021 maxEdgeLen2 = Max( maxEdgeLen2, edgeVec[1].SquareModulus() );
1022 maxEdgeLen2 = Max( maxEdgeLen2, edgeVec[2].SquareModulus() );
1023 maxEdgeLen2 = Max( maxEdgeLen2, edgeVec[3].SquareModulus() );
1024 maxEdgeLen2 = Max( maxEdgeLen2, edgeVec[4].SquareModulus() );
1025 maxEdgeLen2 = Max( maxEdgeLen2, edgeVec[5].SquareModulus() );
1026 double maxEdgeLen = Sqrt( maxEdgeLen2 );
1028 gp_XYZ cross01 = edgeVec[0] ^ edgeVec[1];
1029 double sumArea = ( cross01 ).Modulus(); // actually double area
1030 sumArea += ( edgeVec[0] ^ edgeVec[3] ).Modulus();
1031 sumArea += ( edgeVec[1] ^ edgeVec[4] ).Modulus();
1032 sumArea += ( edgeVec[2] ^ edgeVec[5] ).Modulus();
1034 double sixVolume = Abs( cross01 * edgeVec[4] ); // 6 * volume
1035 double quality = maxEdgeLen * sumArea / sixVolume; // not normalized!!!
1039 //================================================================================
1041 * \brief HOMARD method of hexahedron quality
1042 * 1. Decompose the hexa into 24 tetra: each face is splitted into 4 triangles by
1043 * adding the diagonals and every triangle is connected to the center of the hexa.
1044 * 2. Compute the quality of every tetra with the same formula as for the standard quality,
1045 * except that the factor for the normalization is not the same because the final goal
1046 * is to have a quality equal to 1 for a perfect cube. So the formula is:
1047 * qual = max(lengthes of 6 edges) * (sum of surfaces of 4 faces) / (7.6569*6*volume)
1048 * 3. The quality of the hexa is the highest value of the qualities of the 24 tetra
1050 //================================================================================
1052 double hexQualityByHomardMethod( const TSequenceOfXYZ& P )
1054 gp_XYZ quadCenter[6];
1055 quadCenter[0] = ( P(1) + P(2) + P(3) + P(4) ) / 4.;
1056 quadCenter[1] = ( P(5) + P(6) + P(7) + P(8) ) / 4.;
1057 quadCenter[2] = ( P(1) + P(2) + P(6) + P(5) ) / 4.;
1058 quadCenter[3] = ( P(2) + P(3) + P(7) + P(6) ) / 4.;
1059 quadCenter[4] = ( P(3) + P(4) + P(8) + P(7) ) / 4.;
1060 quadCenter[5] = ( P(1) + P(4) + P(8) + P(5) ) / 4.;
1062 gp_XYZ hexCenter = ( P(1) + P(2) + P(3) + P(4) + P(5) + P(6) + P(7) + P(8) ) / 8.;
1064 // quad 1 ( 1 2 3 4 )
1065 double quality = tetQualityByHomardMethod( P(1), P(2), quadCenter[0], hexCenter );
1066 quality = Max( quality, tetQualityByHomardMethod( P(2), P(3), quadCenter[0], hexCenter ));
1067 quality = Max( quality, tetQualityByHomardMethod( P(3), P(4), quadCenter[0], hexCenter ));
1068 quality = Max( quality, tetQualityByHomardMethod( P(4), P(1), quadCenter[0], hexCenter ));
1069 // quad 2 ( 5 6 7 8 )
1070 quality = Max( quality, tetQualityByHomardMethod( P(5), P(6), quadCenter[1], hexCenter ));
1071 quality = Max( quality, tetQualityByHomardMethod( P(6), P(7), quadCenter[1], hexCenter ));
1072 quality = Max( quality, tetQualityByHomardMethod( P(7), P(8), quadCenter[1], hexCenter ));
1073 quality = Max( quality, tetQualityByHomardMethod( P(8), P(5), quadCenter[1], hexCenter ));
1074 // quad 3 ( 1 2 6 5 )
1075 quality = Max( quality, tetQualityByHomardMethod( P(1), P(2), quadCenter[2], hexCenter ));
1076 quality = Max( quality, tetQualityByHomardMethod( P(2), P(6), quadCenter[2], hexCenter ));
1077 quality = Max( quality, tetQualityByHomardMethod( P(6), P(5), quadCenter[2], hexCenter ));
1078 quality = Max( quality, tetQualityByHomardMethod( P(5), P(1), quadCenter[2], hexCenter ));
1079 // quad 4 ( 2 3 7 6 )
1080 quality = Max( quality, tetQualityByHomardMethod( P(2), P(3), quadCenter[3], hexCenter ));
1081 quality = Max( quality, tetQualityByHomardMethod( P(3), P(7), quadCenter[3], hexCenter ));
1082 quality = Max( quality, tetQualityByHomardMethod( P(7), P(6), quadCenter[3], hexCenter ));
1083 quality = Max( quality, tetQualityByHomardMethod( P(6), P(2), quadCenter[3], hexCenter ));
1084 // quad 5 ( 3 4 8 7 )
1085 quality = Max( quality, tetQualityByHomardMethod( P(3), P(4), quadCenter[4], hexCenter ));
1086 quality = Max( quality, tetQualityByHomardMethod( P(4), P(8), quadCenter[4], hexCenter ));
1087 quality = Max( quality, tetQualityByHomardMethod( P(8), P(7), quadCenter[4], hexCenter ));
1088 quality = Max( quality, tetQualityByHomardMethod( P(7), P(3), quadCenter[4], hexCenter ));
1089 // quad 6 ( 1 4 8 5 )
1090 quality = Max( quality, tetQualityByHomardMethod( P(1), P(4), quadCenter[5], hexCenter ));
1091 quality = Max( quality, tetQualityByHomardMethod( P(4), P(8), quadCenter[5], hexCenter ));
1092 quality = Max( quality, tetQualityByHomardMethod( P(8), P(5), quadCenter[5], hexCenter ));
1093 quality = Max( quality, tetQualityByHomardMethod( P(5), P(1), quadCenter[5], hexCenter ));
1095 return quality / 7.65685424949;
1099 double AspectRatio3D::GetValue( long theId )
1102 myCurrElement = myMesh->FindElement( theId );
1103 if ( myCurrElement && myCurrElement->GetVtkType() == VTK_TETRA )
1105 // Action from CoTech | ACTION 31.3:
1106 // EURIWARE BO: Homogenize the formulas used to calculate the Controls in SMESH to fit with
1107 // those of ParaView. The library used by ParaView for those calculations can be reused in SMESH.
1108 vtkUnstructuredGrid* grid = const_cast<SMDS_Mesh*>( myMesh )->GetGrid();
1109 if ( vtkCell* avtkCell = grid->GetCell( myCurrElement->GetVtkID() ))
1110 aVal = Round( vtkMeshQuality::TetAspectRatio( avtkCell ));
1115 if ( GetPoints( myCurrElement, P ))
1116 aVal = Round( GetValue( P ));
1121 bool AspectRatio3D::IsApplicable( const SMDS_MeshElement* element ) const
1123 return ( NumericalFunctor::IsApplicable( element ) && !element->IsPoly() );
1126 double AspectRatio3D::GetValue( const TSequenceOfXYZ& P )
1128 double aQuality = 0.0;
1129 if(myCurrElement->IsPoly()) return aQuality;
1131 int nbNodes = P.size();
1133 if( myCurrElement->IsQuadratic() ) {
1134 if (nbNodes==10) nbNodes=4; // quadratic tetrahedron
1135 else if(nbNodes==13) nbNodes=5; // quadratic pyramid
1136 else if(nbNodes==15) nbNodes=6; // quadratic pentahedron
1137 else if(nbNodes==20) nbNodes=8; // quadratic hexahedron
1138 else if(nbNodes==27) nbNodes=8; // tri-quadratic hexahedron
1139 else return aQuality;
1145 getDistance(P( 1 ),P( 2 )), // a
1146 getDistance(P( 2 ),P( 3 )), // b
1147 getDistance(P( 3 ),P( 1 )), // c
1148 getDistance(P( 2 ),P( 4 )), // d
1149 getDistance(P( 3 ),P( 4 )), // e
1150 getDistance(P( 1 ),P( 4 )) // f
1152 double aTria[4][3] = {
1153 {aLen[0],aLen[1],aLen[2]}, // abc
1154 {aLen[0],aLen[3],aLen[5]}, // adf
1155 {aLen[1],aLen[3],aLen[4]}, // bde
1156 {aLen[2],aLen[4],aLen[5]} // cef
1158 double aSumArea = 0.0;
1159 double aHalfPerimeter = getHalfPerimeter(aTria[0]);
1160 double anArea = getArea(aHalfPerimeter,aTria[0]);
1162 aHalfPerimeter = getHalfPerimeter(aTria[1]);
1163 anArea = getArea(aHalfPerimeter,aTria[1]);
1165 aHalfPerimeter = getHalfPerimeter(aTria[2]);
1166 anArea = getArea(aHalfPerimeter,aTria[2]);
1168 aHalfPerimeter = getHalfPerimeter(aTria[3]);
1169 anArea = getArea(aHalfPerimeter,aTria[3]);
1171 double aVolume = getVolume(P);
1172 //double aVolume = getVolume(aLen);
1173 double aHeight = getMaxHeight(aLen);
1174 static double aCoeff = sqrt(2.0)/12.0;
1175 if ( aVolume > DBL_MIN )
1176 aQuality = aCoeff*aHeight*aSumArea/aVolume;
1181 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 3 ),P( 5 )};
1182 aQuality = GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4]));
1185 gp_XYZ aXYZ[4] = {P( 1 ),P( 3 ),P( 4 ),P( 5 )};
1186 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1189 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 5 )};
1190 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1193 gp_XYZ aXYZ[4] = {P( 2 ),P( 3 ),P( 4 ),P( 5 )};
1194 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1200 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 6 )};
1201 aQuality = GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4]));
1204 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 3 )};
1205 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1208 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 6 )};
1209 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1212 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 3 )};
1213 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1216 gp_XYZ aXYZ[4] = {P( 2 ),P( 5 ),P( 4 ),P( 6 )};
1217 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1220 gp_XYZ aXYZ[4] = {P( 2 ),P( 5 ),P( 4 ),P( 3 )};
1221 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1227 return hexQualityByHomardMethod( P ); // bos #23982
1231 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 3 )};
1232 aQuality = GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4]));
1235 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 4 )};
1236 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1239 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 7 )};
1240 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1243 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 5 ),P( 8 )};
1244 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1247 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 3 )};
1248 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1251 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 4 )};
1252 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1255 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 7 )};
1256 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1259 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 6 ),P( 8 )};
1260 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1263 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 3 )};
1264 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1267 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 4 )};
1268 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1271 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 7 )};
1272 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1275 gp_XYZ aXYZ[4] = {P( 2 ),P( 6 ),P( 5 ),P( 8 )};
1276 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1279 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 1 )};
1280 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1283 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 2 )};
1284 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1287 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 5 )};
1288 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1291 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 8 ),P( 6 )};
1292 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1295 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 1 )};
1296 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1299 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 2 )};
1300 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1303 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 5 )};
1304 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1307 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 7 ),P( 6 )};
1308 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1311 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 1 )};
1312 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1315 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 2 )};
1316 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1319 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 5 )};
1320 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1323 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 6 )};
1324 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1327 gp_XYZ aXYZ[4] = {P( 4 ),P( 8 ),P( 7 ),P( 2 )};
1328 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1331 gp_XYZ aXYZ[4] = {P( 4 ),P( 5 ),P( 8 ),P( 2 )};
1332 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1335 gp_XYZ aXYZ[4] = {P( 1 ),P( 4 ),P( 5 ),P( 3 )};
1336 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1339 gp_XYZ aXYZ[4] = {P( 3 ),P( 6 ),P( 7 ),P( 1 )};
1340 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1343 gp_XYZ aXYZ[4] = {P( 2 ),P( 3 ),P( 6 ),P( 4 )};
1344 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1347 gp_XYZ aXYZ[4] = {P( 5 ),P( 6 ),P( 8 ),P( 3 )};
1348 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1351 gp_XYZ aXYZ[4] = {P( 7 ),P( 8 ),P( 6 ),P( 1 )};
1352 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1355 gp_XYZ aXYZ[4] = {P( 1 ),P( 2 ),P( 4 ),P( 7 )};
1356 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1359 gp_XYZ aXYZ[4] = {P( 3 ),P( 4 ),P( 2 ),P( 5 )};
1360 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[4])),aQuality);
1366 gp_XYZ aXYZ[8] = {P( 1 ),P( 2 ),P( 4 ),P( 5 ),P( 7 ),P( 8 ),P( 10 ),P( 11 )};
1367 aQuality = GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[8]));
1370 gp_XYZ aXYZ[8] = {P( 2 ),P( 3 ),P( 5 ),P( 6 ),P( 8 ),P( 9 ),P( 11 ),P( 12 )};
1371 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[8])),aQuality);
1374 gp_XYZ aXYZ[8] = {P( 3 ),P( 4 ),P( 6 ),P( 1 ),P( 9 ),P( 10 ),P( 12 ),P( 7 )};
1375 aQuality = std::max(GetValue(TSequenceOfXYZ(&aXYZ[0],&aXYZ[8])),aQuality);
1378 } // switch(nbNodes)
1380 if ( nbNodes > 4 ) {
1381 // evaluate aspect ratio of quadrangle faces
1382 AspectRatio aspect2D;
1383 SMDS_VolumeTool::VolumeType type = SMDS_VolumeTool::GetType( nbNodes );
1384 int nbFaces = SMDS_VolumeTool::NbFaces( type );
1385 TSequenceOfXYZ points(4);
1386 for ( int i = 0; i < nbFaces; ++i ) { // loop on faces of a volume
1387 if ( SMDS_VolumeTool::NbFaceNodes( type, i ) != 4 )
1389 const int* pInd = SMDS_VolumeTool::GetFaceNodesIndices( type, i, true );
1390 for ( int p = 0; p < 4; ++p ) // loop on nodes of a quadrangle face
1391 points( p + 1 ) = P( pInd[ p ] + 1 );
1392 aQuality = std::max( aQuality, aspect2D.GetValue( points ));
1398 double AspectRatio3D::GetBadRate( double Value, int /*nbNodes*/ ) const
1400 // the aspect ratio is in the range [1.0,infinity]
1403 return Value / 1000.;
1406 SMDSAbs_ElementType AspectRatio3D::GetType() const
1408 return SMDSAbs_Volume;
1412 //================================================================================
1415 Description : Functor for calculating warping
1417 //================================================================================
1419 bool Warping::IsApplicable( const SMDS_MeshElement* element ) const
1421 return NumericalFunctor::IsApplicable( element ) && element->NbNodes() == 4;
1424 double Warping::GetValue( const TSequenceOfXYZ& P )
1426 if ( P.size() != 4 )
1429 gp_XYZ G = ( P( 1 ) + P( 2 ) + P( 3 ) + P( 4 ) ) / 4.;
1431 double A1 = ComputeA( P( 1 ), P( 2 ), P( 3 ), G );
1432 double A2 = ComputeA( P( 2 ), P( 3 ), P( 4 ), G );
1433 double A3 = ComputeA( P( 3 ), P( 4 ), P( 1 ), G );
1434 double A4 = ComputeA( P( 4 ), P( 1 ), P( 2 ), G );
1436 double val = Max( Max( A1, A2 ), Max( A3, A4 ) );
1438 const double eps = 0.1; // val is in degrees
1440 return val < eps ? 0. : val;
1443 double Warping::ComputeA( const gp_XYZ& thePnt1,
1444 const gp_XYZ& thePnt2,
1445 const gp_XYZ& thePnt3,
1446 const gp_XYZ& theG ) const
1448 double aLen1 = gp_Pnt( thePnt1 ).Distance( gp_Pnt( thePnt2 ) );
1449 double aLen2 = gp_Pnt( thePnt2 ).Distance( gp_Pnt( thePnt3 ) );
1450 double L = Min( aLen1, aLen2 ) * 0.5;
1454 gp_XYZ GI = ( thePnt2 + thePnt1 ) / 2. - theG;
1455 gp_XYZ GJ = ( thePnt3 + thePnt2 ) / 2. - theG;
1456 gp_XYZ N = GI.Crossed( GJ );
1458 if ( N.Modulus() < gp::Resolution() )
1463 double H = ( thePnt2 - theG ).Dot( N );
1464 return asin( fabs( H / L ) ) * 180. / M_PI;
1467 double Warping::GetBadRate( double Value, int /*nbNodes*/ ) const
1469 // the warp is in the range [0.0,PI/2]
1470 // 0.0 = good (no warp)
1471 // PI/2 = bad (face pliee)
1475 SMDSAbs_ElementType Warping::GetType() const
1477 return SMDSAbs_Face;
1481 //================================================================================
1484 Description : Functor for calculating taper
1486 //================================================================================
1488 bool Taper::IsApplicable( const SMDS_MeshElement* element ) const
1490 return ( NumericalFunctor::IsApplicable( element ) && element->NbNodes() == 4 );
1493 double Taper::GetValue( const TSequenceOfXYZ& P )
1495 if ( P.size() != 4 )
1499 double J1 = getArea( P( 4 ), P( 1 ), P( 2 ) );
1500 double J2 = getArea( P( 3 ), P( 1 ), P( 2 ) );
1501 double J3 = getArea( P( 2 ), P( 3 ), P( 4 ) );
1502 double J4 = getArea( P( 3 ), P( 4 ), P( 1 ) );
1504 double JA = 0.25 * ( J1 + J2 + J3 + J4 );
1508 double T1 = fabs( ( J1 - JA ) / JA );
1509 double T2 = fabs( ( J2 - JA ) / JA );
1510 double T3 = fabs( ( J3 - JA ) / JA );
1511 double T4 = fabs( ( J4 - JA ) / JA );
1513 double val = Max( Max( T1, T2 ), Max( T3, T4 ) );
1515 const double eps = 0.01;
1517 return val < eps ? 0. : val;
1520 double Taper::GetBadRate( double Value, int /*nbNodes*/ ) const
1522 // the taper is in the range [0.0,1.0]
1523 // 0.0 = good (no taper)
1524 // 1.0 = bad (les cotes opposes sont allignes)
1528 SMDSAbs_ElementType Taper::GetType() const
1530 return SMDSAbs_Face;
1533 //================================================================================
1536 Description : Functor for calculating skew in degrees
1538 //================================================================================
1540 static inline double skewAngle( const gp_XYZ& p1, const gp_XYZ& p2, const gp_XYZ& p3 )
1542 gp_XYZ p12 = ( p2 + p1 ) / 2.;
1543 gp_XYZ p23 = ( p3 + p2 ) / 2.;
1544 gp_XYZ p31 = ( p3 + p1 ) / 2.;
1546 gp_Vec v1( p31 - p2 ), v2( p12 - p23 );
1548 return v1.Magnitude() < gp::Resolution() || v2.Magnitude() < gp::Resolution() ? 0. : v1.Angle( v2 );
1551 bool Skew::IsApplicable( const SMDS_MeshElement* element ) const
1553 return ( NumericalFunctor::IsApplicable( element ) && element->NbNodes() <= 4 );
1556 double Skew::GetValue( const TSequenceOfXYZ& P )
1558 if ( P.size() != 3 && P.size() != 4 )
1562 const double PI2 = M_PI / 2.;
1563 if ( P.size() == 3 )
1565 double A0 = fabs( PI2 - skewAngle( P( 3 ), P( 1 ), P( 2 ) ) );
1566 double A1 = fabs( PI2 - skewAngle( P( 1 ), P( 2 ), P( 3 ) ) );
1567 double A2 = fabs( PI2 - skewAngle( P( 2 ), P( 3 ), P( 1 ) ) );
1569 return Max( A0, Max( A1, A2 ) ) * 180. / M_PI;
1573 gp_XYZ p12 = ( P( 1 ) + P( 2 ) ) / 2.;
1574 gp_XYZ p23 = ( P( 2 ) + P( 3 ) ) / 2.;
1575 gp_XYZ p34 = ( P( 3 ) + P( 4 ) ) / 2.;
1576 gp_XYZ p41 = ( P( 4 ) + P( 1 ) ) / 2.;
1578 gp_Vec v1( p34 - p12 ), v2( p23 - p41 );
1579 double A = v1.Magnitude() <= gp::Resolution() || v2.Magnitude() <= gp::Resolution()
1580 ? 0. : fabs( PI2 - v1.Angle( v2 ) );
1582 double val = A * 180. / M_PI;
1584 const double eps = 0.1; // val is in degrees
1586 return val < eps ? 0. : val;
1590 double Skew::GetBadRate( double Value, int /*nbNodes*/ ) const
1592 // the skew is in the range [0.0,PI/2].
1598 SMDSAbs_ElementType Skew::GetType() const
1600 return SMDSAbs_Face;
1604 //================================================================================
1607 Description : Functor for calculating area
1609 //================================================================================
1611 double Area::GetValue( const TSequenceOfXYZ& P )
1616 gp_Vec aVec1( P(2) - P(1) );
1617 gp_Vec aVec2( P(3) - P(1) );
1618 gp_Vec SumVec = aVec1 ^ aVec2;
1620 for (size_t i=4; i<=P.size(); i++)
1622 gp_Vec aVec1( P(i-1) - P(1) );
1623 gp_Vec aVec2( P(i ) - P(1) );
1624 gp_Vec tmp = aVec1 ^ aVec2;
1627 val = SumVec.Magnitude() * 0.5;
1632 double Area::GetBadRate( double Value, int /*nbNodes*/ ) const
1634 // meaningless as it is not a quality control functor
1638 SMDSAbs_ElementType Area::GetType() const
1640 return SMDSAbs_Face;
1643 //================================================================================
1646 Description : Functor for calculating length of edge
1648 //================================================================================
1650 double Length::GetValue( const TSequenceOfXYZ& P )
1652 switch ( P.size() ) {
1653 case 2: return getDistance( P( 1 ), P( 2 ) );
1654 case 3: return getDistance( P( 1 ), P( 2 ) ) + getDistance( P( 2 ), P( 3 ) );
1659 double Length::GetBadRate( double Value, int /*nbNodes*/ ) const
1661 // meaningless as it is not quality control functor
1665 SMDSAbs_ElementType Length::GetType() const
1667 return SMDSAbs_Edge;
1670 //================================================================================
1673 Description : Functor for calculating minimal length of element edge
1675 //================================================================================
1677 Length3D::Length3D():
1678 Length2D ( SMDSAbs_Volume )
1682 //================================================================================
1685 Description : Functor for calculating minimal length of element edge
1687 //================================================================================
1689 Length2D::Length2D( SMDSAbs_ElementType type ):
1694 bool Length2D::IsApplicable( const SMDS_MeshElement* element ) const
1696 return ( NumericalFunctor::IsApplicable( element ) &&
1697 element->GetEntityType() != SMDSEntity_Polyhedra );
1700 double Length2D::GetValue( const TSequenceOfXYZ& P )
1704 SMDSAbs_EntityType aType = P.getElementEntity();
1707 case SMDSEntity_Edge:
1709 aVal = getDistance( P( 1 ), P( 2 ) );
1711 case SMDSEntity_Quad_Edge:
1712 if (len == 3) // quadratic edge
1713 aVal = getDistance(P( 1 ),P( 3 )) + getDistance(P( 3 ),P( 2 ));
1715 case SMDSEntity_Triangle:
1716 if (len == 3){ // triangles
1717 double L1 = getDistance(P( 1 ),P( 2 ));
1718 double L2 = getDistance(P( 2 ),P( 3 ));
1719 double L3 = getDistance(P( 3 ),P( 1 ));
1720 aVal = Min(L1,Min(L2,L3));
1723 case SMDSEntity_Quadrangle:
1724 if (len == 4){ // quadrangles
1725 double L1 = getDistance(P( 1 ),P( 2 ));
1726 double L2 = getDistance(P( 2 ),P( 3 ));
1727 double L3 = getDistance(P( 3 ),P( 4 ));
1728 double L4 = getDistance(P( 4 ),P( 1 ));
1729 aVal = Min(Min(L1,L2),Min(L3,L4));
1732 case SMDSEntity_Quad_Triangle:
1733 case SMDSEntity_BiQuad_Triangle:
1734 if (len >= 6){ // quadratic triangles
1735 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
1736 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1737 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 1 ));
1738 aVal = Min(L1,Min(L2,L3));
1741 case SMDSEntity_Quad_Quadrangle:
1742 case SMDSEntity_BiQuad_Quadrangle:
1743 if (len >= 8){ // quadratic quadrangles
1744 double L1 = getDistance(P( 1 ),P( 2 )) + getDistance(P( 2 ),P( 3 ));
1745 double L2 = getDistance(P( 3 ),P( 4 )) + getDistance(P( 4 ),P( 5 ));
1746 double L3 = getDistance(P( 5 ),P( 6 )) + getDistance(P( 6 ),P( 7 ));
1747 double L4 = getDistance(P( 7 ),P( 8 )) + getDistance(P( 8 ),P( 1 ));
1748 aVal = Min(Min(L1,L2),Min(L3,L4));
1751 case SMDSEntity_Tetra:
1752 if (len == 4){ // tetrahedra
1753 double L1 = getDistance(P( 1 ),P( 2 ));
1754 double L2 = getDistance(P( 2 ),P( 3 ));
1755 double L3 = getDistance(P( 3 ),P( 1 ));
1756 double L4 = getDistance(P( 1 ),P( 4 ));
1757 double L5 = getDistance(P( 2 ),P( 4 ));
1758 double L6 = getDistance(P( 3 ),P( 4 ));
1759 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1762 case SMDSEntity_Pyramid:
1763 if (len == 5){ // pyramid
1764 double L1 = getDistance(P( 1 ),P( 2 ));
1765 double L2 = getDistance(P( 2 ),P( 3 ));
1766 double L3 = getDistance(P( 3 ),P( 4 ));
1767 double L4 = getDistance(P( 4 ),P( 1 ));
1768 double L5 = getDistance(P( 1 ),P( 5 ));
1769 double L6 = getDistance(P( 2 ),P( 5 ));
1770 double L7 = getDistance(P( 3 ),P( 5 ));
1771 double L8 = getDistance(P( 4 ),P( 5 ));
1773 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1774 aVal = Min(aVal,Min(L7,L8));
1777 case SMDSEntity_Penta:
1778 if (len == 6) { // pentahedron
1779 double L1 = getDistance(P( 1 ),P( 2 ));
1780 double L2 = getDistance(P( 2 ),P( 3 ));
1781 double L3 = getDistance(P( 3 ),P( 1 ));
1782 double L4 = getDistance(P( 4 ),P( 5 ));
1783 double L5 = getDistance(P( 5 ),P( 6 ));
1784 double L6 = getDistance(P( 6 ),P( 4 ));
1785 double L7 = getDistance(P( 1 ),P( 4 ));
1786 double L8 = getDistance(P( 2 ),P( 5 ));
1787 double L9 = getDistance(P( 3 ),P( 6 ));
1789 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1790 aVal = Min(aVal,Min(Min(L7,L8),L9));
1793 case SMDSEntity_Hexa:
1794 if (len == 8){ // hexahedron
1795 double L1 = getDistance(P( 1 ),P( 2 ));
1796 double L2 = getDistance(P( 2 ),P( 3 ));
1797 double L3 = getDistance(P( 3 ),P( 4 ));
1798 double L4 = getDistance(P( 4 ),P( 1 ));
1799 double L5 = getDistance(P( 5 ),P( 6 ));
1800 double L6 = getDistance(P( 6 ),P( 7 ));
1801 double L7 = getDistance(P( 7 ),P( 8 ));
1802 double L8 = getDistance(P( 8 ),P( 5 ));
1803 double L9 = getDistance(P( 1 ),P( 5 ));
1804 double L10= getDistance(P( 2 ),P( 6 ));
1805 double L11= getDistance(P( 3 ),P( 7 ));
1806 double L12= getDistance(P( 4 ),P( 8 ));
1808 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1809 aVal = Min(aVal,Min(Min(L7,L8),Min(L9,L10)));
1810 aVal = Min(aVal,Min(L11,L12));
1813 case SMDSEntity_Quad_Tetra:
1814 if (len == 10){ // quadratic tetrahedron
1815 double L1 = getDistance(P( 1 ),P( 5 )) + getDistance(P( 5 ),P( 2 ));
1816 double L2 = getDistance(P( 2 ),P( 6 )) + getDistance(P( 6 ),P( 3 ));
1817 double L3 = getDistance(P( 3 ),P( 7 )) + getDistance(P( 7 ),P( 1 ));
1818 double L4 = getDistance(P( 1 ),P( 8 )) + getDistance(P( 8 ),P( 4 ));
1819 double L5 = getDistance(P( 2 ),P( 9 )) + getDistance(P( 9 ),P( 4 ));
1820 double L6 = getDistance(P( 3 ),P( 10 )) + getDistance(P( 10 ),P( 4 ));
1821 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1824 case SMDSEntity_Quad_Pyramid:
1825 if (len == 13){ // quadratic pyramid
1826 double L1 = getDistance(P( 1 ),P( 6 )) + getDistance(P( 6 ),P( 2 ));
1827 double L2 = getDistance(P( 2 ),P( 7 )) + getDistance(P( 7 ),P( 3 ));
1828 double L3 = getDistance(P( 3 ),P( 8 )) + getDistance(P( 8 ),P( 4 ));
1829 double L4 = getDistance(P( 4 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1830 double L5 = getDistance(P( 1 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1831 double L6 = getDistance(P( 2 ),P( 11 )) + getDistance(P( 11 ),P( 5 ));
1832 double L7 = getDistance(P( 3 ),P( 12 )) + getDistance(P( 12 ),P( 5 ));
1833 double L8 = getDistance(P( 4 ),P( 13 )) + getDistance(P( 13 ),P( 5 ));
1834 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1835 aVal = Min(aVal,Min(L7,L8));
1838 case SMDSEntity_Quad_Penta:
1839 case SMDSEntity_BiQuad_Penta:
1840 if (len >= 15){ // quadratic pentahedron
1841 double L1 = getDistance(P( 1 ),P( 7 )) + getDistance(P( 7 ),P( 2 ));
1842 double L2 = getDistance(P( 2 ),P( 8 )) + getDistance(P( 8 ),P( 3 ));
1843 double L3 = getDistance(P( 3 ),P( 9 )) + getDistance(P( 9 ),P( 1 ));
1844 double L4 = getDistance(P( 4 ),P( 10 )) + getDistance(P( 10 ),P( 5 ));
1845 double L5 = getDistance(P( 5 ),P( 11 )) + getDistance(P( 11 ),P( 6 ));
1846 double L6 = getDistance(P( 6 ),P( 12 )) + getDistance(P( 12 ),P( 4 ));
1847 double L7 = getDistance(P( 1 ),P( 13 )) + getDistance(P( 13 ),P( 4 ));
1848 double L8 = getDistance(P( 2 ),P( 14 )) + getDistance(P( 14 ),P( 5 ));
1849 double L9 = getDistance(P( 3 ),P( 15 )) + getDistance(P( 15 ),P( 6 ));
1850 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1851 aVal = Min(aVal,Min(Min(L7,L8),L9));
1854 case SMDSEntity_Quad_Hexa:
1855 case SMDSEntity_TriQuad_Hexa:
1856 if (len >= 20) { // quadratic hexahedron
1857 double L1 = getDistance(P( 1 ),P( 9 )) + getDistance(P( 9 ),P( 2 ));
1858 double L2 = getDistance(P( 2 ),P( 10 )) + getDistance(P( 10 ),P( 3 ));
1859 double L3 = getDistance(P( 3 ),P( 11 )) + getDistance(P( 11 ),P( 4 ));
1860 double L4 = getDistance(P( 4 ),P( 12 )) + getDistance(P( 12 ),P( 1 ));
1861 double L5 = getDistance(P( 5 ),P( 13 )) + getDistance(P( 13 ),P( 6 ));
1862 double L6 = getDistance(P( 6 ),P( 14 )) + getDistance(P( 14 ),P( 7 ));
1863 double L7 = getDistance(P( 7 ),P( 15 )) + getDistance(P( 15 ),P( 8 ));
1864 double L8 = getDistance(P( 8 ),P( 16 )) + getDistance(P( 16 ),P( 5 ));
1865 double L9 = getDistance(P( 1 ),P( 17 )) + getDistance(P( 17 ),P( 5 ));
1866 double L10= getDistance(P( 2 ),P( 18 )) + getDistance(P( 18 ),P( 6 ));
1867 double L11= getDistance(P( 3 ),P( 19 )) + getDistance(P( 19 ),P( 7 ));
1868 double L12= getDistance(P( 4 ),P( 20 )) + getDistance(P( 20 ),P( 8 ));
1869 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1870 aVal = Min(aVal,Min(Min(L7,L8),Min(L9,L10)));
1871 aVal = Min(aVal,Min(L11,L12));
1874 case SMDSEntity_Polygon:
1876 aVal = getDistance( P(1), P( P.size() ));
1877 for ( size_t i = 1; i < P.size(); ++i )
1878 aVal = Min( aVal, getDistance( P( i ), P( i+1 )));
1881 case SMDSEntity_Quad_Polygon:
1883 aVal = getDistance( P(1), P( P.size() )) + getDistance( P(P.size()), P( P.size()-1 ));
1884 for ( size_t i = 1; i < P.size()-1; i += 2 )
1885 aVal = Min( aVal, getDistance( P( i ), P( i+1 )) + getDistance( P( i+1 ), P( i+2 )));
1888 case SMDSEntity_Hexagonal_Prism:
1889 if (len == 12) { // hexagonal prism
1890 double L1 = getDistance(P( 1 ),P( 2 ));
1891 double L2 = getDistance(P( 2 ),P( 3 ));
1892 double L3 = getDistance(P( 3 ),P( 4 ));
1893 double L4 = getDistance(P( 4 ),P( 5 ));
1894 double L5 = getDistance(P( 5 ),P( 6 ));
1895 double L6 = getDistance(P( 6 ),P( 1 ));
1897 double L7 = getDistance(P( 7 ), P( 8 ));
1898 double L8 = getDistance(P( 8 ), P( 9 ));
1899 double L9 = getDistance(P( 9 ), P( 10 ));
1900 double L10= getDistance(P( 10 ),P( 11 ));
1901 double L11= getDistance(P( 11 ),P( 12 ));
1902 double L12= getDistance(P( 12 ),P( 7 ));
1904 double L13 = getDistance(P( 1 ),P( 7 ));
1905 double L14 = getDistance(P( 2 ),P( 8 ));
1906 double L15 = getDistance(P( 3 ),P( 9 ));
1907 double L16 = getDistance(P( 4 ),P( 10 ));
1908 double L17 = getDistance(P( 5 ),P( 11 ));
1909 double L18 = getDistance(P( 6 ),P( 12 ));
1910 aVal = Min(Min(Min(L1,L2),Min(L3,L4)),Min(L5,L6));
1911 aVal = Min(aVal, Min(Min(Min(L7,L8),Min(L9,L10)),Min(L11,L12)));
1912 aVal = Min(aVal, Min(Min(Min(L13,L14),Min(L15,L16)),Min(L17,L18)));
1915 case SMDSEntity_Polyhedra:
1927 if ( myPrecision >= 0 )
1929 double prec = pow( 10., (double)( myPrecision ) );
1930 aVal = floor( aVal * prec + 0.5 ) / prec;
1936 double Length2D::GetBadRate( double Value, int /*nbNodes*/ ) const
1938 // meaningless as it is not a quality control functor
1942 SMDSAbs_ElementType Length2D::GetType() const
1947 Length2D::Value::Value(double theLength,long thePntId1, long thePntId2):
1950 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
1951 if(thePntId1 > thePntId2){
1952 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
1956 bool Length2D::Value::operator<(const Length2D::Value& x) const
1958 if(myPntId[0] < x.myPntId[0]) return true;
1959 if(myPntId[0] == x.myPntId[0])
1960 if(myPntId[1] < x.myPntId[1]) return true;
1964 void Length2D::GetValues(TValues& theValues)
1966 if ( myType == SMDSAbs_Face )
1968 for ( SMDS_FaceIteratorPtr anIter = myMesh->facesIterator(); anIter->more(); )
1970 const SMDS_MeshFace* anElem = anIter->next();
1971 if ( anElem->IsQuadratic() )
1973 // use special nodes iterator
1974 SMDS_NodeIteratorPtr anIter = anElem->interlacedNodesIterator();
1975 smIdType aNodeId[4] = { 0,0,0,0 };
1979 if ( anIter->more() )
1981 const SMDS_MeshNode* aNode = anIter->next();
1982 P[0] = P[1] = SMESH_NodeXYZ( aNode );
1983 aNodeId[0] = aNodeId[1] = aNode->GetID();
1986 for ( ; anIter->more(); )
1988 const SMDS_MeshNode* N1 = anIter->next();
1989 P[2] = SMESH_NodeXYZ( N1 );
1990 aNodeId[2] = N1->GetID();
1991 aLength = P[1].Distance(P[2]);
1992 if(!anIter->more()) break;
1993 const SMDS_MeshNode* N2 = anIter->next();
1994 P[3] = SMESH_NodeXYZ( N2 );
1995 aNodeId[3] = N2->GetID();
1996 aLength += P[2].Distance(P[3]);
1997 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
1998 Value aValue2(aLength,aNodeId[2],aNodeId[3]);
2000 aNodeId[1] = aNodeId[3];
2001 theValues.insert(aValue1);
2002 theValues.insert(aValue2);
2004 aLength += P[2].Distance(P[0]);
2005 Value aValue1(aLength,aNodeId[1],aNodeId[2]);
2006 Value aValue2(aLength,aNodeId[2],aNodeId[0]);
2007 theValues.insert(aValue1);
2008 theValues.insert(aValue2);
2011 SMDS_NodeIteratorPtr aNodesIter = anElem->nodeIterator();
2012 smIdType aNodeId[2] = {0,0};
2016 const SMDS_MeshElement* aNode;
2017 if ( aNodesIter->more())
2019 aNode = aNodesIter->next();
2020 P[0] = P[1] = SMESH_NodeXYZ( aNode );
2021 aNodeId[0] = aNodeId[1] = aNode->GetID();
2024 for( ; aNodesIter->more(); )
2026 aNode = aNodesIter->next();
2027 smIdType anId = aNode->GetID();
2029 P[2] = SMESH_NodeXYZ( aNode );
2031 aLength = P[1].Distance(P[2]);
2033 Value aValue(aLength,aNodeId[1],anId);
2036 theValues.insert(aValue);
2039 aLength = P[0].Distance(P[1]);
2041 Value aValue(aLength,aNodeId[0],aNodeId[1]);
2042 theValues.insert(aValue);
2052 //================================================================================
2054 Class : Deflection2D
2055 Description : computes distance between a face center and an underlying surface
2057 //================================================================================
2059 double Deflection2D::GetValue( const TSequenceOfXYZ& P )
2061 if ( myMesh && P.getElement() )
2063 // get underlying surface
2064 if ( myShapeIndex != P.getElement()->getshapeId() )
2066 mySurface.Nullify();
2067 myShapeIndex = P.getElement()->getshapeId();
2068 const TopoDS_Shape& S =
2069 static_cast< const SMESHDS_Mesh* >( myMesh )->IndexToShape( myShapeIndex );
2070 if ( !S.IsNull() && S.ShapeType() == TopAbs_FACE )
2072 mySurface = new ShapeAnalysis_Surface( BRep_Tool::Surface( TopoDS::Face( S )));
2074 GeomLib_IsPlanarSurface isPlaneCheck( mySurface->Surface() );
2075 if ( isPlaneCheck.IsPlanar() )
2076 myPlane.reset( new gp_Pln( isPlaneCheck.Plan() ));
2081 // project gravity center to the surface
2082 if ( !mySurface.IsNull() )
2087 for ( size_t i = 0; i < P.size(); ++i )
2091 if ( SMDS_FacePositionPtr fPos = P.getElement()->GetNode( i )->GetPosition() )
2093 uv.ChangeCoord(1) += fPos->GetUParameter();
2094 uv.ChangeCoord(2) += fPos->GetVParameter();
2099 if ( nbUV ) uv /= nbUV;
2101 double maxLen = MaxElementLength2D().GetValue( P );
2102 double tol = 1e-3 * maxLen;
2106 dist = myPlane->Distance( gc );
2112 if ( uv.X() != 0 && uv.Y() != 0 ) // faster way
2113 mySurface->NextValueOfUV( uv, gc, tol, 0.5 * maxLen );
2115 mySurface->ValueOfUV( gc, tol );
2116 dist = mySurface->Gap();
2118 return Round( dist );
2124 void Deflection2D::SetMesh( const SMDS_Mesh* theMesh )
2126 NumericalFunctor::SetMesh( dynamic_cast<const SMESHDS_Mesh* >( theMesh ));
2127 myShapeIndex = -100;
2131 SMDSAbs_ElementType Deflection2D::GetType() const
2133 return SMDSAbs_Face;
2136 double Deflection2D::GetBadRate( double Value, int /*nbNodes*/ ) const
2138 // meaningless as it is not quality control functor
2142 //================================================================================
2144 Class : MultiConnection
2145 Description : Functor for calculating number of faces conneted to the edge
2147 //================================================================================
2149 double MultiConnection::GetValue( const TSequenceOfXYZ& /*P*/ )
2153 double MultiConnection::GetValue( long theId )
2155 return getNbMultiConnection( myMesh, theId );
2158 double MultiConnection::GetBadRate( double Value, int /*nbNodes*/ ) const
2160 // meaningless as it is not quality control functor
2164 SMDSAbs_ElementType MultiConnection::GetType() const
2166 return SMDSAbs_Edge;
2169 //================================================================================
2171 Class : MultiConnection2D
2172 Description : Functor for calculating number of faces conneted to the edge
2174 //================================================================================
2176 double MultiConnection2D::GetValue( const TSequenceOfXYZ& /*P*/ )
2181 double MultiConnection2D::GetValue( long theElementId )
2185 const SMDS_MeshElement* aFaceElem = myMesh->FindElement(theElementId);
2186 SMDSAbs_ElementType aType = aFaceElem->GetType();
2191 int i = 0, len = aFaceElem->NbNodes();
2192 SMDS_ElemIteratorPtr anIter = aFaceElem->nodesIterator();
2195 const SMDS_MeshNode *aNode, *aNode0 = 0;
2196 NCollection_Map< smIdType, smIdHasher > aMap, aMapPrev;
2198 for (i = 0; i <= len; i++) {
2203 if (anIter->more()) {
2204 aNode = (SMDS_MeshNode*)anIter->next();
2212 if (i == 0) aNode0 = aNode;
2214 SMDS_ElemIteratorPtr anElemIter = aNode->GetInverseElementIterator();
2215 while (anElemIter->more()) {
2216 const SMDS_MeshElement* anElem = anElemIter->next();
2217 if (anElem != 0 && anElem->GetType() == SMDSAbs_Face) {
2218 smIdType anId = anElem->GetID();
2221 if (aMapPrev.Contains(anId)) {
2226 aResult = Max(aResult, aNb);
2237 double MultiConnection2D::GetBadRate( double Value, int /*nbNodes*/ ) const
2239 // meaningless as it is not quality control functor
2243 SMDSAbs_ElementType MultiConnection2D::GetType() const
2245 return SMDSAbs_Face;
2248 MultiConnection2D::Value::Value(long thePntId1, long thePntId2)
2250 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
2251 if(thePntId1 > thePntId2){
2252 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
2256 bool MultiConnection2D::Value::operator<(const MultiConnection2D::Value& x) const
2258 if(myPntId[0] < x.myPntId[0]) return true;
2259 if(myPntId[0] == x.myPntId[0])
2260 if(myPntId[1] < x.myPntId[1]) return true;
2264 void MultiConnection2D::GetValues(MValues& theValues)
2266 if ( !myMesh ) return;
2267 for ( SMDS_FaceIteratorPtr anIter = myMesh->facesIterator(); anIter->more(); )
2269 const SMDS_MeshFace* anElem = anIter->next();
2270 SMDS_NodeIteratorPtr aNodesIter = anElem->interlacedNodesIterator();
2272 const SMDS_MeshNode* aNode1 = anElem->GetNode( anElem->NbNodes() - 1 );
2273 const SMDS_MeshNode* aNode2;
2274 for ( ; aNodesIter->more(); )
2276 aNode2 = aNodesIter->next();
2278 Value aValue ( aNode1->GetID(), aNode2->GetID() );
2279 MValues::iterator aItr = theValues.insert( std::make_pair( aValue, 0 )).first;
2287 //================================================================================
2289 Class : BallDiameter
2290 Description : Functor returning diameter of a ball element
2292 //================================================================================
2294 double BallDiameter::GetValue( long theId )
2296 double diameter = 0;
2298 if ( const SMDS_BallElement* ball =
2299 myMesh->DownCast< SMDS_BallElement >( myMesh->FindElement( theId )))
2301 diameter = ball->GetDiameter();
2306 double BallDiameter::GetBadRate( double Value, int /*nbNodes*/ ) const
2308 // meaningless as it is not a quality control functor
2312 SMDSAbs_ElementType BallDiameter::GetType() const
2314 return SMDSAbs_Ball;
2317 //================================================================================
2319 Class : NodeConnectivityNumber
2320 Description : Functor returning number of elements connected to a node
2322 //================================================================================
2324 double NodeConnectivityNumber::GetValue( long theId )
2328 if ( const SMDS_MeshNode* node = myMesh->FindNode( theId ))
2330 SMDSAbs_ElementType type;
2331 if ( myMesh->NbVolumes() > 0 )
2332 type = SMDSAbs_Volume;
2333 else if ( myMesh->NbFaces() > 0 )
2334 type = SMDSAbs_Face;
2335 else if ( myMesh->NbEdges() > 0 )
2336 type = SMDSAbs_Edge;
2339 nb = node->NbInverseElements( type );
2344 double NodeConnectivityNumber::GetBadRate( double Value, int /*nbNodes*/ ) const
2349 SMDSAbs_ElementType NodeConnectivityNumber::GetType() const
2351 return SMDSAbs_Node;
2358 //================================================================================
2360 Class : BadOrientedVolume
2361 Description : Predicate bad oriented volumes
2363 //================================================================================
2365 BadOrientedVolume::BadOrientedVolume()
2370 void BadOrientedVolume::SetMesh( const SMDS_Mesh* theMesh )
2375 bool BadOrientedVolume::IsSatisfy( long theId )
2380 SMDS_VolumeTool vTool( myMesh->FindElement( theId ));
2383 if ( vTool.IsPoly() )
2386 for ( int i = 0; i < vTool.NbFaces() && isOk; ++i )
2387 isOk = vTool.IsFaceExternal( i );
2391 isOk = vTool.IsForward();
2396 SMDSAbs_ElementType BadOrientedVolume::GetType() const
2398 return SMDSAbs_Volume;
2402 Class : BareBorderVolume
2405 bool BareBorderVolume::IsSatisfy(long theElementId )
2407 SMDS_VolumeTool myTool;
2408 if ( myTool.Set( myMesh->FindElement(theElementId)))
2410 for ( int iF = 0; iF < myTool.NbFaces(); ++iF )
2411 if ( myTool.IsFreeFace( iF ))
2413 const SMDS_MeshNode** n = myTool.GetFaceNodes(iF);
2414 std::vector< const SMDS_MeshNode*> nodes( n, n+myTool.NbFaceNodes(iF));
2415 if ( !myMesh->FindElement( nodes, SMDSAbs_Face, /*Nomedium=*/false))
2422 //================================================================================
2424 Class : BareBorderFace
2426 //================================================================================
2428 bool BareBorderFace::IsSatisfy(long theElementId )
2431 if ( const SMDS_MeshElement* face = myMesh->FindElement(theElementId))
2433 if ( face->GetType() == SMDSAbs_Face )
2435 int nbN = face->NbCornerNodes();
2436 for ( int i = 0; i < nbN && !ok; ++i )
2438 // check if a link is shared by another face
2439 const SMDS_MeshNode* n1 = face->GetNode( i );
2440 const SMDS_MeshNode* n2 = face->GetNode( (i+1)%nbN );
2441 SMDS_ElemIteratorPtr fIt = n1->GetInverseElementIterator( SMDSAbs_Face );
2442 bool isShared = false;
2443 while ( !isShared && fIt->more() )
2445 const SMDS_MeshElement* f = fIt->next();
2446 isShared = ( f != face && f->GetNodeIndex(n2) != -1 );
2450 const int iQuad = face->IsQuadratic();
2451 myLinkNodes.resize( 2 + iQuad);
2452 myLinkNodes[0] = n1;
2453 myLinkNodes[1] = n2;
2455 myLinkNodes[2] = face->GetNode( i+nbN );
2456 ok = !myMesh->FindElement( myLinkNodes, SMDSAbs_Edge, /*noMedium=*/false);
2464 //================================================================================
2466 Class : OverConstrainedVolume
2468 //================================================================================
2470 bool OverConstrainedVolume::IsSatisfy(long theElementId )
2472 // An element is over-constrained if it has N-1 free borders where
2473 // N is the number of edges/faces for a 2D/3D element.
2474 SMDS_VolumeTool myTool;
2475 if ( myTool.Set( myMesh->FindElement(theElementId)))
2477 int nbSharedFaces = 0;
2478 for ( int iF = 0; iF < myTool.NbFaces(); ++iF )
2479 if ( !myTool.IsFreeFace( iF ) && ++nbSharedFaces > 1 )
2481 return ( nbSharedFaces == 1 );
2486 //================================================================================
2488 Class : OverConstrainedFace
2490 //================================================================================
2492 bool OverConstrainedFace::IsSatisfy(long theElementId )
2494 // An element is over-constrained if it has N-1 free borders where
2495 // N is the number of edges/faces for a 2D/3D element.
2496 if ( const SMDS_MeshElement* face = myMesh->FindElement(theElementId))
2497 if ( face->GetType() == SMDSAbs_Face )
2499 int nbSharedBorders = 0;
2500 int nbN = face->NbCornerNodes();
2501 for ( int i = 0; i < nbN; ++i )
2503 // check if a link is shared by another face
2504 const SMDS_MeshNode* n1 = face->GetNode( i );
2505 const SMDS_MeshNode* n2 = face->GetNode( (i+1)%nbN );
2506 SMDS_ElemIteratorPtr fIt = n1->GetInverseElementIterator( SMDSAbs_Face );
2507 bool isShared = false;
2508 while ( !isShared && fIt->more() )
2510 const SMDS_MeshElement* f = fIt->next();
2511 isShared = ( f != face && f->GetNodeIndex(n2) != -1 );
2513 if ( isShared && ++nbSharedBorders > 1 )
2516 return ( nbSharedBorders == 1 );
2521 //================================================================================
2523 Class : CoincidentNodes
2524 Description : Predicate of Coincident nodes
2526 //================================================================================
2528 CoincidentNodes::CoincidentNodes()
2533 bool CoincidentNodes::IsSatisfy( long theElementId )
2535 return myCoincidentIDs.Contains( theElementId );
2538 SMDSAbs_ElementType CoincidentNodes::GetType() const
2540 return SMDSAbs_Node;
2543 void CoincidentNodes::SetTolerance( const double theToler )
2545 if ( myToler != theToler )
2552 void CoincidentNodes::SetMesh( const SMDS_Mesh* theMesh )
2554 myMeshModifTracer.SetMesh( theMesh );
2555 if ( myMeshModifTracer.IsMeshModified() )
2557 TIDSortedNodeSet nodesToCheck;
2558 SMDS_NodeIteratorPtr nIt = theMesh->nodesIterator();
2559 while ( nIt->more() )
2560 nodesToCheck.insert( nodesToCheck.end(), nIt->next() );
2562 std::list< std::list< const SMDS_MeshNode*> > nodeGroups;
2563 SMESH_OctreeNode::FindCoincidentNodes ( nodesToCheck, &nodeGroups, myToler );
2565 myCoincidentIDs.Clear();
2566 std::list< std::list< const SMDS_MeshNode*> >::iterator groupIt = nodeGroups.begin();
2567 for ( ; groupIt != nodeGroups.end(); ++groupIt )
2569 std::list< const SMDS_MeshNode*>& coincNodes = *groupIt;
2570 std::list< const SMDS_MeshNode*>::iterator n = coincNodes.begin();
2571 for ( ; n != coincNodes.end(); ++n )
2572 myCoincidentIDs.Add( (*n)->GetID() );
2577 //================================================================================
2579 Class : CoincidentElements
2580 Description : Predicate of Coincident Elements
2581 Note : This class is suitable only for visualization of Coincident Elements
2583 //================================================================================
2585 CoincidentElements::CoincidentElements()
2590 void CoincidentElements::SetMesh( const SMDS_Mesh* theMesh )
2595 bool CoincidentElements::IsSatisfy( long theElementId )
2597 if ( !myMesh ) return false;
2599 if ( const SMDS_MeshElement* e = myMesh->FindElement( theElementId ))
2601 if ( e->GetType() != GetType() ) return false;
2602 std::set< const SMDS_MeshNode* > elemNodes( e->begin_nodes(), e->end_nodes() );
2603 const int nbNodes = e->NbNodes();
2604 SMDS_ElemIteratorPtr invIt = (*elemNodes.begin())->GetInverseElementIterator( GetType() );
2605 while ( invIt->more() )
2607 const SMDS_MeshElement* e2 = invIt->next();
2608 if ( e2 == e || e2->NbNodes() != nbNodes ) continue;
2610 bool sameNodes = true;
2611 for ( size_t i = 0; i < elemNodes.size() && sameNodes; ++i )
2612 sameNodes = ( elemNodes.count( e2->GetNode( i )));
2620 SMDSAbs_ElementType CoincidentElements1D::GetType() const
2622 return SMDSAbs_Edge;
2624 SMDSAbs_ElementType CoincidentElements2D::GetType() const
2626 return SMDSAbs_Face;
2628 SMDSAbs_ElementType CoincidentElements3D::GetType() const
2630 return SMDSAbs_Volume;
2634 //================================================================================
2637 Description : Predicate for free borders
2639 //================================================================================
2641 FreeBorders::FreeBorders()
2646 void FreeBorders::SetMesh( const SMDS_Mesh* theMesh )
2651 bool FreeBorders::IsSatisfy( long theId )
2653 return getNbMultiConnection( myMesh, theId ) == 1;
2656 SMDSAbs_ElementType FreeBorders::GetType() const
2658 return SMDSAbs_Edge;
2662 //================================================================================
2665 Description : Predicate for free Edges
2667 //================================================================================
2669 FreeEdges::FreeEdges()
2674 void FreeEdges::SetMesh( const SMDS_Mesh* theMesh )
2679 bool FreeEdges::IsFreeEdge( const SMDS_MeshNode** theNodes, const smIdType theFaceId )
2681 SMDS_ElemIteratorPtr anElemIter = theNodes[ 0 ]->GetInverseElementIterator(SMDSAbs_Face);
2682 while( anElemIter->more() )
2684 if ( const SMDS_MeshElement* anElem = anElemIter->next())
2686 const smIdType anId = anElem->GetID();
2687 if ( anId != theFaceId && anElem->GetNodeIndex( theNodes[1] ) >= 0 )
2694 bool FreeEdges::IsSatisfy( long theId )
2699 const SMDS_MeshElement* aFace = myMesh->FindElement( theId );
2700 if ( aFace == 0 || aFace->GetType() != SMDSAbs_Face || aFace->NbNodes() < 3 )
2703 SMDS_NodeIteratorPtr anIter = aFace->interlacedNodesIterator();
2707 int i = 0, nbNodes = aFace->NbNodes();
2708 std::vector <const SMDS_MeshNode*> aNodes( nbNodes+1 );
2709 while( anIter->more() )
2710 if ( ! ( aNodes[ i++ ] = anIter->next() ))
2712 aNodes[ nbNodes ] = aNodes[ 0 ];
2714 for ( i = 0; i < nbNodes; i++ )
2715 if ( IsFreeEdge( &aNodes[ i ], theId ) )
2721 SMDSAbs_ElementType FreeEdges::GetType() const
2723 return SMDSAbs_Face;
2726 FreeEdges::Border::Border(long theElemId, long thePntId1, long thePntId2):
2729 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
2730 if(thePntId1 > thePntId2){
2731 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
2735 bool FreeEdges::Border::operator<(const FreeEdges::Border& x) const{
2736 if(myPntId[0] < x.myPntId[0]) return true;
2737 if(myPntId[0] == x.myPntId[0])
2738 if(myPntId[1] < x.myPntId[1]) return true;
2742 inline void UpdateBorders(const FreeEdges::Border& theBorder,
2743 FreeEdges::TBorders& theRegistry,
2744 FreeEdges::TBorders& theContainer)
2746 if(theRegistry.find(theBorder) == theRegistry.end()){
2747 theRegistry.insert(theBorder);
2748 theContainer.insert(theBorder);
2750 theContainer.erase(theBorder);
2754 void FreeEdges::GetBoreders(TBorders& theBorders)
2757 for ( SMDS_FaceIteratorPtr anIter = myMesh->facesIterator(); anIter->more(); )
2759 const SMDS_MeshFace* anElem = anIter->next();
2760 long anElemId = anElem->GetID();
2761 SMDS_NodeIteratorPtr aNodesIter = anElem->interlacedNodesIterator();
2762 if ( !aNodesIter->more() ) continue;
2763 long aNodeId[2] = {0,0};
2764 aNodeId[0] = anElem->GetNode( anElem->NbNodes()-1 )->GetID();
2765 for ( ; aNodesIter->more(); )
2767 aNodeId[1] = aNodesIter->next()->GetID();
2768 Border aBorder( anElemId, aNodeId[0], aNodeId[1] );
2769 UpdateBorders( aBorder, aRegistry, theBorders );
2770 aNodeId[0] = aNodeId[1];
2775 //================================================================================
2778 Description : Predicate for free nodes
2780 //================================================================================
2782 FreeNodes::FreeNodes()
2787 void FreeNodes::SetMesh( const SMDS_Mesh* theMesh )
2792 bool FreeNodes::IsSatisfy( long theNodeId )
2794 const SMDS_MeshNode* aNode = myMesh->FindNode( theNodeId );
2798 return (aNode->NbInverseElements() < 1);
2801 SMDSAbs_ElementType FreeNodes::GetType() const
2803 return SMDSAbs_Node;
2807 //================================================================================
2810 Description : Predicate for free faces
2812 //================================================================================
2814 FreeFaces::FreeFaces()
2819 void FreeFaces::SetMesh( const SMDS_Mesh* theMesh )
2824 bool FreeFaces::IsSatisfy( long theId )
2826 if (!myMesh) return false;
2827 // check that faces nodes refers to less than two common volumes
2828 const SMDS_MeshElement* aFace = myMesh->FindElement( theId );
2829 if ( !aFace || aFace->GetType() != SMDSAbs_Face )
2832 int nbNode = aFace->NbNodes();
2834 // collect volumes to check that number of volumes with count equal nbNode not less than 2
2835 typedef std::map< SMDS_MeshElement*, int > TMapOfVolume; // map of volume counters
2836 typedef std::map< SMDS_MeshElement*, int >::iterator TItrMapOfVolume; // iterator
2837 TMapOfVolume mapOfVol;
2839 SMDS_ElemIteratorPtr nodeItr = aFace->nodesIterator();
2840 while ( nodeItr->more() )
2842 const SMDS_MeshNode* aNode = static_cast<const SMDS_MeshNode*>(nodeItr->next());
2843 if ( !aNode ) continue;
2844 SMDS_ElemIteratorPtr volItr = aNode->GetInverseElementIterator(SMDSAbs_Volume);
2845 while ( volItr->more() )
2847 SMDS_MeshElement* aVol = (SMDS_MeshElement*)volItr->next();
2848 TItrMapOfVolume itr = mapOfVol.insert( std::make_pair( aVol, 0 )).first;
2853 TItrMapOfVolume volItr = mapOfVol.begin();
2854 TItrMapOfVolume volEnd = mapOfVol.end();
2855 for ( ; volItr != volEnd; ++volItr )
2856 if ( (*volItr).second >= nbNode )
2858 // face is not free if number of volumes constructed on their nodes more than one
2862 SMDSAbs_ElementType FreeFaces::GetType() const
2864 return SMDSAbs_Face;
2867 //================================================================================
2869 Class : LinearOrQuadratic
2870 Description : Predicate to verify whether a mesh element is linear
2872 //================================================================================
2874 LinearOrQuadratic::LinearOrQuadratic()
2879 void LinearOrQuadratic::SetMesh( const SMDS_Mesh* theMesh )
2884 bool LinearOrQuadratic::IsSatisfy( long theId )
2886 if (!myMesh) return false;
2887 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
2888 if ( !anElem || (myType != SMDSAbs_All && anElem->GetType() != myType) )
2890 return (!anElem->IsQuadratic());
2893 void LinearOrQuadratic::SetType( SMDSAbs_ElementType theType )
2898 SMDSAbs_ElementType LinearOrQuadratic::GetType() const
2903 //================================================================================
2906 Description : Functor for check color of group to which mesh element belongs to
2908 //================================================================================
2910 GroupColor::GroupColor()
2914 bool GroupColor::IsSatisfy( long theId )
2916 return myIDs.count( theId );
2919 void GroupColor::SetType( SMDSAbs_ElementType theType )
2924 SMDSAbs_ElementType GroupColor::GetType() const
2929 static bool isEqual( const Quantity_Color& theColor1,
2930 const Quantity_Color& theColor2 )
2932 // tolerance to compare colors
2933 const double tol = 5*1e-3;
2934 return ( fabs( theColor1.Red() - theColor2.Red() ) < tol &&
2935 fabs( theColor1.Green() - theColor2.Green() ) < tol &&
2936 fabs( theColor1.Blue() - theColor2.Blue() ) < tol );
2939 void GroupColor::SetMesh( const SMDS_Mesh* theMesh )
2943 const SMESHDS_Mesh* aMesh = dynamic_cast<const SMESHDS_Mesh*>(theMesh);
2947 int nbGrp = aMesh->GetNbGroups();
2951 // iterates on groups and find necessary elements ids
2952 const std::set<SMESHDS_GroupBase*>& aGroups = aMesh->GetGroups();
2953 std::set<SMESHDS_GroupBase*>::const_iterator GrIt = aGroups.begin();
2954 for (; GrIt != aGroups.end(); GrIt++)
2956 SMESHDS_GroupBase* aGrp = (*GrIt);
2959 // check type and color of group
2960 if ( !isEqual( myColor, aGrp->GetColor() ))
2963 // IPAL52867 (prevent infinite recursion via GroupOnFilter)
2964 if ( SMESHDS_GroupOnFilter * gof = dynamic_cast< SMESHDS_GroupOnFilter* >( aGrp ))
2965 if ( gof->GetPredicate().get() == this )
2968 SMDSAbs_ElementType aGrpElType = (SMDSAbs_ElementType)aGrp->GetType();
2969 if ( myType == aGrpElType || (myType == SMDSAbs_All && aGrpElType != SMDSAbs_Node) ) {
2970 // add elements IDS into control
2971 smIdType aSize = aGrp->Extent();
2972 for (smIdType i = 0; i < aSize; i++)
2973 myIDs.insert( aGrp->GetID(i+1) );
2978 void GroupColor::SetColorStr( const TCollection_AsciiString& theStr )
2980 Kernel_Utils::Localizer loc;
2981 TCollection_AsciiString aStr = theStr;
2982 aStr.RemoveAll( ' ' );
2983 aStr.RemoveAll( '\t' );
2984 for ( int aPos = aStr.Search( ";;" ); aPos != -1; aPos = aStr.Search( ";;" ) )
2985 aStr.Remove( aPos, 2 );
2986 Standard_Real clr[3];
2987 clr[0] = clr[1] = clr[2] = 0.;
2988 for ( int i = 0; i < 3; i++ ) {
2989 TCollection_AsciiString tmpStr = aStr.Token( ";", i+1 );
2990 if ( !tmpStr.IsEmpty() && tmpStr.IsRealValue() )
2991 clr[i] = tmpStr.RealValue();
2993 myColor = Quantity_Color( clr[0], clr[1], clr[2], Quantity_TOC_RGB );
2996 //=======================================================================
2997 // name : GetRangeStr
2998 // Purpose : Get range as a string.
2999 // Example: "1,2,3,50-60,63,67,70-"
3000 //=======================================================================
3002 void GroupColor::GetColorStr( TCollection_AsciiString& theResStr ) const
3005 theResStr += TCollection_AsciiString( myColor.Red() );
3006 theResStr += TCollection_AsciiString( ";" ) + TCollection_AsciiString( myColor.Green() );
3007 theResStr += TCollection_AsciiString( ";" ) + TCollection_AsciiString( myColor.Blue() );
3010 //================================================================================
3012 Class : ElemGeomType
3013 Description : Predicate to check element geometry type
3015 //================================================================================
3017 ElemGeomType::ElemGeomType()
3020 myType = SMDSAbs_All;
3021 myGeomType = SMDSGeom_TRIANGLE;
3024 void ElemGeomType::SetMesh( const SMDS_Mesh* theMesh )
3029 bool ElemGeomType::IsSatisfy( long theId )
3031 if (!myMesh) return false;
3032 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
3035 const SMDSAbs_ElementType anElemType = anElem->GetType();
3036 if ( myType != SMDSAbs_All && anElemType != myType )
3038 bool isOk = ( anElem->GetGeomType() == myGeomType );
3042 void ElemGeomType::SetType( SMDSAbs_ElementType theType )
3047 SMDSAbs_ElementType ElemGeomType::GetType() const
3052 void ElemGeomType::SetGeomType( SMDSAbs_GeometryType theType )
3054 myGeomType = theType;
3057 SMDSAbs_GeometryType ElemGeomType::GetGeomType() const
3062 //================================================================================
3064 Class : ElemEntityType
3065 Description : Predicate to check element entity type
3067 //================================================================================
3069 ElemEntityType::ElemEntityType():
3071 myType( SMDSAbs_All ),
3072 myEntityType( SMDSEntity_0D )
3076 void ElemEntityType::SetMesh( const SMDS_Mesh* theMesh )
3081 bool ElemEntityType::IsSatisfy( long theId )
3083 if ( !myMesh ) return false;
3084 if ( myType == SMDSAbs_Node )
3085 return myMesh->FindNode( theId );
3086 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
3088 myEntityType == anElem->GetEntityType() );
3091 void ElemEntityType::SetType( SMDSAbs_ElementType theType )
3096 SMDSAbs_ElementType ElemEntityType::GetType() const
3101 void ElemEntityType::SetElemEntityType( SMDSAbs_EntityType theEntityType )
3103 myEntityType = theEntityType;
3106 SMDSAbs_EntityType ElemEntityType::GetElemEntityType() const
3108 return myEntityType;
3111 //================================================================================
3113 * \brief Class ConnectedElements
3115 //================================================================================
3117 ConnectedElements::ConnectedElements():
3118 myNodeID(0), myType( SMDSAbs_All ), myOkIDsReady( false ) {}
3120 SMDSAbs_ElementType ConnectedElements::GetType() const
3123 smIdType ConnectedElements::GetNode() const
3124 { return myXYZ.empty() ? myNodeID : 0; } // myNodeID can be found by myXYZ
3126 std::vector<double> ConnectedElements::GetPoint() const
3129 void ConnectedElements::clearOkIDs()
3130 { myOkIDsReady = false; myOkIDs.clear(); }
3132 void ConnectedElements::SetType( SMDSAbs_ElementType theType )
3134 if ( myType != theType || myMeshModifTracer.IsMeshModified() )
3139 void ConnectedElements::SetMesh( const SMDS_Mesh* theMesh )
3141 myMeshModifTracer.SetMesh( theMesh );
3142 if ( myMeshModifTracer.IsMeshModified() )
3145 if ( !myXYZ.empty() )
3146 SetPoint( myXYZ[0], myXYZ[1], myXYZ[2] ); // find a node near myXYZ it in a new mesh
3150 void ConnectedElements::SetNode( smIdType nodeID )
3155 bool isSameDomain = false;
3156 if ( myOkIDsReady && myMeshModifTracer.GetMesh() && !myMeshModifTracer.IsMeshModified() )
3157 if ( const SMDS_MeshNode* n = myMeshModifTracer.GetMesh()->FindNode( myNodeID ))
3159 SMDS_ElemIteratorPtr eIt = n->GetInverseElementIterator( myType );
3160 while ( !isSameDomain && eIt->more() )
3161 isSameDomain = IsSatisfy( eIt->next()->GetID() );
3163 if ( !isSameDomain )
3167 void ConnectedElements::SetPoint( double x, double y, double z )
3175 bool isSameDomain = false;
3177 // find myNodeID by myXYZ if possible
3178 if ( myMeshModifTracer.GetMesh() )
3180 SMESHUtils::Deleter<SMESH_ElementSearcher> searcher
3181 ( SMESH_MeshAlgos::GetElementSearcher( (SMDS_Mesh&) *myMeshModifTracer.GetMesh() ));
3183 std::vector< const SMDS_MeshElement* > foundElems;
3184 searcher->FindElementsByPoint( gp_Pnt(x,y,z), SMDSAbs_All, foundElems );
3186 if ( !foundElems.empty() )
3188 myNodeID = foundElems[0]->GetNode(0)->GetID();
3189 if ( myOkIDsReady && !myMeshModifTracer.IsMeshModified() )
3190 isSameDomain = IsSatisfy( foundElems[0]->GetID() );
3193 if ( !isSameDomain )
3197 bool ConnectedElements::IsSatisfy( long theElementId )
3199 // Here we do NOT check if the mesh has changed, we do it in Set...() only!!!
3201 if ( !myOkIDsReady )
3203 if ( !myMeshModifTracer.GetMesh() )
3205 const SMDS_MeshNode* node0 = myMeshModifTracer.GetMesh()->FindNode( myNodeID );
3209 std::list< const SMDS_MeshNode* > nodeQueue( 1, node0 );
3210 std::set< smIdType > checkedNodeIDs;
3212 // foreach node in nodeQueue:
3213 // foreach element sharing a node:
3214 // add ID of an element of myType to myOkIDs;
3215 // push all element nodes absent from checkedNodeIDs to nodeQueue;
3216 while ( !nodeQueue.empty() )
3218 const SMDS_MeshNode* node = nodeQueue.front();
3219 nodeQueue.pop_front();
3221 // loop on elements sharing the node
3222 SMDS_ElemIteratorPtr eIt = node->GetInverseElementIterator();
3223 while ( eIt->more() )
3225 // keep elements of myType
3226 const SMDS_MeshElement* element = eIt->next();
3227 if ( myType == SMDSAbs_All || element->GetType() == myType )
3228 myOkIDs.insert( myOkIDs.end(), element->GetID() );
3230 // enqueue nodes of the element
3231 SMDS_ElemIteratorPtr nIt = element->nodesIterator();
3232 while ( nIt->more() )
3234 const SMDS_MeshNode* n = static_cast< const SMDS_MeshNode* >( nIt->next() );
3235 if ( checkedNodeIDs.insert( n->GetID()).second )
3236 nodeQueue.push_back( n );
3240 if ( myType == SMDSAbs_Node )
3241 std::swap( myOkIDs, checkedNodeIDs );
3243 size_t totalNbElems = myMeshModifTracer.GetMesh()->GetMeshInfo().NbElements( myType );
3244 if ( myOkIDs.size() == totalNbElems )
3247 myOkIDsReady = true;
3250 return myOkIDs.empty() ? true : myOkIDs.count( theElementId );
3253 //================================================================================
3255 * \brief Class CoplanarFaces
3257 //================================================================================
3261 inline bool isLessAngle( const gp_Vec& v1, const gp_Vec& v2, const double cos )
3263 double dot = v1 * v2; // cos * |v1| * |v2|
3264 double l1 = v1.SquareMagnitude();
3265 double l2 = v2.SquareMagnitude();
3266 return (( dot * cos >= 0 ) &&
3267 ( dot * dot ) / l1 / l2 >= ( cos * cos ));
3270 CoplanarFaces::CoplanarFaces()
3271 : myFaceID(0), myToler(0)
3274 void CoplanarFaces::SetMesh( const SMDS_Mesh* theMesh )
3276 myMeshModifTracer.SetMesh( theMesh );
3277 if ( myMeshModifTracer.IsMeshModified() )
3279 // Build a set of coplanar face ids
3281 myCoplanarIDs.Clear();
3283 if ( !myMeshModifTracer.GetMesh() || !myFaceID || !myToler )
3286 const SMDS_MeshElement* face = myMeshModifTracer.GetMesh()->FindElement( myFaceID );
3287 if ( !face || face->GetType() != SMDSAbs_Face )
3291 gp_Vec myNorm = getNormale( static_cast<const SMDS_MeshFace*>(face), &normOK );
3295 const double cosTol = Cos( myToler * M_PI / 180. );
3296 NCollection_Map< SMESH_TLink, SMESH_TLink > checkedLinks;
3298 std::list< std::pair< const SMDS_MeshElement*, gp_Vec > > faceQueue;
3299 faceQueue.push_back( std::make_pair( face, myNorm ));
3300 while ( !faceQueue.empty() )
3302 face = faceQueue.front().first;
3303 myNorm = faceQueue.front().second;
3304 faceQueue.pop_front();
3306 for ( int i = 0, nbN = face->NbCornerNodes(); i < nbN; ++i )
3308 const SMDS_MeshNode* n1 = face->GetNode( i );
3309 const SMDS_MeshNode* n2 = face->GetNode(( i+1 )%nbN);
3310 if ( !checkedLinks.Add( SMESH_TLink( n1, n2 )))
3312 SMDS_ElemIteratorPtr fIt = n1->GetInverseElementIterator(SMDSAbs_Face);
3313 while ( fIt->more() )
3315 const SMDS_MeshElement* f = fIt->next();
3316 if ( f->GetNodeIndex( n2 ) > -1 )
3318 gp_Vec norm = getNormale( static_cast<const SMDS_MeshFace*>(f), &normOK );
3319 if (!normOK || isLessAngle( myNorm, norm, cosTol))
3321 myCoplanarIDs.Add( f->GetID() );
3322 faceQueue.push_back( std::make_pair( f, norm ));
3330 bool CoplanarFaces::IsSatisfy( long theElementId )
3332 return myCoplanarIDs.Contains( theElementId );
3337 *Description : Predicate for Range of Ids.
3338 * Range may be specified with two ways.
3339 * 1. Using AddToRange method
3340 * 2. With SetRangeStr method. Parameter of this method is a string
3341 * like as "1,2,3,50-60,63,67,70-"
3344 //=======================================================================
3345 // name : RangeOfIds
3346 // Purpose : Constructor
3347 //=======================================================================
3348 RangeOfIds::RangeOfIds()
3351 myType = SMDSAbs_All;
3354 //=======================================================================
3356 // Purpose : Set mesh
3357 //=======================================================================
3358 void RangeOfIds::SetMesh( const SMDS_Mesh* theMesh )
3363 //=======================================================================
3364 // name : AddToRange
3365 // Purpose : Add ID to the range
3366 //=======================================================================
3367 bool RangeOfIds::AddToRange( long theEntityId )
3369 myIds.Add( theEntityId );
3373 //=======================================================================
3374 // name : GetRangeStr
3375 // Purpose : Get range as a string.
3376 // Example: "1,2,3,50-60,63,67,70-"
3377 //=======================================================================
3378 void RangeOfIds::GetRangeStr( TCollection_AsciiString& theResStr )
3383 NCollection_Sequence< std::string > aStrSeq;
3385 TIDsMap::Iterator anIter( myIds );
3386 for ( ; anIter.More(); anIter.Next() )
3388 smIdType anId = anIter.Key();
3389 SMESH_Comment aStr( anId );
3390 anIntSeq.Append( anId );
3391 aStrSeq.Append( aStr );
3394 for ( smIdType i = 1, n = myMin.size(); i <= n; i++ )
3396 smIdType aMinId = myMin[i];
3397 smIdType aMaxId = myMax[i];
3400 if ( aMinId != IntegerFirst() )
3405 if ( aMaxId != std::numeric_limits<smIdType>::max() )
3408 // find position of the string in result sequence and insert string in it
3409 if ( anIntSeq.Length() == 0 )
3411 anIntSeq.Append( aMinId );
3412 aStrSeq.Append( (const char*)aStr );
3416 if ( aMinId < anIntSeq.First() )
3418 anIntSeq.Prepend( aMinId );
3419 aStrSeq.Prepend( (const char*)aStr );
3421 else if ( aMinId > anIntSeq.Last() )
3423 anIntSeq.Append( aMinId );
3424 aStrSeq.Append( (const char*)aStr );
3427 for ( int j = 1, k = anIntSeq.Length(); j <= k; j++ )
3428 if ( aMinId < anIntSeq( j ) )
3430 anIntSeq.InsertBefore( j, aMinId );
3431 aStrSeq.InsertBefore( j, (const char*)aStr );
3437 if ( aStrSeq.Length() == 0 )
3439 std::string aResStr;
3440 aResStr = aStrSeq( 1 );
3441 for ( int j = 2, k = aStrSeq.Length(); j <= k; j++ )
3444 aResStr += aStrSeq( j );
3446 theResStr = aResStr.c_str();
3449 //=======================================================================
3450 // name : SetRangeStr
3451 // Purpose : Define range with string
3452 // Example of entry string: "1,2,3,50-60,63,67,70-"
3453 //=======================================================================
3454 bool RangeOfIds::SetRangeStr( const TCollection_AsciiString& theStr )
3460 TCollection_AsciiString aStr = theStr;
3461 for ( int i = 1; i <= aStr.Length(); ++i )
3463 char c = aStr.Value( i );
3464 if ( !isdigit( c ) && c != ',' && c != '-' )
3465 aStr.SetValue( i, ',');
3467 aStr.RemoveAll( ' ' );
3469 TCollection_AsciiString tmpStr = aStr.Token( ",", 1 );
3471 while ( tmpStr != "" )
3473 tmpStr = aStr.Token( ",", i++ );
3474 int aPos = tmpStr.Search( '-' );
3478 if ( tmpStr.IsIntegerValue() )
3479 myIds.Add( tmpStr.IntegerValue() );
3485 TCollection_AsciiString aMaxStr = tmpStr.Split( aPos );
3486 TCollection_AsciiString aMinStr = tmpStr;
3488 while ( aMinStr.Search( "-" ) != -1 ) aMinStr.RemoveAll( '-' );
3489 while ( aMaxStr.Search( "-" ) != -1 ) aMaxStr.RemoveAll( '-' );
3491 if ( (!aMinStr.IsEmpty() && !aMinStr.IsIntegerValue()) ||
3492 (!aMaxStr.IsEmpty() && !aMaxStr.IsIntegerValue()) )
3495 myMin.push_back( aMinStr.IsEmpty() ? IntegerFirst() : aMinStr.IntegerValue() );
3496 myMax.push_back( aMaxStr.IsEmpty() ? IntegerLast() : aMaxStr.IntegerValue() );
3503 //=======================================================================
3505 // Purpose : Get type of supported entities
3506 //=======================================================================
3507 SMDSAbs_ElementType RangeOfIds::GetType() const
3512 //=======================================================================
3514 // Purpose : Set type of supported entities
3515 //=======================================================================
3516 void RangeOfIds::SetType( SMDSAbs_ElementType theType )
3521 //=======================================================================
3523 // Purpose : Verify whether entity satisfies to this rpedicate
3524 //=======================================================================
3525 bool RangeOfIds::IsSatisfy( long theId )
3530 if ( myType == SMDSAbs_Node )
3532 if ( myMesh->FindNode( theId ) == 0 )
3537 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
3538 if ( anElem == 0 || (myType != anElem->GetType() && myType != SMDSAbs_All ))
3542 if ( myIds.Contains( theId ) )
3545 for ( size_t i = 0; i < myMin.size(); i++ )
3546 if ( theId >= myMin[i] && theId <= myMax[i] )
3554 Description : Base class for comparators
3556 Comparator::Comparator():
3560 Comparator::~Comparator()
3563 void Comparator::SetMesh( const SMDS_Mesh* theMesh )
3566 myFunctor->SetMesh( theMesh );
3569 void Comparator::SetMargin( double theValue )
3571 myMargin = theValue;
3574 void Comparator::SetNumFunctor( NumericalFunctorPtr theFunct )
3576 myFunctor = theFunct;
3579 SMDSAbs_ElementType Comparator::GetType() const
3581 return myFunctor ? myFunctor->GetType() : SMDSAbs_All;
3584 double Comparator::GetMargin()
3592 Description : Comparator "<"
3594 bool LessThan::IsSatisfy( long theId )
3596 return myFunctor && myFunctor->GetValue( theId ) < myMargin;
3602 Description : Comparator ">"
3604 bool MoreThan::IsSatisfy( long theId )
3606 return myFunctor && myFunctor->GetValue( theId ) > myMargin;
3612 Description : Comparator "="
3615 myToler(Precision::Confusion())
3618 bool EqualTo::IsSatisfy( long theId )
3620 return myFunctor && fabs( myFunctor->GetValue( theId ) - myMargin ) < myToler;
3623 void EqualTo::SetTolerance( double theToler )
3628 double EqualTo::GetTolerance()
3635 Description : Logical NOT predicate
3637 LogicalNOT::LogicalNOT()
3640 LogicalNOT::~LogicalNOT()
3643 bool LogicalNOT::IsSatisfy( long theId )
3645 return myPredicate && !myPredicate->IsSatisfy( theId );
3648 void LogicalNOT::SetMesh( const SMDS_Mesh* theMesh )
3651 myPredicate->SetMesh( theMesh );
3654 void LogicalNOT::SetPredicate( PredicatePtr thePred )
3656 myPredicate = thePred;
3659 SMDSAbs_ElementType LogicalNOT::GetType() const
3661 return myPredicate ? myPredicate->GetType() : SMDSAbs_All;
3666 Class : LogicalBinary
3667 Description : Base class for binary logical predicate
3669 LogicalBinary::LogicalBinary()
3672 LogicalBinary::~LogicalBinary()
3675 void LogicalBinary::SetMesh( const SMDS_Mesh* theMesh )
3678 myPredicate1->SetMesh( theMesh );
3681 myPredicate2->SetMesh( theMesh );
3684 void LogicalBinary::SetPredicate1( PredicatePtr thePredicate )
3686 myPredicate1 = thePredicate;
3689 void LogicalBinary::SetPredicate2( PredicatePtr thePredicate )
3691 myPredicate2 = thePredicate;
3694 SMDSAbs_ElementType LogicalBinary::GetType() const
3696 if ( !myPredicate1 || !myPredicate2 )
3699 SMDSAbs_ElementType aType1 = myPredicate1->GetType();
3700 SMDSAbs_ElementType aType2 = myPredicate2->GetType();
3702 return aType1 == aType2 ? aType1 : SMDSAbs_All;
3708 Description : Logical AND
3710 bool LogicalAND::IsSatisfy( long theId )
3715 myPredicate1->IsSatisfy( theId ) &&
3716 myPredicate2->IsSatisfy( theId );
3722 Description : Logical OR
3724 bool LogicalOR::IsSatisfy( long theId )
3729 (myPredicate1->IsSatisfy( theId ) ||
3730 myPredicate2->IsSatisfy( theId ));
3739 // #include <tbb/parallel_for.h>
3740 // #include <tbb/enumerable_thread_specific.h>
3742 // namespace Parallel
3744 // typedef tbb::enumerable_thread_specific< TIdSequence > TIdSeq;
3748 // const SMDS_Mesh* myMesh;
3749 // PredicatePtr myPredicate;
3750 // TIdSeq & myOKIds;
3751 // Predicate( const SMDS_Mesh* m, PredicatePtr p, TIdSeq & ids ):
3752 // myMesh(m), myPredicate(p->Duplicate()), myOKIds(ids) {}
3753 // void operator() ( const tbb::blocked_range<size_t>& r ) const
3755 // for ( size_t i = r.begin(); i != r.end(); ++i )
3756 // if ( myPredicate->IsSatisfy( i ))
3757 // myOKIds.local().push_back();
3769 void Filter::SetPredicate( PredicatePtr thePredicate )
3771 myPredicate = thePredicate;
3774 void Filter::GetElementsId( const SMDS_Mesh* theMesh,
3775 PredicatePtr thePredicate,
3776 TIdSequence& theSequence,
3777 SMDS_ElemIteratorPtr theElements )
3779 theSequence.clear();
3781 if ( !theMesh || !thePredicate )
3784 thePredicate->SetMesh( theMesh );
3787 theElements = theMesh->elementsIterator( thePredicate->GetType() );
3789 if ( theElements ) {
3790 while ( theElements->more() ) {
3791 const SMDS_MeshElement* anElem = theElements->next();
3792 if ( thePredicate->GetType() == SMDSAbs_All ||
3793 thePredicate->GetType() == anElem->GetType() )
3795 long anId = anElem->GetID();
3796 if ( thePredicate->IsSatisfy( anId ) )
3797 theSequence.push_back( anId );
3803 void Filter::GetElementsId( const SMDS_Mesh* theMesh,
3804 Filter::TIdSequence& theSequence,
3805 SMDS_ElemIteratorPtr theElements )
3807 GetElementsId(theMesh,myPredicate,theSequence,theElements);
3814 typedef std::set<SMDS_MeshFace*> TMapOfFacePtr;
3820 ManifoldPart::Link::Link( SMDS_MeshNode* theNode1,
3821 SMDS_MeshNode* theNode2 )
3827 ManifoldPart::Link::~Link()
3833 bool ManifoldPart::Link::IsEqual( const ManifoldPart::Link& theLink ) const
3835 if ( myNode1 == theLink.myNode1 &&
3836 myNode2 == theLink.myNode2 )
3838 else if ( myNode1 == theLink.myNode2 &&
3839 myNode2 == theLink.myNode1 )
3845 bool ManifoldPart::Link::operator<( const ManifoldPart::Link& x ) const
3847 if(myNode1 < x.myNode1) return true;
3848 if(myNode1 == x.myNode1)
3849 if(myNode2 < x.myNode2) return true;
3853 bool ManifoldPart::IsEqual( const ManifoldPart::Link& theLink1,
3854 const ManifoldPart::Link& theLink2 )
3856 return theLink1.IsEqual( theLink2 );
3859 ManifoldPart::ManifoldPart()
3862 myAngToler = Precision::Angular();
3863 myIsOnlyManifold = true;
3866 ManifoldPart::~ManifoldPart()
3871 void ManifoldPart::SetMesh( const SMDS_Mesh* theMesh )
3877 SMDSAbs_ElementType ManifoldPart::GetType() const
3878 { return SMDSAbs_Face; }
3880 bool ManifoldPart::IsSatisfy( long theElementId )
3882 return myMapIds.Contains( theElementId );
3885 void ManifoldPart::SetAngleTolerance( const double theAngToler )
3886 { myAngToler = theAngToler; }
3888 double ManifoldPart::GetAngleTolerance() const
3889 { return myAngToler; }
3891 void ManifoldPart::SetIsOnlyManifold( const bool theIsOnly )
3892 { myIsOnlyManifold = theIsOnly; }
3894 void ManifoldPart::SetStartElem( const long theStartId )
3895 { myStartElemId = theStartId; }
3897 bool ManifoldPart::process()
3900 myMapBadGeomIds.Clear();
3902 myAllFacePtr.clear();
3903 myAllFacePtrIntDMap.clear();
3907 // collect all faces into own map
3908 SMDS_FaceIteratorPtr anFaceItr = myMesh->facesIterator();
3909 for (; anFaceItr->more(); )
3911 SMDS_MeshFace* aFacePtr = (SMDS_MeshFace*)anFaceItr->next();
3912 myAllFacePtr.push_back( aFacePtr );
3913 myAllFacePtrIntDMap[aFacePtr] = myAllFacePtr.size()-1;
3916 SMDS_MeshFace* aStartFace = (SMDS_MeshFace*)myMesh->FindElement( myStartElemId );
3920 // the map of non manifold links and bad geometry
3921 TMapOfLink aMapOfNonManifold;
3922 TIDsMap aMapOfTreated;
3924 // begin cycle on faces from start index and run on vector till the end
3925 // and from begin to start index to cover whole vector
3926 const int aStartIndx = myAllFacePtrIntDMap[aStartFace];
3927 bool isStartTreat = false;
3928 for ( int fi = aStartIndx; !isStartTreat || fi != aStartIndx ; fi++ )
3930 if ( fi == aStartIndx )
3931 isStartTreat = true;
3932 // as result next time when fi will be equal to aStartIndx
3934 SMDS_MeshFace* aFacePtr = myAllFacePtr[ fi ];
3935 if ( aMapOfTreated.Contains( aFacePtr->GetID()) )
3938 aMapOfTreated.Add( aFacePtr->GetID() );
3940 if ( !findConnected( myAllFacePtrIntDMap, aFacePtr,
3941 aMapOfNonManifold, aResFaces ) )
3943 TIDsMap::Iterator anItr( aResFaces );
3944 for ( ; anItr.More(); anItr.Next() )
3946 smIdType aFaceId = anItr.Key();
3947 aMapOfTreated.Add( aFaceId );
3948 myMapIds.Add( aFaceId );
3951 if ( fi == int( myAllFacePtr.size() - 1 ))
3953 } // end run on vector of faces
3954 return !myMapIds.IsEmpty();
3957 static void getLinks( const SMDS_MeshFace* theFace,
3958 ManifoldPart::TVectorOfLink& theLinks )
3960 int aNbNode = theFace->NbNodes();
3961 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
3963 SMDS_MeshNode* aNode = 0;
3964 for ( ; aNodeItr->more() && i <= aNbNode; )
3967 SMDS_MeshNode* aN1 = (SMDS_MeshNode*)aNodeItr->next();
3971 SMDS_MeshNode* aN2 = ( i >= aNbNode ) ? aNode : (SMDS_MeshNode*)aNodeItr->next();
3973 ManifoldPart::Link aLink( aN1, aN2 );
3974 theLinks.push_back( aLink );
3978 bool ManifoldPart::findConnected
3979 ( const ManifoldPart::TDataMapFacePtrInt& theAllFacePtrInt,
3980 SMDS_MeshFace* theStartFace,
3981 ManifoldPart::TMapOfLink& theNonManifold,
3982 TIDsMap& theResFaces )
3984 theResFaces.Clear();
3985 if ( !theAllFacePtrInt.size() )
3988 if ( getNormale( theStartFace ).SquareModulus() <= gp::Resolution() )
3990 myMapBadGeomIds.Add( theStartFace->GetID() );
3994 ManifoldPart::TMapOfLink aMapOfBoundary, aMapToSkip;
3995 ManifoldPart::TVectorOfLink aSeqOfBoundary;
3996 theResFaces.Add( theStartFace->GetID() );
3997 ManifoldPart::TDataMapOfLinkFacePtr aDMapLinkFace;
3999 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
4000 aDMapLinkFace, theNonManifold, theStartFace );
4002 bool isDone = false;
4003 while ( !isDone && aMapOfBoundary.size() != 0 )
4005 bool isToReset = false;
4006 ManifoldPart::TVectorOfLink::iterator pLink = aSeqOfBoundary.begin();
4007 for ( ; !isToReset && pLink != aSeqOfBoundary.end(); ++pLink )
4009 ManifoldPart::Link aLink = *pLink;
4010 if ( aMapToSkip.find( aLink ) != aMapToSkip.end() )
4012 // each link could be treated only once
4013 aMapToSkip.insert( aLink );
4015 ManifoldPart::TVectorOfFacePtr aFaces;
4017 if ( myIsOnlyManifold &&
4018 (theNonManifold.find( aLink ) != theNonManifold.end()) )
4022 getFacesByLink( aLink, aFaces );
4023 // filter the element to keep only indicated elements
4024 ManifoldPart::TVectorOfFacePtr aFiltered;
4025 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
4026 for ( ; pFace != aFaces.end(); ++pFace )
4028 SMDS_MeshFace* aFace = *pFace;
4029 if ( myAllFacePtrIntDMap.find( aFace ) != myAllFacePtrIntDMap.end() )
4030 aFiltered.push_back( aFace );
4033 if ( aFaces.size() < 2 ) // no neihgbour faces
4035 else if ( myIsOnlyManifold && aFaces.size() > 2 ) // non manifold case
4037 theNonManifold.insert( aLink );
4042 // compare normal with normals of neighbor element
4043 SMDS_MeshFace* aPrevFace = aDMapLinkFace[ aLink ];
4044 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
4045 for ( ; pFace != aFaces.end(); ++pFace )
4047 SMDS_MeshFace* aNextFace = *pFace;
4048 if ( aPrevFace == aNextFace )
4050 smIdType anNextFaceID = aNextFace->GetID();
4051 if ( myIsOnlyManifold && theResFaces.Contains( anNextFaceID ) )
4052 // should not be with non manifold restriction. probably bad topology
4054 // check if face was treated and skipped
4055 if ( myMapBadGeomIds.Contains( anNextFaceID ) ||
4056 !isInPlane( aPrevFace, aNextFace ) )
4058 // add new element to connected and extend the boundaries.
4059 theResFaces.Add( anNextFaceID );
4060 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
4061 aDMapLinkFace, theNonManifold, aNextFace );
4065 isDone = !isToReset;
4068 return !theResFaces.IsEmpty();
4071 bool ManifoldPart::isInPlane( const SMDS_MeshFace* theFace1,
4072 const SMDS_MeshFace* theFace2 )
4074 gp_Dir aNorm1 = gp_Dir( getNormale( theFace1 ) );
4075 gp_XYZ aNorm2XYZ = getNormale( theFace2 );
4076 if ( aNorm2XYZ.SquareModulus() <= gp::Resolution() )
4078 myMapBadGeomIds.Add( theFace2->GetID() );
4081 if ( aNorm1.IsParallel( gp_Dir( aNorm2XYZ ), myAngToler ) )
4087 void ManifoldPart::expandBoundary
4088 ( ManifoldPart::TMapOfLink& theMapOfBoundary,
4089 ManifoldPart::TVectorOfLink& theSeqOfBoundary,
4090 ManifoldPart::TDataMapOfLinkFacePtr& theDMapLinkFacePtr,
4091 ManifoldPart::TMapOfLink& theNonManifold,
4092 SMDS_MeshFace* theNextFace ) const
4094 ManifoldPart::TVectorOfLink aLinks;
4095 getLinks( theNextFace, aLinks );
4096 int aNbLink = (int)aLinks.size();
4097 for ( int i = 0; i < aNbLink; i++ )
4099 ManifoldPart::Link aLink = aLinks[ i ];
4100 if ( myIsOnlyManifold && (theNonManifold.find( aLink ) != theNonManifold.end()) )
4102 if ( theMapOfBoundary.find( aLink ) != theMapOfBoundary.end() )
4104 if ( myIsOnlyManifold )
4106 // remove from boundary
4107 theMapOfBoundary.erase( aLink );
4108 ManifoldPart::TVectorOfLink::iterator pLink = theSeqOfBoundary.begin();
4109 for ( ; pLink != theSeqOfBoundary.end(); ++pLink )
4111 ManifoldPart::Link aBoundLink = *pLink;
4112 if ( aBoundLink.IsEqual( aLink ) )
4114 theSeqOfBoundary.erase( pLink );
4122 theMapOfBoundary.insert( aLink );
4123 theSeqOfBoundary.push_back( aLink );
4124 theDMapLinkFacePtr[ aLink ] = theNextFace;
4129 void ManifoldPart::getFacesByLink( const ManifoldPart::Link& theLink,
4130 ManifoldPart::TVectorOfFacePtr& theFaces ) const
4133 // take all faces that shared first node
4134 SMDS_ElemIteratorPtr anItr = theLink.myNode1->GetInverseElementIterator( SMDSAbs_Face );
4135 SMDS_StdIterator< const SMDS_MeshElement*, SMDS_ElemIteratorPtr > faces( anItr ), facesEnd;
4136 std::set<const SMDS_MeshElement *> aSetOfFaces( faces, facesEnd );
4138 // take all faces that shared second node
4139 anItr = theLink.myNode2->GetInverseElementIterator( SMDSAbs_Face );
4140 // find the common part of two sets
4141 for ( ; anItr->more(); )
4143 const SMDS_MeshElement* aFace = anItr->next();
4144 if ( aSetOfFaces.count( aFace ))
4145 theFaces.push_back( (SMDS_MeshFace*) aFace );
4150 Class : BelongToMeshGroup
4151 Description : Verify whether a mesh element is included into a mesh group
4153 BelongToMeshGroup::BelongToMeshGroup(): myGroup( 0 )
4157 void BelongToMeshGroup::SetGroup( SMESHDS_GroupBase* g )
4162 void BelongToMeshGroup::SetStoreName( const std::string& sn )
4167 void BelongToMeshGroup::SetMesh( const SMDS_Mesh* theMesh )
4169 if ( myGroup && myGroup->GetMesh() != theMesh )
4173 if ( !myGroup && !myStoreName.empty() )
4175 if ( const SMESHDS_Mesh* aMesh = dynamic_cast<const SMESHDS_Mesh*>(theMesh))
4177 const std::set<SMESHDS_GroupBase*>& grps = aMesh->GetGroups();
4178 std::set<SMESHDS_GroupBase*>::const_iterator g = grps.begin();
4179 for ( ; g != grps.end() && !myGroup; ++g )
4180 if ( *g && myStoreName == (*g)->GetStoreName() )
4186 myGroup->IsEmpty(); // make GroupOnFilter update its predicate
4190 bool BelongToMeshGroup::IsSatisfy( long theElementId )
4192 return myGroup ? myGroup->Contains( theElementId ) : false;
4195 SMDSAbs_ElementType BelongToMeshGroup::GetType() const
4197 return myGroup ? myGroup->GetType() : SMDSAbs_All;
4200 //================================================================================
4201 // ElementsOnSurface
4202 //================================================================================
4204 ElementsOnSurface::ElementsOnSurface()
4207 myType = SMDSAbs_All;
4209 myToler = Precision::Confusion();
4210 myUseBoundaries = false;
4213 ElementsOnSurface::~ElementsOnSurface()
4217 void ElementsOnSurface::SetMesh( const SMDS_Mesh* theMesh )
4219 myMeshModifTracer.SetMesh( theMesh );
4220 if ( myMeshModifTracer.IsMeshModified())
4224 bool ElementsOnSurface::IsSatisfy( long theElementId )
4226 return myIds.Contains( theElementId );
4229 SMDSAbs_ElementType ElementsOnSurface::GetType() const
4232 void ElementsOnSurface::SetTolerance( const double theToler )
4234 if ( myToler != theToler )
4241 double ElementsOnSurface::GetTolerance() const
4244 void ElementsOnSurface::SetUseBoundaries( bool theUse )
4246 if ( myUseBoundaries != theUse ) {
4247 myUseBoundaries = theUse;
4248 SetSurface( mySurf, myType );
4252 void ElementsOnSurface::SetSurface( const TopoDS_Shape& theShape,
4253 const SMDSAbs_ElementType theType )
4258 if ( theShape.IsNull() || theShape.ShapeType() != TopAbs_FACE )
4260 mySurf = TopoDS::Face( theShape );
4261 BRepAdaptor_Surface SA( mySurf, myUseBoundaries );
4263 u1 = SA.FirstUParameter(),
4264 u2 = SA.LastUParameter(),
4265 v1 = SA.FirstVParameter(),
4266 v2 = SA.LastVParameter();
4267 Handle(Geom_Surface) surf = BRep_Tool::Surface( mySurf );
4268 myProjector.Init( surf, u1,u2, v1,v2 );
4272 void ElementsOnSurface::process()
4275 if ( mySurf.IsNull() )
4278 if ( !myMeshModifTracer.GetMesh() )
4281 int nbElems = FromSmIdType<int>( myMeshModifTracer.GetMesh()->GetMeshInfo().NbElements( myType ));
4283 myIds.ReSize( nbElems );
4285 SMDS_ElemIteratorPtr anIter = myMeshModifTracer.GetMesh()->elementsIterator( myType );
4286 for(; anIter->more(); )
4287 process( anIter->next() );
4290 void ElementsOnSurface::process( const SMDS_MeshElement* theElemPtr )
4292 SMDS_ElemIteratorPtr aNodeItr = theElemPtr->nodesIterator();
4293 bool isSatisfy = true;
4294 for ( ; aNodeItr->more(); )
4296 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
4297 if ( !isOnSurface( aNode ) )
4304 myIds.Add( theElemPtr->GetID() );
4307 bool ElementsOnSurface::isOnSurface( const SMDS_MeshNode* theNode )
4309 if ( mySurf.IsNull() )
4312 gp_Pnt aPnt( theNode->X(), theNode->Y(), theNode->Z() );
4313 // double aToler2 = myToler * myToler;
4314 // if ( mySurf->IsKind(STANDARD_TYPE(Geom_Plane)))
4316 // gp_Pln aPln = Handle(Geom_Plane)::DownCast(mySurf)->Pln();
4317 // if ( aPln.SquareDistance( aPnt ) > aToler2 )
4320 // else if ( mySurf->IsKind(STANDARD_TYPE(Geom_CylindricalSurface)))
4322 // gp_Cylinder aCyl = Handle(Geom_CylindricalSurface)::DownCast(mySurf)->Cylinder();
4323 // double aRad = aCyl.Radius();
4324 // gp_Ax3 anAxis = aCyl.Position();
4325 // gp_XYZ aLoc = aCyl.Location().XYZ();
4326 // double aXDist = anAxis.XDirection().XYZ() * ( aPnt.XYZ() - aLoc );
4327 // double aYDist = anAxis.YDirection().XYZ() * ( aPnt.XYZ() - aLoc );
4328 // if ( fabs(aXDist*aXDist + aYDist*aYDist - aRad*aRad) > aToler2 )
4333 myProjector.Perform( aPnt );
4334 bool isOn = ( myProjector.IsDone() && myProjector.LowerDistance() <= myToler );
4340 //================================================================================
4342 //================================================================================
4345 const int theIsCheckedFlag = 0x0000100;
4348 struct ElementsOnShape::Classifier
4350 Classifier() { mySolidClfr = 0; myFlags = 0; }
4352 void Init(const TopoDS_Shape& s, double tol, const Bnd_B3d* box = 0 );
4353 bool IsOut(const gp_Pnt& p) { return SetChecked( true ), (this->*myIsOutFun)( p ); }
4354 TopAbs_ShapeEnum ShapeType() const { return myShape.ShapeType(); }
4355 const TopoDS_Shape& Shape() const { return myShape; }
4356 const Bnd_B3d* GetBndBox() const { return & myBox; }
4357 double Tolerance() const { return myTol; }
4358 bool IsChecked() { return myFlags & theIsCheckedFlag; }
4359 bool IsSetFlag( int flag ) const { return myFlags & flag; }
4360 void SetChecked( bool is ) { is ? SetFlag( theIsCheckedFlag ) : UnsetFlag( theIsCheckedFlag ); }
4361 void SetFlag ( int flag ) { myFlags |= flag; }
4362 void UnsetFlag( int flag ) { myFlags &= ~flag; }
4365 bool isOutOfSolid (const gp_Pnt& p);
4366 bool isOutOfBox (const gp_Pnt& p);
4367 bool isOutOfFace (const gp_Pnt& p);
4368 bool isOutOfEdge (const gp_Pnt& p);
4369 bool isOutOfVertex(const gp_Pnt& p);
4370 bool isOutOfNone (const gp_Pnt& /*p*/) { return true; }
4371 bool isBox (const TopoDS_Shape& s);
4373 TopoDS_Shape prepareSolid( const TopoDS_Shape& theSolid );
4375 bool (Classifier::* myIsOutFun)(const gp_Pnt& p);
4376 BRepClass3d_SolidClassifier* mySolidClfr; // ptr because of a run-time forbidden copy-constructor
4378 GeomAPI_ProjectPointOnSurf myProjFace;
4379 GeomAPI_ProjectPointOnCurve myProjEdge;
4381 TopoDS_Shape myShape;
4386 struct ElementsOnShape::OctreeClassifier : public SMESH_Octree
4388 OctreeClassifier( const std::vector< ElementsOnShape::Classifier* >& classifiers );
4389 OctreeClassifier( const OctreeClassifier* otherTree,
4390 const std::vector< ElementsOnShape::Classifier >& clsOther,
4391 std::vector< ElementsOnShape::Classifier >& cls );
4392 void GetClassifiersAtPoint( const gp_XYZ& p,
4393 std::vector< ElementsOnShape::Classifier* >& classifiers );
4397 OctreeClassifier() {}
4398 SMESH_Octree* newChild() const { return new OctreeClassifier; }
4399 void buildChildrenData();
4400 Bnd_B3d* buildRootBox();
4402 std::vector< ElementsOnShape::Classifier* > myClassifiers;
4406 ElementsOnShape::ElementsOnShape():
4408 myType(SMDSAbs_All),
4409 myToler(Precision::Confusion()),
4410 myAllNodesFlag(false)
4414 ElementsOnShape::~ElementsOnShape()
4419 Predicate* ElementsOnShape::clone() const
4421 size_t size = sizeof( *this );
4423 size += myOctree->GetSize();
4424 if ( !myClassifiers.empty() )
4425 size += sizeof( myClassifiers[0] ) * myClassifiers.size();
4426 if ( !myWorkClassifiers.empty() )
4427 size += sizeof( myWorkClassifiers[0] ) * myWorkClassifiers.size();
4428 if ( size > 1e+9 ) // 1G
4431 std::cout << "Avoid ElementsOnShape::clone(), too large: " << size << " bytes " << std::endl;
4436 ElementsOnShape* cln = new ElementsOnShape();
4437 cln->SetAllNodes ( myAllNodesFlag );
4438 cln->SetTolerance( myToler );
4439 cln->SetMesh ( myMeshModifTracer.GetMesh() );
4440 cln->myShape = myShape; // avoid creation of myClassifiers
4441 cln->SetShape ( myShape, myType );
4442 cln->myClassifiers.resize( myClassifiers.size() );
4443 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4444 cln->myClassifiers[ i ].Init( BRepBuilderAPI_Copy( myClassifiers[ i ].Shape()),
4445 myToler, myClassifiers[ i ].GetBndBox() );
4446 if ( myOctree ) // copy myOctree
4448 cln->myOctree = new OctreeClassifier( myOctree, myClassifiers, cln->myClassifiers );
4453 SMDSAbs_ElementType ElementsOnShape::GetType() const
4458 void ElementsOnShape::SetTolerance (const double theToler)
4460 if (myToler != theToler) {
4462 SetShape(myShape, myType);
4466 double ElementsOnShape::GetTolerance() const
4471 void ElementsOnShape::SetAllNodes (bool theAllNodes)
4473 myAllNodesFlag = theAllNodes;
4476 void ElementsOnShape::SetMesh (const SMDS_Mesh* theMesh)
4478 myMeshModifTracer.SetMesh( theMesh );
4479 if ( myMeshModifTracer.IsMeshModified())
4481 size_t nbNodes = theMesh ? theMesh->NbNodes() : 0;
4482 if ( myNodeIsChecked.size() == nbNodes )
4484 std::fill( myNodeIsChecked.begin(), myNodeIsChecked.end(), false );
4488 SMESHUtils::FreeVector( myNodeIsChecked );
4489 SMESHUtils::FreeVector( myNodeIsOut );
4490 myNodeIsChecked.resize( nbNodes, false );
4491 myNodeIsOut.resize( nbNodes );
4496 bool ElementsOnShape::getNodeIsOut( const SMDS_MeshNode* n, bool& isOut )
4498 if ( n->GetID() >= (int) myNodeIsChecked.size() ||
4499 !myNodeIsChecked[ n->GetID() ])
4502 isOut = myNodeIsOut[ n->GetID() ];
4506 void ElementsOnShape::setNodeIsOut( const SMDS_MeshNode* n, bool isOut )
4508 if ( n->GetID() < (int) myNodeIsChecked.size() )
4510 myNodeIsChecked[ n->GetID() ] = true;
4511 myNodeIsOut [ n->GetID() ] = isOut;
4515 void ElementsOnShape::SetShape (const TopoDS_Shape& theShape,
4516 const SMDSAbs_ElementType theType)
4518 bool shapeChanges = ( myShape != theShape );
4521 if ( myShape.IsNull() ) return;
4525 // find most complex shapes
4526 TopTools_IndexedMapOfShape shapesMap;
4527 TopAbs_ShapeEnum shapeTypes[4] = { TopAbs_SOLID, TopAbs_FACE, TopAbs_EDGE, TopAbs_VERTEX };
4528 TopExp_Explorer sub;
4529 for ( int i = 0; i < 4; ++i )
4531 if ( shapesMap.IsEmpty() )
4532 for ( sub.Init( myShape, shapeTypes[i] ); sub.More(); sub.Next() )
4533 shapesMap.Add( sub.Current() );
4535 for ( sub.Init( myShape, shapeTypes[i], shapeTypes[i-1] ); sub.More(); sub.Next() )
4536 shapesMap.Add( sub.Current() );
4540 myClassifiers.resize( shapesMap.Extent() );
4541 for ( int i = 0; i < shapesMap.Extent(); ++i )
4542 myClassifiers[ i ].Init( shapesMap( i+1 ), myToler );
4545 if ( theType == SMDSAbs_Node )
4547 SMESHUtils::FreeVector( myNodeIsChecked );
4548 SMESHUtils::FreeVector( myNodeIsOut );
4552 std::fill( myNodeIsChecked.begin(), myNodeIsChecked.end(), false );
4556 void ElementsOnShape::clearClassifiers()
4558 // for ( size_t i = 0; i < myClassifiers.size(); ++i )
4559 // delete myClassifiers[ i ];
4560 myClassifiers.clear();
4566 bool ElementsOnShape::IsSatisfy( long elemId )
4568 if ( myClassifiers.empty() )
4571 const SMDS_Mesh* mesh = myMeshModifTracer.GetMesh();
4572 if ( myType == SMDSAbs_Node )
4573 return IsSatisfy( mesh->FindNode( elemId ));
4574 return IsSatisfy( mesh->FindElement( elemId ));
4577 bool ElementsOnShape::IsSatisfy (const SMDS_MeshElement* elem)
4582 bool isSatisfy = myAllNodesFlag, isNodeOut;
4584 gp_XYZ centerXYZ (0, 0, 0);
4586 if ( !myOctree && myClassifiers.size() > 5 )
4588 myWorkClassifiers.resize( myClassifiers.size() );
4589 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4590 myWorkClassifiers[ i ] = & myClassifiers[ i ];
4591 myOctree = new OctreeClassifier( myWorkClassifiers );
4593 SMESHUtils::FreeVector( myWorkClassifiers );
4596 for ( int i = 0, nb = elem->NbNodes(); i < nb && (isSatisfy == myAllNodesFlag); ++i )
4598 SMESH_TNodeXYZ aPnt( elem->GetNode( i ));
4602 if ( !getNodeIsOut( aPnt._node, isNodeOut ))
4606 myWorkClassifiers.clear();
4607 myOctree->GetClassifiersAtPoint( aPnt, myWorkClassifiers );
4609 for ( size_t i = 0; i < myWorkClassifiers.size(); ++i )
4610 myWorkClassifiers[i]->SetChecked( false );
4612 for ( size_t i = 0; i < myWorkClassifiers.size() && isNodeOut; ++i )
4613 if ( !myWorkClassifiers[i]->IsChecked() )
4614 isNodeOut = myWorkClassifiers[i]->IsOut( aPnt );
4618 for ( size_t i = 0; i < myClassifiers.size() && isNodeOut; ++i )
4619 isNodeOut = myClassifiers[i].IsOut( aPnt );
4621 setNodeIsOut( aPnt._node, isNodeOut );
4623 isSatisfy = !isNodeOut;
4626 // Check the center point for volumes MantisBug 0020168
4629 myClassifiers[0].ShapeType() == TopAbs_SOLID )
4631 centerXYZ /= elem->NbNodes();
4635 myWorkClassifiers.clear();
4636 myOctree->GetClassifiersAtPoint( centerXYZ, myWorkClassifiers );
4637 for ( size_t i = 0; i < myWorkClassifiers.size() && !isSatisfy; ++i )
4638 isSatisfy = ! myWorkClassifiers[i]->IsOut( centerXYZ );
4642 for ( size_t i = 0; i < myClassifiers.size() && !isSatisfy; ++i )
4643 isSatisfy = ! myClassifiers[i].IsOut( centerXYZ );
4650 //================================================================================
4652 * \brief Check and optionally return a satisfying shape
4654 //================================================================================
4656 bool ElementsOnShape::IsSatisfy (const SMDS_MeshNode* node,
4657 TopoDS_Shape* okShape)
4662 if ( !myOctree && myClassifiers.size() > 5 )
4664 myWorkClassifiers.resize( myClassifiers.size() );
4665 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4666 myWorkClassifiers[ i ] = & myClassifiers[ i ];
4667 myOctree = new OctreeClassifier( myWorkClassifiers );
4670 bool isNodeOut = true;
4672 if ( okShape || !getNodeIsOut( node, isNodeOut ))
4674 SMESH_NodeXYZ aPnt = node;
4677 myWorkClassifiers.clear();
4678 myOctree->GetClassifiersAtPoint( aPnt, myWorkClassifiers );
4680 for ( size_t i = 0; i < myWorkClassifiers.size(); ++i )
4681 myWorkClassifiers[i]->SetChecked( false );
4683 for ( size_t i = 0; i < myWorkClassifiers.size(); ++i )
4684 if ( !myWorkClassifiers[i]->IsChecked() &&
4685 !myWorkClassifiers[i]->IsOut( aPnt ))
4689 *okShape = myWorkClassifiers[i]->Shape();
4695 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4696 if ( !myClassifiers[i].IsOut( aPnt ))
4700 *okShape = myClassifiers[i].Shape();
4704 setNodeIsOut( node, isNodeOut );
4710 void ElementsOnShape::Classifier::Init( const TopoDS_Shape& theShape,
4712 const Bnd_B3d* theBox )
4718 bool isShapeBox = false;
4719 switch ( myShape.ShapeType() )
4723 if (( isShapeBox = isBox( theShape )))
4725 myIsOutFun = & ElementsOnShape::Classifier::isOutOfBox;
4729 mySolidClfr = new BRepClass3d_SolidClassifier( prepareSolid( theShape ));
4730 myIsOutFun = & ElementsOnShape::Classifier::isOutOfSolid;
4736 Standard_Real u1,u2,v1,v2;
4737 Handle(Geom_Surface) surf = BRep_Tool::Surface( TopoDS::Face( theShape ));
4738 if ( surf.IsNull() )
4739 myIsOutFun = & ElementsOnShape::Classifier::isOutOfNone;
4742 surf->Bounds( u1,u2,v1,v2 );
4743 myProjFace.Init(surf, u1,u2, v1,v2, myTol );
4744 myIsOutFun = & ElementsOnShape::Classifier::isOutOfFace;
4750 Standard_Real u1, u2;
4751 Handle(Geom_Curve) curve = BRep_Tool::Curve( TopoDS::Edge( theShape ), u1, u2);
4752 if ( curve.IsNull() )
4753 myIsOutFun = & ElementsOnShape::Classifier::isOutOfNone;
4756 myProjEdge.Init(curve, u1, u2);
4757 myIsOutFun = & ElementsOnShape::Classifier::isOutOfEdge;
4763 myVertexXYZ = BRep_Tool::Pnt( TopoDS::Vertex( theShape ) );
4764 myIsOutFun = & ElementsOnShape::Classifier::isOutOfVertex;
4768 throw SALOME_Exception("Programmer error in usage of ElementsOnShape::Classifier");
4780 if ( myShape.ShapeType() == TopAbs_FACE )
4782 BRepAdaptor_Surface SA( TopoDS::Face( myShape ), /*useBoundaries=*/false );
4783 if ( SA.GetType() == GeomAbs_BSplineSurface )
4784 BRepBndLib::AddOptimal( myShape, box,
4785 /*useTriangulation=*/true, /*useShapeTolerance=*/true );
4788 BRepBndLib::Add( myShape, box );
4790 myBox.Add( box.CornerMin() );
4791 myBox.Add( box.CornerMax() );
4792 gp_XYZ halfSize = 0.5 * ( box.CornerMax().XYZ() - box.CornerMin().XYZ() );
4793 for ( int iDim = 1; iDim <= 3; ++iDim )
4795 double x = halfSize.Coord( iDim );
4796 halfSize.SetCoord( iDim, x + Max( myTol, 1e-2 * x ));
4798 myBox.SetHSize( halfSize );
4803 ElementsOnShape::Classifier::~Classifier()
4805 delete mySolidClfr; mySolidClfr = 0;
4808 TopoDS_Shape ElementsOnShape::Classifier::prepareSolid( const TopoDS_Shape& theSolid )
4810 // try to limit tolerance of theSolid down to myTol (issue #19026)
4812 // check if tolerance of theSolid is more than myTol
4813 bool tolIsOk = true; // max tolerance is at VERTEXes
4814 for ( TopExp_Explorer exp( theSolid, TopAbs_VERTEX ); exp.More() && tolIsOk; exp.Next() )
4815 tolIsOk = ( myTol >= BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current() )));
4819 // make a copy to prevent the original shape from changes
4820 TopoDS_Shape resultShape = BRepBuilderAPI_Copy( theSolid );
4822 if ( !GEOMUtils::FixShapeTolerance( resultShape, TopAbs_SHAPE, myTol ))
4827 bool ElementsOnShape::Classifier::isOutOfSolid( const gp_Pnt& p )
4829 if ( isOutOfBox( p )) return true;
4830 mySolidClfr->Perform( p, myTol );
4831 return ( mySolidClfr->State() != TopAbs_IN && mySolidClfr->State() != TopAbs_ON );
4834 bool ElementsOnShape::Classifier::isOutOfBox( const gp_Pnt& p )
4836 return myBox.IsOut( p.XYZ() );
4839 bool ElementsOnShape::Classifier::isOutOfFace( const gp_Pnt& p )
4841 if ( isOutOfBox( p )) return true;
4842 myProjFace.Perform( p );
4843 if ( myProjFace.IsDone() && myProjFace.LowerDistance() <= myTol )
4845 // check relatively to the face
4847 myProjFace.LowerDistanceParameters(u, v);
4848 gp_Pnt2d aProjPnt (u, v);
4849 BRepClass_FaceClassifier aClsf ( TopoDS::Face( myShape ), aProjPnt, myTol );
4850 if ( aClsf.State() == TopAbs_IN || aClsf.State() == TopAbs_ON )
4856 bool ElementsOnShape::Classifier::isOutOfEdge( const gp_Pnt& p )
4858 if ( isOutOfBox( p )) return true;
4859 myProjEdge.Perform( p );
4860 return ! ( myProjEdge.NbPoints() > 0 && myProjEdge.LowerDistance() <= myTol );
4863 bool ElementsOnShape::Classifier::isOutOfVertex( const gp_Pnt& p )
4865 return ( myVertexXYZ.Distance( p ) > myTol );
4868 bool ElementsOnShape::Classifier::isBox(const TopoDS_Shape& theShape )
4870 TopTools_IndexedMapOfShape vMap;
4871 TopExp::MapShapes( theShape, TopAbs_VERTEX, vMap );
4872 if ( vMap.Extent() != 8 )
4876 for ( int i = 1; i <= 8; ++i )
4877 myBox.Add( BRep_Tool::Pnt( TopoDS::Vertex( vMap( i ))).XYZ() );
4879 gp_XYZ pMin = myBox.CornerMin(), pMax = myBox.CornerMax();
4880 for ( int i = 1; i <= 8; ++i )
4882 gp_Pnt p = BRep_Tool::Pnt( TopoDS::Vertex( vMap( i )));
4883 for ( int iC = 1; iC <= 3; ++ iC )
4885 double d1 = Abs( pMin.Coord( iC ) - p.Coord( iC ));
4886 double d2 = Abs( pMax.Coord( iC ) - p.Coord( iC ));
4887 if ( Min( d1, d2 ) > myTol )
4891 myBox.Enlarge( myTol );
4896 OctreeClassifier::OctreeClassifier( const std::vector< ElementsOnShape::Classifier* >& classifiers )
4897 :SMESH_Octree( new SMESH_TreeLimit )
4899 myClassifiers = classifiers;
4904 OctreeClassifier::OctreeClassifier( const OctreeClassifier* otherTree,
4905 const std::vector< ElementsOnShape::Classifier >& clsOther,
4906 std::vector< ElementsOnShape::Classifier >& cls )
4907 :SMESH_Octree( new SMESH_TreeLimit )
4909 myBox = new Bnd_B3d( *otherTree->getBox() );
4911 if (( myIsLeaf = otherTree->isLeaf() ))
4913 myClassifiers.resize( otherTree->myClassifiers.size() );
4914 for ( size_t i = 0; i < otherTree->myClassifiers.size(); ++i )
4916 int ind = otherTree->myClassifiers[i] - & clsOther[0];
4917 myClassifiers[ i ] = & cls[ ind ];
4920 else if ( otherTree->myChildren )
4922 myChildren = new SMESH_Tree< Bnd_B3d, 8 > * [ 8 ];
4923 for ( int i = 0; i < nbChildren(); i++ )
4925 new OctreeClassifier( static_cast<const OctreeClassifier*>( otherTree->myChildren[i]),
4930 void ElementsOnShape::
4931 OctreeClassifier::GetClassifiersAtPoint( const gp_XYZ& point,
4932 std::vector< ElementsOnShape::Classifier* >& result )
4934 if ( getBox()->IsOut( point ))
4939 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4940 if ( !myClassifiers[i]->GetBndBox()->IsOut( point ))
4941 result.push_back( myClassifiers[i] );
4945 for (int i = 0; i < nbChildren(); i++)
4946 ((OctreeClassifier*) myChildren[i])->GetClassifiersAtPoint( point, result );
4950 size_t ElementsOnShape::OctreeClassifier::GetSize()
4952 size_t res = sizeof( *this );
4953 if ( !myClassifiers.empty() )
4954 res += sizeof( myClassifiers[0] ) * myClassifiers.size();
4957 for (int i = 0; i < nbChildren(); i++)
4958 res += ((OctreeClassifier*) myChildren[i])->GetSize();
4963 void ElementsOnShape::OctreeClassifier::buildChildrenData()
4965 // distribute myClassifiers among myChildren
4967 const int childFlag[8] = { 0x0000001,
4975 int nbInChild[8] = { 0, 0, 0, 0, 0, 0, 0, 0 };
4977 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4979 for ( int j = 0; j < nbChildren(); j++ )
4981 if ( !myClassifiers[i]->GetBndBox()->IsOut( *myChildren[j]->getBox() ))
4983 myClassifiers[i]->SetFlag( childFlag[ j ]);
4989 for ( int j = 0; j < nbChildren(); j++ )
4991 OctreeClassifier* child = static_cast<OctreeClassifier*>( myChildren[ j ]);
4992 child->myClassifiers.resize( nbInChild[ j ]);
4993 for ( size_t i = 0; nbInChild[ j ] && i < myClassifiers.size(); ++i )
4995 if ( myClassifiers[ i ]->IsSetFlag( childFlag[ j ]))
4998 child->myClassifiers[ nbInChild[ j ]] = myClassifiers[ i ];
4999 myClassifiers[ i ]->UnsetFlag( childFlag[ j ]);
5003 SMESHUtils::FreeVector( myClassifiers );
5005 // define if a child isLeaf()
5006 for ( int i = 0; i < nbChildren(); i++ )
5008 OctreeClassifier* child = static_cast<OctreeClassifier*>( myChildren[ i ]);
5009 child->myIsLeaf = ( child->myClassifiers.size() <= 5 ||
5010 child->maxSize() < child->myClassifiers[0]->Tolerance() );
5014 Bnd_B3d* ElementsOnShape::OctreeClassifier::buildRootBox()
5016 Bnd_B3d* box = new Bnd_B3d;
5017 for ( size_t i = 0; i < myClassifiers.size(); ++i )
5018 box->Add( *myClassifiers[i]->GetBndBox() );
5023 Class : BelongToGeom
5024 Description : Predicate for verifying whether entity belongs to
5025 specified geometrical support
5028 BelongToGeom::BelongToGeom()
5030 myType(SMDSAbs_NbElementTypes),
5031 myIsSubshape(false),
5032 myTolerance(Precision::Confusion())
5035 Predicate* BelongToGeom::clone() const
5037 BelongToGeom* cln = 0;
5038 if ( myElementsOnShapePtr )
5039 if ( ElementsOnShape* eos = static_cast<ElementsOnShape*>( myElementsOnShapePtr->clone() ))
5041 cln = new BelongToGeom( *this );
5042 cln->myElementsOnShapePtr.reset( eos );
5047 void BelongToGeom::SetMesh( const SMDS_Mesh* theMesh )
5049 if ( myMeshDS != theMesh )
5051 myMeshDS = dynamic_cast<const SMESHDS_Mesh*>(theMesh);
5054 if ( myElementsOnShapePtr )
5055 myElementsOnShapePtr->SetMesh( myMeshDS );
5058 void BelongToGeom::SetGeom( const TopoDS_Shape& theShape )
5060 if ( myShape != theShape )
5067 static bool IsSubShape (const TopTools_IndexedMapOfShape& theMap,
5068 const TopoDS_Shape& theShape)
5070 if (theMap.Contains(theShape)) return true;
5072 if (theShape.ShapeType() == TopAbs_COMPOUND ||
5073 theShape.ShapeType() == TopAbs_COMPSOLID)
5075 TopoDS_Iterator anIt (theShape, Standard_True, Standard_True);
5076 for (; anIt.More(); anIt.Next())
5078 if (!IsSubShape(theMap, anIt.Value())) {
5088 void BelongToGeom::init()
5090 if ( !myMeshDS || myShape.IsNull() ) return;
5092 // is sub-shape of main shape?
5093 TopoDS_Shape aMainShape = myMeshDS->ShapeToMesh();
5094 if (aMainShape.IsNull()) {
5095 myIsSubshape = false;
5098 TopTools_IndexedMapOfShape aMap;
5099 TopExp::MapShapes( aMainShape, aMap );
5100 myIsSubshape = IsSubShape( aMap, myShape );
5104 TopExp::MapShapes( myShape, aMap );
5105 mySubShapesIDs.Clear();
5106 for ( int i = 1; i <= aMap.Extent(); ++i )
5108 int subID = myMeshDS->ShapeToIndex( aMap( i ));
5110 mySubShapesIDs.Add( subID );
5115 //if (!myIsSubshape) // to be always ready to check an element not bound to geometry
5117 if ( !myElementsOnShapePtr )
5118 myElementsOnShapePtr.reset( new ElementsOnShape() );
5119 myElementsOnShapePtr->SetTolerance( myTolerance );
5120 myElementsOnShapePtr->SetAllNodes( true ); // "belong", while false means "lays on"
5121 myElementsOnShapePtr->SetMesh( myMeshDS );
5122 myElementsOnShapePtr->SetShape( myShape, myType );
5126 bool BelongToGeom::IsSatisfy (long theId)
5128 if (myMeshDS == 0 || myShape.IsNull())
5133 return myElementsOnShapePtr->IsSatisfy(theId);
5138 if (myType == SMDSAbs_Node)
5140 if ( const SMDS_MeshNode* aNode = myMeshDS->FindNode( theId ))
5142 if ( aNode->getshapeId() < 1 )
5143 return myElementsOnShapePtr->IsSatisfy(theId);
5145 return mySubShapesIDs.Contains( aNode->getshapeId() );
5150 if ( const SMDS_MeshElement* anElem = myMeshDS->FindElement( theId ))
5152 if ( myType == SMDSAbs_All || anElem->GetType() == myType )
5154 if ( anElem->getshapeId() < 1 )
5155 return myElementsOnShapePtr->IsSatisfy(theId);
5157 return mySubShapesIDs.Contains( anElem->getshapeId() );
5165 void BelongToGeom::SetType (SMDSAbs_ElementType theType)
5167 if ( myType != theType )
5174 SMDSAbs_ElementType BelongToGeom::GetType() const
5179 TopoDS_Shape BelongToGeom::GetShape()
5184 const SMESHDS_Mesh* BelongToGeom::GetMeshDS() const
5189 void BelongToGeom::SetTolerance (double theTolerance)
5191 myTolerance = theTolerance;
5195 double BelongToGeom::GetTolerance()
5202 Description : Predicate for verifying whether entiy lying or partially lying on
5203 specified geometrical support
5206 LyingOnGeom::LyingOnGeom()
5208 myType(SMDSAbs_NbElementTypes),
5209 myIsSubshape(false),
5210 myTolerance(Precision::Confusion())
5213 Predicate* LyingOnGeom::clone() const
5215 LyingOnGeom* cln = 0;
5216 if ( myElementsOnShapePtr )
5217 if ( ElementsOnShape* eos = static_cast<ElementsOnShape*>( myElementsOnShapePtr->clone() ))
5219 cln = new LyingOnGeom( *this );
5220 cln->myElementsOnShapePtr.reset( eos );
5225 void LyingOnGeom::SetMesh( const SMDS_Mesh* theMesh )
5227 if ( myMeshDS != theMesh )
5229 myMeshDS = dynamic_cast<const SMESHDS_Mesh*>(theMesh);
5232 if ( myElementsOnShapePtr )
5233 myElementsOnShapePtr->SetMesh( myMeshDS );
5236 void LyingOnGeom::SetGeom( const TopoDS_Shape& theShape )
5238 if ( myShape != theShape )
5245 void LyingOnGeom::init()
5247 if (!myMeshDS || myShape.IsNull()) return;
5249 // is sub-shape of main shape?
5250 TopoDS_Shape aMainShape = myMeshDS->ShapeToMesh();
5251 if (aMainShape.IsNull()) {
5252 myIsSubshape = false;
5255 myIsSubshape = myMeshDS->IsGroupOfSubShapes( myShape );
5260 TopTools_IndexedMapOfShape shapes;
5261 TopExp::MapShapes( myShape, shapes );
5262 mySubShapesIDs.Clear();
5263 for ( int i = 1; i <= shapes.Extent(); ++i )
5265 int subID = myMeshDS->ShapeToIndex( shapes( i ));
5267 mySubShapesIDs.Add( subID );
5270 // else // to be always ready to check an element not bound to geometry
5272 if ( !myElementsOnShapePtr )
5273 myElementsOnShapePtr.reset( new ElementsOnShape() );
5274 myElementsOnShapePtr->SetTolerance( myTolerance );
5275 myElementsOnShapePtr->SetAllNodes( false ); // lays on, while true means "belong"
5276 myElementsOnShapePtr->SetMesh( myMeshDS );
5277 myElementsOnShapePtr->SetShape( myShape, myType );
5281 bool LyingOnGeom::IsSatisfy( long theId )
5283 if ( myMeshDS == 0 || myShape.IsNull() )
5288 return myElementsOnShapePtr->IsSatisfy(theId);
5293 const SMDS_MeshElement* elem =
5294 ( myType == SMDSAbs_Node ) ? myMeshDS->FindNode( theId ) : myMeshDS->FindElement( theId );
5296 if ( mySubShapesIDs.Contains( elem->getshapeId() ))
5299 if (( elem->GetType() != SMDSAbs_Node ) &&
5300 ( myType == SMDSAbs_All || elem->GetType() == myType ))
5302 SMDS_ElemIteratorPtr nodeItr = elem->nodesIterator();
5303 while ( nodeItr->more() )
5305 const SMDS_MeshElement* aNode = nodeItr->next();
5306 if ( mySubShapesIDs.Contains( aNode->getshapeId() ))
5314 void LyingOnGeom::SetType( SMDSAbs_ElementType theType )
5316 if ( myType != theType )
5323 SMDSAbs_ElementType LyingOnGeom::GetType() const
5328 TopoDS_Shape LyingOnGeom::GetShape()
5333 const SMESHDS_Mesh* LyingOnGeom::GetMeshDS() const
5338 void LyingOnGeom::SetTolerance (double theTolerance)
5340 myTolerance = theTolerance;
5344 double LyingOnGeom::GetTolerance()
5349 TSequenceOfXYZ::TSequenceOfXYZ(): myElem(0)
5352 TSequenceOfXYZ::TSequenceOfXYZ(size_type n) : myArray(n), myElem(0)
5355 TSequenceOfXYZ::TSequenceOfXYZ(size_type n, const gp_XYZ& t) : myArray(n,t), myElem(0)
5358 TSequenceOfXYZ::TSequenceOfXYZ(const TSequenceOfXYZ& theSequenceOfXYZ) : myArray(theSequenceOfXYZ.myArray), myElem(theSequenceOfXYZ.myElem)
5361 template <class InputIterator>
5362 TSequenceOfXYZ::TSequenceOfXYZ(InputIterator theBegin, InputIterator theEnd): myArray(theBegin,theEnd), myElem(0)
5365 TSequenceOfXYZ::~TSequenceOfXYZ()
5368 TSequenceOfXYZ& TSequenceOfXYZ::operator=(const TSequenceOfXYZ& theSequenceOfXYZ)
5370 myArray = theSequenceOfXYZ.myArray;
5371 myElem = theSequenceOfXYZ.myElem;
5375 gp_XYZ& TSequenceOfXYZ::operator()(size_type n)
5377 return myArray[n-1];
5380 const gp_XYZ& TSequenceOfXYZ::operator()(size_type n) const
5382 return myArray[n-1];
5385 void TSequenceOfXYZ::clear()
5390 void TSequenceOfXYZ::reserve(size_type n)
5395 void TSequenceOfXYZ::push_back(const gp_XYZ& v)
5397 myArray.push_back(v);
5400 TSequenceOfXYZ::size_type TSequenceOfXYZ::size() const
5402 return myArray.size();
5405 SMDSAbs_EntityType TSequenceOfXYZ::getElementEntity() const
5407 return myElem ? myElem->GetEntityType() : SMDSEntity_Last;
5410 TMeshModifTracer::TMeshModifTracer():
5411 myMeshModifTime(0), myMesh(0)
5414 void TMeshModifTracer::SetMesh( const SMDS_Mesh* theMesh )
5416 if ( theMesh != myMesh )
5417 myMeshModifTime = 0;
5420 bool TMeshModifTracer::IsMeshModified()
5422 bool modified = false;
5425 modified = ( myMeshModifTime != myMesh->GetMTime() );
5426 myMeshModifTime = myMesh->GetMTime();