Merge branch 'master' of https://gitlab.steamware.net/egaltech/EgtGeomKernel

CurveAux.cpp

@@ -574,14 +574,11 @@ NurbsCurveCanonicalize( CNurbsData& cnData)
      // procedo all'inserimento
       int L = 0 ;
       double alpha ;
-      double num, den ;
       if ( mult < nDeg) {
         // inserisco il nodo r volte
          for ( int j = 1 ; j <= r ; ++ j) {
             L = b - nDeg + j ;
             for ( int i = 0; i <= r - j ; ++i) {
-               num = (cnData.vU[b] - cnData.vU[L + i]) ;
-               den = ( cnData.vU[i + b + 1] - cnData.vU[L + i]) ;
                alpha = (cnData.vU[b] - cnData.vU[L + i])/ ( cnData.vU[i + b + 1] - cnData.vU[L + i]) ;
                vBC[i] = alpha * vBC[i +1 ] + ( 1 - alpha) * vBC[i] ;
                if ( cnData.bRat) {
@@ -780,7 +777,6 @@ NurbsToBezierCurve( const CNurbsData& cnData)
    int b = cnData.nDeg ;
    bool bPrevRejected = false ;
   // ciclo
-   int n = 0 ; // debug
    while ( b < nU - 1) {
       int i = b ;
       while ( b < nU - 1  &&  abs( cnData.vU[b+1] - cnData.vU[b]) < EPS_ZERO)
@@ -848,8 +844,6 @@ NurbsToBezierCurve( const CNurbsData& cnData)
          pCrvBez.Reset() ;
          bPrevRejected = true ;
       }
-      // debug
-      ++n ;
      // inizializzazioni per la prossima curva di Bezier
       if ( b < nU - 1) {
          if ( ! cnData.bRat) {

ExtDimension.cpp

@@ -1285,7 +1285,7 @@ ExtDimension::ApproxWithLines( double dLinTol, double dAngTolDeg, POLYLINELIST&
          PtrOwner<CurveArc> pCrvPos( CreateBasicCurveArc()) ;
          if ( IsNull( pCrvPos))
             return false ;
-         double dHalfDist = GetTextHalfDist( m_ptCalcPos) ;
+         //double dHalfDist = GetTextHalfDist( m_ptCalcPos) ;
         
         // se non ho testo 
          if ( IsEmptyOrSpaces( m_sCalcText)) {

SurfBezier.cpp

@@ -1503,12 +1503,10 @@ SurfBezier::GetAuxSurf( void) const
   
    // costruttore della superficie
    vector<POLYLINEVECTOR> vvPL ;
-   POLYLINEVECTOR vPL ;    // per usare i polygon basic
+   //POLYLINEVECTOR vPL ;    // per usare i polygon basic
    Tree Tree( this, true) ;
    std::vector<std::tuple<Point3d,Point3d>> vTrees ;
    Tree.GetIndependentTrees( vTrees) ;
-   static int a = 0 ;
-   ++a ;
    for ( int i = 0 ; i < (int) vTrees.size() ; ++ i) {
       Point3d ptMin = std::get<0>( vTrees[i]) ;
       Point3d ptMax = std::get<1>( vTrees[i]) ;