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

EgtMachKernel 2.3d5 :

Browse Source 
- step minimo simulazione con verifica collisioni portato da 10 a 20 mm
- in svuotature aggiunta possibilità di disabilitare tutti i lati aperti con Open=0 nelle note della lavorazione.
This commit is contained in:
DarioS
2021-04-29 08:55:07 +02:00
parent eeedb33603
commit 94de4a72ae
3 changed files with 13 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
EgtMachKernel.rc
BIN
View File
Binary file not shown.
Pocketing.cpp
+12 -3
View File
@@ -1386,11 +1386,20 @@ Pocketing::ProcessPath( int nPathId, int nPvId, int nClId)
return false ; return false ;
ICurveComposite* pCompo = GetCurveComposite( m_pGeomDB->GetGeoObj( nCopyId)) ; ICurveComposite* pCompo = GetCurveComposite( m_pGeomDB->GetGeoObj( nCopyId)) ;
// aggiorno flag per lati aperti // annullo i flag di tratto aperto
for ( int i = 0 ; i < int( pCompo->GetCurveCount()) ; ++ i)
pCompo->SetCurveTempProp( i, 0) ;
// verifico se vanno gestiti i lati aperti
bool bSomeOpen = m_pGeomDB->ExistsInfo( nCrvId, KEY_OPEN) ; bool bSomeOpen = m_pGeomDB->ExistsInfo( nCrvId, KEY_OPEN) ;
if ( bSomeOpen) { if ( bSomeOpen) {
for ( int i = 0 ; i < int( pCompo->GetCurveCount()) ; ++ i) int nOpen ;
pCompo->SetCurveTempProp( i, 0) ; if ( FromString( ExtractInfo( m_Params.m_sUserNotes, "Open="), nOpen) && nOpen == 0)
bSomeOpen = false ;
}
// aggiorno flag per lati aperti
if ( bSomeOpen) {
INTVECTOR vOpen ; INTVECTOR vOpen ;
m_pGeomDB->GetInfo( nCrvId, KEY_OPEN, vOpen) ; m_pGeomDB->GetInfo( nCrvId, KEY_OPEN, vOpen) ;
for ( int j : vOpen) for ( int j : vOpen)
Simulator.cpp
+1 -1
View File
@@ -974,7 +974,7 @@ Simulator::ManageSingleMove( int& nStatus, double& dMove)
// se attivo CollisionCheck approssimo movimento con più step // se attivo CollisionCheck approssimo movimento con più step
int nStep = 1 ; int nStep = 1 ;
if ( NeedCollisionCheck()) { if ( NeedCollisionCheck()) {
const double LEN_STEP = 10. ; const double LEN_STEP = 20. ;
nStep = max( int( dDist / LEN_STEP), 1) ; nStep = max( int( dDist / LEN_STEP), 1) ;
} }
for ( int i = 1 ; i <= nStep ; ++ i) { for ( int i = 1 ; i <= nStep ; ++ i) {