Method BuildLocatorInternal

Common/DataModel/vtkKdTree.cxx:772–918

------------------------------------------------------------------------------ Build the kdtree structure based on location of cell centroids.

//------------------------------------------------------------------------------
// Build the kdtree structure based on location of cell centroids.
void vtkKdTree::BuildLocatorInternal()
{
  SCOPETIMER("BuildLocator");

  this->UpdateProgress(0);
  int nCells = 0;
  int i;

  if (this->NewGeometry() == 0)
  {
    return;
  }

  nCells = this->GetNumberOfCells();

  if (nCells == 0)
  {
    vtkErrorMacro(<< "vtkKdTree::BuildLocator - No cells to subdivide");
    return;
  }

  vtkDebugMacro(<< "Creating Kdtree");
  this->InvokeEvent(vtkCommand::StartEvent);

  if ((this->Timing) && (this->TimerLog == nullptr))
  {
    this->TimerLog = vtkTimerLog::New();
  }

  TIMER("Set up to build k-d tree");

  this->FreeSearchStructure();

  // volume bounds - push out a little if flat
  vtkCollectionSimpleIterator cookie;
  this->DataSets->InitTraversal(cookie);
  vtkDataSet* iset = this->DataSets->GetNextDataSet(cookie);
  double volBounds[6];
  iset->GetBounds(volBounds);

  while ((iset = this->DataSets->GetNextDataSet(cookie)))
  {
    double setBounds[6];
    iset->GetBounds(setBounds);
    volBounds[0] = std::min(setBounds[0], volBounds[0]);
    volBounds[2] = std::min(setBounds[2], volBounds[2]);
    volBounds[4] = std::min(setBounds[4], volBounds[4]);
    volBounds[1] = std::max(setBounds[1], volBounds[1]);
    volBounds[3] = std::max(setBounds[3], volBounds[3]);
    volBounds[5] = std::max(setBounds[5], volBounds[5]);
  }

  double diff[3], aLittle = 0.0;
  this->MaxWidth = 0.0;

  for (i = 0; i < 3; i++)
  {
    diff[i] = volBounds[2 * i + 1] - volBounds[2 * i];