Line-Shape intersection algorithm became 400 times slower

Measure the speed of IntCurvesFace_ShapeIntersector::Perform in OCC 6.5.2, and any later release.

The sample code:

#include <BRepBndLib.hxx>
#include <OSD_Timer.hxx>
#include <IntCurvesFace_ShapeIntersector.hxx>

static Standard_Integer test(Draw_Interpretor& di, Standard_Integer narg , const char** a)
{
  if (narg != 2) return 1;
  TopoDS_Shape aShape = DBRep::Get(a[1]);

  IntCurvesFace_ShapeIntersector Inter;
  Inter.Load(aShape, Precision::Confusion());

  Bnd_Box aBndBox;
  BRepBndLib::Add(aShape, aBndBox);

  gp_Dir aDir(0., 1., 0.);
  const int N = 250;
  Standard_Real xMin = aBndBox.CornerMin().X();
  Standard_Real zMin = aBndBox.CornerMin().Z();
  Standard_Real xMax = aBndBox.CornerMax().X();
  Standard_Real zMax = aBndBox.CornerMax().Z();
  Standard_Real xStep = (xMax - xMin) / N;
  Standard_Real zStep = (zMax - zMin) / N;

  OSD_Timer aTimer;
  aTimer.Start();
  for (Standard_Real x = xMin; x <= xMax; x += xStep)
    for (Standard_Real z = zMin; z <= zMax; z += zStep)
    {
      gp_Pnt aPoint(x, 0.0, z);
      gp_Lin aLine(aPoint, aDir);
      Inter.PerformNearest(aLine, -100., 100.);
    }
  aTimer.Stop();
  aTimer.Show();
  return 0;
}