50 #ifndef vtkDijkstraImageGeodesicPath_h 51 #define vtkDijkstraImageGeodesicPath_h 54 #include "vtkFiltersModelingModule.h" 86 void SetImageWeight(
double);
87 vtkGetMacro(ImageWeight,
double);
94 void SetEdgeLengthWeight(
double);
95 vtkGetMacro(EdgeLengthWeight,
double);
102 vtkSetClampMacro(CurvatureWeight,
double, 0.0, 1.0);
103 vtkGetMacro(CurvatureWeight,
double);
void PrintSelf(ostream &os, vtkIndent indent) override
Standard methods for printing and determining type information.
abstract class to specify dataset behavior
virtual void BuildAdjacency(vtkDataSet *inData)
Dijkstra algorithm to compute the graph geodesic.
virtual double CalculateStaticEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
static vtkDijkstraGraphGeodesicPath * New()
Instantiate the class.
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *) override
This is called by the superclass.
a simple class to control print indentation
topologically and geometrically regular array of data
int FillInputPortInformation(int port, vtkInformation *info) override
Fill the input port information objects for this algorithm.
void SetInputData(vtkDataObject *)
Assign a data object as input.
virtual double CalculateDynamicEdgeCost(vtkDataSet *, vtkIdType, vtkIdType)
general representation of visualization data
Dijkstra algorithm to compute the graph geodesic.