EgtGeomKernel :

- tolta da ChainCurves riduzione tolleranza con dimensione pezzi - aggiunte DistPointTriangle, IntersPlaneTria, IntersPlaneSurfTm - correzioni a IntersCrvCompoCrvCompo per topologia intersezioni - completamente riscritta IntersCoplanarLineTria per robustezza topologica.
2017-10-21 17:01:23 +00:00
parent 5bcd4bb67d
commit 9770d57793
14 changed files with 909 additions and 340 deletions
@@ -0,0 +1,95 @@
+//----------------------------------------------------------------------------
+//  EgalTech 2017-2017
+//----------------------------------------------------------------------------
+// File : DistPointTria.cpp       Data : 19.10.17          Versione : 1.8j4
+// Contenuto : Implementazione della classe distanza punto da triangolo.
+//
+//
+//
+// Modifiche : 19.10.17 DS Creazione modulo.
+//
+//
+//----------------------------------------------------------------------------
+
+//--------------------------- Include ----------------------------------------
+#include "stdafx.h"
+#include "ProjPlane.h"
+#include "DistPointLine.h"
+#include "/EgtDev/Include/EGkDistPointTria.h"
+
+
+//----------------------------------------------------------------------------
+DistPointTriangle::DistPointTriangle( const Point3d& ptP, const Triangle3d& Tria)
+{
+   if ( &Tria == nullptr  ||  ! Tria.IsValid()) {
+     // distanza non calcolabile
+      m_dSqDist = - 1 ;
+      return ;
+   }
+
+  // eseguo calcoli e determino il quadrato della distanza
+   Calculate( ptP, Tria) ;
+
+  // dichiaro distanza non ancora calcolata
+   m_dDist = - 1 ;
+}
+
+//----------------------------------------------------------------------------
+void
+DistPointTriangle::Calculate( const Point3d& ptP, const Triangle3d& Tria)
+{
+  // Proiezione del punto sul piano del triangolo
+   Point3d ptQ = ptP - (( ptP - Tria.GetP( 0)) * Tria.GetN()) * Tria.GetN() ;
+
+  // Verifico se il punto proiettato sta nel triangolo
+   if ( PointInTria( ptQ, Tria) != PTT_OUT) {
+      m_dSqDist = SqDist( ptP, ptQ) ;
+      m_ptMinDist = ptQ ;
+      return ;
+   }
+
+  // Determino la minima distanza dai tre lati
+   for ( int i = 0 ; i < 3 ; ++ i) {
+      DistPointLine dstPL( ptQ, Tria.GetP( i), Tria.GetP( ( i + 1) % 3)) ;
+      double dSqDist ;
+      if ( dstPL.GetSqDist( dSqDist)  &&  ( m_dSqDist < 0  ||  dSqDist < m_dSqDist)) {
+         m_dSqDist = dSqDist ;
+         dstPL.GetMinDistPoint( m_ptMinDist) ;
+      }
+   }
+}
+
+//----------------------------------------------------------------------------
+bool
+DistPointTriangle::GetSqDist( double& dSqDist)
+{
+   if ( m_dSqDist < 0)
+      return false ;
+
+   dSqDist = m_dSqDist ;
+   return true ;
+}
+
+//----------------------------------------------------------------------------
+bool
+DistPointTriangle::GetDist( double& dDist)
+{
+   if ( m_dSqDist < 0)
+      return false ;
+
+   if ( m_dDist < 0)
+      m_dDist = sqrt( m_dSqDist) ;
+   dDist = m_dDist ;
+   return true ;
+}
+
+//----------------------------------------------------------------------------
+bool
+DistPointTriangle::GetMinDistPoint( Point3d& ptMinDist)
+{
+   if ( m_dSqDist < 0)
+      return false ;
+
+   ptMinDist = m_ptMinDist ;
+   return true ;
+}