Method GetDistance2ToBoundaryPrivate

Common/DataModel/vtkKdNode.cxx:266–530

}

double vtkKdNode::GetDistance2ToBoundaryPrivate(double x, double y, double z, // from this point
  double* p,             // set to point on boundary that is closest
  int innerBoundaryOnly, // ignore boundaries on "outside"
  int useDataBounds = 0) // use bounds of data within region instead
{
  double minDistance, dist;
  double edgePt[3];
  double cornerPt[3];
  double pt3[3];

  double *min, *max;

  if (useDataBounds)
  {
    min = this->MinVal;
    max = this->MaxVal; // data inside region
  }
  else
  {
    min = this->Min;
    max = this->Max; // region itself
  }

  double* outerBoundaryMin = nullptr;
  double* outerBoundaryMax = nullptr;

  if (innerBoundaryOnly)
  {
    // We want the distance to the nearest inner boundary, because we are only
    // interested in boundaries such that there may be points on the other
    // side.  This option only makes sense when the point supplied is
    // inside this node (region).

    vtkKdNode* top = this;
    vtkKdNode* up = this->Up;

    while (up)
    {
      top = up;
      up = up->Up;
    }

    outerBoundaryMin = (useDataBounds ? top->MinVal : top->Min);
    outerBoundaryMax = (useDataBounds ? top->MaxVal : top->Max);
  }

  double xmax = max[0];
  double ymax = max[1];
  double zmax = max[2];
  double xmin = min[0];
  double ymin = min[1];
  double zmin = min[2];

  int xless = (x < xmin);
  int xmore = (x > xmax);
  int yless = (y < ymin);
  int ymore = (y > ymax);
  int zless = (z < zmin);