From 0fc8291ef5eab4e4fd3f6f28f61f8efe1db32664 Mon Sep 17 00:00:00 2001 From: Daniele Bariletti Date: Fri, 7 Mar 2025 09:17:38 +0100 Subject: [PATCH] - piccola miglioria a test per concatenamento. --- ChainCurves.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/ChainCurves.cpp b/ChainCurves.cpp index 01eface..ad5d615 100644 --- a/ChainCurves.cpp +++ b/ChainCurves.cpp @@ -273,7 +273,7 @@ ChainCurves::ChooseStart( const Point3d& ptStart, const INTVECTOR& vStart, int& // altrimenti, cerco la migliore int nI = - 1 ; - double dSqDistMin = SQ_INFINITO ; + double dDistMin = INFINITO ; for ( int i = 0 ; i < nSize ; ++ i) { // recupero indice e verso int nId = abs( vStart[i]) - 1 ; @@ -281,12 +281,12 @@ ChainCurves::ChooseStart( const Point3d& ptStart, const INTVECTOR& vStart, int& // calcolo un punto vicino all'estremo lungo la tangente Point3d ptNear = ( bEquiv ? m_vCrvData[nId].ptStart + m_vCrvData[nId].vtStart : m_vCrvData[nId].ptEnd - m_vCrvData[nId].vtEnd) ; - double dSqDist = SqDist( ptStart, ptNear) ; + double dDist = Dist( ptStart, ptNear) ; // tengo il segmento più vicino al punto // favorendo eventualmente quello equiverso se entro EPS da un concorrente - if ( dSqDist < dSqDistMin - EPS_SMALL || - ((dSqDist < dSqDistMin + EPS_SMALL) && bEquiv && vStart[nI] < 0)) { - dSqDistMin = dSqDist ; + if ( dDist < dDistMin - EPS_SMALL || + ((dDist < dDistMin + EPS_SMALL) && bEquiv && vStart[nI] < 0)) { + dDistMin = dDist ; nI = i ; } }