1 // Copyright (C) 2007-2010 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.
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 // SMESH SMESH : implementaion of SMESH idl descriptions
24 // File : StdMeshers_Regular_1D.cxx
25 // Moved here from SMESH_Regular_1D.cxx
26 // Author : Paul RASCLE, EDF
29 #include "StdMeshers_Regular_1D.hxx"
30 #include "StdMeshers_Distribution.hxx"
32 #include "StdMeshers_Arithmetic1D.hxx"
33 #include "StdMeshers_AutomaticLength.hxx"
34 #include "StdMeshers_Deflection1D.hxx"
35 #include "StdMeshers_LocalLength.hxx"
36 #include "StdMeshers_MaxLength.hxx"
37 #include "StdMeshers_NumberOfSegments.hxx"
38 #include "StdMeshers_Propagation.hxx"
39 #include "StdMeshers_SegmentLengthAroundVertex.hxx"
40 #include "StdMeshers_StartEndLength.hxx"
42 #include "SMESH_Gen.hxx"
43 #include "SMESH_Mesh.hxx"
44 #include "SMESH_HypoFilter.hxx"
45 #include "SMESH_subMesh.hxx"
46 #include "SMESH_subMeshEventListener.hxx"
47 #include "SMESH_Comment.hxx"
49 #include "SMDS_MeshElement.hxx"
50 #include "SMDS_MeshNode.hxx"
52 #include "Utils_SALOME_Exception.hxx"
53 #include "utilities.h"
55 #include <BRepAdaptor_Curve.hxx>
56 #include <BRep_Tool.hxx>
57 #include <GCPnts_AbscissaPoint.hxx>
58 #include <GCPnts_UniformAbscissa.hxx>
59 #include <GCPnts_UniformDeflection.hxx>
60 #include <Precision.hxx>
62 #include <TopExp_Explorer.hxx>
64 #include <TopoDS_Edge.hxx>
71 //=============================================================================
75 //=============================================================================
77 StdMeshers_Regular_1D::StdMeshers_Regular_1D(int hypId, int studyId,
78 SMESH_Gen * gen):SMESH_1D_Algo(hypId, studyId, gen)
80 MESSAGE("StdMeshers_Regular_1D::StdMeshers_Regular_1D");
82 _shapeType = (1 << TopAbs_EDGE);
85 _compatibleHypothesis.push_back("LocalLength");
86 _compatibleHypothesis.push_back("MaxLength");
87 _compatibleHypothesis.push_back("NumberOfSegments");
88 _compatibleHypothesis.push_back("StartEndLength");
89 _compatibleHypothesis.push_back("Deflection1D");
90 _compatibleHypothesis.push_back("Arithmetic1D");
91 _compatibleHypothesis.push_back("FixedPoints1D");
92 _compatibleHypothesis.push_back("AutomaticLength");
94 _compatibleHypothesis.push_back("QuadraticMesh"); // auxiliary !!!
95 _compatibleHypothesis.push_back("Propagation"); // auxiliary !!!
98 //=============================================================================
102 //=============================================================================
104 StdMeshers_Regular_1D::~StdMeshers_Regular_1D()
108 //=============================================================================
112 //=============================================================================
114 bool StdMeshers_Regular_1D::CheckHypothesis
116 const TopoDS_Shape& aShape,
117 SMESH_Hypothesis::Hypothesis_Status& aStatus)
120 _quadraticMesh = false;
122 const list <const SMESHDS_Hypothesis * > & hyps =
123 GetUsedHypothesis(aMesh, aShape, /*ignoreAuxiliaryHyps=*/false);
125 // find non-auxiliary hypothesis
126 const SMESHDS_Hypothesis *theHyp = 0;
127 list <const SMESHDS_Hypothesis * >::const_iterator h = hyps.begin();
128 for ( ; h != hyps.end(); ++h ) {
129 if ( static_cast<const SMESH_Hypothesis*>(*h)->IsAuxiliary() ) {
130 if ( strcmp( "QuadraticMesh", (*h)->GetName() ) == 0 )
131 _quadraticMesh = true;
135 theHyp = *h; // use only the first non-auxiliary hypothesis
141 aStatus = SMESH_Hypothesis::HYP_MISSING;
142 return false; // can't work without a hypothesis
145 string hypName = theHyp->GetName();
147 if (hypName == "LocalLength")
149 const StdMeshers_LocalLength * hyp =
150 dynamic_cast <const StdMeshers_LocalLength * >(theHyp);
152 _value[ BEG_LENGTH_IND ] = hyp->GetLength();
153 _value[ PRECISION_IND ] = hyp->GetPrecision();
154 ASSERT( _value[ BEG_LENGTH_IND ] > 0 );
155 _hypType = LOCAL_LENGTH;
156 aStatus = SMESH_Hypothesis::HYP_OK;
159 else if (hypName == "MaxLength")
161 const StdMeshers_MaxLength * hyp =
162 dynamic_cast <const StdMeshers_MaxLength * >(theHyp);
164 _value[ BEG_LENGTH_IND ] = hyp->GetLength();
165 if ( hyp->GetUsePreestimatedLength() ) {
166 if ( int nbSeg = aMesh.GetGen()->GetBoundaryBoxSegmentation() )
167 _value[ BEG_LENGTH_IND ] = aMesh.GetShapeDiagonalSize() / nbSeg;
169 ASSERT( _value[ BEG_LENGTH_IND ] > 0 );
170 _hypType = MAX_LENGTH;
171 aStatus = SMESH_Hypothesis::HYP_OK;
174 else if (hypName == "NumberOfSegments")
176 const StdMeshers_NumberOfSegments * hyp =
177 dynamic_cast <const StdMeshers_NumberOfSegments * >(theHyp);
179 _ivalue[ NB_SEGMENTS_IND ] = hyp->GetNumberOfSegments();
180 ASSERT( _ivalue[ NB_SEGMENTS_IND ] > 0 );
181 _ivalue[ DISTR_TYPE_IND ] = (int) hyp->GetDistrType();
182 switch (_ivalue[ DISTR_TYPE_IND ])
184 case StdMeshers_NumberOfSegments::DT_Scale:
185 _value[ SCALE_FACTOR_IND ] = hyp->GetScaleFactor();
186 _revEdgesIDs = hyp->GetReversedEdges();
188 case StdMeshers_NumberOfSegments::DT_TabFunc:
189 _vvalue[ TAB_FUNC_IND ] = hyp->GetTableFunction();
190 _revEdgesIDs = hyp->GetReversedEdges();
192 case StdMeshers_NumberOfSegments::DT_ExprFunc:
193 _svalue[ EXPR_FUNC_IND ] = hyp->GetExpressionFunction();
194 _revEdgesIDs = hyp->GetReversedEdges();
196 case StdMeshers_NumberOfSegments::DT_Regular:
202 if (_ivalue[ DISTR_TYPE_IND ] == StdMeshers_NumberOfSegments::DT_TabFunc ||
203 _ivalue[ DISTR_TYPE_IND ] == StdMeshers_NumberOfSegments::DT_ExprFunc)
204 _ivalue[ CONV_MODE_IND ] = hyp->ConversionMode();
205 _hypType = NB_SEGMENTS;
206 aStatus = SMESH_Hypothesis::HYP_OK;
209 else if (hypName == "Arithmetic1D")
211 const StdMeshers_Arithmetic1D * hyp =
212 dynamic_cast <const StdMeshers_Arithmetic1D * >(theHyp);
214 _value[ BEG_LENGTH_IND ] = hyp->GetLength( true );
215 _value[ END_LENGTH_IND ] = hyp->GetLength( false );
216 ASSERT( _value[ BEG_LENGTH_IND ] > 0 && _value[ END_LENGTH_IND ] > 0 );
217 _hypType = ARITHMETIC_1D;
219 _revEdgesIDs = hyp->GetReversedEdges();
221 aStatus = SMESH_Hypothesis::HYP_OK;
224 else if (hypName == "FixedPoints1D") {
225 _fpHyp = dynamic_cast <const StdMeshers_FixedPoints1D*>(theHyp);
227 _hypType = FIXED_POINTS_1D;
229 _revEdgesIDs = _fpHyp->GetReversedEdges();
231 aStatus = SMESH_Hypothesis::HYP_OK;
234 else if (hypName == "StartEndLength")
236 const StdMeshers_StartEndLength * hyp =
237 dynamic_cast <const StdMeshers_StartEndLength * >(theHyp);
239 _value[ BEG_LENGTH_IND ] = hyp->GetLength( true );
240 _value[ END_LENGTH_IND ] = hyp->GetLength( false );
241 ASSERT( _value[ BEG_LENGTH_IND ] > 0 && _value[ END_LENGTH_IND ] > 0 );
242 _hypType = BEG_END_LENGTH;
244 _revEdgesIDs = hyp->GetReversedEdges();
246 aStatus = SMESH_Hypothesis::HYP_OK;
249 else if (hypName == "Deflection1D")
251 const StdMeshers_Deflection1D * hyp =
252 dynamic_cast <const StdMeshers_Deflection1D * >(theHyp);
254 _value[ DEFLECTION_IND ] = hyp->GetDeflection();
255 ASSERT( _value[ DEFLECTION_IND ] > 0 );
256 _hypType = DEFLECTION;
257 aStatus = SMESH_Hypothesis::HYP_OK;
260 else if (hypName == "AutomaticLength")
262 StdMeshers_AutomaticLength * hyp = const_cast<StdMeshers_AutomaticLength *>
263 (dynamic_cast <const StdMeshers_AutomaticLength * >(theHyp));
265 _value[ BEG_LENGTH_IND ] = _value[ END_LENGTH_IND ] = hyp->GetLength( &aMesh, aShape );
266 // _value[ BEG_LENGTH_IND ] = hyp->GetLength( &aMesh, aShape );
267 // _value[ END_LENGTH_IND ] = Precision::Confusion(); // ?? or set to zero?
268 ASSERT( _value[ BEG_LENGTH_IND ] > 0 );
269 _hypType = MAX_LENGTH;
270 aStatus = SMESH_Hypothesis::HYP_OK;
273 aStatus = SMESH_Hypothesis::HYP_INCOMPATIBLE;
275 return ( _hypType != NONE );
278 static bool computeParamByFunc(Adaptor3d_Curve& C3d, double first, double last,
279 double length, bool theReverse,
280 int nbSeg, Function& func,
281 list<double>& theParams)
284 //OSD::SetSignal( true );
289 MESSAGE( "computeParamByFunc" );
291 int nbPnt = 1 + nbSeg;
292 vector<double> x(nbPnt, 0.);
294 if (!buildDistribution(func, 0.0, 1.0, nbSeg, x, 1E-4))
297 MESSAGE( "Points:\n" );
299 for ( int i=0; i<=nbSeg; i++ )
301 sprintf( buf, "%f\n", float(x[i] ) );
307 // apply parameters in range [0,1] to the space of the curve
308 double prevU = first;
315 for( int i = 1; i < nbSeg; i++ )
317 double curvLength = length * (x[i] - x[i-1]) * sign;
318 GCPnts_AbscissaPoint Discret( C3d, curvLength, prevU );
319 if ( !Discret.IsDone() )
321 double U = Discret.Parameter();
322 if ( U > first && U < last )
323 theParams.push_back( U );
334 //================================================================================
336 * \brief adjust internal node parameters so that the last segment length == an
337 * \param a1 - the first segment length
338 * \param an - the last segment length
339 * \param U1 - the first edge parameter
340 * \param Un - the last edge parameter
341 * \param length - the edge length
342 * \param C3d - the edge curve
343 * \param theParams - internal node parameters to adjust
344 * \param adjustNeighbors2an - to adjust length of segments next to the last one
345 * and not to remove parameters
347 //================================================================================
349 static void compensateError(double a1, double an,
350 double U1, double Un,
352 Adaptor3d_Curve& C3d,
353 list<double> & theParams,
354 bool adjustNeighbors2an = false)
356 int i, nPar = theParams.size();
357 if ( a1 + an < length && nPar > 1 )
359 bool reverse = ( U1 > Un );
360 GCPnts_AbscissaPoint Discret(C3d, reverse ? an : -an, Un);
361 if ( !Discret.IsDone() )
363 double Utgt = Discret.Parameter(); // target value of the last parameter
364 list<double>::reverse_iterator itU = theParams.rbegin();
365 double Ul = *itU++; // real value of the last parameter
366 double dUn = Utgt - Ul; // parametric error of <an>
367 if ( Abs(dUn) <= Precision::Confusion() )
369 double dU = Abs( Ul - *itU ); // parametric length of the last but one segment
370 if ( adjustNeighbors2an || Abs(dUn) < 0.5 * dU ) { // last segment is a bit shorter than it should
371 // move the last parameter to the edge beginning
373 else { // last segment is much shorter than it should -> remove the last param and
374 theParams.pop_back(); nPar--; // move the rest points toward the edge end
375 dUn = Utgt - theParams.back();
378 double q = dUn / ( nPar - 1 );
379 if ( !adjustNeighbors2an )
381 q = Abs( dUn / ( Utgt - Un )); // factor of segment length change
382 for ( itU = theParams.rbegin(), i = 1; i < nPar; i++ ) {
386 dUn = q * (*itU - prevU) * (prevU-U1)/(Un-U1);
390 theParams.back() += dUn;
391 double sign = reverse ? -1 : 1;
392 double prevU = theParams.back();
393 itU = theParams.rbegin();
394 for ( ++itU, i = 2; i < nPar; ++itU, i++ ) {
395 double newU = *itU + dUn;
396 if ( newU*sign < prevU*sign ) {
400 else { // set U between prevU and next valid param
401 list<double>::reverse_iterator itU2 = itU;
404 while ( (*itU2)*sign > prevU*sign ) {
407 dU = ( *itU2 - prevU ) / nb;
408 while ( itU != itU2 ) {
418 //================================================================================
420 * \brief Class used to clean mesh on edges when 0D hyp modified.
421 * Common approach doesn't work when 0D algo is missing because the 0D hyp is
422 * considered as not participating in computation whereas it is used by 1D algo.
424 //================================================================================
426 // struct VertexEventListener : public SMESH_subMeshEventListener
428 // VertexEventListener():SMESH_subMeshEventListener(0) // won't be deleted by submesh
431 // * \brief Clean mesh on edges
432 // * \param event - algo_event or compute_event itself (of SMESH_subMesh)
433 // * \param eventType - ALGO_EVENT or COMPUTE_EVENT (of SMESH_subMesh)
434 // * \param subMesh - the submesh where the event occures
436 // void ProcessEvent(const int event, const int eventType, SMESH_subMesh* subMesh,
437 // EventListenerData*, const SMESH_Hypothesis*)
439 // if ( eventType == SMESH_subMesh::ALGO_EVENT) // all algo events
441 // subMesh->ComputeStateEngine( SMESH_subMesh::MODIF_ALGO_STATE );
444 // }; // struct VertexEventListener
446 //=============================================================================
448 * \brief Sets event listener to vertex submeshes
449 * \param subMesh - submesh where algo is set
451 * This method is called when a submesh gets HYP_OK algo_state.
452 * After being set, event listener is notified on each event of a submesh.
454 //=============================================================================
456 void StdMeshers_Regular_1D::SetEventListener(SMESH_subMesh* subMesh)
458 StdMeshers_Propagation::SetPropagationMgr( subMesh );
461 //=============================================================================
464 * \param subMesh - restored submesh
466 * This method is called only if a submesh has HYP_OK algo_state.
468 //=============================================================================
470 void StdMeshers_Regular_1D::SubmeshRestored(SMESH_subMesh* subMesh)
474 //=============================================================================
476 * \brief Return StdMeshers_SegmentLengthAroundVertex assigned to vertex
478 //=============================================================================
480 const StdMeshers_SegmentLengthAroundVertex*
481 StdMeshers_Regular_1D::getVertexHyp(SMESH_Mesh & theMesh,
482 const TopoDS_Vertex & theV)
484 static SMESH_HypoFilter filter( SMESH_HypoFilter::HasName("SegmentAroundVertex_0D"));
485 if ( const SMESH_Hypothesis * h = theMesh.GetHypothesis( theV, filter, true ))
487 SMESH_Algo* algo = const_cast< SMESH_Algo* >( static_cast< const SMESH_Algo* > ( h ));
488 const list <const SMESHDS_Hypothesis *> & hypList = algo->GetUsedHypothesis( theMesh, theV, 0 );
489 if ( !hypList.empty() && string("SegmentLengthAroundVertex") == hypList.front()->GetName() )
490 return static_cast<const StdMeshers_SegmentLengthAroundVertex*>( hypList.front() );
495 //================================================================================
497 * \brief Tune parameters to fit "SegmentLengthAroundVertex" hypothesis
498 * \param theC3d - wire curve
499 * \param theLength - curve length
500 * \param theParameters - internal nodes parameters to modify
501 * \param theVf - 1st vertex
502 * \param theVl - 2nd vertex
504 //================================================================================
506 void StdMeshers_Regular_1D::redistributeNearVertices (SMESH_Mesh & theMesh,
507 Adaptor3d_Curve & theC3d,
509 std::list< double > & theParameters,
510 const TopoDS_Vertex & theVf,
511 const TopoDS_Vertex & theVl)
513 double f = theC3d.FirstParameter(), l = theC3d.LastParameter();
514 int nPar = theParameters.size();
515 for ( int isEnd1 = 0; isEnd1 < 2; ++isEnd1 )
517 const TopoDS_Vertex & V = isEnd1 ? theVf : theVl;
518 const StdMeshers_SegmentLengthAroundVertex* hyp = getVertexHyp (theMesh, V );
520 double vertexLength = hyp->GetLength();
521 if ( vertexLength > theLength / 2.0 )
523 if ( isEnd1 ) { // to have a segment of interest at end of theParameters
524 theParameters.reverse();
527 if ( _hypType == NB_SEGMENTS )
529 compensateError(0, vertexLength, f, l, theLength, theC3d, theParameters, true );
531 else if ( nPar <= 3 )
534 vertexLength = -vertexLength;
535 GCPnts_AbscissaPoint Discret(theC3d, vertexLength, l);
536 if ( Discret.IsDone() ) {
538 theParameters.push_back( Discret.Parameter());
540 double L = GCPnts_AbscissaPoint::Length( theC3d, theParameters.back(), l);
541 if ( vertexLength < L / 2.0 )
542 theParameters.push_back( Discret.Parameter());
544 compensateError(0, vertexLength, f, l, theLength, theC3d, theParameters, true );
550 // recompute params between the last segment and a middle one.
551 // find size of a middle segment
552 int nHalf = ( nPar-1 ) / 2;
553 list< double >::reverse_iterator itU = theParameters.rbegin();
554 std::advance( itU, nHalf );
556 double Lm = GCPnts_AbscissaPoint::Length( theC3d, Um, *itU);
557 double L = GCPnts_AbscissaPoint::Length( theC3d, *itU, l);
558 StdMeshers_Regular_1D algo( *this );
559 algo._hypType = BEG_END_LENGTH;
560 algo._value[ BEG_LENGTH_IND ] = Lm;
561 algo._value[ END_LENGTH_IND ] = vertexLength;
562 double from = *itU, to = l;
564 std::swap( from, to );
565 std::swap( algo._value[ BEG_LENGTH_IND ], algo._value[ END_LENGTH_IND ]);
568 if ( algo.computeInternalParameters( theMesh, theC3d, L, from, to, params, false ))
570 if ( isEnd1 ) params.reverse();
571 while ( 1 + nHalf-- )
572 theParameters.pop_back();
573 theParameters.splice( theParameters.end(), params );
577 compensateError(0, vertexLength, f, l, theLength, theC3d, theParameters, true );
581 theParameters.reverse();
586 //=============================================================================
590 //=============================================================================
591 bool StdMeshers_Regular_1D::computeInternalParameters(SMESH_Mesh & theMesh,
592 Adaptor3d_Curve& theC3d,
596 list<double> & theParams,
597 const bool theReverse,
598 bool theConsiderPropagation)
602 double f = theFirstU, l = theLastU;
611 if ( _hypType == MAX_LENGTH )
613 double nbseg = ceil(theLength / _value[ BEG_LENGTH_IND ]); // integer sup
615 nbseg = 1; // degenerated edge
616 eltSize = theLength / nbseg;
618 else if ( _hypType == LOCAL_LENGTH )
620 // Local Length hypothesis
621 double nbseg = ceil(theLength / _value[ BEG_LENGTH_IND ]); // integer sup
624 bool isFound = false;
625 if (theConsiderPropagation && !_mainEdge.IsNull()) // propagated from some other edge
627 // Advanced processing to assure equal number of segments in case of Propagation
628 SMESH_subMesh* sm = theMesh.GetSubMeshContaining(_mainEdge);
630 bool computed = sm->IsMeshComputed();
632 if (sm->GetComputeState() == SMESH_subMesh::READY_TO_COMPUTE) {
633 _gen->Compute( theMesh, _mainEdge, /*anUpward=*/true);
634 computed = sm->IsMeshComputed();
638 SMESHDS_SubMesh* smds = sm->GetSubMeshDS();
639 int nb_segments = smds->NbElements();
640 if (nbseg - 1 <= nb_segments && nb_segments <= nbseg + 1) {
647 if (!isFound) // not found by meshed edge in the propagation chain, use precision
649 double aPrecision = _value[ PRECISION_IND ];
650 double nbseg_prec = ceil((theLength / _value[ BEG_LENGTH_IND ]) - aPrecision);
651 if (nbseg_prec == (nbseg - 1)) nbseg--;
655 nbseg = 1; // degenerated edge
656 eltSize = theLength / nbseg;
660 // Number Of Segments hypothesis
661 int NbSegm = _ivalue[ NB_SEGMENTS_IND ];
662 if ( NbSegm < 1 ) return false;
663 if ( NbSegm == 1 ) return true;
665 switch (_ivalue[ DISTR_TYPE_IND ])
667 case StdMeshers_NumberOfSegments::DT_Scale:
669 double scale = _value[ SCALE_FACTOR_IND ];
671 if (fabs(scale - 1.0) < Precision::Confusion()) {
672 // special case to avoid division by zero
673 for (int i = 1; i < NbSegm; i++) {
674 double param = f + (l - f) * i / NbSegm;
675 theParams.push_back( param );
678 // general case of scale distribution
682 double alpha = pow(scale, 1.0 / (NbSegm - 1));
683 double factor = (l - f) / (1.0 - pow(alpha, NbSegm));
685 for (int i = 1; i < NbSegm; i++) {
686 double param = f + factor * (1.0 - pow(alpha, i));
687 theParams.push_back( param );
693 case StdMeshers_NumberOfSegments::DT_TabFunc:
695 FunctionTable func(_vvalue[ TAB_FUNC_IND ], _ivalue[ CONV_MODE_IND ]);
696 return computeParamByFunc(theC3d, f, l, theLength, theReverse,
697 _ivalue[ NB_SEGMENTS_IND ], func,
701 case StdMeshers_NumberOfSegments::DT_ExprFunc:
703 FunctionExpr func(_svalue[ EXPR_FUNC_IND ].c_str(), _ivalue[ CONV_MODE_IND ]);
704 return computeParamByFunc(theC3d, f, l, theLength, theReverse,
705 _ivalue[ NB_SEGMENTS_IND ], func,
709 case StdMeshers_NumberOfSegments::DT_Regular:
710 eltSize = theLength / _ivalue[ NB_SEGMENTS_IND ];
716 GCPnts_UniformAbscissa Discret(theC3d, eltSize, f, l);
717 if ( !Discret.IsDone() )
718 return error( "GCPnts_UniformAbscissa failed");
720 int NbPoints = Discret.NbPoints();
721 for ( int i = 2; i < NbPoints; i++ )
723 double param = Discret.Parameter(i);
724 theParams.push_back( param );
726 compensateError( eltSize, eltSize, f, l, theLength, theC3d, theParams ); // for PAL9899
730 case BEG_END_LENGTH: {
732 // geometric progression: SUM(n) = ( a1 - an * q ) / ( 1 - q ) = theLength
734 double a1 = _value[ BEG_LENGTH_IND ];
735 double an = _value[ END_LENGTH_IND ];
736 double q = ( theLength - a1 ) / ( theLength - an );
737 if ( q < theLength/1e6 || 1.01*theLength < a1 + an)
738 return error ( SMESH_Comment("Invalid segment lengths (")<<a1<<" and "<<an<<") "<<
739 "for an edge of length "<<theLength);
741 double U1 = theReverse ? l : f;
742 double Un = theReverse ? f : l;
744 double eltSize = theReverse ? -a1 : a1;
746 // computes a point on a curve <theC3d> at the distance <eltSize>
747 // from the point of parameter <param>.
748 GCPnts_AbscissaPoint Discret( theC3d, eltSize, param );
749 if ( !Discret.IsDone() ) break;
750 param = Discret.Parameter();
751 if ( f < param && param < l )
752 theParams.push_back( param );
757 compensateError( a1, an, U1, Un, theLength, theC3d, theParams );
758 if (theReverse) theParams.reverse(); // NPAL18025
762 case ARITHMETIC_1D: {
764 // arithmetic progression: SUM(n) = ( an - a1 + q ) * ( a1 + an ) / ( 2 * q ) = theLength
766 double a1 = _value[ BEG_LENGTH_IND ];
767 double an = _value[ END_LENGTH_IND ];
768 if ( 1.01*theLength < a1 + an)
769 return error ( SMESH_Comment("Invalid segment lengths (")<<a1<<" and "<<an<<") "<<
770 "for an edge of length "<<theLength);
772 double q = ( an - a1 ) / ( 2 *theLength/( a1 + an ) - 1 );
773 int n = int(fabs(q) > numeric_limits<double>::min() ? ( 1+( an-a1 )/q ) : ( 1+theLength/a1 ));
775 double U1 = theReverse ? l : f;
776 double Un = theReverse ? f : l;
783 while ( n-- > 0 && eltSize * ( Un - U1 ) > 0 ) {
784 // computes a point on a curve <theC3d> at the distance <eltSize>
785 // from the point of parameter <param>.
786 GCPnts_AbscissaPoint Discret( theC3d, eltSize, param );
787 if ( !Discret.IsDone() ) break;
788 param = Discret.Parameter();
789 if ( param > f && param < l )
790 theParams.push_back( param );
795 compensateError( a1, an, U1, Un, theLength, theC3d, theParams );
796 if (theReverse) theParams.reverse(); // NPAL18025
801 case FIXED_POINTS_1D: {
802 const std::vector<double>& aPnts = _fpHyp->GetPoints();
803 const std::vector<int>& nbsegs = _fpHyp->GetNbSegments();
805 TColStd_SequenceOfReal Params;
806 for(; i<aPnts.size(); i++) {
807 if( aPnts[i]<0.0001 || aPnts[i]>0.9999 ) continue;
809 bool IsExist = false;
810 for(; j<=Params.Length(); j++) {
811 if( fabs(aPnts[i]-Params.Value(j)) < 1e-4 ) {
815 if( aPnts[i]<Params.Value(j) ) break;
817 if(!IsExist) Params.InsertBefore(j,aPnts[i]);
819 double par2, par1, lp;
828 double eltSize, segmentSize = 0.;
829 double currAbscissa = 0;
830 for(i=0; i<Params.Length(); i++) {
831 int nbseg = ( i > nbsegs.size()-1 ) ? nbsegs[0] : nbsegs[i];
832 segmentSize = Params.Value(i+1)*theLength - currAbscissa;
833 currAbscissa += segmentSize;
834 GCPnts_AbscissaPoint APnt(theC3d, sign*segmentSize, par1);
836 return error( "GCPnts_AbscissaPoint failed");
837 par2 = APnt.Parameter();
838 eltSize = segmentSize/nbseg;
839 GCPnts_UniformAbscissa Discret(theC3d, eltSize, par1, par2);
841 Discret.Initialize(theC3d, eltSize, par2, par1);
843 Discret.Initialize(theC3d, eltSize, par1, par2);
844 if ( !Discret.IsDone() )
845 return error( "GCPnts_UniformAbscissa failed");
846 int NbPoints = Discret.NbPoints();
847 list<double> tmpParams;
848 for(int i=2; i<NbPoints; i++) {
849 double param = Discret.Parameter(i);
850 tmpParams.push_back( param );
853 compensateError( eltSize, eltSize, par2, par1, segmentSize, theC3d, tmpParams );
857 compensateError( eltSize, eltSize, par1, par2, segmentSize, theC3d, tmpParams );
859 list<double>::iterator itP = tmpParams.begin();
860 for(; itP != tmpParams.end(); itP++) {
861 theParams.push_back( *(itP) );
863 theParams.push_back( par2 );
868 int nbseg = ( nbsegs.size() > Params.Length() ) ? nbsegs[Params.Length()] : nbsegs[0];
869 segmentSize = theLength - currAbscissa;
870 eltSize = segmentSize/nbseg;
871 GCPnts_UniformAbscissa Discret;
873 Discret.Initialize(theC3d, eltSize, par1, lp);
875 Discret.Initialize(theC3d, eltSize, lp, par1);
876 if ( !Discret.IsDone() )
877 return error( "GCPnts_UniformAbscissa failed");
878 int NbPoints = Discret.NbPoints();
879 list<double> tmpParams;
880 for(int i=2; i<NbPoints; i++) {
881 double param = Discret.Parameter(i);
882 tmpParams.push_back( param );
885 compensateError( eltSize, eltSize, lp, par1, segmentSize, theC3d, tmpParams );
889 compensateError( eltSize, eltSize, par1, lp, segmentSize, theC3d, tmpParams );
891 list<double>::iterator itP = tmpParams.begin();
892 for(; itP != tmpParams.end(); itP++) {
893 theParams.push_back( *(itP) );
897 theParams.reverse(); // NPAL18025
904 GCPnts_UniformDeflection Discret(theC3d, _value[ DEFLECTION_IND ], f, l, true);
905 if ( !Discret.IsDone() )
908 int NbPoints = Discret.NbPoints();
909 for ( int i = 2; i < NbPoints; i++ )
911 double param = Discret.Parameter(i);
912 theParams.push_back( param );
923 //=============================================================================
927 //=============================================================================
929 bool StdMeshers_Regular_1D::Compute(SMESH_Mesh & theMesh, const TopoDS_Shape & theShape)
931 if ( _hypType == NONE )
934 SMESHDS_Mesh * meshDS = theMesh.GetMeshDS();
936 const TopoDS_Edge & EE = TopoDS::Edge(theShape);
937 TopoDS_Edge E = TopoDS::Edge(EE.Oriented(TopAbs_FORWARD));
938 int shapeID = meshDS->ShapeToIndex( E );
941 Handle(Geom_Curve) Curve = BRep_Tool::Curve(E, f, l);
943 TopoDS_Vertex VFirst, VLast;
944 TopExp::Vertices(E, VFirst, VLast); // Vfirst corresponds to f and Vlast to l
946 ASSERT(!VFirst.IsNull());
947 ASSERT(!VLast.IsNull());
948 const SMDS_MeshNode * idFirst = SMESH_Algo::VertexNode( VFirst, meshDS );
949 const SMDS_MeshNode * idLast = SMESH_Algo::VertexNode( VLast, meshDS );
950 if (!idFirst || !idLast)
951 return error( COMPERR_BAD_INPUT_MESH, "No node on vertex");
953 // remove elements created by e.g. patern mapping (PAL21999)
954 // CLEAN event is incorrectly ptopagated seemingly due to Propagation hyp
955 // so TEMPORARY solution is to clean the submesh manually
956 //theMesh.GetSubMesh(theShape)->ComputeStateEngine( SMESH_subMesh::CLEAN );
957 if (SMESHDS_SubMesh * subMeshDS = meshDS->MeshElements(theShape))
959 SMDS_ElemIteratorPtr ite = subMeshDS->GetElements();
961 meshDS->RemoveFreeElement(ite->next(), subMeshDS);
962 SMDS_NodeIteratorPtr itn = subMeshDS->GetNodes();
963 while (itn->more()) {
964 const SMDS_MeshNode * node = itn->next();
965 if ( node->NbInverseElements() == 0 )
966 meshDS->RemoveFreeNode(node, subMeshDS);
968 meshDS->RemoveNode(node);
974 list< double > params;
975 bool reversed = false;
976 if ( theMesh.GetShapeToMesh().ShapeType() >= TopAbs_WIRE ) {
977 // if the shape to mesh is WIRE or EDGE
978 reversed = ( EE.Orientation() == TopAbs_REVERSED );
980 if ( !_mainEdge.IsNull() ) {
981 // take into account reversing the edge the hypothesis is propagated from
982 reversed = ( _mainEdge.Orientation() == TopAbs_REVERSED );
983 int mainID = meshDS->ShapeToIndex(_mainEdge);
984 if ( std::find( _revEdgesIDs.begin(), _revEdgesIDs.end(), mainID) != _revEdgesIDs.end())
985 reversed = !reversed;
987 // take into account this edge reversing
988 if ( std::find( _revEdgesIDs.begin(), _revEdgesIDs.end(), shapeID) != _revEdgesIDs.end())
989 reversed = !reversed;
991 BRepAdaptor_Curve C3d( E );
992 double length = EdgeLength( E );
993 if ( ! computeInternalParameters( theMesh, C3d, length, f, l, params, reversed, true )) {
996 redistributeNearVertices( theMesh, C3d, length, params, VFirst, VLast );
998 // edge extrema (indexes : 1 & NbPoints) already in SMDS (TopoDS_Vertex)
999 // only internal nodes receive an edge position with param on curve
1001 const SMDS_MeshNode * idPrev = idFirst;
1014 for (list<double>::iterator itU = params.begin(); itU != params.end(); itU++) {
1015 double param = *itU;
1016 gp_Pnt P = Curve->Value(param);
1018 //Add the Node in the DataStructure
1019 SMDS_MeshNode * node = meshDS->AddNode(P.X(), P.Y(), P.Z());
1020 meshDS->SetNodeOnEdge(node, shapeID, param);
1022 if(_quadraticMesh) {
1023 // create medium node
1024 double prm = ( parPrev + param )/2;
1025 gp_Pnt PM = Curve->Value(prm);
1026 SMDS_MeshNode * NM = meshDS->AddNode(PM.X(), PM.Y(), PM.Z());
1027 meshDS->SetNodeOnEdge(NM, shapeID, prm);
1028 SMDS_MeshEdge * edge = meshDS->AddEdge(idPrev, node, NM);
1029 meshDS->SetMeshElementOnShape(edge, shapeID);
1032 SMDS_MeshEdge * edge = meshDS->AddEdge(idPrev, node);
1033 meshDS->SetMeshElementOnShape(edge, shapeID);
1039 if(_quadraticMesh) {
1040 double prm = ( parPrev + parLast )/2;
1041 gp_Pnt PM = Curve->Value(prm);
1042 SMDS_MeshNode * NM = meshDS->AddNode(PM.X(), PM.Y(), PM.Z());
1043 meshDS->SetNodeOnEdge(NM, shapeID, prm);
1044 SMDS_MeshEdge * edge = meshDS->AddEdge(idPrev, idLast, NM);
1045 meshDS->SetMeshElementOnShape(edge, shapeID);
1048 SMDS_MeshEdge* edge = meshDS->AddEdge(idPrev, idLast);
1049 meshDS->SetMeshElementOnShape(edge, shapeID);
1054 //MESSAGE("************* Degenerated edge! *****************");
1056 // Edge is a degenerated Edge : We put n = 5 points on the edge.
1057 const int NbPoints = 5;
1058 BRep_Tool::Range( E, f, l ); // PAL15185
1059 double du = (l - f) / (NbPoints - 1);
1061 gp_Pnt P = BRep_Tool::Pnt(VFirst);
1063 const SMDS_MeshNode * idPrev = idFirst;
1064 for (int i = 2; i < NbPoints; i++) {
1065 double param = f + (i - 1) * du;
1066 SMDS_MeshNode * node = meshDS->AddNode(P.X(), P.Y(), P.Z());
1067 if(_quadraticMesh) {
1068 // create medium node
1069 double prm = param - du/2.;
1070 SMDS_MeshNode * NM = meshDS->AddNode(P.X(), P.Y(), P.Z());
1071 meshDS->SetNodeOnEdge(NM, shapeID, prm);
1072 SMDS_MeshEdge * edge = meshDS->AddEdge(idPrev, node, NM);
1073 meshDS->SetMeshElementOnShape(edge, shapeID);
1076 SMDS_MeshEdge * edge = meshDS->AddEdge(idPrev, node);
1077 meshDS->SetMeshElementOnShape(edge, shapeID);
1079 meshDS->SetNodeOnEdge(node, shapeID, param);
1082 if(_quadraticMesh) {
1083 // create medium node
1084 double prm = l - du/2.;
1085 SMDS_MeshNode * NM = meshDS->AddNode(P.X(), P.Y(), P.Z());
1086 meshDS->SetNodeOnEdge(NM, shapeID, prm);
1087 SMDS_MeshEdge * edge = meshDS->AddEdge(idPrev, idLast, NM);
1088 meshDS->SetMeshElementOnShape(edge, shapeID);
1091 SMDS_MeshEdge * edge = meshDS->AddEdge(idPrev, idLast);
1092 meshDS->SetMeshElementOnShape(edge, shapeID);
1099 //=============================================================================
1103 //=============================================================================
1105 bool StdMeshers_Regular_1D::Evaluate(SMESH_Mesh & theMesh,
1106 const TopoDS_Shape & theShape,
1107 MapShapeNbElems& aResMap)
1109 if ( _hypType == NONE )
1112 //SMESHDS_Mesh * meshDS = theMesh.GetMeshDS();
1114 const TopoDS_Edge & EE = TopoDS::Edge(theShape);
1115 TopoDS_Edge E = TopoDS::Edge(EE.Oriented(TopAbs_FORWARD));
1116 // int shapeID = meshDS->ShapeToIndex( E );
1119 Handle(Geom_Curve) Curve = BRep_Tool::Curve(E, f, l);
1121 TopoDS_Vertex VFirst, VLast;
1122 TopExp::Vertices(E, VFirst, VLast); // Vfirst corresponds to f and Vlast to l
1124 ASSERT(!VFirst.IsNull());
1125 ASSERT(!VLast.IsNull());
1127 std::vector<int> aVec(SMDSEntity_Last,0);
1129 if (!Curve.IsNull()) {
1130 list< double > params;
1132 BRepAdaptor_Curve C3d( E );
1133 double length = EdgeLength( E );
1134 if ( ! computeInternalParameters( theMesh, C3d, length, f, l, params, false, true )) {
1135 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1136 aResMap.insert(std::make_pair(sm,aVec));
1137 SMESH_ComputeErrorPtr& smError = sm->GetComputeError();
1138 smError.reset( new SMESH_ComputeError(COMPERR_ALGO_FAILED,"Submesh can not be evaluated",this));
1141 redistributeNearVertices( theMesh, C3d, length, params, VFirst, VLast );
1143 if(_quadraticMesh) {
1144 aVec[SMDSEntity_Node] = 2*params.size() + 1;
1145 aVec[SMDSEntity_Quad_Edge] = params.size() + 1;
1148 aVec[SMDSEntity_Node] = params.size();
1149 aVec[SMDSEntity_Edge] = params.size() + 1;
1154 //MESSAGE("************* Degenerated edge! *****************");
1155 // Edge is a degenerated Edge : We put n = 5 points on the edge.
1156 if(_quadraticMesh) {
1157 aVec[SMDSEntity_Node] = 11;
1158 aVec[SMDSEntity_Quad_Edge] = 6;
1161 aVec[SMDSEntity_Node] = 5;
1162 aVec[SMDSEntity_Edge] = 6;
1166 SMESH_subMesh * sm = theMesh.GetSubMesh(theShape);
1167 aResMap.insert(std::make_pair(sm,aVec));
1173 //=============================================================================
1175 * See comments in SMESH_Algo.cxx
1177 //=============================================================================
1179 const list <const SMESHDS_Hypothesis *> &
1180 StdMeshers_Regular_1D::GetUsedHypothesis(SMESH_Mesh & aMesh,
1181 const TopoDS_Shape & aShape,
1182 const bool ignoreAuxiliary)
1184 _usedHypList.clear();
1185 _mainEdge.Nullify();
1187 SMESH_HypoFilter auxiliaryFilter, compatibleFilter;
1188 auxiliaryFilter.Init( SMESH_HypoFilter::IsAuxiliary() );
1189 InitCompatibleHypoFilter( compatibleFilter, /*ignoreAux=*/true );
1191 // get non-auxiliary assigned directly to aShape
1192 int nbHyp = aMesh.GetHypotheses( aShape, compatibleFilter, _usedHypList, false );
1194 if (nbHyp == 0 && aShape.ShapeType() == TopAbs_EDGE)
1196 // Check, if propagated from some other edge
1197 _mainEdge = StdMeshers_Propagation::GetPropagationSource( aMesh, aShape );
1198 if ( !_mainEdge.IsNull() )
1200 // Propagation of 1D hypothesis from <aMainEdge> on this edge;
1201 // get non-auxiliary assigned to _mainEdge
1202 nbHyp = aMesh.GetHypotheses( _mainEdge, compatibleFilter, _usedHypList, true );
1206 if (nbHyp == 0) // nothing propagated nor assigned to aShape
1208 SMESH_Algo::GetUsedHypothesis( aMesh, aShape, ignoreAuxiliary );
1209 nbHyp = _usedHypList.size();
1213 // get auxiliary hyps from aShape
1214 aMesh.GetHypotheses( aShape, auxiliaryFilter, _usedHypList, true );
1216 if ( nbHyp > 1 && ignoreAuxiliary )
1217 _usedHypList.clear(); //only one compatible non-auxiliary hypothesis allowed
1219 return _usedHypList;