Egalware/EgtGeomKernel
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Migliorie in polyline e split parti triangolabili

Browse Source
This commit is contained in:
LorenzoM
2021-06-25 17:10:15 +02:00
parent 111880573c
commit dc17c648dc
2 changed files with 13 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files
SurfTriMeshBooleans.cpp
+2 -2
View File
@@ -4162,7 +4162,7 @@ SplitPolyLineContour( const POLYLINEVECTOR& vContourVec, POLYLINEVECTOR& vContou
return false ;
// Se la complessità non è eccessiva, non procedo.
int nPointsNum = vContourVec[0].GetPointNbr() ;
if ( nPointsNum < 10)
if ( nPointsNum < 4)
return false ;
for ( int n = 1 ; n < int( vContourVec.size()) ; ++ n)
nPointsNum += vContourVec[n].GetPointNbr() ;
@@ -4478,7 +4478,7 @@ SurfTriMesh::IntersectTriMeshFacets( SurfTriMesh& Other)
{ ////////////////////////////////////////////////////////////////////////////////////////////////////////
static int nTime = 0;
nTime++;
if (nTime == 14)
if (nTime == 4)
nTime = 0;
////////////////////////////////////////////////////////////////////////////////////////////////////////
SurfTriMesh& SurfB = Other ;