Method SplitExtent

Common/ExecutionModel/vtkExtentSplitter.cxx:334–426

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

//------------------------------------------------------------------------------
void vtkExtentSplitter::SplitExtent(int* extent, int* subextent)
{
  // Subtract the volume described by subextent from that described by
  // extent.  Split the remaining region into rectangular solids and
  // queue them as additional extents.  We may assume that subextent
  // is completely contained by extent.
  vtkExtentSplitterExtent e;

  // In PointMode, there are no cell data, so we can skip over cells.
  int pointMode = this->PointMode ? 1 : 0;

  // Split with xy-planes.
  if (extent[4] < subextent[4])
  {
    e.extent[0] = extent[0];
    e.extent[1] = extent[1];
    e.extent[2] = extent[2];
    e.extent[3] = extent[3];
    e.extent[4] = extent[4];
    e.extent[5] = subextent[4] - pointMode;
    this->Internal->Queue.push(e);

    extent[4] = subextent[4];
  }
  if (extent[5] > subextent[5])
  {
    e.extent[0] = extent[0];
    e.extent[1] = extent[1];
    e.extent[2] = extent[2];
    e.extent[3] = extent[3];
    e.extent[4] = subextent[5] + pointMode;
    e.extent[5] = extent[5];
    this->Internal->Queue.push(e);

    extent[5] = subextent[5];
  }

  // Split with xz-planes.
  if (extent[2] < subextent[2])
  {
    e.extent[0] = extent[0];
    e.extent[1] = extent[1];
    e.extent[2] = extent[2];
    e.extent[3] = subextent[2] - pointMode;
    e.extent[4] = extent[4];
    e.extent[5] = extent[5];
    this->Internal->Queue.push(e);

    extent[2] = subextent[2];
  }
  if (extent[3] > subextent[3])
  {
    e.extent[0] = extent[0];
    e.extent[1] = extent[1];
    e.extent[2] = subextent[3] + pointMode;
    e.extent[3] = extent[3];
    e.extent[4] = extent[4];
    e.extent[5] = extent[5];