Method BuildTree

Common/DataModel/vtkBSPCuts.cxx:316–378

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

}
//------------------------------------------------------------------------------
void vtkBSPCuts::BuildTree(vtkKdNode* kd, int idx)
{
  int dim = this->Dim[idx];

  if (this->Npoints)
  {
    kd->SetNumberOfPoints(this->Npoints[idx]);
  }

  if (this->Lower[idx] > 0)
  {
    vtkKdNode* left = vtkKdNode::New();
    vtkKdNode* right = vtkKdNode::New();

    kd->SetDim(dim);

    double b2[6];
    double db2[6];

    kd->GetBounds(b2);
    kd->GetDataBounds(db2);

    b2[dim * 2 + 1] = this->Coord[idx]; // new upper bound for lower half

    if (this->LowerDataCoord)
    {
      db2[dim * 2 + 1] = this->LowerDataCoord[idx];
    }
    else
    {
      db2[dim * 2 + 1] = this->Coord[idx];
    }

    left->SetBounds(b2[0], b2[1], b2[2], b2[3], b2[4], b2[5]);
    left->SetDataBounds(db2[0], db2[1], db2[2], db2[3], db2[4], db2[5]);

    kd->GetBounds(b2);
    kd->GetDataBounds(db2);

    b2[dim * 2] = this->Coord[idx]; // new lower bound for upper half

    if (this->UpperDataCoord)
    {
      db2[dim * 2] = this->UpperDataCoord[idx];
    }
    else
    {
      db2[dim * 2] = this->Coord[idx];
    }

    right->SetBounds(b2[0], b2[1], b2[2], b2[3], b2[4], b2[5]);
    right->SetDataBounds(db2[0], db2[1], db2[2], db2[3], db2[4], db2[5]);

    kd->AddChildNodes(left, right);

    this->BuildTree(left, this->Lower[idx]);
    this->BuildTree(right, this->Upper[idx]);
  }