Go to the documentation of this file.
33 #ifndef vtkAttributeClustering2DLayoutStrategy_h
34 #define vtkAttributeClustering2DLayoutStrategy_h
36 #include "vtkInfovisLayoutModule.h"
60 void SetVertexAttribute(
const char*);
70 vtkGetMacro(RandomSeed,
int);
82 vtkSetClampMacro(MaxNumberOfIterations,
int, 0,
VTK_INT_MAX);
83 vtkGetMacro(MaxNumberOfIterations,
int);
94 vtkSetClampMacro(IterationsPerLayout,
int, 0,
VTK_INT_MAX);
95 vtkGetMacro(IterationsPerLayout,
int);
105 vtkSetClampMacro(InitialTemperature,
float, 0.0,
VTK_FLOAT_MAX);
106 vtkGetMacro(InitialTemperature,
float);
119 vtkGetMacro(CoolDownRate,
double);
128 vtkGetMacro(RestDistance,
float);
170 int IterationsPerLayout;
175 float CuttingThreshold;
176 char* VertexAttribute;
179 void GenerateCircularSplat(
vtkImageData *splat,
int x,
int y);
180 void GenerateGaussianSplat(
vtkImageData *splat,
int x,
int y);
181 void ResolveCoincidentVertices();
184 Internals* Implementation;
int MaxNumberOfIterations
dynamic, self-adjusting array of float
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
abstract superclass for all graph layout strategies
virtual void Layout()=0
This is the layout method where the graph that was set in SetGraph() is laid out.
a simple fast 2D graph layout
topologically and geometrically regular array of data
a simple class to control print indentation
dynamic, self-adjusting array of int
virtual void Initialize()
This method allows the layout strategy to do initialization of data structures or whatever else it mi...
A splatter optimized for splatting single kernels.
void PrintSelf(ostream &os, vtkIndent indent)
Methods invoked by print to print information about the object including superclasses.
vtkGetStringMacro(ExtensionsString)
Returns a string listing all available extensions.
vtkSetMacro(IgnoreDriverBugs, bool)
Updates the extensions string.
virtual int IsLayoutComplete()
I'm an iterative layout so this method lets the caller know if I'm done laying out the graph.