From 6628b1ee245db944ece811932c4dff0751e0dcd3 Mon Sep 17 00:00:00 2001
From: DarioS <dario.sassi@egaltech.com>
Date: Mon, 22 Nov 2021 22:56:13 +0100
Subject: [PATCH 1/3] =?UTF-8?q?EgtGeomKernel=202.3k5=20:=20-=20correzione?=
 =?UTF-8?q?=20in=20RemoveTriangle=20di=20TriMesh=20(controllo=20validit?=
 =?UTF-8?q?=C3=A0=20indice=20vertice).?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 EgtGeomKernel.rc | Bin 11718 -> 11718 bytes
 SurfTriMesh.cpp  |   2 +-
 2 files changed, 1 insertion(+), 1 deletion(-)

diff --git a/EgtGeomKernel.rc b/EgtGeomKernel.rc
index 2bed869af1d3e371655ae011860da7917ae26ef6..8823af26857775dc6357e388b0d9b1b392d7b629 100644
GIT binary patch
delta 110
zcmX>WeJpyzA2vqQ&G-4vGfl1&(wY2&Q;pGdvZAo=W*@FeEMOU1X1ItO<K_v%K0rQD
U1FCSJG*lRiIUbCgi<CpS00t)_umAu6

delta 110
zcmX>WeJpyzA2vpl&G-4vGfl1&(wY2&Q;pGNvZAo=W*@FeEMOU1X1ItO<K_v%K0rQD
U1FCSJG*lRiIUbCgi<CpS00c=Qr~m)}

diff --git a/SurfTriMesh.cpp b/SurfTriMesh.cpp
index 0970cbd..4fa8bab 100644
--- a/SurfTriMesh.cpp
+++ b/SurfTriMesh.cpp
@@ -239,7 +239,7 @@ SurfTriMesh::RemoveTriangle( int nId)
      // indice vertice
       int nV = m_vTria[nId].nIdVert[i] ;
      // se vertice non c'è passo al prossimo
-      if ( nV < 0  ||  nV >= int( m_vTria.size()))
+      if ( nV < 0  ||  nV >= int( m_vVert.size()))
          continue ;
       if ( m_vVert[nV].nIdTria == nId) {
          int nAdjP = m_vTria[nId].nIdAdjac[i] ;

From 6cdfdf6db8ff077f3666c3dd25059189aae5d197 Mon Sep 17 00:00:00 2001
From: DarioS <dario.sassi@egaltech.com>
Date: Thu, 25 Nov 2021 14:47:03 +0100
Subject: [PATCH 2/3] EgtGeomKernel 2.3k6 : - dopo tagli e tagli generalizzati
 lunghezza minima per SimplfyFacets portata da 500 a 5000 per evitare problemi
 di adiacenza non trovata tra facce.

---
 EgtGeomKernel.rc    | Bin 11718 -> 11718 bytes
 SurfTriMeshCuts.cpp |   4 ++--
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/EgtGeomKernel.rc b/EgtGeomKernel.rc
index 8823af26857775dc6357e388b0d9b1b392d7b629..699e5e00699dc45f6e1d485b54402217649da827 100644
GIT binary patch
delta 110
zcmX>WeJpyzA2vp_&G-4vGfl1&(wY2&Q;pGVvZAo=W*@FeEMOU1X1ItO<K_v%K0rQD
U1FCSJG*lRiIUbCgi<CpS00;#lxBvhE

delta 110
zcmX>WeJpyzA2vqQ&G-4vGfl1&(wY2&Q;pGdvZAo=W*@FeEMOU1X1ItO<K_v%K0rQD
U1FCSJG*lRiIUbCgi<CpS00t)_umAu6

diff --git a/SurfTriMeshCuts.cpp b/SurfTriMeshCuts.cpp
index 4d29524..124ce0e 100644
--- a/SurfTriMeshCuts.cpp
+++ b/SurfTriMeshCuts.cpp
@@ -57,7 +57,7 @@ SurfTriMesh::Cut( const Plane3d& plPlane, bool bSaveOnEq)
 
   // se superficie originale a facce, cerco di semplificarle in ogni caso
    if ( nFacetOriCnt < 200  ||  double( nTriaOriCnt) / nFacetOriCnt > 4) {
-      if ( ! SimplifyFacets( 500.0))
+      if ( ! SimplifyFacets( 5000.0))
          LOG_ERROR( GetEGkLogger(), "Error in SimplifyFacets of Stm::Cut")
    }
 
@@ -866,7 +866,7 @@ SurfTriMesh::GeneralizedCut( const ICurve& cvCurve, bool bSaveOnEq)
 
   // se superficie originale a facce, cerco di semplificarle in ogni caso
    if ( nFacetOriCnt < 200  ||  double( nTriaOriCnt) / nFacetOriCnt > 4) {
-      if ( ! SimplifyFacets( 500.0))
+      if ( ! SimplifyFacets( 5000.0))
          LOG_ERROR( GetEGkLogger(), "Error in SimplifyFacets of Stm::GeneralizedCut")
    }
 

From ca83aaa249ef66937ccc16640c11d72bd2f04c55 Mon Sep 17 00:00:00 2001
From: DarioS <dario.sassi@egaltech.com>
Date: Mon, 6 Dec 2021 16:47:36 +0100
Subject: [PATCH 3/3] EgtGeomKernel 2.3l1 : - in IntersTriaTria aggiunto
 riconoscimento triangoli coincidenti - in IntersTriaTria aggiunta distinzione
 tra intersezione sovrapposta equiversa e controversa.

---
 EgtGeomKernel.rc        | Bin 11718 -> 11718 bytes
 IntersSurfTmSurfTm.cpp  |   2 +-
 IntersTriaTria.cpp      |  33 +++++++++++++++++++++++++++++++--
 SurfTriMeshBooleans.cpp |  18 ++++++++++++------
 4 files changed, 44 insertions(+), 9 deletions(-)

diff --git a/EgtGeomKernel.rc b/EgtGeomKernel.rc
index 699e5e00699dc45f6e1d485b54402217649da827..c90a3d5b2e700f8515b8212dfc0fe0529995afd8 100644
GIT binary patch
delta 134
zcmX>WeJpyz4>ndK1|0^&&G-4vGfl1&(wY2&Q-wK)!Emyou<m9bu09sHyfrhDxEtf<
Y3Bn%CI3@d}ktDI2?7_IXNI8TH0A_<FxBvhE

delta 134
zcmX>WeJpyz4>ndq1|0^o&G-4vGfl1&(wY2&Q-wL3!ECaku<m9bu09sHyfrhDxEtf<
Y3Bn%CI3@d}ktDI2?7_IXNI8TH0B<8D*Z=?k

diff --git a/IntersSurfTmSurfTm.cpp b/IntersSurfTmSurfTm.cpp
index 4a07e49..1a95d00 100644
--- a/IntersSurfTmSurfTm.cpp
+++ b/IntersSurfTmSurfTm.cpp
@@ -116,7 +116,7 @@ IntersSurfTmSurfTm( const ISurfTriMesh& Stm1, const ISurfTriMesh& Stm2,
                   }
                }
               // se altrimenti sovrapposizione
-               else if ( nRes == ITTT_OVERLAPS) {
+               else if ( nRes == ITTT_OVERLAPS  ||  nRes == ITTT_COUNTER_OVERLAPS) {
                   for ( const auto& Tria : vIttTria) {
                     // verifico se triangolo già inserito
                      bool bFound = false ;
diff --git a/IntersTriaTria.cpp b/IntersTriaTria.cpp
index 03cf31e..8eb8d02 100644
--- a/IntersTriaTria.cpp
+++ b/IntersTriaTria.cpp
@@ -83,8 +83,37 @@ IntersTriaTria( const Triangle3d& trTria1, const Triangle3d& trTria2, Point3d& p
   // se i triangoli sono complanari
    if ( nResPP == IPPT_OVERLAPS  ||
         ((( nVertPos1 == 0  &&  nVertNeg1 == 0)  ||  ( nVertPos2 == 0  &&  nVertNeg2 == 0)) &&
-         ( trTria1.GetN() ^ trTria2.GetN()).SqLen() < 25 * SIN_EPS_ANG_SMALL * SIN_EPS_ANG_SMALL))
-      return IntersCoplanarTriaTria( trTria1, trTria2, vTria) ;
+         ( trTria1.GetN() ^ trTria2.GetN()).SqLen() < 25 * SIN_EPS_ANG_SMALL * SIN_EPS_ANG_SMALL)) {
+     // verifica per triangoli con normali controverse
+      bool bCounter = false ;
+      Triangle3d trMyTria2 = trTria2 ;
+      if ( trTria1.GetN() * trTria2.GetN() < 0) {
+         Point3d ptV0 = trMyTria2.GetP( 0) ;
+         trMyTria2.SetP( 0, trMyTria2.GetP( 1)) ;
+         trMyTria2.SetP( 1, ptV0) ;
+         trMyTria2.Validate() ;
+         bCounter = true ;
+      }
+     // verifica per triangoli coincidenti
+      bool bAreSameTria = ( ( AreSamePointExact( trTria1.GetP( 0), trMyTria2.GetP( 0))  &&
+                              AreSamePointExact( trTria1.GetP( 1), trMyTria2.GetP( 1))  &&
+                              AreSamePointExact( trTria1.GetP( 2), trMyTria2.GetP( 2)))  ||
+                            ( AreSamePointExact( trTria1.GetP( 0), trMyTria2.GetP( 1))  &&
+                              AreSamePointExact( trTria1.GetP( 1), trMyTria2.GetP( 2))  &&
+                              AreSamePointExact( trTria1.GetP( 2), trMyTria2.GetP( 0)))  ||
+                            ( AreSamePointExact( trTria1.GetP( 0), trMyTria2.GetP( 2))  &&
+                              AreSamePointExact( trTria1.GetP( 1), trMyTria2.GetP( 0))  &&
+                              AreSamePointExact( trTria1.GetP( 2), trMyTria2.GetP( 1))))  &&
+                          ( AreSameVectorExact( trTria1.GetN(), trMyTria2.GetN())) ;
+      if ( bAreSameTria) {
+         vTria.emplace_back( trTria1) ;
+         return ( bCounter ? ITTT_COUNTER_OVERLAPS : ITTT_OVERLAPS) ;
+      }
+      if ( ITTT_OVERLAPS == IntersCoplanarTriaTria( trTria1, trMyTria2, vTria)) {
+         return ( bCounter ? ITTT_COUNTER_OVERLAPS : ITTT_OVERLAPS) ;
+      }
+      return ITTT_NO ;
+   }
 
   // limito la linea di intersezione con il primo triangolo
    Point3d ptSt1, ptEn1 ;
diff --git a/SurfTriMeshBooleans.cpp b/SurfTriMeshBooleans.cpp
index 2b199d5..d5b6f8a 100644
--- a/SurfTriMeshBooleans.cpp
+++ b/SurfTriMeshBooleans.cpp
@@ -1339,9 +1339,12 @@ SurfTriMesh::IntersectTriMeshTriangle( SurfTriMesh& Other)
             Point3d ptTempA, ptTempB ;
             int nIntTypeAB = IntersTriaTria( trTriaA, trTriaB, ptTempA, ptTempB, vTriaAB) ;
             if ( nIntTypeAB == ITTT_OVERLAPS) {
-               bool bInvertB = trTriaA.GetN() * trTriaB.GetN() < 0. ;
-               m_vTria[nTA].nTempPart = ( bInvertB ? -2 : 2) ;
-               SurfB.m_vTria[vNearTria[nTB]].nTempPart = ( bInvertB ? - 2 : 2) ;
+               m_vTria[nTA].nTempPart = 2 ;
+               SurfB.m_vTria[vNearTria[nTB]].nTempPart = 2 ;
+            }
+            else if ( nIntTypeAB == ITTT_COUNTER_OVERLAPS) {
+               m_vTria[nTA].nTempPart = -2 ;
+               SurfB.m_vTria[vNearTria[nTB]].nTempPart = -2 ;  
             }
          }
       }
@@ -3663,9 +3666,12 @@ SurfTriMesh::IntersectTriMeshFacets( SurfTriMesh& Other)
             }
             // Se l'intersezeione è corretta e i triangoli sono sovrapposti aggiorno gli indici.
             if ( nIntTypeAB == ITTT_OVERLAPS  &&  bSuccesfullInters) {
-               bool bInvertB = trTriaA.GetN() * trTriaB.GetN() < 0. ;
-               m_vTria[nTA].nTempPart = ( bInvertB ? -2 : 2) ;
-               SurfB.m_vTria[vNearTria[nTB]].nTempPart = ( bInvertB ? - 2 : 2) ;
+               m_vTria[nTA].nTempPart = 2 ;
+               SurfB.m_vTria[vNearTria[nTB]].nTempPart = 2 ;
+            }
+            else if ( nIntTypeAB == ITTT_COUNTER_OVERLAPS  &&  bSuccesfullInters) {
+               m_vTria[nTA].nTempPart = - 2 ;
+               SurfB.m_vTria[vNearTria[nTB]].nTempPart = - 2 ;  
             }
          }
       }