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