1 // Copyright (C) 2007-2024 CEA, EDF, 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;
2354 //================================================================================
2356 Class : ScaledJacobian
2357 Description : Functor returning the ScaledJacobian for volumetric elements
2359 //================================================================================
2361 double ScaledJacobian::GetValue( long theElementId )
2363 if ( theElementId && myMesh ) {
2364 SMDS_VolumeTool aVolumeTool;
2365 if ( aVolumeTool.Set( myMesh->FindElement( theElementId )))
2366 return aVolumeTool.GetScaledJacobian();
2371 //VTK version not used because lack of implementation for HEXAGONAL_PRISM.
2372 //Several mesh quality measures implemented in vtkMeshQuality can be accessed left here as reference
2374 myCurrElement = myMesh->FindElement( theElementId );
2375 if ( myCurrElement )
2377 VTKCellType cellType = myCurrElement->GetVtkType();
2378 vtkUnstructuredGrid* grid = const_cast<SMDS_Mesh*>( myMesh )->GetGrid();
2379 vtkCell* avtkCell = grid->GetCell( myCurrElement->GetVtkID() );
2382 case VTK_QUADRATIC_TETRA:
2384 aVal = Round( vtkMeshQuality::TetScaledJacobian( avtkCell ));
2386 case VTK_QUADRATIC_HEXAHEDRON:
2387 case VTK_HEXAHEDRON:
2388 aVal = Round( vtkMeshQuality::HexScaledJacobian( avtkCell ));
2390 case VTK_QUADRATIC_WEDGE:
2391 case VTK_WEDGE: //Pentahedron
2392 aVal = Round( vtkMeshQuality::WedgeScaledJacobian( avtkCell ));
2394 case VTK_QUADRATIC_PYRAMID:
2396 aVal = Round( vtkMeshQuality::PyramidScaledJacobian( avtkCell ));
2398 case VTK_HEXAGONAL_PRISM:
2399 case VTK_POLYHEDRON:
2408 double ScaledJacobian::GetBadRate( double Value, int /*nbNodes*/ ) const
2413 SMDSAbs_ElementType ScaledJacobian::GetType() const
2415 return SMDSAbs_Volume;
2422 //================================================================================
2424 Class : BadOrientedVolume
2425 Description : Predicate bad oriented volumes
2427 //================================================================================
2429 BadOrientedVolume::BadOrientedVolume()
2434 void BadOrientedVolume::SetMesh( const SMDS_Mesh* theMesh )
2439 bool BadOrientedVolume::IsSatisfy( long theId )
2444 SMDS_VolumeTool vTool( myMesh->FindElement( theId ));
2447 if ( vTool.IsPoly() )
2450 for ( int i = 0; i < vTool.NbFaces() && isOk; ++i )
2451 isOk = vTool.IsFaceExternal( i );
2455 isOk = vTool.IsForward();
2460 SMDSAbs_ElementType BadOrientedVolume::GetType() const
2462 return SMDSAbs_Volume;
2466 Class : BareBorderVolume
2469 bool BareBorderVolume::IsSatisfy(long theElementId )
2471 SMDS_VolumeTool myTool;
2472 if ( myTool.Set( myMesh->FindElement(theElementId)))
2474 for ( int iF = 0; iF < myTool.NbFaces(); ++iF )
2475 if ( myTool.IsFreeFace( iF ))
2477 const SMDS_MeshNode** n = myTool.GetFaceNodes(iF);
2478 std::vector< const SMDS_MeshNode*> nodes( n, n+myTool.NbFaceNodes(iF));
2479 if ( !myMesh->FindElement( nodes, SMDSAbs_Face, /*Nomedium=*/false))
2486 //================================================================================
2488 Class : BareBorderFace
2490 //================================================================================
2492 bool BareBorderFace::IsSatisfy(long theElementId )
2495 if ( const SMDS_MeshElement* face = myMesh->FindElement(theElementId))
2497 if ( face->GetType() == SMDSAbs_Face )
2499 int nbN = face->NbCornerNodes();
2500 for ( int i = 0; i < nbN && !ok; ++i )
2502 // check if a link is shared by another face
2503 const SMDS_MeshNode* n1 = face->GetNode( i );
2504 const SMDS_MeshNode* n2 = face->GetNode( (i+1)%nbN );
2505 SMDS_ElemIteratorPtr fIt = n1->GetInverseElementIterator( SMDSAbs_Face );
2506 bool isShared = false;
2507 while ( !isShared && fIt->more() )
2509 const SMDS_MeshElement* f = fIt->next();
2510 isShared = ( f != face && f->GetNodeIndex(n2) != -1 );
2514 const int iQuad = face->IsQuadratic();
2515 myLinkNodes.resize( 2 + iQuad);
2516 myLinkNodes[0] = n1;
2517 myLinkNodes[1] = n2;
2519 myLinkNodes[2] = face->GetNode( i+nbN );
2520 ok = !myMesh->FindElement( myLinkNodes, SMDSAbs_Edge, /*noMedium=*/false);
2528 //================================================================================
2530 Class : OverConstrainedVolume
2532 //================================================================================
2534 bool OverConstrainedVolume::IsSatisfy(long theElementId )
2536 // An element is over-constrained if all its nodes are on the boundary.
2537 // A node is on the boundary if it is connected to one or more faces.
2538 SMDS_VolumeTool myTool;
2539 if (myTool.Set(myMesh->FindElement(theElementId)))
2541 auto nodes = myTool.GetNodes();
2543 for (int i = 0; i < myTool.NbNodes(); ++i)
2545 auto node = nodes[i];
2546 if (node->NbInverseElements(SMDSAbs_Face) == 0)
2556 //================================================================================
2558 Class : OverConstrainedFace
2560 //================================================================================
2562 bool OverConstrainedFace::IsSatisfy(long theElementId )
2564 // An element is over-constrained if all its nodes are on the boundary.
2565 // A node is on the boundary if it is connected to one or more faces.
2566 if (const SMDS_MeshElement *face = myMesh->FindElement(theElementId))
2567 if (face->GetType() == SMDSAbs_Face)
2569 int nbN = face->NbCornerNodes();
2570 for (int i = 0; i < nbN; ++i)
2572 const SMDS_MeshNode *n1 = face->GetNode(i);
2573 if (n1->NbInverseElements(SMDSAbs_Edge) == 0)
2581 //================================================================================
2583 Class : CoincidentNodes
2584 Description : Predicate of Coincident nodes
2586 //================================================================================
2588 CoincidentNodes::CoincidentNodes()
2593 bool CoincidentNodes::IsSatisfy( long theElementId )
2595 return myCoincidentIDs.Contains( theElementId );
2598 SMDSAbs_ElementType CoincidentNodes::GetType() const
2600 return SMDSAbs_Node;
2603 void CoincidentNodes::SetTolerance( const double theToler )
2605 if ( myToler != theToler )
2612 void CoincidentNodes::SetMesh( const SMDS_Mesh* theMesh )
2614 myMeshModifTracer.SetMesh( theMesh );
2615 if ( myMeshModifTracer.IsMeshModified() )
2617 TIDSortedNodeSet nodesToCheck;
2618 SMDS_NodeIteratorPtr nIt = theMesh->nodesIterator();
2619 while ( nIt->more() )
2620 nodesToCheck.insert( nodesToCheck.end(), nIt->next() );
2622 std::list< std::list< const SMDS_MeshNode*> > nodeGroups;
2623 SMESH_OctreeNode::FindCoincidentNodes ( nodesToCheck, &nodeGroups, myToler );
2625 myCoincidentIDs.Clear();
2626 std::list< std::list< const SMDS_MeshNode*> >::iterator groupIt = nodeGroups.begin();
2627 for ( ; groupIt != nodeGroups.end(); ++groupIt )
2629 std::list< const SMDS_MeshNode*>& coincNodes = *groupIt;
2630 std::list< const SMDS_MeshNode*>::iterator n = coincNodes.begin();
2631 for ( ; n != coincNodes.end(); ++n )
2632 myCoincidentIDs.Add( (*n)->GetID() );
2637 //================================================================================
2639 Class : CoincidentElements
2640 Description : Predicate of Coincident Elements
2641 Note : This class is suitable only for visualization of Coincident Elements
2643 //================================================================================
2645 CoincidentElements::CoincidentElements()
2650 void CoincidentElements::SetMesh( const SMDS_Mesh* theMesh )
2655 bool CoincidentElements::IsSatisfy( long theElementId )
2657 if ( !myMesh ) return false;
2659 if ( const SMDS_MeshElement* e = myMesh->FindElement( theElementId ))
2661 if ( e->GetType() != GetType() ) return false;
2662 std::set< const SMDS_MeshNode* > elemNodes( e->begin_nodes(), e->end_nodes() );
2663 const int nbNodes = e->NbNodes();
2664 SMDS_ElemIteratorPtr invIt = (*elemNodes.begin())->GetInverseElementIterator( GetType() );
2665 while ( invIt->more() )
2667 const SMDS_MeshElement* e2 = invIt->next();
2668 if ( e2 == e || e2->NbNodes() != nbNodes ) continue;
2670 bool sameNodes = true;
2671 for ( size_t i = 0; i < elemNodes.size() && sameNodes; ++i )
2672 sameNodes = ( elemNodes.count( e2->GetNode( i )));
2680 SMDSAbs_ElementType CoincidentElements1D::GetType() const
2682 return SMDSAbs_Edge;
2684 SMDSAbs_ElementType CoincidentElements2D::GetType() const
2686 return SMDSAbs_Face;
2688 SMDSAbs_ElementType CoincidentElements3D::GetType() const
2690 return SMDSAbs_Volume;
2694 //================================================================================
2697 Description : Predicate for free borders
2699 //================================================================================
2701 FreeBorders::FreeBorders()
2706 void FreeBorders::SetMesh( const SMDS_Mesh* theMesh )
2711 bool FreeBorders::IsSatisfy( long theId )
2713 return getNbMultiConnection( myMesh, theId ) == 1;
2716 SMDSAbs_ElementType FreeBorders::GetType() const
2718 return SMDSAbs_Edge;
2722 //================================================================================
2725 Description : Predicate for free Edges
2727 //================================================================================
2729 FreeEdges::FreeEdges()
2734 void FreeEdges::SetMesh( const SMDS_Mesh* theMesh )
2739 bool FreeEdges::IsFreeEdge( const SMDS_MeshNode** theNodes, const smIdType theFaceId )
2741 SMDS_ElemIteratorPtr anElemIter = theNodes[ 0 ]->GetInverseElementIterator(SMDSAbs_Face);
2742 while( anElemIter->more() )
2744 if ( const SMDS_MeshElement* anElem = anElemIter->next())
2746 const smIdType anId = anElem->GetID();
2747 if ( anId != theFaceId && anElem->GetNodeIndex( theNodes[1] ) >= 0 )
2754 bool FreeEdges::IsSatisfy( long theId )
2759 const SMDS_MeshElement* aFace = myMesh->FindElement( theId );
2760 if ( aFace == 0 || aFace->GetType() != SMDSAbs_Face || aFace->NbNodes() < 3 )
2763 SMDS_NodeIteratorPtr anIter = aFace->interlacedNodesIterator();
2767 int i = 0, nbNodes = aFace->NbNodes();
2768 std::vector <const SMDS_MeshNode*> aNodes( nbNodes+1 );
2769 while( anIter->more() )
2770 if ( ! ( aNodes[ i++ ] = anIter->next() ))
2772 aNodes[ nbNodes ] = aNodes[ 0 ];
2774 for ( i = 0; i < nbNodes; i++ )
2775 if ( IsFreeEdge( &aNodes[ i ], theId ) )
2781 SMDSAbs_ElementType FreeEdges::GetType() const
2783 return SMDSAbs_Face;
2786 FreeEdges::Border::Border(long theElemId, long thePntId1, long thePntId2):
2789 myPntId[0] = thePntId1; myPntId[1] = thePntId2;
2790 if(thePntId1 > thePntId2){
2791 myPntId[1] = thePntId1; myPntId[0] = thePntId2;
2795 bool FreeEdges::Border::operator<(const FreeEdges::Border& x) const{
2796 if(myPntId[0] < x.myPntId[0]) return true;
2797 if(myPntId[0] == x.myPntId[0])
2798 if(myPntId[1] < x.myPntId[1]) return true;
2802 inline void UpdateBorders(const FreeEdges::Border& theBorder,
2803 FreeEdges::TBorders& theRegistry,
2804 FreeEdges::TBorders& theContainer)
2806 if(theRegistry.find(theBorder) == theRegistry.end()){
2807 theRegistry.insert(theBorder);
2808 theContainer.insert(theBorder);
2810 theContainer.erase(theBorder);
2814 void FreeEdges::GetBoreders(TBorders& theBorders)
2817 for ( SMDS_FaceIteratorPtr anIter = myMesh->facesIterator(); anIter->more(); )
2819 const SMDS_MeshFace* anElem = anIter->next();
2820 long anElemId = anElem->GetID();
2821 SMDS_NodeIteratorPtr aNodesIter = anElem->interlacedNodesIterator();
2822 if ( !aNodesIter->more() ) continue;
2823 long aNodeId[2] = {0,0};
2824 aNodeId[0] = anElem->GetNode( anElem->NbNodes()-1 )->GetID();
2825 for ( ; aNodesIter->more(); )
2827 aNodeId[1] = aNodesIter->next()->GetID();
2828 Border aBorder( anElemId, aNodeId[0], aNodeId[1] );
2829 UpdateBorders( aBorder, aRegistry, theBorders );
2830 aNodeId[0] = aNodeId[1];
2835 //================================================================================
2838 Description : Predicate for free nodes
2840 //================================================================================
2842 FreeNodes::FreeNodes()
2847 void FreeNodes::SetMesh( const SMDS_Mesh* theMesh )
2852 bool FreeNodes::IsSatisfy( long theNodeId )
2854 const SMDS_MeshNode* aNode = myMesh->FindNode( theNodeId );
2858 return (aNode->NbInverseElements() < 1);
2861 SMDSAbs_ElementType FreeNodes::GetType() const
2863 return SMDSAbs_Node;
2867 //================================================================================
2870 Description : Predicate for free faces
2872 //================================================================================
2874 FreeFaces::FreeFaces()
2879 void FreeFaces::SetMesh( const SMDS_Mesh* theMesh )
2884 bool FreeFaces::IsSatisfy( long theId )
2886 if (!myMesh) return false;
2887 // check that faces nodes refers to less than two common volumes
2888 const SMDS_MeshElement* aFace = myMesh->FindElement( theId );
2889 if ( !aFace || aFace->GetType() != SMDSAbs_Face )
2892 int nbNode = aFace->NbNodes();
2894 // collect volumes to check that number of volumes with count equal nbNode not less than 2
2895 typedef std::map< SMDS_MeshElement*, int > TMapOfVolume; // map of volume counters
2896 typedef std::map< SMDS_MeshElement*, int >::iterator TItrMapOfVolume; // iterator
2897 TMapOfVolume mapOfVol;
2899 SMDS_ElemIteratorPtr nodeItr = aFace->nodesIterator();
2900 while ( nodeItr->more() )
2902 const SMDS_MeshNode* aNode = static_cast<const SMDS_MeshNode*>(nodeItr->next());
2903 if ( !aNode ) continue;
2904 SMDS_ElemIteratorPtr volItr = aNode->GetInverseElementIterator(SMDSAbs_Volume);
2905 while ( volItr->more() )
2907 SMDS_MeshElement* aVol = (SMDS_MeshElement*)volItr->next();
2908 TItrMapOfVolume itr = mapOfVol.insert( std::make_pair( aVol, 0 )).first;
2913 TItrMapOfVolume volItr = mapOfVol.begin();
2914 TItrMapOfVolume volEnd = mapOfVol.end();
2915 for ( ; volItr != volEnd; ++volItr )
2916 if ( (*volItr).second >= nbNode )
2918 // face is not free if number of volumes constructed on their nodes more than one
2922 SMDSAbs_ElementType FreeFaces::GetType() const
2924 return SMDSAbs_Face;
2927 //================================================================================
2929 Class : LinearOrQuadratic
2930 Description : Predicate to verify whether a mesh element is linear
2932 //================================================================================
2934 LinearOrQuadratic::LinearOrQuadratic()
2939 void LinearOrQuadratic::SetMesh( const SMDS_Mesh* theMesh )
2944 bool LinearOrQuadratic::IsSatisfy( long theId )
2946 if (!myMesh) return false;
2947 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
2948 if ( !anElem || (myType != SMDSAbs_All && anElem->GetType() != myType) )
2950 return (!anElem->IsQuadratic());
2953 void LinearOrQuadratic::SetType( SMDSAbs_ElementType theType )
2958 SMDSAbs_ElementType LinearOrQuadratic::GetType() const
2963 //================================================================================
2966 Description : Functor for check color of group to which mesh element belongs to
2968 //================================================================================
2970 GroupColor::GroupColor()
2974 bool GroupColor::IsSatisfy( long theId )
2976 return myIDs.count( theId );
2979 void GroupColor::SetType( SMDSAbs_ElementType theType )
2984 SMDSAbs_ElementType GroupColor::GetType() const
2989 static bool isEqual( const Quantity_Color& theColor1,
2990 const Quantity_Color& theColor2 )
2992 // tolerance to compare colors
2993 const double tol = 5*1e-3;
2994 return ( fabs( theColor1.Red() - theColor2.Red() ) < tol &&
2995 fabs( theColor1.Green() - theColor2.Green() ) < tol &&
2996 fabs( theColor1.Blue() - theColor2.Blue() ) < tol );
2999 void GroupColor::SetMesh( const SMDS_Mesh* theMesh )
3003 const SMESHDS_Mesh* aMesh = dynamic_cast<const SMESHDS_Mesh*>(theMesh);
3007 int nbGrp = aMesh->GetNbGroups();
3011 // iterates on groups and find necessary elements ids
3012 const std::set<SMESHDS_GroupBase*>& aGroups = aMesh->GetGroups();
3013 std::set<SMESHDS_GroupBase*>::const_iterator GrIt = aGroups.begin();
3014 for (; GrIt != aGroups.end(); GrIt++)
3016 SMESHDS_GroupBase* aGrp = (*GrIt);
3019 // check type and color of group
3020 if ( !isEqual( myColor, aGrp->GetColor() ))
3023 // IPAL52867 (prevent infinite recursion via GroupOnFilter)
3024 if ( SMESHDS_GroupOnFilter * gof = dynamic_cast< SMESHDS_GroupOnFilter* >( aGrp ))
3025 if ( gof->GetPredicate().get() == this )
3028 SMDSAbs_ElementType aGrpElType = (SMDSAbs_ElementType)aGrp->GetType();
3029 if ( myType == aGrpElType || (myType == SMDSAbs_All && aGrpElType != SMDSAbs_Node) ) {
3030 // add elements IDS into control
3031 smIdType aSize = aGrp->Extent();
3032 for (smIdType i = 0; i < aSize; i++)
3033 myIDs.insert( aGrp->GetID(i+1) );
3038 void GroupColor::SetColorStr( const TCollection_AsciiString& theStr )
3040 Kernel_Utils::Localizer loc;
3041 TCollection_AsciiString aStr = theStr;
3042 aStr.RemoveAll( ' ' );
3043 aStr.RemoveAll( '\t' );
3044 for ( int aPos = aStr.Search( ";;" ); aPos != -1; aPos = aStr.Search( ";;" ) )
3045 aStr.Remove( aPos, 2 );
3046 Standard_Real clr[3];
3047 clr[0] = clr[1] = clr[2] = 0.;
3048 for ( int i = 0; i < 3; i++ ) {
3049 TCollection_AsciiString tmpStr = aStr.Token( ";", i+1 );
3050 if ( !tmpStr.IsEmpty() && tmpStr.IsRealValue() )
3051 clr[i] = tmpStr.RealValue();
3053 myColor = Quantity_Color( clr[0], clr[1], clr[2], Quantity_TOC_RGB );
3056 //=======================================================================
3057 // name : GetRangeStr
3058 // Purpose : Get range as a string.
3059 // Example: "1,2,3,50-60,63,67,70-"
3060 //=======================================================================
3062 void GroupColor::GetColorStr( TCollection_AsciiString& theResStr ) const
3065 theResStr += TCollection_AsciiString( myColor.Red() );
3066 theResStr += TCollection_AsciiString( ";" ) + TCollection_AsciiString( myColor.Green() );
3067 theResStr += TCollection_AsciiString( ";" ) + TCollection_AsciiString( myColor.Blue() );
3070 //================================================================================
3072 Class : ElemGeomType
3073 Description : Predicate to check element geometry type
3075 //================================================================================
3077 ElemGeomType::ElemGeomType()
3080 myType = SMDSAbs_All;
3081 myGeomType = SMDSGeom_TRIANGLE;
3084 void ElemGeomType::SetMesh( const SMDS_Mesh* theMesh )
3089 bool ElemGeomType::IsSatisfy( long theId )
3091 if (!myMesh) return false;
3092 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
3095 const SMDSAbs_ElementType anElemType = anElem->GetType();
3096 if ( myType != SMDSAbs_All && anElemType != myType )
3098 bool isOk = ( anElem->GetGeomType() == myGeomType );
3102 void ElemGeomType::SetType( SMDSAbs_ElementType theType )
3107 SMDSAbs_ElementType ElemGeomType::GetType() const
3112 void ElemGeomType::SetGeomType( SMDSAbs_GeometryType theType )
3114 myGeomType = theType;
3117 SMDSAbs_GeometryType ElemGeomType::GetGeomType() const
3122 //================================================================================
3124 Class : ElemEntityType
3125 Description : Predicate to check element entity type
3127 //================================================================================
3129 ElemEntityType::ElemEntityType():
3131 myType( SMDSAbs_All ),
3132 myEntityType( SMDSEntity_0D )
3136 void ElemEntityType::SetMesh( const SMDS_Mesh* theMesh )
3141 bool ElemEntityType::IsSatisfy( long theId )
3143 if ( !myMesh ) return false;
3144 if ( myType == SMDSAbs_Node )
3145 return myMesh->FindNode( theId );
3146 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
3148 myEntityType == anElem->GetEntityType() );
3151 void ElemEntityType::SetType( SMDSAbs_ElementType theType )
3156 SMDSAbs_ElementType ElemEntityType::GetType() const
3161 void ElemEntityType::SetElemEntityType( SMDSAbs_EntityType theEntityType )
3163 myEntityType = theEntityType;
3166 SMDSAbs_EntityType ElemEntityType::GetElemEntityType() const
3168 return myEntityType;
3171 //================================================================================
3173 * \brief Class ConnectedElements
3175 //================================================================================
3177 ConnectedElements::ConnectedElements():
3178 myNodeID(0), myType( SMDSAbs_All ), myOkIDsReady( false ) {}
3180 SMDSAbs_ElementType ConnectedElements::GetType() const
3183 smIdType ConnectedElements::GetNode() const
3184 { return myXYZ.empty() ? myNodeID : 0; } // myNodeID can be found by myXYZ
3186 std::vector<double> ConnectedElements::GetPoint() const
3189 void ConnectedElements::clearOkIDs()
3190 { myOkIDsReady = false; myOkIDs.clear(); }
3192 void ConnectedElements::SetType( SMDSAbs_ElementType theType )
3194 if ( myType != theType || myMeshModifTracer.IsMeshModified() )
3199 void ConnectedElements::SetMesh( const SMDS_Mesh* theMesh )
3201 myMeshModifTracer.SetMesh( theMesh );
3202 if ( myMeshModifTracer.IsMeshModified() )
3205 if ( !myXYZ.empty() )
3206 SetPoint( myXYZ[0], myXYZ[1], myXYZ[2] ); // find a node near myXYZ it in a new mesh
3210 void ConnectedElements::SetNode( smIdType nodeID )
3215 bool isSameDomain = false;
3216 if ( myOkIDsReady && myMeshModifTracer.GetMesh() && !myMeshModifTracer.IsMeshModified() )
3217 if ( const SMDS_MeshNode* n = myMeshModifTracer.GetMesh()->FindNode( myNodeID ))
3219 SMDS_ElemIteratorPtr eIt = n->GetInverseElementIterator( myType );
3220 while ( !isSameDomain && eIt->more() )
3221 isSameDomain = IsSatisfy( eIt->next()->GetID() );
3223 if ( !isSameDomain )
3227 void ConnectedElements::SetPoint( double x, double y, double z )
3235 bool isSameDomain = false;
3237 // find myNodeID by myXYZ if possible
3238 if ( myMeshModifTracer.GetMesh() )
3240 SMESHUtils::Deleter<SMESH_ElementSearcher> searcher
3241 ( SMESH_MeshAlgos::GetElementSearcher( (SMDS_Mesh&) *myMeshModifTracer.GetMesh() ));
3243 std::vector< const SMDS_MeshElement* > foundElems;
3244 searcher->FindElementsByPoint( gp_Pnt(x,y,z), SMDSAbs_All, foundElems );
3246 if ( !foundElems.empty() )
3248 myNodeID = foundElems[0]->GetNode(0)->GetID();
3249 if ( myOkIDsReady && !myMeshModifTracer.IsMeshModified() )
3250 isSameDomain = IsSatisfy( foundElems[0]->GetID() );
3253 if ( !isSameDomain )
3257 bool ConnectedElements::IsSatisfy( long theElementId )
3259 // Here we do NOT check if the mesh has changed, we do it in Set...() only!!!
3261 if ( !myOkIDsReady )
3263 if ( !myMeshModifTracer.GetMesh() )
3265 const SMDS_MeshNode* node0 = myMeshModifTracer.GetMesh()->FindNode( myNodeID );
3269 std::list< const SMDS_MeshNode* > nodeQueue( 1, node0 );
3270 std::set< smIdType > checkedNodeIDs;
3272 // foreach node in nodeQueue:
3273 // foreach element sharing a node:
3274 // add ID of an element of myType to myOkIDs;
3275 // push all element nodes absent from checkedNodeIDs to nodeQueue;
3276 while ( !nodeQueue.empty() )
3278 const SMDS_MeshNode* node = nodeQueue.front();
3279 nodeQueue.pop_front();
3281 // loop on elements sharing the node
3282 SMDS_ElemIteratorPtr eIt = node->GetInverseElementIterator();
3283 while ( eIt->more() )
3285 // keep elements of myType
3286 const SMDS_MeshElement* element = eIt->next();
3287 if ( myType == SMDSAbs_All || element->GetType() == myType )
3288 myOkIDs.insert( myOkIDs.end(), element->GetID() );
3290 // enqueue nodes of the element
3291 SMDS_ElemIteratorPtr nIt = element->nodesIterator();
3292 while ( nIt->more() )
3294 const SMDS_MeshNode* n = static_cast< const SMDS_MeshNode* >( nIt->next() );
3295 if ( checkedNodeIDs.insert( n->GetID()).second )
3296 nodeQueue.push_back( n );
3300 if ( myType == SMDSAbs_Node )
3301 std::swap( myOkIDs, checkedNodeIDs );
3303 size_t totalNbElems = myMeshModifTracer.GetMesh()->GetMeshInfo().NbElements( myType );
3304 if ( myOkIDs.size() == totalNbElems )
3307 myOkIDsReady = true;
3310 return myOkIDs.empty() ? true : myOkIDs.count( theElementId );
3313 //================================================================================
3315 * \brief Class CoplanarFaces
3317 //================================================================================
3321 inline bool isLessAngle( const gp_Vec& v1, const gp_Vec& v2, const double cos )
3323 double dot = v1 * v2; // cos * |v1| * |v2|
3324 double l1 = v1.SquareMagnitude();
3325 double l2 = v2.SquareMagnitude();
3326 return (( dot * cos >= 0 ) &&
3327 ( dot * dot ) / l1 / l2 >= ( cos * cos ));
3330 CoplanarFaces::CoplanarFaces()
3331 : myFaceID(0), myToler(0)
3334 void CoplanarFaces::SetMesh( const SMDS_Mesh* theMesh )
3336 myMeshModifTracer.SetMesh( theMesh );
3337 if ( myMeshModifTracer.IsMeshModified() )
3339 // Build a set of coplanar face ids
3341 myCoplanarIDs.Clear();
3343 if ( !myMeshModifTracer.GetMesh() || !myFaceID || !myToler )
3346 const SMDS_MeshElement* face = myMeshModifTracer.GetMesh()->FindElement( myFaceID );
3347 if ( !face || face->GetType() != SMDSAbs_Face )
3351 gp_Vec myNorm = getNormale( static_cast<const SMDS_MeshFace*>(face), &normOK );
3355 const double cosTol = Cos( myToler * M_PI / 180. );
3356 NCollection_Map< SMESH_TLink, SMESH_TLinkHasher > checkedLinks;
3358 std::list< std::pair< const SMDS_MeshElement*, gp_Vec > > faceQueue;
3359 faceQueue.push_back( std::make_pair( face, myNorm ));
3360 while ( !faceQueue.empty() )
3362 face = faceQueue.front().first;
3363 myNorm = faceQueue.front().second;
3364 faceQueue.pop_front();
3366 for ( int i = 0, nbN = face->NbCornerNodes(); i < nbN; ++i )
3368 const SMDS_MeshNode* n1 = face->GetNode( i );
3369 const SMDS_MeshNode* n2 = face->GetNode(( i+1 )%nbN);
3370 if ( !checkedLinks.Add( SMESH_TLink( n1, n2 )))
3372 SMDS_ElemIteratorPtr fIt = n1->GetInverseElementIterator(SMDSAbs_Face);
3373 while ( fIt->more() )
3375 const SMDS_MeshElement* f = fIt->next();
3376 if ( f->GetNodeIndex( n2 ) > -1 )
3378 gp_Vec norm = getNormale( static_cast<const SMDS_MeshFace*>(f), &normOK );
3379 if (!normOK || isLessAngle( myNorm, norm, cosTol))
3381 myCoplanarIDs.Add( f->GetID() );
3382 faceQueue.push_back( std::make_pair( f, norm ));
3390 bool CoplanarFaces::IsSatisfy( long theElementId )
3392 return myCoplanarIDs.Contains( theElementId );
3397 *Description : Predicate for Range of Ids.
3398 * Range may be specified with two ways.
3399 * 1. Using AddToRange method
3400 * 2. With SetRangeStr method. Parameter of this method is a string
3401 * like as "1,2,3,50-60,63,67,70-"
3404 //=======================================================================
3405 // name : RangeOfIds
3406 // Purpose : Constructor
3407 //=======================================================================
3408 RangeOfIds::RangeOfIds()
3411 myType = SMDSAbs_All;
3414 //=======================================================================
3416 // Purpose : Set mesh
3417 //=======================================================================
3418 void RangeOfIds::SetMesh( const SMDS_Mesh* theMesh )
3423 //=======================================================================
3424 // name : AddToRange
3425 // Purpose : Add ID to the range
3426 //=======================================================================
3427 bool RangeOfIds::AddToRange( long theEntityId )
3429 myIds.Add( theEntityId );
3433 //=======================================================================
3434 // name : GetRangeStr
3435 // Purpose : Get range as a string.
3436 // Example: "1,2,3,50-60,63,67,70-"
3437 //=======================================================================
3438 void RangeOfIds::GetRangeStr( TCollection_AsciiString& theResStr )
3443 NCollection_Sequence< std::string > aStrSeq;
3445 TIDsMap::Iterator anIter( myIds );
3446 for ( ; anIter.More(); anIter.Next() )
3448 smIdType anId = anIter.Key();
3449 SMESH_Comment aStr( anId );
3450 anIntSeq.Append( anId );
3451 aStrSeq.Append( aStr );
3454 for ( smIdType i = 1, n = myMin.size(); i <= n; i++ )
3456 smIdType aMinId = myMin[i];
3457 smIdType aMaxId = myMax[i];
3460 if ( aMinId != IntegerFirst() )
3465 if ( aMaxId != std::numeric_limits<smIdType>::max() )
3468 // find position of the string in result sequence and insert string in it
3469 if ( anIntSeq.Length() == 0 )
3471 anIntSeq.Append( aMinId );
3472 aStrSeq.Append( (const char*)aStr );
3476 if ( aMinId < anIntSeq.First() )
3478 anIntSeq.Prepend( aMinId );
3479 aStrSeq.Prepend( (const char*)aStr );
3481 else if ( aMinId > anIntSeq.Last() )
3483 anIntSeq.Append( aMinId );
3484 aStrSeq.Append( (const char*)aStr );
3487 for ( int j = 1, k = anIntSeq.Length(); j <= k; j++ )
3488 if ( aMinId < anIntSeq( j ) )
3490 anIntSeq.InsertBefore( j, aMinId );
3491 aStrSeq.InsertBefore( j, (const char*)aStr );
3497 if ( aStrSeq.Length() == 0 )
3499 std::string aResStr;
3500 aResStr = aStrSeq( 1 );
3501 for ( int j = 2, k = aStrSeq.Length(); j <= k; j++ )
3504 aResStr += aStrSeq( j );
3506 theResStr = aResStr.c_str();
3509 //=======================================================================
3510 // name : SetRangeStr
3511 // Purpose : Define range with string
3512 // Example of entry string: "1,2,3,50-60,63,67,70-"
3513 //=======================================================================
3514 bool RangeOfIds::SetRangeStr( const TCollection_AsciiString& theStr )
3520 TCollection_AsciiString aStr = theStr;
3521 for ( int i = 1; i <= aStr.Length(); ++i )
3523 char c = aStr.Value( i );
3524 if ( !isdigit( c ) && c != ',' && c != '-' )
3525 aStr.SetValue( i, ',');
3527 aStr.RemoveAll( ' ' );
3529 TCollection_AsciiString tmpStr = aStr.Token( ",", 1 );
3531 while ( tmpStr != "" )
3533 tmpStr = aStr.Token( ",", i++ );
3534 int aPos = tmpStr.Search( '-' );
3538 if ( tmpStr.IsIntegerValue() )
3539 myIds.Add( tmpStr.IntegerValue() );
3545 TCollection_AsciiString aMaxStr = tmpStr.Split( aPos );
3546 TCollection_AsciiString aMinStr = tmpStr;
3548 while ( aMinStr.Search( "-" ) != -1 ) aMinStr.RemoveAll( '-' );
3549 while ( aMaxStr.Search( "-" ) != -1 ) aMaxStr.RemoveAll( '-' );
3551 if ( (!aMinStr.IsEmpty() && !aMinStr.IsIntegerValue()) ||
3552 (!aMaxStr.IsEmpty() && !aMaxStr.IsIntegerValue()) )
3555 myMin.push_back( aMinStr.IsEmpty() ? IntegerFirst() : aMinStr.IntegerValue() );
3556 myMax.push_back( aMaxStr.IsEmpty() ? IntegerLast() : aMaxStr.IntegerValue() );
3563 //=======================================================================
3565 // Purpose : Get type of supported entities
3566 //=======================================================================
3567 SMDSAbs_ElementType RangeOfIds::GetType() const
3572 //=======================================================================
3574 // Purpose : Set type of supported entities
3575 //=======================================================================
3576 void RangeOfIds::SetType( SMDSAbs_ElementType theType )
3581 //=======================================================================
3583 // Purpose : Verify whether entity satisfies to this rpedicate
3584 //=======================================================================
3585 bool RangeOfIds::IsSatisfy( long theId )
3590 if ( myType == SMDSAbs_Node )
3592 if ( myMesh->FindNode( theId ) == 0 )
3597 const SMDS_MeshElement* anElem = myMesh->FindElement( theId );
3598 if ( anElem == 0 || (myType != anElem->GetType() && myType != SMDSAbs_All ))
3602 if ( myIds.Contains( theId ) )
3605 for ( size_t i = 0; i < myMin.size(); i++ )
3606 if ( theId >= myMin[i] && theId <= myMax[i] )
3614 Description : Base class for comparators
3616 Comparator::Comparator():
3620 Comparator::~Comparator()
3623 void Comparator::SetMesh( const SMDS_Mesh* theMesh )
3626 myFunctor->SetMesh( theMesh );
3629 void Comparator::SetMargin( double theValue )
3631 myMargin = theValue;
3634 void Comparator::SetNumFunctor( NumericalFunctorPtr theFunct )
3636 myFunctor = theFunct;
3639 SMDSAbs_ElementType Comparator::GetType() const
3641 return myFunctor ? myFunctor->GetType() : SMDSAbs_All;
3644 double Comparator::GetMargin()
3652 Description : Comparator "<"
3654 bool LessThan::IsSatisfy( long theId )
3656 return myFunctor && myFunctor->GetValue( theId ) < myMargin;
3662 Description : Comparator ">"
3664 bool MoreThan::IsSatisfy( long theId )
3666 return myFunctor && myFunctor->GetValue( theId ) > myMargin;
3672 Description : Comparator "="
3675 myToler(Precision::Confusion())
3678 bool EqualTo::IsSatisfy( long theId )
3680 return myFunctor && fabs( myFunctor->GetValue( theId ) - myMargin ) < myToler;
3683 void EqualTo::SetTolerance( double theToler )
3688 double EqualTo::GetTolerance()
3695 Description : Logical NOT predicate
3697 LogicalNOT::LogicalNOT()
3700 LogicalNOT::~LogicalNOT()
3703 bool LogicalNOT::IsSatisfy( long theId )
3705 return myPredicate && !myPredicate->IsSatisfy( theId );
3708 void LogicalNOT::SetMesh( const SMDS_Mesh* theMesh )
3711 myPredicate->SetMesh( theMesh );
3714 void LogicalNOT::SetPredicate( PredicatePtr thePred )
3716 myPredicate = thePred;
3719 SMDSAbs_ElementType LogicalNOT::GetType() const
3721 return myPredicate ? myPredicate->GetType() : SMDSAbs_All;
3726 Class : LogicalBinary
3727 Description : Base class for binary logical predicate
3729 LogicalBinary::LogicalBinary()
3732 LogicalBinary::~LogicalBinary()
3735 void LogicalBinary::SetMesh( const SMDS_Mesh* theMesh )
3738 myPredicate1->SetMesh( theMesh );
3741 myPredicate2->SetMesh( theMesh );
3744 void LogicalBinary::SetPredicate1( PredicatePtr thePredicate )
3746 myPredicate1 = thePredicate;
3749 void LogicalBinary::SetPredicate2( PredicatePtr thePredicate )
3751 myPredicate2 = thePredicate;
3754 SMDSAbs_ElementType LogicalBinary::GetType() const
3756 if ( !myPredicate1 || !myPredicate2 )
3759 SMDSAbs_ElementType aType1 = myPredicate1->GetType();
3760 SMDSAbs_ElementType aType2 = myPredicate2->GetType();
3762 return aType1 == aType2 ? aType1 : SMDSAbs_All;
3768 Description : Logical AND
3770 bool LogicalAND::IsSatisfy( long theId )
3775 myPredicate1->IsSatisfy( theId ) &&
3776 myPredicate2->IsSatisfy( theId );
3782 Description : Logical OR
3784 bool LogicalOR::IsSatisfy( long theId )
3789 (myPredicate1->IsSatisfy( theId ) ||
3790 myPredicate2->IsSatisfy( theId ));
3799 // #include <tbb/parallel_for.h>
3800 // #include <tbb/enumerable_thread_specific.h>
3802 // namespace Parallel
3804 // typedef tbb::enumerable_thread_specific< TIdSequence > TIdSeq;
3808 // const SMDS_Mesh* myMesh;
3809 // PredicatePtr myPredicate;
3810 // TIdSeq & myOKIds;
3811 // Predicate( const SMDS_Mesh* m, PredicatePtr p, TIdSeq & ids ):
3812 // myMesh(m), myPredicate(p->Duplicate()), myOKIds(ids) {}
3813 // void operator() ( const tbb::blocked_range<size_t>& r ) const
3815 // for ( size_t i = r.begin(); i != r.end(); ++i )
3816 // if ( myPredicate->IsSatisfy( i ))
3817 // myOKIds.local().push_back();
3829 void Filter::SetPredicate( PredicatePtr thePredicate )
3831 myPredicate = thePredicate;
3834 void Filter::GetElementsId( const SMDS_Mesh* theMesh,
3835 PredicatePtr thePredicate,
3836 TIdSequence& theSequence,
3837 SMDS_ElemIteratorPtr theElements )
3839 theSequence.clear();
3841 if ( !theMesh || !thePredicate )
3844 thePredicate->SetMesh( theMesh );
3847 theElements = theMesh->elementsIterator( thePredicate->GetType() );
3849 if ( theElements ) {
3850 while ( theElements->more() ) {
3851 const SMDS_MeshElement* anElem = theElements->next();
3852 if ( thePredicate->GetType() == SMDSAbs_All ||
3853 thePredicate->GetType() == anElem->GetType() )
3855 long anId = anElem->GetID();
3856 if ( thePredicate->IsSatisfy( anId ) )
3857 theSequence.push_back( anId );
3863 void Filter::GetElementsId( const SMDS_Mesh* theMesh,
3864 Filter::TIdSequence& theSequence,
3865 SMDS_ElemIteratorPtr theElements )
3867 GetElementsId(theMesh,myPredicate,theSequence,theElements);
3874 typedef std::set<SMDS_MeshFace*> TMapOfFacePtr;
3880 ManifoldPart::Link::Link( SMDS_MeshNode* theNode1,
3881 SMDS_MeshNode* theNode2 )
3887 ManifoldPart::Link::~Link()
3893 bool ManifoldPart::Link::IsEqual( const ManifoldPart::Link& theLink ) const
3895 if ( myNode1 == theLink.myNode1 &&
3896 myNode2 == theLink.myNode2 )
3898 else if ( myNode1 == theLink.myNode2 &&
3899 myNode2 == theLink.myNode1 )
3905 bool ManifoldPart::Link::operator<( const ManifoldPart::Link& x ) const
3907 if(myNode1 < x.myNode1) return true;
3908 if(myNode1 == x.myNode1)
3909 if(myNode2 < x.myNode2) return true;
3913 bool ManifoldPart::IsEqual( const ManifoldPart::Link& theLink1,
3914 const ManifoldPart::Link& theLink2 )
3916 return theLink1.IsEqual( theLink2 );
3919 ManifoldPart::ManifoldPart()
3922 myAngToler = Precision::Angular();
3923 myIsOnlyManifold = true;
3926 ManifoldPart::~ManifoldPart()
3931 void ManifoldPart::SetMesh( const SMDS_Mesh* theMesh )
3937 SMDSAbs_ElementType ManifoldPart::GetType() const
3938 { return SMDSAbs_Face; }
3940 bool ManifoldPart::IsSatisfy( long theElementId )
3942 return myMapIds.Contains( theElementId );
3945 void ManifoldPart::SetAngleTolerance( const double theAngToler )
3946 { myAngToler = theAngToler; }
3948 double ManifoldPart::GetAngleTolerance() const
3949 { return myAngToler; }
3951 void ManifoldPart::SetIsOnlyManifold( const bool theIsOnly )
3952 { myIsOnlyManifold = theIsOnly; }
3954 void ManifoldPart::SetStartElem( const long theStartId )
3955 { myStartElemId = theStartId; }
3957 bool ManifoldPart::process()
3960 myMapBadGeomIds.Clear();
3962 myAllFacePtr.clear();
3963 myAllFacePtrIntDMap.clear();
3967 // collect all faces into own map
3968 SMDS_FaceIteratorPtr anFaceItr = myMesh->facesIterator();
3969 for (; anFaceItr->more(); )
3971 SMDS_MeshFace* aFacePtr = (SMDS_MeshFace*)anFaceItr->next();
3972 myAllFacePtr.push_back( aFacePtr );
3973 myAllFacePtrIntDMap[aFacePtr] = myAllFacePtr.size()-1;
3976 SMDS_MeshFace* aStartFace = (SMDS_MeshFace*)myMesh->FindElement( myStartElemId );
3980 // the map of non manifold links and bad geometry
3981 TMapOfLink aMapOfNonManifold;
3982 TIDsMap aMapOfTreated;
3984 // begin cycle on faces from start index and run on vector till the end
3985 // and from begin to start index to cover whole vector
3986 const int aStartIndx = myAllFacePtrIntDMap[aStartFace];
3987 bool isStartTreat = false;
3988 for ( int fi = aStartIndx; !isStartTreat || fi != aStartIndx ; fi++ )
3990 if ( fi == aStartIndx )
3991 isStartTreat = true;
3992 // as result next time when fi will be equal to aStartIndx
3994 SMDS_MeshFace* aFacePtr = myAllFacePtr[ fi ];
3995 if ( aMapOfTreated.Contains( aFacePtr->GetID()) )
3998 aMapOfTreated.Add( aFacePtr->GetID() );
4000 if ( !findConnected( myAllFacePtrIntDMap, aFacePtr,
4001 aMapOfNonManifold, aResFaces ) )
4003 TIDsMap::Iterator anItr( aResFaces );
4004 for ( ; anItr.More(); anItr.Next() )
4006 smIdType aFaceId = anItr.Key();
4007 aMapOfTreated.Add( aFaceId );
4008 myMapIds.Add( aFaceId );
4011 if ( fi == int( myAllFacePtr.size() - 1 ))
4013 } // end run on vector of faces
4014 return !myMapIds.IsEmpty();
4017 static void getLinks( const SMDS_MeshFace* theFace,
4018 ManifoldPart::TVectorOfLink& theLinks )
4020 int aNbNode = theFace->NbNodes();
4021 SMDS_ElemIteratorPtr aNodeItr = theFace->nodesIterator();
4023 SMDS_MeshNode* aNode = 0;
4024 for ( ; aNodeItr->more() && i <= aNbNode; )
4027 SMDS_MeshNode* aN1 = (SMDS_MeshNode*)aNodeItr->next();
4031 SMDS_MeshNode* aN2 = ( i >= aNbNode ) ? aNode : (SMDS_MeshNode*)aNodeItr->next();
4033 ManifoldPart::Link aLink( aN1, aN2 );
4034 theLinks.push_back( aLink );
4038 bool ManifoldPart::findConnected
4039 ( const ManifoldPart::TDataMapFacePtrInt& theAllFacePtrInt,
4040 SMDS_MeshFace* theStartFace,
4041 ManifoldPart::TMapOfLink& theNonManifold,
4042 TIDsMap& theResFaces )
4044 theResFaces.Clear();
4045 if ( !theAllFacePtrInt.size() )
4048 if ( getNormale( theStartFace ).SquareModulus() <= gp::Resolution() )
4050 myMapBadGeomIds.Add( theStartFace->GetID() );
4054 ManifoldPart::TMapOfLink aMapOfBoundary, aMapToSkip;
4055 ManifoldPart::TVectorOfLink aSeqOfBoundary;
4056 theResFaces.Add( theStartFace->GetID() );
4057 ManifoldPart::TDataMapOfLinkFacePtr aDMapLinkFace;
4059 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
4060 aDMapLinkFace, theNonManifold, theStartFace );
4062 bool isDone = false;
4063 while ( !isDone && aMapOfBoundary.size() != 0 )
4065 bool isToReset = false;
4066 ManifoldPart::TVectorOfLink::iterator pLink = aSeqOfBoundary.begin();
4067 for ( ; !isToReset && pLink != aSeqOfBoundary.end(); ++pLink )
4069 ManifoldPart::Link aLink = *pLink;
4070 if ( aMapToSkip.find( aLink ) != aMapToSkip.end() )
4072 // each link could be treated only once
4073 aMapToSkip.insert( aLink );
4075 ManifoldPart::TVectorOfFacePtr aFaces;
4077 if ( myIsOnlyManifold &&
4078 (theNonManifold.find( aLink ) != theNonManifold.end()) )
4082 getFacesByLink( aLink, aFaces );
4083 // filter the element to keep only indicated elements
4084 ManifoldPart::TVectorOfFacePtr aFiltered;
4085 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
4086 for ( ; pFace != aFaces.end(); ++pFace )
4088 SMDS_MeshFace* aFace = *pFace;
4089 if ( myAllFacePtrIntDMap.find( aFace ) != myAllFacePtrIntDMap.end() )
4090 aFiltered.push_back( aFace );
4093 if ( aFaces.size() < 2 ) // no neihgbour faces
4095 else if ( myIsOnlyManifold && aFaces.size() > 2 ) // non manifold case
4097 theNonManifold.insert( aLink );
4102 // compare normal with normals of neighbor element
4103 SMDS_MeshFace* aPrevFace = aDMapLinkFace[ aLink ];
4104 ManifoldPart::TVectorOfFacePtr::iterator pFace = aFaces.begin();
4105 for ( ; pFace != aFaces.end(); ++pFace )
4107 SMDS_MeshFace* aNextFace = *pFace;
4108 if ( aPrevFace == aNextFace )
4110 smIdType anNextFaceID = aNextFace->GetID();
4111 if ( myIsOnlyManifold && theResFaces.Contains( anNextFaceID ) )
4112 // should not be with non manifold restriction. probably bad topology
4114 // check if face was treated and skipped
4115 if ( myMapBadGeomIds.Contains( anNextFaceID ) ||
4116 !isInPlane( aPrevFace, aNextFace ) )
4118 // add new element to connected and extend the boundaries.
4119 theResFaces.Add( anNextFaceID );
4120 expandBoundary( aMapOfBoundary, aSeqOfBoundary,
4121 aDMapLinkFace, theNonManifold, aNextFace );
4125 isDone = !isToReset;
4128 return !theResFaces.IsEmpty();
4131 bool ManifoldPart::isInPlane( const SMDS_MeshFace* theFace1,
4132 const SMDS_MeshFace* theFace2 )
4134 gp_Dir aNorm1 = gp_Dir( getNormale( theFace1 ) );
4135 gp_XYZ aNorm2XYZ = getNormale( theFace2 );
4136 if ( aNorm2XYZ.SquareModulus() <= gp::Resolution() )
4138 myMapBadGeomIds.Add( theFace2->GetID() );
4141 if ( aNorm1.IsParallel( gp_Dir( aNorm2XYZ ), myAngToler ) )
4147 void ManifoldPart::expandBoundary
4148 ( ManifoldPart::TMapOfLink& theMapOfBoundary,
4149 ManifoldPart::TVectorOfLink& theSeqOfBoundary,
4150 ManifoldPart::TDataMapOfLinkFacePtr& theDMapLinkFacePtr,
4151 ManifoldPart::TMapOfLink& theNonManifold,
4152 SMDS_MeshFace* theNextFace ) const
4154 ManifoldPart::TVectorOfLink aLinks;
4155 getLinks( theNextFace, aLinks );
4156 int aNbLink = (int)aLinks.size();
4157 for ( int i = 0; i < aNbLink; i++ )
4159 ManifoldPart::Link aLink = aLinks[ i ];
4160 if ( myIsOnlyManifold && (theNonManifold.find( aLink ) != theNonManifold.end()) )
4162 if ( theMapOfBoundary.find( aLink ) != theMapOfBoundary.end() )
4164 if ( myIsOnlyManifold )
4166 // remove from boundary
4167 theMapOfBoundary.erase( aLink );
4168 ManifoldPart::TVectorOfLink::iterator pLink = theSeqOfBoundary.begin();
4169 for ( ; pLink != theSeqOfBoundary.end(); ++pLink )
4171 ManifoldPart::Link aBoundLink = *pLink;
4172 if ( aBoundLink.IsEqual( aLink ) )
4174 theSeqOfBoundary.erase( pLink );
4182 theMapOfBoundary.insert( aLink );
4183 theSeqOfBoundary.push_back( aLink );
4184 theDMapLinkFacePtr[ aLink ] = theNextFace;
4189 void ManifoldPart::getFacesByLink( const ManifoldPart::Link& theLink,
4190 ManifoldPart::TVectorOfFacePtr& theFaces ) const
4193 // take all faces that shared first node
4194 SMDS_ElemIteratorPtr anItr = theLink.myNode1->GetInverseElementIterator( SMDSAbs_Face );
4195 SMDS_StdIterator< const SMDS_MeshElement*, SMDS_ElemIteratorPtr > faces( anItr ), facesEnd;
4196 std::set<const SMDS_MeshElement *> aSetOfFaces( faces, facesEnd );
4198 // take all faces that shared second node
4199 anItr = theLink.myNode2->GetInverseElementIterator( SMDSAbs_Face );
4200 // find the common part of two sets
4201 for ( ; anItr->more(); )
4203 const SMDS_MeshElement* aFace = anItr->next();
4204 if ( aSetOfFaces.count( aFace ))
4205 theFaces.push_back( (SMDS_MeshFace*) aFace );
4210 Class : BelongToMeshGroup
4211 Description : Verify whether a mesh element is included into a mesh group
4213 BelongToMeshGroup::BelongToMeshGroup(): myGroup( 0 )
4217 void BelongToMeshGroup::SetGroup( SMESHDS_GroupBase* g )
4222 void BelongToMeshGroup::SetStoreName( const std::string& sn )
4227 void BelongToMeshGroup::SetMesh( const SMDS_Mesh* theMesh )
4229 if ( myGroup && myGroup->GetMesh() != theMesh )
4233 if ( !myGroup && !myStoreName.empty() )
4235 if ( const SMESHDS_Mesh* aMesh = dynamic_cast<const SMESHDS_Mesh*>(theMesh))
4237 const std::set<SMESHDS_GroupBase*>& grps = aMesh->GetGroups();
4238 std::set<SMESHDS_GroupBase*>::const_iterator g = grps.begin();
4239 for ( ; g != grps.end() && !myGroup; ++g )
4240 if ( *g && myStoreName == (*g)->GetStoreName() )
4246 myGroup->IsEmpty(); // make GroupOnFilter update its predicate
4250 bool BelongToMeshGroup::IsSatisfy( long theElementId )
4252 return myGroup ? myGroup->Contains( theElementId ) : false;
4255 SMDSAbs_ElementType BelongToMeshGroup::GetType() const
4257 return myGroup ? myGroup->GetType() : SMDSAbs_All;
4260 //================================================================================
4261 // ElementsOnSurface
4262 //================================================================================
4264 ElementsOnSurface::ElementsOnSurface()
4267 myType = SMDSAbs_All;
4269 myToler = Precision::Confusion();
4270 myUseBoundaries = false;
4273 ElementsOnSurface::~ElementsOnSurface()
4277 void ElementsOnSurface::SetMesh( const SMDS_Mesh* theMesh )
4279 myMeshModifTracer.SetMesh( theMesh );
4280 if ( myMeshModifTracer.IsMeshModified())
4284 bool ElementsOnSurface::IsSatisfy( long theElementId )
4286 return myIds.Contains( theElementId );
4289 SMDSAbs_ElementType ElementsOnSurface::GetType() const
4292 void ElementsOnSurface::SetTolerance( const double theToler )
4294 if ( myToler != theToler )
4301 double ElementsOnSurface::GetTolerance() const
4304 void ElementsOnSurface::SetUseBoundaries( bool theUse )
4306 if ( myUseBoundaries != theUse ) {
4307 myUseBoundaries = theUse;
4308 SetSurface( mySurf, myType );
4312 void ElementsOnSurface::SetSurface( const TopoDS_Shape& theShape,
4313 const SMDSAbs_ElementType theType )
4318 if ( theShape.IsNull() || theShape.ShapeType() != TopAbs_FACE )
4320 mySurf = TopoDS::Face( theShape );
4321 BRepAdaptor_Surface SA( mySurf, myUseBoundaries );
4323 u1 = SA.FirstUParameter(),
4324 u2 = SA.LastUParameter(),
4325 v1 = SA.FirstVParameter(),
4326 v2 = SA.LastVParameter();
4327 Handle(Geom_Surface) surf = BRep_Tool::Surface( mySurf );
4328 myProjector.Init( surf, u1,u2, v1,v2 );
4332 void ElementsOnSurface::process()
4335 if ( mySurf.IsNull() )
4338 if ( !myMeshModifTracer.GetMesh() )
4341 int nbElems = FromSmIdType<int>( myMeshModifTracer.GetMesh()->GetMeshInfo().NbElements( myType ));
4343 myIds.ReSize( nbElems );
4345 SMDS_ElemIteratorPtr anIter = myMeshModifTracer.GetMesh()->elementsIterator( myType );
4346 for(; anIter->more(); )
4347 process( anIter->next() );
4350 void ElementsOnSurface::process( const SMDS_MeshElement* theElemPtr )
4352 SMDS_ElemIteratorPtr aNodeItr = theElemPtr->nodesIterator();
4353 bool isSatisfy = true;
4354 for ( ; aNodeItr->more(); )
4356 SMDS_MeshNode* aNode = (SMDS_MeshNode*)aNodeItr->next();
4357 if ( !isOnSurface( aNode ) )
4364 myIds.Add( theElemPtr->GetID() );
4367 bool ElementsOnSurface::isOnSurface( const SMDS_MeshNode* theNode )
4369 if ( mySurf.IsNull() )
4372 gp_Pnt aPnt( theNode->X(), theNode->Y(), theNode->Z() );
4373 // double aToler2 = myToler * myToler;
4374 // if ( mySurf->IsKind(STANDARD_TYPE(Geom_Plane)))
4376 // gp_Pln aPln = Handle(Geom_Plane)::DownCast(mySurf)->Pln();
4377 // if ( aPln.SquareDistance( aPnt ) > aToler2 )
4380 // else if ( mySurf->IsKind(STANDARD_TYPE(Geom_CylindricalSurface)))
4382 // gp_Cylinder aCyl = Handle(Geom_CylindricalSurface)::DownCast(mySurf)->Cylinder();
4383 // double aRad = aCyl.Radius();
4384 // gp_Ax3 anAxis = aCyl.Position();
4385 // gp_XYZ aLoc = aCyl.Location().XYZ();
4386 // double aXDist = anAxis.XDirection().XYZ() * ( aPnt.XYZ() - aLoc );
4387 // double aYDist = anAxis.YDirection().XYZ() * ( aPnt.XYZ() - aLoc );
4388 // if ( fabs(aXDist*aXDist + aYDist*aYDist - aRad*aRad) > aToler2 )
4393 myProjector.Perform( aPnt );
4394 bool isOn = ( myProjector.IsDone() && myProjector.LowerDistance() <= myToler );
4400 //================================================================================
4402 //================================================================================
4405 const int theIsCheckedFlag = 0x0000100;
4408 struct ElementsOnShape::Classifier
4410 Classifier(): mySolidClfr(0), myProjFace(0), myProjEdge(0), myFlags(0) { myU = myV = 1e100; }
4412 void Init(const TopoDS_Shape& s, double tol, const Bnd_B3d* box = 0 );
4413 bool IsOut(const gp_Pnt& p) { return SetChecked( true ), (this->*myIsOutFun)( p ); }
4414 TopAbs_ShapeEnum ShapeType() const { return myShape.ShapeType(); }
4415 const TopoDS_Shape& Shape() const { return myShape; }
4416 const Bnd_B3d* GetBndBox() const { return & myBox; }
4417 double Tolerance() const { return myTol; }
4418 bool IsChecked() { return myFlags & theIsCheckedFlag; }
4419 bool IsSetFlag( int flag ) const { return myFlags & flag; }
4420 void SetChecked( bool is ) { is ? SetFlag( theIsCheckedFlag ) : UnsetFlag( theIsCheckedFlag ); }
4421 void SetFlag ( int flag ) { myFlags |= flag; }
4422 void UnsetFlag( int flag ) { myFlags &= ~flag; }
4423 void GetParams( double & u, double & v ) const { u = myU; v = myV; }
4426 bool isOutOfSolid (const gp_Pnt& p);
4427 bool isOutOfBox (const gp_Pnt& p);
4428 bool isOutOfFace (const gp_Pnt& p);
4429 bool isOutOfEdge (const gp_Pnt& p);
4430 bool isOutOfVertex(const gp_Pnt& p);
4431 bool isOutOfNone (const gp_Pnt& /*p*/) { return true; }
4432 bool isBox (const TopoDS_Shape& s);
4434 TopoDS_Shape prepareSolid( const TopoDS_Shape& theSolid );
4436 bool (Classifier::* myIsOutFun)(const gp_Pnt& p);
4437 BRepClass3d_SolidClassifier* mySolidClfr;
4439 GeomAPI_ProjectPointOnSurf* myProjFace;
4440 GeomAPI_ProjectPointOnCurve* myProjEdge;
4442 TopoDS_Shape myShape;
4444 double myU, myV; // result of isOutOfFace() and isOutOfEdge()
4448 struct ElementsOnShape::OctreeClassifier : public SMESH_Octree
4450 OctreeClassifier( const std::vector< ElementsOnShape::Classifier* >& classifiers );
4451 OctreeClassifier( const OctreeClassifier* otherTree,
4452 const std::vector< ElementsOnShape::Classifier >& clsOther,
4453 std::vector< ElementsOnShape::Classifier >& cls );
4454 void GetClassifiersAtPoint( const gp_XYZ& p,
4455 std::vector< ElementsOnShape::Classifier* >& classifiers );
4459 OctreeClassifier() {}
4460 SMESH_Octree* newChild() const { return new OctreeClassifier; }
4461 void buildChildrenData();
4462 Bnd_B3d* buildRootBox();
4464 std::vector< ElementsOnShape::Classifier* > myClassifiers;
4468 ElementsOnShape::ElementsOnShape():
4470 myType(SMDSAbs_All),
4471 myToler(Precision::Confusion()),
4472 myAllNodesFlag(false)
4476 ElementsOnShape::~ElementsOnShape()
4481 Predicate* ElementsOnShape::clone() const
4483 size_t size = sizeof( *this );
4485 size += myOctree->GetSize();
4486 if ( !myClassifiers.empty() )
4487 size += sizeof( myClassifiers[0] ) * myClassifiers.size();
4488 if ( !myWorkClassifiers.empty() )
4489 size += sizeof( myWorkClassifiers[0] ) * myWorkClassifiers.size();
4490 if ( size > 1e+9 ) // 1G
4493 if (SALOME::VerbosityActivated())
4494 std::cout << "Avoid ElementsOnShape::clone(), too large: " << size << " bytes " << std::endl;
4499 ElementsOnShape* cln = new ElementsOnShape();
4500 cln->SetAllNodes ( myAllNodesFlag );
4501 cln->SetTolerance( myToler );
4502 cln->SetMesh ( myMeshModifTracer.GetMesh() );
4503 cln->myShape = myShape; // avoid creation of myClassifiers
4504 cln->SetShape ( myShape, myType );
4505 cln->myClassifiers.resize( myClassifiers.size() );
4506 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4507 cln->myClassifiers[ i ].Init( BRepBuilderAPI_Copy( myClassifiers[ i ].Shape()),
4508 myToler, myClassifiers[ i ].GetBndBox() );
4509 if ( myOctree ) // copy myOctree
4511 cln->myOctree = new OctreeClassifier( myOctree, myClassifiers, cln->myClassifiers );
4516 SMDSAbs_ElementType ElementsOnShape::GetType() const
4521 void ElementsOnShape::SetTolerance (const double theToler)
4523 if (myToler != theToler)
4526 TopoDS_Shape s = myShape;
4528 SetShape( s, myType );
4532 double ElementsOnShape::GetTolerance() const
4537 void ElementsOnShape::SetAllNodes (bool theAllNodes)
4539 myAllNodesFlag = theAllNodes;
4542 void ElementsOnShape::SetMesh (const SMDS_Mesh* theMesh)
4544 myMeshModifTracer.SetMesh( theMesh );
4545 if ( myMeshModifTracer.IsMeshModified())
4547 size_t nbNodes = theMesh ? theMesh->NbNodes() : 0;
4548 if ( myNodeIsChecked.size() == nbNodes )
4550 std::fill( myNodeIsChecked.begin(), myNodeIsChecked.end(), false );
4554 SMESHUtils::FreeVector( myNodeIsChecked );
4555 SMESHUtils::FreeVector( myNodeIsOut );
4556 myNodeIsChecked.resize( nbNodes, false );
4557 myNodeIsOut.resize( nbNodes );
4562 bool ElementsOnShape::getNodeIsOut( const SMDS_MeshNode* n, bool& isOut )
4564 if ( n->GetID() >= (int) myNodeIsChecked.size() ||
4565 !myNodeIsChecked[ n->GetID() ])
4568 isOut = myNodeIsOut[ n->GetID() ];
4572 void ElementsOnShape::setNodeIsOut( const SMDS_MeshNode* n, bool isOut )
4574 if ( n->GetID() < (int) myNodeIsChecked.size() )
4576 myNodeIsChecked[ n->GetID() ] = true;
4577 myNodeIsOut [ n->GetID() ] = isOut;
4581 void ElementsOnShape::SetShape (const TopoDS_Shape& theShape,
4582 const SMDSAbs_ElementType theType)
4584 bool shapeChanges = ( myShape != theShape );
4587 if ( myShape.IsNull() ) return;
4591 // find most complex shapes
4592 TopTools_IndexedMapOfShape shapesMap;
4593 TopAbs_ShapeEnum shapeTypes[4] = { TopAbs_SOLID, TopAbs_FACE, TopAbs_EDGE, TopAbs_VERTEX };
4594 TopExp_Explorer sub;
4595 for ( int i = 0; i < 4; ++i )
4597 if ( shapesMap.IsEmpty() )
4598 for ( sub.Init( myShape, shapeTypes[i] ); sub.More(); sub.Next() )
4599 shapesMap.Add( sub.Current() );
4601 for ( sub.Init( myShape, shapeTypes[i], shapeTypes[i-1] ); sub.More(); sub.Next() )
4602 shapesMap.Add( sub.Current() );
4606 myClassifiers.resize( shapesMap.Extent() );
4607 for ( int i = 0; i < shapesMap.Extent(); ++i )
4608 myClassifiers[ i ].Init( shapesMap( i+1 ), myToler );
4611 if ( theType == SMDSAbs_Node )
4613 SMESHUtils::FreeVector( myNodeIsChecked );
4614 SMESHUtils::FreeVector( myNodeIsOut );
4618 std::fill( myNodeIsChecked.begin(), myNodeIsChecked.end(), false );
4622 void ElementsOnShape::clearClassifiers()
4624 // for ( size_t i = 0; i < myClassifiers.size(); ++i )
4625 // delete myClassifiers[ i ];
4626 myClassifiers.clear();
4632 bool ElementsOnShape::IsSatisfy( long elemId )
4634 if ( myClassifiers.empty() )
4637 const SMDS_Mesh* mesh = myMeshModifTracer.GetMesh();
4638 if ( myType == SMDSAbs_Node )
4639 return IsSatisfy( mesh->FindNode( elemId ));
4640 return IsSatisfy( mesh->FindElement( elemId ));
4643 bool ElementsOnShape::IsSatisfy (const SMDS_MeshElement* elem)
4648 bool isSatisfy = myAllNodesFlag, isNodeOut;
4650 gp_XYZ centerXYZ (0, 0, 0);
4652 if ( !myOctree && myClassifiers.size() > 5 )
4654 myWorkClassifiers.resize( myClassifiers.size() );
4655 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4656 myWorkClassifiers[ i ] = & myClassifiers[ i ];
4657 myOctree = new OctreeClassifier( myWorkClassifiers );
4659 SMESHUtils::FreeVector( myWorkClassifiers );
4662 for ( int i = 0, nb = elem->NbNodes(); i < nb && (isSatisfy == myAllNodesFlag); ++i )
4664 SMESH_TNodeXYZ aPnt( elem->GetNode( i ));
4668 if ( !getNodeIsOut( aPnt._node, isNodeOut ))
4672 myWorkClassifiers.clear();
4673 myOctree->GetClassifiersAtPoint( aPnt, myWorkClassifiers );
4675 for ( size_t i = 0; i < myWorkClassifiers.size(); ++i )
4676 myWorkClassifiers[i]->SetChecked( false );
4678 for ( size_t i = 0; i < myWorkClassifiers.size() && isNodeOut; ++i )
4679 if ( !myWorkClassifiers[i]->IsChecked() )
4680 isNodeOut = myWorkClassifiers[i]->IsOut( aPnt );
4684 for ( size_t i = 0; i < myClassifiers.size() && isNodeOut; ++i )
4685 isNodeOut = myClassifiers[i].IsOut( aPnt );
4687 setNodeIsOut( aPnt._node, isNodeOut );
4689 isSatisfy = !isNodeOut;
4692 // Check the center point for volumes MantisBug 0020168
4695 myClassifiers[0].ShapeType() == TopAbs_SOLID )
4697 centerXYZ /= elem->NbNodes();
4701 myWorkClassifiers.clear();
4702 myOctree->GetClassifiersAtPoint( centerXYZ, myWorkClassifiers );
4703 for ( size_t i = 0; i < myWorkClassifiers.size() && !isSatisfy; ++i )
4704 isSatisfy = ! myWorkClassifiers[i]->IsOut( centerXYZ );
4708 for ( size_t i = 0; i < myClassifiers.size() && !isSatisfy; ++i )
4709 isSatisfy = ! myClassifiers[i].IsOut( centerXYZ );
4716 //================================================================================
4718 * \brief Check and optionally return a satisfying shape
4720 //================================================================================
4722 bool ElementsOnShape::IsSatisfy (const SMDS_MeshNode* node,
4723 TopoDS_Shape* okShape)
4728 if ( !myOctree && myClassifiers.size() > 5 )
4730 myWorkClassifiers.resize( myClassifiers.size() );
4731 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4732 myWorkClassifiers[ i ] = & myClassifiers[ i ];
4733 myOctree = new OctreeClassifier( myWorkClassifiers );
4736 bool isNodeOut = true;
4738 if ( okShape || !getNodeIsOut( node, isNodeOut ))
4740 SMESH_NodeXYZ aPnt = node;
4743 myWorkClassifiers.clear();
4744 myOctree->GetClassifiersAtPoint( aPnt, myWorkClassifiers );
4746 for ( size_t i = 0; i < myWorkClassifiers.size(); ++i )
4747 myWorkClassifiers[i]->SetChecked( false );
4749 for ( size_t i = 0; i < myWorkClassifiers.size(); ++i )
4750 if ( !myWorkClassifiers[i]->IsChecked() &&
4751 !myWorkClassifiers[i]->IsOut( aPnt ))
4755 *okShape = myWorkClassifiers[i]->Shape();
4756 myWorkClassifiers[i]->GetParams( myU, myV );
4762 for ( size_t i = 0; i < myClassifiers.size(); ++i )
4763 if ( !myClassifiers[i].IsOut( aPnt ))
4767 *okShape = myClassifiers[i].Shape();
4768 myClassifiers[i].GetParams( myU, myV );
4772 setNodeIsOut( node, isNodeOut );
4778 void ElementsOnShape::Classifier::Init( const TopoDS_Shape& theShape,
4780 const Bnd_B3d* theBox )
4786 bool isShapeBox = false;
4787 switch ( myShape.ShapeType() )
4791 if (( isShapeBox = isBox( theShape )))
4793 myIsOutFun = & ElementsOnShape::Classifier::isOutOfBox;
4797 mySolidClfr = new BRepClass3d_SolidClassifier( prepareSolid( theShape ));
4798 myIsOutFun = & ElementsOnShape::Classifier::isOutOfSolid;
4804 Standard_Real u1,u2,v1,v2;
4805 Handle(Geom_Surface) surf = BRep_Tool::Surface( TopoDS::Face( theShape ));
4806 if ( surf.IsNull() )
4807 myIsOutFun = & ElementsOnShape::Classifier::isOutOfNone;
4810 surf->Bounds( u1,u2,v1,v2 );
4811 myProjFace = new GeomAPI_ProjectPointOnSurf;
4812 myProjFace->Init( surf, u1,u2, v1,v2, myTol );
4813 myIsOutFun = & ElementsOnShape::Classifier::isOutOfFace;
4819 Standard_Real u1, u2;
4820 Handle(Geom_Curve) curve = BRep_Tool::Curve( TopoDS::Edge( theShape ), u1, u2);
4821 if ( curve.IsNull() )
4822 myIsOutFun = & ElementsOnShape::Classifier::isOutOfNone;
4825 myProjEdge = new GeomAPI_ProjectPointOnCurve;
4826 myProjEdge->Init( curve, u1, u2 );
4827 myIsOutFun = & ElementsOnShape::Classifier::isOutOfEdge;
4833 myVertexXYZ = BRep_Tool::Pnt( TopoDS::Vertex( theShape ) );
4834 myIsOutFun = & ElementsOnShape::Classifier::isOutOfVertex;
4838 throw SALOME_Exception("Programmer error in usage of ElementsOnShape::Classifier");
4850 if ( myShape.ShapeType() == TopAbs_FACE )
4852 BRepAdaptor_Surface SA( TopoDS::Face( myShape ), /*useBoundaries=*/false );
4853 if ( SA.GetType() == GeomAbs_BSplineSurface )
4854 BRepBndLib::AddOptimal( myShape, box,
4855 /*useTriangulation=*/true, /*useShapeTolerance=*/true );
4858 BRepBndLib::Add( myShape, box );
4860 myBox.Add( box.CornerMin() );
4861 myBox.Add( box.CornerMax() );
4862 gp_XYZ halfSize = 0.5 * ( box.CornerMax().XYZ() - box.CornerMin().XYZ() );
4863 for ( int iDim = 1; iDim <= 3; ++iDim )
4865 double x = halfSize.Coord( iDim );
4866 halfSize.SetCoord( iDim, x + Max( myTol, 1e-2 * x ));
4868 myBox.SetHSize( halfSize );
4873 ElementsOnShape::Classifier::~Classifier()
4875 delete mySolidClfr; mySolidClfr = 0;
4876 delete myProjFace; myProjFace = 0;
4877 delete myProjEdge; myProjEdge = 0;
4880 TopoDS_Shape ElementsOnShape::Classifier::prepareSolid( const TopoDS_Shape& theSolid )
4882 // try to limit tolerance of theSolid down to myTol (issue #19026)
4884 // check if tolerance of theSolid is more than myTol
4885 bool tolIsOk = true; // max tolerance is at VERTEXes
4886 for ( TopExp_Explorer exp( theSolid, TopAbs_VERTEX ); exp.More() && tolIsOk; exp.Next() )
4887 tolIsOk = ( myTol >= BRep_Tool::Tolerance( TopoDS::Vertex( exp.Current() )));
4891 // make a copy to prevent the original shape from changes
4892 TopoDS_Shape resultShape = BRepBuilderAPI_Copy( theSolid );
4894 if ( !GEOMUtils::FixShapeTolerance( resultShape, TopAbs_SHAPE, myTol ))
4899 bool ElementsOnShape::Classifier::isOutOfSolid( const gp_Pnt& p )
4901 if ( isOutOfBox( p )) return true;
4902 mySolidClfr->Perform( p, myTol );
4903 return ( mySolidClfr->State() != TopAbs_IN && mySolidClfr->State() != TopAbs_ON );
4906 bool ElementsOnShape::Classifier::isOutOfBox( const gp_Pnt& p )
4908 return myBox.IsOut( p.XYZ() );
4911 bool ElementsOnShape::Classifier::isOutOfFace( const gp_Pnt& p )
4913 if ( isOutOfBox( p )) return true;
4914 myProjFace->Perform( p );
4915 if ( myProjFace->IsDone() && myProjFace->LowerDistance() <= myTol )
4917 // check relatively to the face
4918 myProjFace->LowerDistanceParameters( myU, myV );
4919 gp_Pnt2d aProjPnt( myU, myV );
4920 BRepClass_FaceClassifier aClsf ( TopoDS::Face( myShape ), aProjPnt, myTol );
4921 if ( aClsf.State() == TopAbs_IN || aClsf.State() == TopAbs_ON )
4927 bool ElementsOnShape::Classifier::isOutOfEdge( const gp_Pnt& p )
4929 if ( isOutOfBox( p )) return true;
4930 myProjEdge->Perform( p );
4931 bool isOn = ( myProjEdge->NbPoints() > 0 && myProjEdge->LowerDistance() <= myTol );
4933 myU = myProjEdge->LowerDistanceParameter();
4937 bool ElementsOnShape::Classifier::isOutOfVertex( const gp_Pnt& p )
4939 return ( myVertexXYZ.Distance( p ) > myTol );
4942 bool ElementsOnShape::Classifier::isBox(const TopoDS_Shape& theShape )
4944 TopTools_IndexedMapOfShape vMap;
4945 TopExp::MapShapes( theShape, TopAbs_VERTEX, vMap );
4946 if ( vMap.Extent() != 8 )
4950 for ( int i = 1; i <= 8; ++i )
4951 myBox.Add( BRep_Tool::Pnt( TopoDS::Vertex( vMap( i ))).XYZ() );
4953 gp_XYZ pMin = myBox.CornerMin(), pMax = myBox.CornerMax();
4954 for ( int i = 1; i <= 8; ++i )
4956 gp_Pnt p = BRep_Tool::Pnt( TopoDS::Vertex( vMap( i )));
4957 for ( int iC = 1; iC <= 3; ++ iC )
4959 double d1 = Abs( pMin.Coord( iC ) - p.Coord( iC ));
4960 double d2 = Abs( pMax.Coord( iC ) - p.Coord( iC ));
4961 if ( Min( d1, d2 ) > myTol )
4965 myBox.Enlarge( myTol );
4970 OctreeClassifier::OctreeClassifier( const std::vector< ElementsOnShape::Classifier* >& classifiers )
4971 :SMESH_Octree( new SMESH_TreeLimit )
4973 myClassifiers = classifiers;
4978 OctreeClassifier::OctreeClassifier( const OctreeClassifier* otherTree,
4979 const std::vector< ElementsOnShape::Classifier >& clsOther,
4980 std::vector< ElementsOnShape::Classifier >& cls )
4981 :SMESH_Octree( new SMESH_TreeLimit )
4983 myBox = new Bnd_B3d( *otherTree->getBox() );
4985 if (( myIsLeaf = otherTree->isLeaf() ))
4987 myClassifiers.resize( otherTree->myClassifiers.size() );
4988 for ( size_t i = 0; i < otherTree->myClassifiers.size(); ++i )
4990 int ind = otherTree->myClassifiers[i] - & clsOther[0];
4991 myClassifiers[ i ] = & cls[ ind ];
4994 else if ( otherTree->myChildren )
4996 myChildren = new SMESH_Tree< Bnd_B3d, 8 > * [ 8 ];
4997 for ( int i = 0; i < nbChildren(); i++ )
4999 new OctreeClassifier( static_cast<const OctreeClassifier*>( otherTree->myChildren[i]),
5004 void ElementsOnShape::
5005 OctreeClassifier::GetClassifiersAtPoint( const gp_XYZ& point,
5006 std::vector< ElementsOnShape::Classifier* >& result )
5008 if ( getBox()->IsOut( point ))
5013 for ( size_t i = 0; i < myClassifiers.size(); ++i )
5014 if ( !myClassifiers[i]->GetBndBox()->IsOut( point ))
5015 result.push_back( myClassifiers[i] );
5019 for (int i = 0; i < nbChildren(); i++)
5020 ((OctreeClassifier*) myChildren[i])->GetClassifiersAtPoint( point, result );
5024 size_t ElementsOnShape::OctreeClassifier::GetSize()
5026 size_t res = sizeof( *this );
5027 if ( !myClassifiers.empty() )
5028 res += sizeof( myClassifiers[0] ) * myClassifiers.size();
5031 for (int i = 0; i < nbChildren(); i++)
5032 res += ((OctreeClassifier*) myChildren[i])->GetSize();
5037 void ElementsOnShape::OctreeClassifier::buildChildrenData()
5039 // distribute myClassifiers among myChildren
5041 const int childFlag[8] = { 0x0000001,
5049 int nbInChild[8] = { 0, 0, 0, 0, 0, 0, 0, 0 };
5051 for ( size_t i = 0; i < myClassifiers.size(); ++i )
5053 for ( int j = 0; j < nbChildren(); j++ )
5055 if ( !myClassifiers[i]->GetBndBox()->IsOut( *myChildren[j]->getBox() ))
5057 myClassifiers[i]->SetFlag( childFlag[ j ]);
5063 for ( int j = 0; j < nbChildren(); j++ )
5065 OctreeClassifier* child = static_cast<OctreeClassifier*>( myChildren[ j ]);
5066 child->myClassifiers.resize( nbInChild[ j ]);
5067 for ( size_t i = 0; nbInChild[ j ] && i < myClassifiers.size(); ++i )
5069 if ( myClassifiers[ i ]->IsSetFlag( childFlag[ j ]))
5072 child->myClassifiers[ nbInChild[ j ]] = myClassifiers[ i ];
5073 myClassifiers[ i ]->UnsetFlag( childFlag[ j ]);
5077 SMESHUtils::FreeVector( myClassifiers );
5079 // define if a child isLeaf()
5080 for ( int i = 0; i < nbChildren(); i++ )
5082 OctreeClassifier* child = static_cast<OctreeClassifier*>( myChildren[ i ]);
5083 child->myIsLeaf = ( child->myClassifiers.size() <= 5 ||
5084 child->maxSize() < child->myClassifiers[0]->Tolerance() );
5088 Bnd_B3d* ElementsOnShape::OctreeClassifier::buildRootBox()
5090 Bnd_B3d* box = new Bnd_B3d;
5091 for ( size_t i = 0; i < myClassifiers.size(); ++i )
5092 box->Add( *myClassifiers[i]->GetBndBox() );
5097 Class : BelongToGeom
5098 Description : Predicate for verifying whether entity belongs to
5099 specified geometrical support
5102 BelongToGeom::BelongToGeom()
5104 myType(SMDSAbs_NbElementTypes),
5105 myIsSubshape(false),
5106 myTolerance(Precision::Confusion())
5109 Predicate* BelongToGeom::clone() const
5111 BelongToGeom* cln = 0;
5112 if ( myElementsOnShapePtr )
5113 if ( ElementsOnShape* eos = static_cast<ElementsOnShape*>( myElementsOnShapePtr->clone() ))
5115 cln = new BelongToGeom( *this );
5116 cln->myElementsOnShapePtr.reset( eos );
5121 void BelongToGeom::SetMesh( const SMDS_Mesh* theMesh )
5123 if ( myMeshDS != theMesh )
5125 myMeshDS = dynamic_cast<const SMESHDS_Mesh*>(theMesh);
5128 if ( myElementsOnShapePtr )
5129 myElementsOnShapePtr->SetMesh( myMeshDS );
5132 void BelongToGeom::SetGeom( const TopoDS_Shape& theShape )
5134 if ( myShape != theShape )
5141 static bool IsSubShape (const TopTools_IndexedMapOfShape& theMap,
5142 const TopoDS_Shape& theShape)
5144 if (theMap.Contains(theShape)) return true;
5146 if (theShape.ShapeType() == TopAbs_COMPOUND ||
5147 theShape.ShapeType() == TopAbs_COMPSOLID)
5149 TopoDS_Iterator anIt (theShape, Standard_True, Standard_True);
5150 for (; anIt.More(); anIt.Next())
5152 if (!IsSubShape(theMap, anIt.Value())) {
5162 void BelongToGeom::init()
5164 if ( !myMeshDS || myShape.IsNull() ) return;
5166 // is sub-shape of main shape?
5167 TopoDS_Shape aMainShape = myMeshDS->ShapeToMesh();
5168 if (aMainShape.IsNull()) {
5169 myIsSubshape = false;
5172 TopTools_IndexedMapOfShape aMap;
5173 TopExp::MapShapes( aMainShape, aMap );
5174 myIsSubshape = IsSubShape( aMap, myShape );
5178 TopExp::MapShapes( myShape, aMap );
5179 mySubShapesIDs.Clear();
5180 for ( int i = 1; i <= aMap.Extent(); ++i )
5182 int subID = myMeshDS->ShapeToIndex( aMap( i ));
5184 mySubShapesIDs.Add( subID );
5189 //if (!myIsSubshape) // to be always ready to check an element not bound to geometry
5191 if ( !myElementsOnShapePtr )
5192 myElementsOnShapePtr.reset( new ElementsOnShape() );
5193 myElementsOnShapePtr->SetTolerance( myTolerance );
5194 myElementsOnShapePtr->SetAllNodes( true ); // "belong", while false means "lays on"
5195 myElementsOnShapePtr->SetMesh( myMeshDS );
5196 myElementsOnShapePtr->SetShape( myShape, myType );
5200 bool BelongToGeom::IsSatisfy (long theId)
5202 if (myMeshDS == 0 || myShape.IsNull())
5207 return myElementsOnShapePtr->IsSatisfy(theId);
5212 if (myType == SMDSAbs_Node)
5214 if ( const SMDS_MeshNode* aNode = myMeshDS->FindNode( theId ))
5216 if ( aNode->getshapeId() < 1 )
5217 return myElementsOnShapePtr->IsSatisfy(theId);
5219 return mySubShapesIDs.Contains( aNode->getshapeId() );
5224 if ( const SMDS_MeshElement* anElem = myMeshDS->FindElement( theId ))
5226 if ( myType == SMDSAbs_All || anElem->GetType() == myType )
5228 if ( anElem->getshapeId() < 1 )
5229 return myElementsOnShapePtr->IsSatisfy(theId);
5231 return mySubShapesIDs.Contains( anElem->getshapeId() );
5239 void BelongToGeom::SetType (SMDSAbs_ElementType theType)
5241 if ( myType != theType )
5248 SMDSAbs_ElementType BelongToGeom::GetType() const
5253 TopoDS_Shape BelongToGeom::GetShape()
5258 const SMESHDS_Mesh* BelongToGeom::GetMeshDS() const
5263 void BelongToGeom::SetTolerance (double theTolerance)
5265 myTolerance = theTolerance;
5269 double BelongToGeom::GetTolerance()
5276 Description : Predicate for verifying whether entiy lying or partially lying on
5277 specified geometrical support
5280 LyingOnGeom::LyingOnGeom()
5282 myType(SMDSAbs_NbElementTypes),
5283 myIsSubshape(false),
5284 myTolerance(Precision::Confusion())
5287 Predicate* LyingOnGeom::clone() const
5289 LyingOnGeom* cln = 0;
5290 if ( myElementsOnShapePtr )
5291 if ( ElementsOnShape* eos = static_cast<ElementsOnShape*>( myElementsOnShapePtr->clone() ))
5293 cln = new LyingOnGeom( *this );
5294 cln->myElementsOnShapePtr.reset( eos );
5299 void LyingOnGeom::SetMesh( const SMDS_Mesh* theMesh )
5301 if ( myMeshDS != theMesh )
5303 myMeshDS = dynamic_cast<const SMESHDS_Mesh*>(theMesh);
5306 if ( myElementsOnShapePtr )
5307 myElementsOnShapePtr->SetMesh( myMeshDS );
5310 void LyingOnGeom::SetGeom( const TopoDS_Shape& theShape )
5312 if ( myShape != theShape )
5319 void LyingOnGeom::init()
5321 if (!myMeshDS || myShape.IsNull()) return;
5323 // is sub-shape of main shape?
5324 TopoDS_Shape aMainShape = myMeshDS->ShapeToMesh();
5325 if (aMainShape.IsNull()) {
5326 myIsSubshape = false;
5329 myIsSubshape = myMeshDS->IsGroupOfSubShapes( myShape );
5334 TopTools_IndexedMapOfShape shapes;
5335 TopExp::MapShapes( myShape, shapes );
5336 mySubShapesIDs.Clear();
5337 for ( int i = 1; i <= shapes.Extent(); ++i )
5339 int subID = myMeshDS->ShapeToIndex( shapes( i ));
5341 mySubShapesIDs.Add( subID );
5344 // else // to be always ready to check an element not bound to geometry
5346 if ( !myElementsOnShapePtr )
5347 myElementsOnShapePtr.reset( new ElementsOnShape() );
5348 myElementsOnShapePtr->SetTolerance( myTolerance );
5349 myElementsOnShapePtr->SetAllNodes( false ); // lays on, while true means "belong"
5350 myElementsOnShapePtr->SetMesh( myMeshDS );
5351 myElementsOnShapePtr->SetShape( myShape, myType );
5355 bool LyingOnGeom::IsSatisfy( long theId )
5357 if ( myMeshDS == 0 || myShape.IsNull() )
5362 return myElementsOnShapePtr->IsSatisfy(theId);
5367 const SMDS_MeshElement* elem =
5368 ( myType == SMDSAbs_Node ) ? myMeshDS->FindNode( theId ) : myMeshDS->FindElement( theId );
5370 if ( mySubShapesIDs.Contains( elem->getshapeId() ))
5373 if (( elem->GetType() != SMDSAbs_Node ) &&
5374 ( myType == SMDSAbs_All || elem->GetType() == myType ))
5376 SMDS_ElemIteratorPtr nodeItr = elem->nodesIterator();
5377 while ( nodeItr->more() )
5379 const SMDS_MeshElement* aNode = nodeItr->next();
5380 if ( mySubShapesIDs.Contains( aNode->getshapeId() ))
5388 void LyingOnGeom::SetType( SMDSAbs_ElementType theType )
5390 if ( myType != theType )
5397 SMDSAbs_ElementType LyingOnGeom::GetType() const
5402 TopoDS_Shape LyingOnGeom::GetShape()
5407 const SMESHDS_Mesh* LyingOnGeom::GetMeshDS() const
5412 void LyingOnGeom::SetTolerance (double theTolerance)
5414 myTolerance = theTolerance;
5418 double LyingOnGeom::GetTolerance()
5423 TSequenceOfXYZ::TSequenceOfXYZ(): myElem(0)
5426 TSequenceOfXYZ::TSequenceOfXYZ(size_type n) : myArray(n), myElem(0)
5429 TSequenceOfXYZ::TSequenceOfXYZ(size_type n, const gp_XYZ& t) : myArray(n,t), myElem(0)
5432 TSequenceOfXYZ::TSequenceOfXYZ(const TSequenceOfXYZ& theSequenceOfXYZ) : myArray(theSequenceOfXYZ.myArray), myElem(theSequenceOfXYZ.myElem)
5435 template <class InputIterator>
5436 TSequenceOfXYZ::TSequenceOfXYZ(InputIterator theBegin, InputIterator theEnd): myArray(theBegin,theEnd), myElem(0)
5439 TSequenceOfXYZ::~TSequenceOfXYZ()
5442 TSequenceOfXYZ& TSequenceOfXYZ::operator=(const TSequenceOfXYZ& theSequenceOfXYZ)
5444 myArray = theSequenceOfXYZ.myArray;
5445 myElem = theSequenceOfXYZ.myElem;
5449 gp_XYZ& TSequenceOfXYZ::operator()(size_type n)
5451 return myArray[n-1];
5454 const gp_XYZ& TSequenceOfXYZ::operator()(size_type n) const
5456 return myArray[n-1];
5459 void TSequenceOfXYZ::clear()
5464 void TSequenceOfXYZ::reserve(size_type n)
5469 void TSequenceOfXYZ::push_back(const gp_XYZ& v)
5471 myArray.push_back(v);
5474 TSequenceOfXYZ::size_type TSequenceOfXYZ::size() const
5476 return myArray.size();
5479 SMDSAbs_EntityType TSequenceOfXYZ::getElementEntity() const
5481 return myElem ? myElem->GetEntityType() : SMDSEntity_Last;
5484 TMeshModifTracer::TMeshModifTracer():
5485 myMeshModifTime(0), myMesh(0)
5488 void TMeshModifTracer::SetMesh( const SMDS_Mesh* theMesh )
5490 if ( theMesh != myMesh )
5491 myMeshModifTime = 0;
5494 bool TMeshModifTracer::IsMeshModified()
5496 bool modified = false;
5499 modified = ( myMeshModifTime != myMesh->GetMTime() );
5500 myMeshModifTime = myMesh->GetMTime();