diff --git a/SurfBezier.cpp b/SurfBezier.cpp
index 05b8ca8..27a6cae 100644
--- a/SurfBezier.cpp
+++ b/SurfBezier.cpp
@@ -56,7 +56,7 @@ static unordered_map<INTINT, DBLVECTOR, PairHashIntInt>  m_mBernCache ;  // mapp
 
 //----------------------------------------------------------------------------
 SurfBezier::SurfBezier( void)
-   : m_pSTM( nullptr), m_nStatus( TO_VERIFY), m_nDegU(), m_nDegV(), m_nSpanU(), m_nSpanV(), m_bRat( false),
+   : m_pSTM( nullptr), m_pSTMRefined( nullptr), m_nStatus( TO_VERIFY), m_nDegU(), m_nDegV(), m_nSpanU(), m_nSpanV(), m_bRat( false),
      m_bTrimmed( false), m_bClosedU( false), m_bClosedV( false), m_pTrimReg(nullptr), m_nTempProp{0,0}, m_dTempParam{0.0,0.0}
 {
 }
@@ -1622,6 +1622,7 @@ SurfBezier::GetAuxSurf( void) const
       return m_pSTM ;
   // eseguo calcolo
    m_pSTM = GetApproxSurf( 1000 * EPS_SMALL, 100 * EPS_SMALL) ;
+   //m_pSTM = GetApproxSurf( 50 * EPS_SMALL, 100 * EPS_SMALL) ;
    return m_pSTM ;
 }
 
@@ -1981,7 +1982,8 @@ SurfBezier::GetLeaves( vector<tuple<int, Point3d, Point3d>>& vLeaves) const
          //Tree.BuildTree( 5 * LIN_TOL_FINE, 1) ;     // per debug
       }
       else {
-         Tree.BuildTree( 100 * LIN_TOL_FINE, 0.1) ;
+         //Tree.BuildTree( 100 * LIN_TOL_FINE, 0.1) ;
+         Tree.BuildTree( 5 * LIN_TOL_FINE, 0.1) ;
       }
       vector<Cell> vCells ;
       Tree.GetLeaves( vCells) ;