Method CalculateDynamicEdgeCost

Filters/Modeling/vtkDijkstraImageGeodesicPath.cxx:185–217

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

//------------------------------------------------------------------------------
double vtkDijkstraImageGeodesicPath::CalculateDynamicEdgeCost(
  vtkDataSet* inData, vtkIdType u, vtkIdType v)
{
  double cost = 0.0;

  if (this->CurvatureWeight != 0.0)
  {
    int t = this->Internals->Predecessors[u];
    if (t != -1)
    {
      vtkImageData* image = vtkImageData::SafeDownCast(inData);

      double p0[3];
      image->GetPoint(t, p0);
      double p1[3];
      image->GetPoint(u, p1);
      double p2[3];
      image->GetPoint(v, p2);

      double p10[3] = { p1[0] - p0[0], p1[1] - p0[1], p1[2] - p0[2] };
      double p21[3] = { p2[0] - p1[0], p2[1] - p1[1], p2[2] - p1[2] };

      vtkMath::Normalize(p10);
      vtkMath::Normalize(p21);

      // the range of dot product of two unit vectors is [-1, 1] so normalize
      // the maximum curvature from 2 to 1
      cost = this->CurvatureWeight * (0.5 * fabs(vtkMath::Dot(p10, p21) - 1.0));
    }
  }

  return cost;
}

//------------------------------------------------------------------------------
// This is probably a horribly inefficient way to do it.