Go to the documentation of this file.
53 #ifndef vtkDijkstraImageGeodesicPath_h
54 #define vtkDijkstraImageGeodesicPath_h
56 #include "vtkFiltersModelingModule.h"
92 vtkGetMacro( ImageWeight,
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.
virtual void BuildAdjacency(vtkDataSet *inData)
virtual int FillInputPortInformation(int port, vtkInformation *info)
Fill the input port information objects for this algorithm.
virtual double CalculateDynamicEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
vtkImageData * GetInputAsImageData()
Dijkstra algorithm to compute the graph geodesic.
static vtkDijkstraImageGeodesicPath * New()
Instantiate the class.
topologically and geometrically regular array of data
a simple class to control print indentation
void UpdateStaticCosts(vtkImageData *image)
abstract class to specify dataset behavior
void PrintSelf(ostream &os, vtkIndent indent)
Methods invoked by print to print information about the object including superclasses.
virtual double CalculateStaticEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
Dijkstra algorithm to compute the graph geodesic.
general representation of visualization data
void SetInputData(vtkDataObject *)
Specify the image object which is used as a cost function.
vtkDijkstraImageGeodesicPath()
~vtkDijkstraImageGeodesicPath()
void SetImageWeight(double)
Image cost weight.
void SetEdgeLengthWeight(double)
Edge length cost weight.