41 #ifndef __vtkConstrained2DLayoutStrategy_h
42 #define __vtkConstrained2DLayoutStrategy_h
65 vtkGetMacro(RandomSeed,
int);
75 vtkGetMacro(MaxNumberOfIterations,
int);
84 vtkGetMacro(IterationsPerLayout,
int);
91 vtkSetClampMacro(InitialTemperature,
float, 0.0,
VTK_FLOAT_MAX);
92 vtkGetMacro(InitialTemperature,
float);
101 vtkGetMacro(CoolDownRate,
double);
108 vtkSetMacro(RestDistance,
float);
109 vtkGetMacro(RestDistance,
float);
129 vtkSetStringMacro(InputArrayName);
130 vtkGetStringMacro(InputArrayName);
161 vtkLayoutEdge *EdgeArray;
164 int IterationsPerLayout;
170 char* InputArrayName;
173 void GenerateCircularSplat(
vtkImageData *splat,
int x,
int y);
174 void GenerateGaussianSplat(
vtkImageData *splat,
int x,
int y);
175 void ResolveCoincidentVertices();
dynamic, self-adjusting array of float
abstract superclass for all graph layout strategies
int MaxNumberOfIterations
A splatter optimized for splatting single kernels.
a simple class to control print indentation
topologically and geometrically regular array of data
a simple fast 2D graph layout that looks for a 'constraint' array (vtkDoubleArray). Any entry in the constraint array will indicate the level of impedence a node has to the force calculations during the layout optimization. The array is assumed to be normalized between zero and one, with one being totally constrained, so no force will be applied to the node (i.e. no movement), and zero being full range of movement (no constraints).
virtual int IsLayoutComplete()
#define VTK_LARGE_INTEGER
virtual void Initialize()
void PrintSelf(ostream &os, vtkIndent indent)