1 // Copyright (C) 2007-2014 CEA/DEN, EDF R&D, OPEN CASCADE
3 // Copyright (C) 2003-2007 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
4 // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
6 // This library is free software; you can redistribute it and/or
7 // modify it under the terms of the GNU Lesser General Public
8 // License as published by the Free Software Foundation; either
9 // version 2.1 of the License, or (at your option) any later version.
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // Lesser General Public License for more details.
16 // You should have received a copy of the GNU Lesser General Public
17 // License along with this library; if not, write to the Free Software
18 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
22 // File : StdMeshers_Adaptive1D.cxx
25 #include "StdMeshers_Adaptive1D.hxx"
27 #include "SMESH_Gen.hxx"
28 #include "SMESH_Mesh.hxx"
29 #include "SMESH_MesherHelper.hxx"
30 #include "SMESH_Octree.hxx"
31 #include "SMESH_subMesh.hxx"
32 #include "SMESH_HypoFilter.hxx"
34 #include <Utils_SALOME_Exception.hxx>
36 #include <BRepAdaptor_Curve.hxx>
37 #include <BRepAdaptor_Surface.hxx>
38 #include <BRepBndLib.hxx>
39 #include <BRepMesh_IncrementalMesh.hxx>
40 #include <BRep_Tool.hxx>
41 #include <Bnd_B3d.hxx>
42 #include <GCPnts_AbscissaPoint.hxx>
43 #include <GeomAdaptor_Curve.hxx>
44 #include <Geom_Curve.hxx>
45 #include <Poly_Array1OfTriangle.hxx>
46 #include <Poly_PolygonOnTriangulation.hxx>
47 #include <Poly_Triangulation.hxx>
48 #include <TColgp_Array1OfPnt.hxx>
50 #include <TopExp_Explorer.hxx>
51 #include <TopLoc_Location.hxx>
52 #include <TopTools_IndexedMapOfShape.hxx>
54 #include <TopoDS_Edge.hxx>
55 #include <TopoDS_Face.hxx>
56 #include <TopoDS_Vertex.hxx>
66 namespace // internal utils
68 //================================================================================
70 * \brief Bnd_B3d with access to its center and half-size
72 struct BBox : public Bnd_B3d
74 gp_XYZ Center() const { return gp_XYZ( myCenter[0], myCenter[1], myCenter[2] ); }
75 gp_XYZ HSize() const { return gp_XYZ( myHSize[0], myHSize[1], myHSize[2] ); }
76 double Size() const { return 2 * myHSize[0]; }
78 //================================================================================
80 * \brief Working data of an EDGE
89 ProbePnt( gp_Pnt p, double u, double sz=1e100 ): myP( p ), myU( u ), mySegSize( sz ) {}
91 BRepAdaptor_Curve myC3d;
93 list< ProbePnt > myPoints;
96 typedef list< ProbePnt >::iterator TPntIter;
97 void AddPoint( TPntIter where, double u )
99 TPntIter it = myPoints.insert( where, ProbePnt( myC3d.Value( u ), u ));
100 myBBox.Add( it->myP.XYZ() );
102 const ProbePnt& First() const { return myPoints.front(); }
103 const ProbePnt& Last() const { return myPoints.back(); }
104 const TopoDS_Edge& Edge() const { return myC3d.Edge(); }
105 bool IsTooDistant( const BBox& faceBox, double maxSegSize ) const
107 gp_XYZ hsize = myBBox.HSize() + gp_XYZ( maxSegSize, maxSegSize, maxSegSize );
108 return faceBox.IsOut ( Bnd_B3d( myBBox.Center(), hsize ));
111 //================================================================================
113 * \brief Octree of local segment size
115 class SegSizeTree : public SMESH_Octree
117 double mySegSize; // segment size
119 // structure holding some common parameters of SegSizeTree
120 struct _CommonData : public SMESH_TreeLimit
122 double myGrading, myMinSize, myMaxSize;
124 _CommonData* getData() const { return (_CommonData*) myLimit; }
126 SegSizeTree(double size): SMESH_Octree(), mySegSize(size)
130 void allocateChildren()
132 myChildren = new SMESH_Octree::TBaseTree*[nbChildren()];
133 for ( int i = 0; i < nbChildren(); ++i )
134 myChildren[i] = NULL;
136 virtual box_type* buildRootBox() { return 0; }
137 virtual SegSizeTree* newChild() const { return 0; }
138 virtual void buildChildrenData() {}
142 SegSizeTree( Bnd_B3d & bb, double grading, double mixSize, double maxSize);
143 void SetSize( const gp_Pnt& p, double size );
144 double SetSize( const gp_Pnt& p1, const gp_Pnt& p2 );
145 double GetSize( const gp_Pnt& p ) const;
146 const BBox* GetBox() const { return (BBox*) getBox(); }
147 double GetMinSize() { return getData()->myMinSize; }
149 //================================================================================
151 * \brief Adaptive wire discertizator.
153 class AdaptiveAlgo : public StdMeshers_Regular_1D
156 AdaptiveAlgo(int hypId, int studyId, SMESH_Gen* gen);
157 virtual bool Compute(SMESH_Mesh & aMesh, const TopoDS_Shape & aShape );
158 virtual bool Evaluate(SMESH_Mesh & theMesh,
159 const TopoDS_Shape & theShape,
160 MapShapeNbElems& theResMap);
161 void SetHypothesis( const StdMeshers_Adaptive1D* hyp );
166 const StdMeshers_Adaptive1D* myHyp;
168 vector< EdgeData > myEdges;
169 SegSizeTree* mySizeTree;
172 //================================================================================
174 * \brief Segment of Poly_PolygonOnTriangulation
181 void Init( const gp_Pnt& p1, const gp_Pnt& p2 )
184 myDir = p2.XYZ() - p1.XYZ();
185 myLength = myDir.Modulus();
186 if ( myLength > std::numeric_limits<double>::min() )
189 bool Distance( const gp_Pnt& P, double& dist ) const // returns length of normal projection
193 double proj = p.Dot( myDir );
194 if ( 0 < proj && proj < myLength )
203 //================================================================================
205 * \brief Data of triangle used to locate it in an octree and to find distance
211 bool myIsChecked; // to mark treated trias instead of using std::set
212 bool myHasNodeOnVertex;
213 Segment* mySegments[3];
214 // data for DistToProjection()
215 gp_XYZ myN0, myEdge1, myEdge2, myNorm, myPVec;
216 double myInvDet, myMaxSize2;
218 void Init( const gp_Pnt& n1, const gp_Pnt& n2, const gp_Pnt& n3 );
219 bool DistToProjection( const gp_Pnt& p, double& dist ) const;
220 bool DistToSegment ( const gp_Pnt& p, double& dist ) const;
222 //================================================================================
224 * \brief Element data held by ElementBndBoxTree + algorithm computing a distance
225 * from a point to element
227 class ElementBndBoxTree;
228 struct ElemTreeData : public SMESH_TreeLimit
230 vector< int > myWorkIDs[8];// to speed up filling ElementBndBoxTree::_elementIDs
231 virtual const Bnd_B3d* GetBox(int elemID) const = 0;
233 struct TriaTreeData : public ElemTreeData
235 vector< Triangle > myTrias;
236 vector< Segment > mySegments;
238 double myTriasDeflection;
240 BRepAdaptor_Surface mySurface;
241 ElementBndBoxTree* myTree;
242 const Poly_Array1OfTriangle* myPolyTrias;
243 const TColgp_Array1OfPnt* myNodes;
246 typedef vector<int> IntVec;
247 IntVec myFoundTriaIDs;
249 TriaTreeData( const TopoDS_Face& face, ElementBndBoxTree* triaTree );
250 ~TriaTreeData() { if ( myOwnNodes ) delete myNodes; myNodes = NULL; }
251 virtual const Bnd_B3d* GetBox(int elemID) const { return &myTrias[elemID].myBox; }
252 void PrepareToTriaSearch();
253 void SetSizeByTrias( SegSizeTree& sizeTree, double deflection ) const;
254 double GetMinDistInSphere(const gp_Pnt& p,
256 const bool projectedOnly,
257 const gp_Pnt* avoidP=0) const;
259 //================================================================================
261 * \brief Octree of triangles or segments
263 class ElementBndBoxTree : public SMESH_Octree
266 ElementBndBoxTree(const TopoDS_Face& face);
267 void GetElementsInSphere( const gp_XYZ& center,
268 const double radius, vector<int> & foundElemIDs) const;
270 ElemTreeData* GetElemData() const { return (ElemTreeData*) myLimit; }
271 TriaTreeData* GetTriaData() const { return (TriaTreeData*) myLimit; }
274 ElementBndBoxTree() {}
275 SMESH_Octree* newChild() const { return new ElementBndBoxTree; }
276 void buildChildrenData();
277 Bnd_B3d* buildRootBox();
279 vector< int > _elementIDs;
281 //================================================================================
283 * \brief Link of two nodes
285 struct NLink : public std::pair< int, int >
287 NLink( int n1, int n2 )
300 int N1() const { return first; }
301 int N2() const { return second; }
304 //================================================================================
306 * \brief Initialize TriaTreeData
308 //================================================================================
310 TriaTreeData::TriaTreeData( const TopoDS_Face& face, ElementBndBoxTree* triaTree )
311 : myTriasDeflection(0), mySurface( face ),
312 myTree(NULL), myPolyTrias(NULL), myNodes(NULL), myOwnNodes(false)
315 Handle(Poly_Triangulation) tr = BRep_Tool::Triangulation( face, loc );
318 myFaceTol = SMESH_MesherHelper::MaxTolerance( face );
320 myNodes = & tr->Nodes();
321 myPolyTrias = & tr->Triangles();
322 myTriasDeflection = tr->Deflection();
323 if ( !loc.IsIdentity() ) // transform nodes if necessary
325 TColgp_Array1OfPnt* trsfNodes = new TColgp_Array1OfPnt( myNodes->Lower(), myNodes->Upper() );
326 trsfNodes->Assign( *myNodes );
329 const gp_Trsf& trsf = loc;
330 for ( int i = trsfNodes->Lower(); i <= trsfNodes->Upper(); ++i )
331 trsfNodes->ChangeValue(i).Transform( trsf );
333 for ( int i = myNodes->Lower(); i <= myNodes->Upper(); ++i )
334 myBBox.Add( myNodes->Value(i).XYZ() );
337 //================================================================================
339 * \brief Prepare data for search of trinagles in GetMinDistInSphere()
341 //================================================================================
343 void TriaTreeData::PrepareToTriaSearch()
345 if ( !myTrias.empty() ) return; // already done
346 if ( !myPolyTrias ) return;
348 // get all boundary links and nodes on VERTEXes
349 map< NLink, Segment* > linkToSegMap;
350 map< NLink, Segment* >::iterator l2s;
351 set< int > vertexNodes;
353 Handle(Poly_Triangulation) tr = BRep_Tool::Triangulation( mySurface.Face(), loc );
356 TopTools_IndexedMapOfShape edgeMap;
357 TopExp::MapShapes( mySurface.Face(), TopAbs_EDGE, edgeMap );
358 for ( int iE = 1; iE <= edgeMap.Extent(); ++iE )
360 const TopoDS_Edge& edge = TopoDS::Edge( edgeMap( iE ));
361 Handle(Poly_PolygonOnTriangulation) polygon =
362 BRep_Tool::PolygonOnTriangulation( edge, tr, loc );
363 if ( polygon.IsNull() )
365 const TColStd_Array1OfInteger& nodes = polygon->Nodes();
366 for ( int i = nodes.Lower(); i < nodes.Upper(); ++i )
367 linkToSegMap.insert( make_pair( NLink( nodes(i), nodes(i+1)), (Segment*)0 ));
368 vertexNodes.insert( nodes( nodes.Lower()));
369 vertexNodes.insert( nodes( nodes.Upper()));
371 // fill mySegments by boundary links
372 mySegments.resize( linkToSegMap.size() );
374 for ( l2s = linkToSegMap.begin(); l2s != linkToSegMap.end(); ++l2s, ++iS )
376 const NLink& link = (*l2s).first;
377 (*l2s).second = & mySegments[ iS ];
378 mySegments[ iS ].Init( myNodes->Value( link.N1() ),
379 myNodes->Value( link.N2() ));
383 // initialize myTrias
384 myTrias.resize( myPolyTrias->Length() );
385 Standard_Integer n1,n2,n3;
386 for ( int i = 1; i <= myPolyTrias->Upper(); ++i )
388 Triangle & t = myTrias[ i-1 ];
389 myPolyTrias->Value( i ).Get( n1,n2,n3 );
390 t.Init( myNodes->Value( n1 ),
391 myNodes->Value( n2 ),
392 myNodes->Value( n3 ));
394 if (( l2s = linkToSegMap.find( NLink( n1, n2 ))) != linkToSegMap.end())
395 t.mySegments[ nbSeg++ ] = l2s->second;
396 if (( l2s = linkToSegMap.find( NLink( n2, n3 ))) != linkToSegMap.end())
397 t.mySegments[ nbSeg++ ] = l2s->second;
398 if (( l2s = linkToSegMap.find( NLink( n3, n1 ))) != linkToSegMap.end())
399 t.mySegments[ nbSeg++ ] = l2s->second;
401 t.mySegments[ nbSeg++ ] = NULL;
403 t.myIsChecked = false;
404 t.myHasNodeOnVertex = ( vertexNodes.count( n1 ) ||
405 vertexNodes.count( n2 ) ||
406 vertexNodes.count( n3 ));
409 // fill the tree of triangles
413 //================================================================================
415 * \brief Set size of segments by size of triangles
417 //================================================================================
419 void TriaTreeData::SetSizeByTrias( SegSizeTree& sizeTree, double hypDeflection ) const
421 if ( mySurface.GetType() == GeomAbs_Plane ||
422 myTriasDeflection <= 1e-100 )
424 const double factor = hypDeflection / myTriasDeflection;
427 switch( mySurface.GetType() ) {
428 case GeomAbs_Cylinder:
431 isConstSize = true; break;
436 map< NLink, double > lenOfDoneLink;
437 map< NLink, double >::iterator link2len;
439 Standard_Integer n[4];
443 double size = -1., maxLinkLen;
447 for ( int i = 1; i <= myPolyTrias->Upper(); ++i )
449 // get corners of a triangle
450 myPolyTrias->Value( i ).Get( n[0],n[1],n[2] );
452 p[0] = myNodes->Value( n[0] );
453 p[1] = myNodes->Value( n[1] );
454 p[2] = myNodes->Value( n[2] );
456 // get length of links and find the longest one
458 for ( int j = 0; j < 3; ++j )
460 link2len = lenOfDoneLink.insert( make_pair( NLink( n[j], n[j+1] ), -1. )).first;
461 isDone[j] = !((*link2len).second < 0 );
462 a[j] = isDone[j] ? (*link2len).second : (*link2len).second = p[j].Distance( p[j+1] );
464 lenOfDoneLink.erase( link2len );
465 if ( a[j] > maxLinkLen )
471 // compute minimal altitude of a triangle
472 if ( !isConstSize || size < 0. )
474 double s = 0.5 * ( a[0] + a[1] + a[2] );
475 double area = sqrt( s * (s - a[0]) * (s - a[1]) * (s - a[2]));
476 size = 2 * area / maxLinkLen; // minimal altitude
478 // set size to the size tree
479 if ( !isDone[ jLongest ] || !isConstSize )
482 if ( size < numeric_limits<double>::min() )
484 int nb = Max( 1, int( maxLinkLen / size / 2 ));
485 for ( int k = 0; k <= nb; ++k )
487 double r = double( k ) / nb;
488 sizeTree.SetSize( r * p[ jLongest ].XYZ() + ( 1-r ) * p[ jLongest+1 ].XYZ(),
492 //cout << "SetSizeByTrias, i="<< i << " " << sz * factor << endl;
494 // cout << "SetSizeByTrias, nn tria="<< myPolyTrias->Upper()
495 // << " nb links" << nbLinks << " isConstSize="<<isConstSize
496 // << " " << size * factor << endl;
498 //================================================================================
500 * \brief Return minimal distance from a given point to a trinangle but not more
501 * distant than a given radius. Triangles with a node at avoidPnt are ignored.
504 //================================================================================
506 double TriaTreeData::GetMinDistInSphere(const gp_Pnt& p,
508 const bool projectedOnly,
509 const gp_Pnt* avoidPnt) const
511 double minDist2 = 1e100;
512 const double tol2 = myFaceTol * myFaceTol;
513 const double dMin2 = myTriasDeflection * myTriasDeflection;
515 TriaTreeData* me = const_cast<TriaTreeData*>( this );
516 me->myFoundTriaIDs.clear();
517 myTree->GetElementsInSphere( p.XYZ(), radius, me->myFoundTriaIDs );
518 if ( myFoundTriaIDs.empty() )
521 Standard_Integer n[ 3 ];
522 for ( size_t i = 0; i < myFoundTriaIDs.size(); ++i )
524 Triangle& t = me->myTrias[ myFoundTriaIDs[i] ];
527 t.myIsChecked = true;
529 double d, minD2 = minDist2;
530 myPolyTrias->Value( myFoundTriaIDs[i]+1 ).Get( n[0],n[1],n[2] );
531 if ( avoidPnt && t.myHasNodeOnVertex )
533 bool avoidTria = false;
534 for ( int i = 0; i < 3; ++i )
536 const gp_Pnt& pn = myNodes->Value(n[i]);
537 if ( avoidTria = ( pn.SquareDistance( *avoidPnt ) <= tol2 ))
539 if ( !projectedOnly )
540 minD2 = Min( minD2, pn.SquareDistance( p ));
544 if (( projectedOnly || minD2 < t.myMaxSize2 ) &&
545 ( t.DistToProjection( p, d ) || t.DistToSegment( p, d )))
546 minD2 = Min( minD2, d*d );
547 minDist2 = Min( minDist2, minD2 );
549 else if ( projectedOnly )
551 if ( t.DistToProjection( p, d ) && d*d > dMin2 )
552 minDist2 = Min( minDist2, d*d );
556 for ( int i = 0; i < 3; ++i )
557 minD2 = Min( minD2, p.SquareDistance( myNodes->Value(n[i]) ));
558 if ( minD2 < t.myMaxSize2 && ( t.DistToProjection( p, d ) || t.DistToSegment( p, d )))
559 minD2 = Min( minD2, d*d );
560 minDist2 = Min( minDist2, minD2 );
564 for ( size_t i = 0; i < myFoundTriaIDs.size(); ++i )
565 me->myTrias[ myFoundTriaIDs[i] ].myIsChecked = false;
567 return sqrt( minDist2 );
569 //================================================================================
571 * \brief Prepare Triangle data
573 //================================================================================
575 void Triangle::Init( const gp_Pnt& p1, const gp_Pnt& p2, const gp_Pnt& p3 )
581 myEdge1 = p2.XYZ() - myN0;
582 myEdge2 = p3.XYZ() - myN0;
583 myNorm = myEdge1 ^ myEdge2;
584 double normSize = myNorm.Modulus();
585 if ( normSize > std::numeric_limits<double>::min() )
588 myPVec = myNorm ^ myEdge2;
589 myInvDet = 1. / ( myEdge1 * myPVec );
595 myMaxSize2 = Max( p2.SquareDistance( p3 ),
596 Max( myEdge2.SquareModulus(), myEdge1.SquareModulus() ));
598 //================================================================================
600 * \brief Compute distance from a point to the triangle. Return false if the point
601 * is not projected inside the triangle
603 //================================================================================
605 bool Triangle::DistToProjection( const gp_Pnt& p, double& dist ) const
608 return false; // degenerated triangle
610 /* distance from n0 to the point */
611 gp_XYZ tvec = p.XYZ() - myN0;
613 /* calculate U parameter and test bounds */
614 double u = ( tvec * myPVec ) * myInvDet;
615 if (u < 0.0 || u > 1.0)
616 return false; // projected outside the triangle
618 /* calculate V parameter and test bounds */
619 gp_XYZ qvec = tvec ^ myEdge1;
620 double v = ( myNorm * qvec) * myInvDet;
621 if ( v < 0.0 || u + v > 1.0 )
622 return false; // projected outside the triangle
624 dist = ( myEdge2 * qvec ) * myInvDet;
628 //================================================================================
630 * \brief Compute distance from a point to either of mySegments. Return false if the point
631 * is not projected on a segment
633 //================================================================================
635 bool Triangle::DistToSegment( const gp_Pnt& p, double& dist ) const
640 for ( int i = 0; i < 3; ++i )
642 if ( !mySegments[ i ])
644 if ( mySegments[ i ]->Distance( p, d ))
647 dist = Min( dist, d );
653 //================================================================================
655 * \brief Consturct ElementBndBoxTree of Poly_Triangulation of a FACE
657 //================================================================================
659 ElementBndBoxTree::ElementBndBoxTree(const TopoDS_Face& face)
662 TriaTreeData* data = new TriaTreeData( face, this );
663 data->myMaxLevel = 5;
666 //================================================================================
668 * \brief Fill all levels of octree of Poly_Triangulation of a FACE
670 //================================================================================
672 void ElementBndBoxTree::FillIn()
674 if ( myChildren ) return;
675 TriaTreeData* data = GetTriaData();
676 if ( !data->myTrias.empty() )
678 for ( size_t i = 0; i < data->myTrias.size(); ++i )
679 _elementIDs.push_back( i );
684 //================================================================================
686 * \brief Return the maximal box
688 //================================================================================
690 Bnd_B3d* ElementBndBoxTree::buildRootBox()
692 TriaTreeData* data = GetTriaData();
693 Bnd_B3d* box = new Bnd_B3d( data->myBBox );
696 //================================================================================
698 * \brief Redistrubute element boxes among children
700 //================================================================================
702 void ElementBndBoxTree::buildChildrenData()
704 ElemTreeData* data = GetElemData();
705 for ( int i = 0; i < _elementIDs.size(); ++i )
707 const Bnd_B3d* elemBox = data->GetBox( _elementIDs[i] );
708 for (int j = 0; j < 8; j++)
709 if ( !elemBox->IsOut( *myChildren[ j ]->getBox() ))
710 data->myWorkIDs[ j ].push_back( _elementIDs[i] );
712 SMESHUtils::FreeVector( _elementIDs ); // = _elements.clear() + free memory
714 const int theMaxNbElemsInLeaf = 7;
716 for (int j = 0; j < 8; j++)
718 ElementBndBoxTree* child = static_cast<ElementBndBoxTree*>( myChildren[j] );
719 child->_elementIDs = data->myWorkIDs[ j ];
720 if ( child->_elementIDs.size() <= theMaxNbElemsInLeaf )
721 child->myIsLeaf = true;
722 data->myWorkIDs[ j ].clear();
725 //================================================================================
727 * \brief Return elements from leaves intersecting the sphere
729 //================================================================================
731 void ElementBndBoxTree::GetElementsInSphere( const gp_XYZ& center,
733 vector<int> & foundElemIDs) const
735 if ( const box_type* box = getBox() )
737 if ( box->IsOut( center, radius ))
742 ElemTreeData* data = GetElemData();
743 for ( int i = 0; i < _elementIDs.size(); ++i )
744 if ( !data->GetBox( _elementIDs[i] )->IsOut( center, radius ))
745 foundElemIDs.push_back( _elementIDs[i] );
749 for (int i = 0; i < 8; i++)
750 ((ElementBndBoxTree*) myChildren[i])->GetElementsInSphere( center, radius, foundElemIDs );
755 //================================================================================
757 * \brief Constructor of SegSizeTree
758 * \param [in,out] bb - bounding box enclosing all EDGEs to discretize
759 * \param [in] grading - factor to get max size of the neighbour segment by
760 * size of a current one.
762 //================================================================================
764 SegSizeTree::SegSizeTree( Bnd_B3d & bb, double grading, double minSize, double maxSize )
765 : SMESH_Octree( new _CommonData() )
767 // make cube myBox from the box bb
768 gp_XYZ pmin = bb.CornerMin(), pmax = bb.CornerMax();
769 double maxBoxHSize = 0.5 * Max( pmax.X()-pmin.X(), Max( pmax.Y()-pmin.Y(), pmax.Z()-pmin.Z() ));
771 bb.SetHSize( gp_XYZ( maxBoxHSize, maxBoxHSize, maxBoxHSize ));
772 myBox = new box_type( bb );
774 mySegSize = Min( 2 * maxBoxHSize, maxSize );
776 getData()->myGrading = grading;
777 getData()->myMinSize = Max( minSize, 2*maxBoxHSize / 1.e6 );
778 getData()->myMaxSize = maxSize;
782 //================================================================================
784 * \brief Set segment size at a given point
786 //================================================================================
788 void SegSizeTree::SetSize( const gp_Pnt& p, double size )
790 // check if the point is out of the largest cube
791 SegSizeTree* root = this;
792 while ( root->myFather )
793 root = (SegSizeTree*) root->myFather;
794 if ( root->getBox()->IsOut( p.XYZ() ))
797 // keep size whthin the valid range
798 size = Max( size, getData()->myMinSize );
799 //size = Min( size, getData()->myMaxSize );
801 // find an existing leaf at the point
802 SegSizeTree* leaf = (SegSizeTree*) root;
806 iChild = SMESH_Octree::getChildIndex( p.X(), p.Y(), p.Z(), leaf->GetBox()->Center() );
807 if ( leaf->myChildren[ iChild ] )
808 leaf = (SegSizeTree*) leaf->myChildren[ iChild ];
812 // don't increase the current size
813 if ( leaf->mySegSize <= 1.1 * size )
816 // split the found leaf until its box size is less than the given size
817 const double rootSize = root->GetBox()->Size();
818 while ( leaf->GetBox()->Size() > size )
820 const BBox* bb = leaf->GetBox();
821 iChild = SMESH_Octree::getChildIndex( p.X(), p.Y(), p.Z(), bb->Center() );
822 SegSizeTree* newLeaf = new SegSizeTree( bb->Size() / 2 );
823 leaf->myChildren[iChild] = newLeaf;
824 newLeaf->myFather = leaf;
825 newLeaf->myLimit = leaf->myLimit;
826 newLeaf->myLevel = leaf->myLevel + 1;
827 newLeaf->myBox = leaf->newChildBox( iChild );
828 newLeaf->myBox->Enlarge( rootSize * 1e-10 );
829 //newLeaf->myIsLeaf = ( newLeaf->mySegSize <= size );
832 leaf->mySegSize = size;
834 // propagate increased size out from the leaf
835 double boxSize = leaf->GetBox()->Size();
836 double sizeInc = size + boxSize * getData()->myGrading;
837 for ( int iDir = 1; iDir <= 3; ++iDir )
840 outPnt.SetCoord( iDir, p.Coord( iDir ) + boxSize );
841 SetSize( outPnt, sizeInc );
842 outPnt.SetCoord( iDir, p.Coord( iDir ) - boxSize );
843 SetSize( outPnt, sizeInc );
846 //================================================================================
848 * \brief Set size of a segment given by two end points
850 //================================================================================
852 double SegSizeTree::SetSize( const gp_Pnt& p1, const gp_Pnt& p2 )
854 const double size = p1.Distance( p2 );
855 gp_XYZ p = 0.5 * ( p1.XYZ() + p2.XYZ() );
859 //cout << "SetSize " << p1.Distance( p2 ) << " at " << p.X() <<", "<< p.Y()<<", "<<p.Z()<< endl;
863 //================================================================================
865 * \brief Return segment size at a point
867 //================================================================================
869 double SegSizeTree::GetSize( const gp_Pnt& p ) const
871 const SegSizeTree* leaf = this;
874 int iChild = SMESH_Octree::getChildIndex( p.X(), p.Y(), p.Z(), leaf->GetBox()->Center() );
875 if ( leaf->myChildren[ iChild ] )
876 leaf = (SegSizeTree*) leaf->myChildren[ iChild ];
878 return leaf->mySegSize;
880 return mySegSize; // just to return anything
883 //================================================================================
885 * \brief Evaluate curve deflection between two points
886 * \param theCurve - the curve
887 * \param theU1 - the parameter of the first point
888 * \param theU2 - the parameter of the second point
889 * \retval double - square deflection value
891 //================================================================================
893 double deflection2(const BRepAdaptor_Curve & theCurve,
897 // line between theU1 and theU2
898 gp_Pnt p1 = theCurve.Value( theU1 ), p2 = theCurve.Value( theU2 );
899 gp_Lin segment( p1, gp_Vec( p1, p2 ));
901 // evaluate square distance of theCurve from the segment
902 Standard_Real dist2 = 0;
904 const double step = ( theU2 - theU1 ) / nbPnt;
905 while (( theU1 += step ) < theU2 )
906 dist2 = Max( dist2, segment.SquareDistance( theCurve.Value( theU1 )));
913 //=======================================================================
914 //function : StdMeshers_Adaptive1D
915 //purpose : Constructor
916 StdMeshers_Adaptive1D::StdMeshers_Adaptive1D(int hypId,
919 :SMESH_Hypothesis(hypId, studyId, gen)
925 _name = "Adaptive1D";
926 _param_algo_dim = 1; // is used by SMESH_Regular_1D
928 //=======================================================================
929 //function : ~StdMeshers_Adaptive1D
930 //purpose : Destructor
931 StdMeshers_Adaptive1D::~StdMeshers_Adaptive1D()
933 delete myAlgo; myAlgo = NULL;
935 //=======================================================================
936 //function : SetDeflection
938 void StdMeshers_Adaptive1D::SetDeflection(double value)
939 throw(SALOME_Exception)
941 if (value <= std::numeric_limits<double>::min() )
942 throw SALOME_Exception("Deflection must be greater that zero");
943 if (myDeflection != value)
945 myDeflection = value;
946 NotifySubMeshesHypothesisModification();
949 //=======================================================================
950 //function : SetMinSize
951 //purpose : Sets minimal allowed segment length
952 void StdMeshers_Adaptive1D::SetMinSize(double minSize)
953 throw(SALOME_Exception)
955 if (minSize <= std::numeric_limits<double>::min() )
956 throw SALOME_Exception("Min size must be greater that zero");
958 if (myMinSize != minSize )
961 NotifySubMeshesHypothesisModification();
964 //=======================================================================
965 //function : SetMaxSize
966 //purpose : Sets maximal allowed segment length
967 void StdMeshers_Adaptive1D::SetMaxSize(double maxSize)
968 throw(SALOME_Exception)
970 if (maxSize <= std::numeric_limits<double>::min() )
971 throw SALOME_Exception("Max size must be greater that zero");
973 if (myMaxSize != maxSize )
976 NotifySubMeshesHypothesisModification();
979 //=======================================================================
981 //purpose : Persistence
982 ostream & StdMeshers_Adaptive1D::SaveTo(ostream & save)
984 save << myMinSize << " " << myMaxSize << " " << myDeflection;
985 save << " " << -1 << " " << -1; // preview addition of parameters
988 //=======================================================================
989 //function : LoadFrom
990 //purpose : Persistence
991 istream & StdMeshers_Adaptive1D::LoadFrom(istream & load)
994 bool isOK = (load >> myMinSize >> myMaxSize >> myDeflection >> dummyParam >> dummyParam);
996 load.clear(ios::badbit | load.rdstate());
999 //=======================================================================
1000 //function : SetParametersByMesh
1001 //purpose : Initialize parameters by the mesh built on the geometry
1002 //param theMesh - the built mesh
1003 //param theShape - the geometry of interest
1004 //retval bool - true if parameter values have been successfully defined
1005 bool StdMeshers_Adaptive1D::SetParametersByMesh(const SMESH_Mesh* theMesh,
1006 const TopoDS_Shape& theShape)
1008 if ( !theMesh || theShape.IsNull() )
1012 TopTools_IndexedMapOfShape edgeMap;
1013 TopExp::MapShapes( theShape, TopAbs_EDGE, edgeMap );
1015 SMESH_MesherHelper helper( (SMESH_Mesh&) *theMesh );
1016 double minSz2 = 1e100, maxSz2 = 0, sz2, maxDefl2 = 0;
1017 for ( int iE = 1; iE <= edgeMap.Extent(); ++iE )
1019 const TopoDS_Edge& edge = TopoDS::Edge( edgeMap( iE ));
1020 SMESHDS_SubMesh* smDS = theMesh->GetMeshDS()->MeshElements( edge );
1021 if ( !smDS ) continue;
1024 helper.SetSubShape( edge );
1025 BRepAdaptor_Curve curve( edge );
1027 SMDS_ElemIteratorPtr segIt = smDS->GetElements();
1028 while ( segIt->more() )
1030 const SMDS_MeshElement* seg = segIt->next();
1031 const SMDS_MeshNode* n1 = seg->GetNode(0);
1032 const SMDS_MeshNode* n2 = seg->GetNode(1);
1033 sz2 = SMESH_TNodeXYZ( n1 ).SquareDistance( n2 );
1034 minSz2 = Min( minSz2, sz2 );
1035 maxSz2 = Max( maxSz2, sz2 );
1036 if ( curve.GetType() != GeomAbs_Line )
1038 double u1 = helper.GetNodeU( edge, n1, n2 );
1039 double u2 = helper.GetNodeU( edge, n2, n1 );
1040 maxDefl2 = Max( maxDefl2, deflection2( curve, u1, u2 ));
1046 myMinSize = sqrt( minSz2 );
1047 myMaxSize = sqrt( maxSz2 );
1049 myDeflection = maxDefl2;
1054 //=======================================================================
1055 //function : SetParametersByDefaults
1056 //purpose : Initialize my parameter values by default parameters.
1057 //retval : bool - true if parameter values have been successfully defined
1058 bool StdMeshers_Adaptive1D::SetParametersByDefaults(const TDefaults& dflts,
1059 const SMESH_Mesh* /*theMesh*/)
1061 myMinSize = dflts._elemLength / 10;
1062 myMaxSize = dflts._elemLength * 2;
1063 myDeflection = myMinSize / 7;
1067 //=======================================================================
1068 //function : GetAlgo
1069 //purpose : Returns an algorithm that works using this hypothesis
1070 //=======================================================================
1072 SMESH_Algo* StdMeshers_Adaptive1D::GetAlgo() const
1076 AdaptiveAlgo* newAlgo =
1077 new AdaptiveAlgo( _gen->GetANewId(), _studyId, _gen );
1078 newAlgo->SetHypothesis( this );
1080 ((StdMeshers_Adaptive1D*) this)->myAlgo = newAlgo;
1085 //================================================================================
1087 * \brief Constructor
1089 //================================================================================
1091 AdaptiveAlgo::AdaptiveAlgo(int hypId,
1094 : StdMeshers_Regular_1D( hypId, studyId, gen ),
1097 _name = "AdaptiveAlgo_1D";
1100 //================================================================================
1102 * \brief Sets the hypothesis
1104 //================================================================================
1106 void AdaptiveAlgo::SetHypothesis( const StdMeshers_Adaptive1D* hyp )
1111 //================================================================================
1113 * \brief Creates segments on all given EDGEs
1115 //================================================================================
1117 bool AdaptiveAlgo::Compute(SMESH_Mesh & theMesh,
1118 const TopoDS_Shape & theShape)
1120 // *theProgress = 0.01;
1122 if ( myHyp->GetMinSize() > myHyp->GetMaxSize() )
1123 return error( "Bad parameters: min size > max size" );
1126 SMESH_MesherHelper helper( theMesh );
1127 const double grading = 0.7;
1129 TopTools_IndexedMapOfShape edgeMap, faceMap;
1130 TopExp::MapShapes( theShape, TopAbs_EDGE, edgeMap );
1131 TopExp::MapShapes( theMesh.GetShapeToMesh(), TopAbs_FACE, faceMap );
1133 // Triangulate the shape with the given deflection ?????????
1135 BRepMesh_IncrementalMesh im( theMesh.GetShapeToMesh(), myHyp->GetDeflection(), /*isRelatif=*/0);
1142 BRepBndLib::Add( theMesh.GetShapeToMesh(), aBox);
1143 Standard_Real TXmin, TYmin, TZmin, TXmax, TYmax, TZmax;
1144 aBox.Get(TXmin, TYmin, TZmin, TXmax, TYmax, TZmax);
1145 box.Add( gp_XYZ( TXmin, TYmin, TZmin ));
1146 box.Add( gp_XYZ( TXmax, TYmax, TZmax ));
1148 // *theProgress = 0.3;
1150 // holder of segment size at each point
1151 SegSizeTree sizeTree( box, grading, myHyp->GetMinSize(), myHyp->GetMaxSize() );
1152 mySizeTree = & sizeTree;
1154 // minimal segment size that sizeTree can store with reasonable tree height
1155 const double minSize = Max( myHyp->GetMinSize(), 1.1 * sizeTree.GetMinSize() );
1158 // fill myEdges - working data of EDGEs
1160 // sort EDGEs by length
1161 multimap< double, TopoDS_Edge > edgeOfLength;
1162 for ( int iE = 1; iE <= edgeMap.Extent(); ++iE )
1164 const TopoDS_Edge & edge = TopoDS::Edge( edgeMap( iE ));
1165 if ( !SMESH_Algo::isDegenerated( edge) )
1166 edgeOfLength.insert( make_pair( EdgeLength( edge ), edge ));
1169 myEdges.resize( edgeOfLength.size() );
1170 multimap< double, TopoDS_Edge >::const_iterator len2edge = edgeOfLength.begin();
1171 for ( int iE = 0; len2edge != edgeOfLength.end(); ++len2edge, ++iE )
1173 const TopoDS_Edge & edge = len2edge->second;
1174 EdgeData& eData = myEdges[ iE ];
1175 eData.myC3d.Initialize( edge );
1176 eData.myLength = EdgeLength( edge );
1177 eData.AddPoint( eData.myPoints.end(), eData.myC3d.FirstParameter() );
1178 eData.AddPoint( eData.myPoints.end(), eData.myC3d.LastParameter() );
1181 if ( _computeCanceled ) return false;
1183 // Take into account size of already existing segments
1184 SMDS_EdgeIteratorPtr segIterator = theMesh.GetMeshDS()->edgesIterator();
1185 while ( segIterator->more() )
1187 const SMDS_MeshElement* seg = segIterator->next();
1188 sizeTree.SetSize( SMESH_TNodeXYZ( seg->GetNode( 0 )), SMESH_TNodeXYZ( seg->GetNode( 1 )));
1190 if ( _computeCanceled ) return false;
1192 // Set size of segments according to the deflection
1194 StdMeshers_Regular_1D::_hypType = DEFLECTION;
1195 StdMeshers_Regular_1D::_value[ DEFLECTION_IND ] = myHyp->GetDeflection();
1197 list< double > params;
1198 for ( int iE = 0; iE < myEdges.size(); ++iE )
1200 EdgeData& eData = myEdges[ iE ];
1201 //cout << "E " << theMesh.GetMeshDS()->ShapeToIndex( eData.Edge() ) << endl;
1203 double f = eData.First().myU, l = eData.Last().myU;
1204 if ( !computeInternalParameters( theMesh, eData.myC3d, eData.myLength, f,l, params, false, false ))
1206 if ( params.size() <= 1 && helper.IsClosedEdge( eData.Edge() ) ) // 2 segments on a circle
1209 for ( int i = 1; i < 6; ++i )
1210 params.push_back(( l - f ) * i/6. );
1212 EdgeData::TPntIter where = --eData.myPoints.end();
1213 list< double >::const_iterator param = params.begin();
1214 for ( ; param != params.end(); ++param )
1215 eData.AddPoint( where, *param );
1217 EdgeData::TPntIter pIt2 = eData.myPoints.begin(), pIt1 = pIt2++;
1218 for ( ; pIt2 != eData.myPoints.end(); ++pIt1, ++pIt2 )
1220 double sz = sizeTree.SetSize( (*pIt1).myP, (*pIt2).myP );
1221 sz = Min( sz, myHyp->GetMaxSize() );
1222 pIt1->mySegSize = Min( sz, pIt1->mySegSize );
1223 pIt2->mySegSize = Min( sz, pIt2->mySegSize );
1226 if ( _computeCanceled ) return false;
1229 // Limit size of segments according to distance to closest FACE
1231 for ( int iF = 1; iF <= faceMap.Extent(); ++iF )
1233 if ( _computeCanceled ) return false;
1235 const TopoDS_Face & face = TopoDS::Face( faceMap( iF ));
1236 // cout << "FACE " << iF << "/" << faceMap.Extent()
1237 // << " id-" << theMesh.GetMeshDS()->ShapeToIndex( face ) << endl;
1239 ElementBndBoxTree triaTree( face ); // tree of FACE triangulation
1240 TriaTreeData* triaSearcher = triaTree.GetTriaData();
1242 triaSearcher->SetSizeByTrias( sizeTree, myHyp->GetDeflection() );
1244 for ( int iE = 0; iE < myEdges.size(); ++iE )
1246 EdgeData& eData = myEdges[ iE ];
1248 // check if the face is in topological contact with the edge
1249 bool isAdjFace = ( helper.IsSubShape( helper.IthVertex( 0, eData.Edge()), face ) ||
1250 helper.IsSubShape( helper.IthVertex( 1, eData.Edge()), face ));
1252 if ( isAdjFace && triaSearcher->mySurface.GetType() == GeomAbs_Plane )
1255 bool sizeDecreased = true;
1256 for (int iLoop = 0; sizeDecreased; ++iLoop ) //repeat until segment size along the edge becomes stable
1258 double maxSegSize = 0;
1260 // get points to check distance to the face
1261 EdgeData::TPntIter pIt2 = eData.myPoints.begin(), pIt1 = pIt2++;
1262 maxSegSize = pIt1->mySegSize = Min( pIt1->mySegSize, sizeTree.GetSize( pIt1->myP ));
1263 for ( ; pIt2 != eData.myPoints.end(); )
1265 pIt2->mySegSize = Min( pIt2->mySegSize, sizeTree.GetSize( pIt2->myP ));
1266 double curSize = Min( pIt1->mySegSize, pIt2->mySegSize );
1267 maxSegSize = Max( pIt2->mySegSize, maxSegSize );
1268 if ( pIt1->myP.Distance( pIt2->myP ) > curSize )
1270 double midU = 0.5*( pIt1->myU + pIt2->myU );
1271 gp_Pnt midP = eData.myC3d.Value( midU );
1272 double midSz = sizeTree.GetSize( midP );
1273 pIt2 = eData.myPoints.insert( pIt2, EdgeData::ProbePnt( midP, midU, midSz ));
1274 eData.myBBox.Add( midP.XYZ() );
1281 // check if the face is more distant than a half of the current segment size,
1282 // if not, segment size is decreased
1284 if ( iLoop == 0 && eData.IsTooDistant( triaSearcher->myBBox, maxSegSize ))
1286 triaSearcher->PrepareToTriaSearch();
1288 //cout << "E " << theMesh.GetMeshDS()->ShapeToIndex( eData.Edge() ) << endl;
1289 sizeDecreased = false;
1290 const gp_Pnt* avoidPnt = & eData.First().myP;
1291 for ( pIt1 = eData.myPoints.begin(); pIt1 != eData.myPoints.end(); )
1294 triaSearcher->GetMinDistInSphere( pIt1->myP, pIt1->mySegSize, isAdjFace, avoidPnt );
1295 double allowedSize = Max( minSize, distToFace*( 1. + grading ));
1296 if ( allowedSize < pIt1->mySegSize )
1298 // cout << "E " << theMesh.GetMeshDS()->ShapeToIndex( eData.Edge() )
1299 // << "\t closure detected " << endl;
1300 if ( 1.1 * allowedSize < pIt1->mySegSize )
1302 sizeDecreased = true;
1303 sizeTree.SetSize( pIt1->myP, allowedSize );
1304 // cout << "E " << theMesh.GetMeshDS()->ShapeToIndex( eData.Edge() )
1305 // << "\t SetSize " << allowedSize << " at "
1306 // << pIt1->myP.X() <<", "<< pIt1->myP.Y()<<", "<<pIt1->myP.Z() << endl;
1308 if ( --pIt2 != eData.myPoints.end() && pIt2->mySegSize > allowedSize )
1309 sizeTree.SetSize( eData.myC3d.Value( 0.6*pIt2->myU + 0.4*pIt1->myU ), allowedSize );
1311 if ( ++pIt2 != eData.myPoints.end() && pIt2->mySegSize > allowedSize )
1312 sizeTree.SetSize( eData.myC3d.Value( 0.6*pIt2->myU + 0.4*pIt1->myU ), allowedSize );
1314 pIt1->mySegSize = allowedSize;
1317 if ( & (*pIt1) == & eData.Last() )
1318 avoidPnt = & eData.Last().myP;
1325 cout << "Infinite loop in AdaptiveAlgo::Compute()" << endl;
1327 sizeDecreased = false;
1331 } // while ( sizeDecreased )
1332 } // loop on myEdges
1334 // *theProgress = 0.3 + 0.3 * iF / double( faceMap.Extent() );
1336 } // loop on faceMap
1338 return makeSegments();
1341 //================================================================================
1343 * \brief Create segments
1345 //================================================================================
1347 bool AdaptiveAlgo::makeSegments()
1349 SMESH_HypoFilter quadHyp( SMESH_HypoFilter::HasName( "QuadraticMesh" ));
1350 _quadraticMesh = myMesh->GetHypothesis( myEdges[0].Edge(), quadHyp, /*andAncestors=*/true );
1352 SMESH_MesherHelper helper( *myMesh );
1353 helper.SetIsQuadratic( _quadraticMesh );
1355 vector< double > nbSegs, params;
1357 for ( int iE = 0; iE < myEdges.size(); ++iE )
1359 EdgeData& eData = myEdges[ iE ];
1361 // estimate roughly min segment size on the EDGE
1362 double edgeMinSize = myHyp->GetMaxSize();
1363 EdgeData::TPntIter pIt1 = eData.myPoints.begin();
1364 for ( ; pIt1 != eData.myPoints.end(); ++pIt1 )
1365 edgeMinSize = Min( edgeMinSize,
1366 Min( pIt1->mySegSize, mySizeTree->GetSize( pIt1->myP )));
1368 const double f = eData.myC3d.FirstParameter(), l = eData.myC3d.LastParameter();
1369 const double parLen = l - f;
1370 const int nbDivSeg = 5;
1371 int nbDiv = Max( 1, int ( eData.myLength / edgeMinSize * nbDivSeg ));
1373 // compute nb of segments
1374 bool toRecompute = true;
1375 double maxSegSize = 0;
1376 size_t i = 1, segCount;
1377 //cout << "E " << theMesh.GetMeshDS()->ShapeToIndex( eData.Edge() ) << endl;
1378 while ( toRecompute ) // recompute if segment size at some point is less than edgeMinSize/nbDivSeg
1380 nbSegs.resize( nbDiv + 1 );
1382 toRecompute = false;
1384 // fill nbSegs with segment size stored in EdgeData::ProbePnt::mySegSize which can
1385 // be less than size in mySizeTree
1386 pIt1 = eData.myPoints.begin();
1387 EdgeData::ProbePnt* pp1 = &(*pIt1), *pp2;
1388 for ( ++pIt1; pIt1 != eData.myPoints.end(); ++pIt1 )
1391 double size1 = Min( pp1->mySegSize, myHyp->GetMaxSize() );
1392 double size2 = Min( pp2->mySegSize, myHyp->GetMaxSize() );
1393 double r, u, du = pp2->myU - pp1->myU;
1394 while(( u = f + parLen * i / nbDiv ) < pp2->myU )
1396 r = ( u - pp1->myU ) / du;
1397 nbSegs[i] = (1-r) * size1 + r * size2;
1400 if ( i < nbSegs.size() )
1404 // fill nbSegs with local nb of segments
1405 gp_Pnt p1 = eData.First().myP, p2, pDiv = p1;
1406 for ( i = 1, segCount = 1; i < nbSegs.size(); ++i )
1408 p2 = eData.myC3d.Value( f + parLen * i / nbDiv );
1409 double locSize = Min( mySizeTree->GetSize( p2 ), nbSegs[i] );
1410 double nb = p1.Distance( p2 ) / locSize;
1411 // if ( nbSegs.size() < 30 )
1412 // cout << "locSize " << locSize << " nb " << nb << endl;
1416 edgeMinSize = locSize;
1417 nbDiv = int ( eData.myLength / edgeMinSize * nbDivSeg );
1420 nbSegs[i] = nbSegs[i-1] + nb;
1422 if ( nbSegs[i] >= segCount )
1424 maxSegSize = Max( maxSegSize, pDiv.Distance( p2 ));
1431 // compute parameters of nodes
1432 int nbSegFinal = Max( 1, int(floor( nbSegs.back() + 0.5 )));
1433 double fact = nbSegFinal / nbSegs.back();
1434 if ( maxSegSize / fact > myHyp->GetMaxSize() )
1435 fact = ++nbSegFinal / nbSegs.back();
1436 //cout << "nbSegs.back() " << nbSegs.back() << " nbSegFinal " << nbSegFinal << endl;
1438 for ( i = 0, segCount = 1; segCount < nbSegFinal; ++segCount )
1440 while ( nbSegs[i] * fact < segCount )
1444 double d = i - ( nbSegs[i] - segCount/fact ) / ( nbSegs[i] - nbSegs[i-1] );
1445 params.push_back( f + parLen * d / nbDiv );
1446 //params.push_back( f + parLen * i / nbDiv );
1451 // get nodes on VERTEXes
1452 TopoDS_Vertex vf = helper.IthVertex( 0, eData.Edge(), false );
1453 TopoDS_Vertex vl = helper.IthVertex( 1, eData.Edge(), false );
1454 myMesh->GetSubMesh( vf )->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1455 myMesh->GetSubMesh( vl )->ComputeStateEngine( SMESH_subMesh::COMPUTE );
1456 const SMDS_MeshNode * nf = VertexNode( vf, myMesh->GetMeshDS() );
1457 const SMDS_MeshNode * nl = VertexNode( vl, myMesh->GetMeshDS() );
1459 return error("No node on vertex");
1462 helper.SetSubShape( eData.Edge() );
1463 helper.SetElementsOnShape( true );
1465 const SMDS_MeshNode *n1 = nf, *n2;
1466 for ( i = 0; i < params.size(); ++i, n1 = n2 )
1468 gp_Pnt p2 = eData.myC3d.Value( params[i] );
1469 n2 = helper.AddNode( p2.X(), p2.Y(), p2.Z(), ID, params[i] );
1470 helper.AddEdge( n1, n2, ID, /*force3d=*/false );
1472 helper.AddEdge( n1, nl, ID, /*force3d=*/false );
1474 eData.myPoints.clear();
1476 //*theProgress = 0.6 + 0.4 * iE / double( myEdges.size() );
1477 if ( _computeCanceled )
1482 SMESHUtils::FreeVector( myEdges );
1487 //================================================================================
1489 * \brief Predict number of segments on all given EDGEs
1491 //================================================================================
1493 bool AdaptiveAlgo::Evaluate(SMESH_Mesh & theMesh,
1494 const TopoDS_Shape & theShape,
1495 MapShapeNbElems& theResMap)
1497 // initialize fields of inherited StdMeshers_Regular_1D
1498 StdMeshers_Regular_1D::_hypType = DEFLECTION;
1499 StdMeshers_Regular_1D::_value[ DEFLECTION_IND ] = myHyp->GetDeflection();
1501 TopExp_Explorer edExp( theShape, TopAbs_EDGE );
1503 for ( ; edExp.More(); edExp.Next() )
1505 const TopoDS_Edge & edge = TopoDS::Edge( edExp.Current() );
1506 StdMeshers_Regular_1D::Evaluate( theMesh, theShape, theResMap );