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

0026576: Wrong result obtained by intersection algorithm.

Browse Source 
1. Algorithm of Restriction line decomposition has been created.
2. Algorithm of check of coincidences between Walking and Restriction line has been improved in new function IsCoincide(...) (which replaces IsIn2DBox(...)).
3. Some useful methods have been added in IntPatch_PointLine (and inherited) classes.

Test cases for this issue have been created.
This commit is contained in:
nbv
2015-12-15 16:24:31 +03:00
committed by bugmaster
parent 4f99f761b1
commit 77dbd1f155
14 changed files with 878 additions and 246 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/IntWalk/IntWalk_IWalking_1.gxx
View File

@@ -40,8 +40,7 @@ static Standard_Boolean IsTangentExtCheck(TheIWFunction& theFunc,
const Standard_Real theVinf,
const Standard_Real theVsup)
{
//Factor 2.0 is chosen because we compare distance(s) between TWO faces
const Standard_Real aTol = 2.0*Precision::Confusion();
const Standard_Real aTol = theFunc.Tolerance();
const Standard_Integer aNbItems = 4;
const Standard_Real aParU[aNbItems] = { Min(theU + theStepU, theUsup),
Max(theU - theStepU, theUinf),