Method SimplifyLoops

Common/DataModel/vtkReebGraph.cxx:1128–1228

------------------------------------------------------------------------------

//------------------------------------------------------------------------------
int vtkReebGraph::Implementation::SimplifyLoops(
  double simplificationThreshold, vtkReebGraphSimplificationMetric* simplificationMetric)
{

  if (!simplificationThreshold)
    return 0;

  // refresh information about ArcLoopTable
  this->FindLoops();

  int NumSimplified = 0;

  for (int n = 0; n < this->LoopNumber; n++)
  {
    int A = this->ArcLoopTable[n];

    if (this->GetArc(A)->LabelId1 == -2)
      continue;

    double simplificationValue = 0;
    if ((!inputMesh) || (!simplificationMetric))
    {
      vtkIdType N0 = this->GetArc(A)->NodeId0;
      vtkIdType N1 = this->GetArc(A)->NodeId1;
      double f0 = this->GetNode(N0)->Value;
      double f1 = this->GetNode(N1)->Value;
      simplificationValue = (f1 - f0) / (this->MaximumScalarValue - this->MinimumScalarValue);
    }
    else
    {
      simplificationValue = ComputeCustomMetric(simplificationMetric, this->GetArc(A));
    }

    if (simplificationValue >= simplificationThreshold)
      continue;

    vtkReebPath entry =
      this->FindPath(this->ArcLoopTable[n], simplificationThreshold, simplificationMetric);

    // too high for persistence
    if (entry.SimplificationValue >= simplificationThreshold)
      continue;

    // distribute its bucket to the loop and delete the arc
    this->FastArcSimplify(ArcLoopTable[n], entry.ArcNumber, entry.ArcTable);
    delete entry.ArcTable;
    delete entry.NodeTable;

    ++NumSimplified;
    CommitSimplification();
  }

  // check for regular points
  for (int N = 1; N < this->MainNodeTable.Size; N++)
  {
    if (this->GetNode(N)->ArcUpId == -2)
      continue;