0026980: Intersection algorithm spends much system time and system memory
authornbv <nbv@opencascade.com>
Mon, 8 Feb 2016 07:01:22 +0000 (10:01 +0300)
committerbugmaster <bugmaster@opencascade.com>
Thu, 11 Feb 2016 09:58:53 +0000 (12:58 +0300)
commit714c3bfcccf84ca64467a089a9089b479ff4ab0d
treece32ca40130e91613dcdfbf2e21fd6e6907d34ec
parent6e448ab08126b00486bcb1de00596cf3a9640e30
0026980: Intersection algorithm spends much system time and system memory

1. Step of Walking-line has been increased as possible and now computes by iteratively adaptive algorithm (every iteration checks if current step is too big/small and decreases/increases one).

2. Interface of IntWalk_PWalking class has been changed
2.1. Method MaxStep() has been added in order to know about maximal distance between 2D-points.
2.2. Method ComputePasInit(...) has been added in order to initial step value computation.
2.3. Fields myTolTang (tolerance for intersection algorithm) and myStepMin (minimal step value) have been added.

Correction of some test cases.
Creation test case for this issue.
Changes to eliminate compiler warnings.
src/IntPatch/IntPatch_Intersection.cxx
src/IntPatch/IntPatch_PrmPrmIntersection.cxx
src/IntWalk/IntWalk_PWalking.cxx
src/IntWalk/IntWalk_PWalking.hxx
src/IntWalk/IntWalk_StatusDeflection.hxx
tests/blend/simple/X4
tests/bugs/modalg_5/bug24585_1
tests/bugs/modalg_5/bug25193
tests/bugs/modalg_6/bug26980 [new file with mode: 0644]
tests/offset/shape/A1