Method RecursivelyProcessTree2D

Filters/Hybrid/vtkAdaptiveDataSetSurfaceFilter.cxx:360–399

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

//------------------------------------------------------------------------------
void vtkAdaptiveDataSetSurfaceFilter::RecursivelyProcessTree2D(
  vtkHyperTreeGridNonOrientedGeometryCursor* cursor, int level)
{
  double originAxis1 = cursor->GetOrigin()[this->Axis1];
  double originAxis2 = cursor->GetOrigin()[this->Axis2];

  std::array<std::array<double, 3>, 4> corners = { { { { originAxis1, originAxis2, 0.0 } },
    { { originAxis1 + cursor->GetSize()[this->Axis1], originAxis2, 0.0 } },
    { { originAxis1, originAxis2 + cursor->GetSize()[this->Axis2], 0.0 } },
    { { originAxis1 + cursor->GetSize()[this->Axis1], originAxis2 + cursor->GetSize()[this->Axis2],
      0.0 } } } };

  // We only process the nodes than are going to be rendered
  if (level < this->MaxLevel &&
    this->IsShapeVisible<4>(corners, level) == ShapeState::OUT_OF_SCREEN)
  {
    return;
  }

  if (cursor->IsLeaf() || level >= this->MaxLevel ||
    (this->FixedLevelMax != -1 && level >= this->FixedLevelMax))
  {
    this->ProcessLeaf2D(cursor);
  }
  else
  {
    // Cursor is not at leaf, recurse to all children
    const int numChildren = cursor->GetNumberOfChildren();
    for (int iChild = 0; iChild < numChildren; ++iChild)
    {
      if (this->CheckAbort())
      {
        break;
      }
      cursor->ToChild(iChild);
      this->RecursivelyProcessTree2D(cursor, level + 1);
      cursor->ToParent();
    }
  }
}

//------------------------------------------------------------------------------
void vtkAdaptiveDataSetSurfaceFilter::ProcessLeaf1D(