OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-14 13:30:48 +03:00
Code Activity

0030194: Modeling Algorithms - Intersection points between line and torus are not found

Browse Source 
Calling numerical solution is implemented if analytical algorithm fails
This commit is contained in:
ifv
2018-10-04 16:06:54 +03:00
committed by apn
parent 0fdcb9c998
commit 751d055356
3 changed files with 77 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/IntAna/IntAna_IntLinTorus.cxx
View File

@@ -79,6 +79,7 @@ void IntAna_IntLinTorus::Perform (const gp_Lin& L, const gp_Torus& T) {
if(mdpr.IsDone()) {
Standard_Integer nbsolvalid = 0;
Standard_Integer n = mdpr.NbSolutions();
Standard_Integer aNbBadSol = 0;
for(Standard_Integer i = 1; i<=n ; i++) {
Standard_Real t = mdpr.Value(i);
t += ParamOfNewPL;
@@ -88,6 +89,7 @@ void IntAna_IntLinTorus::Perform (const gp_Lin& L, const gp_Torus& T) {
a0 = PSolT.SquareDistance(PSolL);
if(a0>0.0000000001) {
aNbBadSol++;
#if 0
cout<<" ------- Erreur : P Ligne < > P Tore "<<endl;
cout<<"Ligne : X:"<<PSolL.X()<<" Y:"<<PSolL.Y()<<" Z:"<<PSolL.Z()<<" l:"<<t<<endl;
@@ -102,8 +104,16 @@ void IntAna_IntLinTorus::Perform (const gp_Lin& L, const gp_Torus& T) {
nbsolvalid++;
}
}
nbpt = nbsolvalid;
done = Standard_True;
if (n > 0 && nbsolvalid == 0 && aNbBadSol == n)
{
nbpt = 0;
done = Standard_False;
}
else
{
nbpt = nbsolvalid;
done = Standard_True;
}
}
else {
nbpt = 0;