Go to the documentation of this file.
52 #ifndef vtkDijkstraImageGeodesicPath_h
53 #define vtkDijkstraImageGeodesicPath_h
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
virtual void BuildAdjacency(vtkDataSet *inData)
virtual int FillInputPortInformation(int port, vtkInformation *info)
virtual double CalculateDynamicEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
vtkImageData * GetInputAsImageData()
#define vtkTypeMacro(thisClass, superclass)
#define vtkSetClampMacro(name, type, min, max)
Dijkstra algorithm to compute the graph geodesic.
static vtkDijkstraImageGeodesicPath * New()
topologically and geometrically regular array of data
a simple class to control print indentation
#define vtkGetMacro(name, type)
void UpdateStaticCosts(vtkImageData *image)
abstract class to specify dataset behavior
void PrintSelf(ostream &os, vtkIndent indent)
virtual double CalculateStaticEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
#define VTKFILTERSMODELING_EXPORT
Dijkstra algorithm to compute the graph geodesic.
general representation of visualization data
void SetInputData(vtkDataObject *)
vtkDijkstraImageGeodesicPath()
~vtkDijkstraImageGeodesicPath()
void SetImageWeight(double)
GLenum GLsizei GLenum GLenum const GLvoid * image
void SetEdgeLengthWeight(double)