Method CanCullBin

Common/DataModel/vtkStaticPointLocator.cxx:805–847

Return true if the bin can be culled: if the bin specified by (i,j,k) is completely outside of the shell request; and completely outside any of the optional sphere petals, then the bin can be eliminated from further processing. Otherwise, false is returned.

  // outside any of the optional sphere petals, then the bin can be
  // eliminated from further processing. Otherwise, false is returned.
  bool CanCullBin(bool gathering, double minR2, double maxR2, int i, int j, int k, int level)
  {
    // Bin culling is generally not worth it for smaller levels.
    if (level < this->LEVEL_QUERY_THRESHOLD || gathering)
    {
      return false;
    }

    // Obtain the bucket bounding box
    double min[3], max[3];
    this->Bins->GetBucketBounds(i, j, k, min, max);

    // Cull the bin if fully outside the (minR2,maxR2] footprint.
    // Greater than the shell request outer radius, and maxR2 determined.
    if (!vtkBoundingBox::IntersectsSphere(min, max, this->X, maxR2))
    {
      return true;
    }

    // Strictly less than the shell request inner radius, minR2 is always known.
    if (vtkBoundingBox::InsideSphere(min, max, this->X, minR2))
    {
      return true;
    }

    // At this point, the bin overlaps the shell request. Cull the bin if not
    // in any of the provided Voronoi hull spheres (petals).
    if (this->NumSpheres > 0)
    {
      const double* sphere = this->Spheres;
      for (int sNum = 0; sNum < this->NumSpheres; ++sNum, sphere += 4)
      {
        if (vtkBoundingBox::IntersectsSphere(min, max, sphere, sphere[3]))
        {
          return false;
        }
      }
      return true; // not in any Voronoi flower petal
    }

    // The bin cannot be culled.
    return false;
  }

  // Gather nearby points in the bin binIdx. Initially, we gather N points
  // in order to define the sphere S with center x and radius**2 maxR2.