20 #ifndef vtkClustering2DLayoutStrategy_h
21 #define vtkClustering2DLayoutStrategy_h
24 #include "vtkInfovisLayoutModule.h"
28 VTK_ABI_NAMESPACE_BEGIN
49 vtkGetMacro(RandomSeed,
int);
62 vtkGetMacro(MaxNumberOfIterations,
int);
74 vtkGetMacro(IterationsPerLayout,
int);
85 vtkGetMacro(InitialTemperature,
float);
98 vtkGetMacro(CoolDownRate,
double);
106 vtkSetMacro(RestDistance,
float);
107 vtkGetMacro(RestDistance,
float);
142 struct vtkLayoutEdge_t
151 using vtkLayoutEdge =
struct vtkLayoutEdge_t;
160 vtkLayoutEdge* EdgeArray;
163 int IterationsPerLayout;
168 float CuttingThreshold;
171 void GenerateCircularSplat(
vtkImageData* splat,
int x,
int y);
172 void GenerateGaussianSplat(
vtkImageData* splat,
int x,
int y);
173 void ResolveCoincidentVertices();
179 VTK_ABI_NAMESPACE_END
a simple fast 2D graph layout
int MaxNumberOfIterations
vtkClustering2DLayoutStrategy()
~vtkClustering2DLayoutStrategy() override
void Initialize() override
This strategy sets up some data structures for faster processing of each Layout() call.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
void Layout() override
This is the layout method where the graph that was set in SetGraph() is laid out.
static vtkClustering2DLayoutStrategy * New()
int IsLayoutComplete() override
I'm an iterative layout so this method lets the caller know if I'm done laying out the graph.
A splatter optimized for splatting single kernels.
dynamic, self-adjusting array of float
abstract superclass for all graph layout strategies
topologically and geometrically regular array of data
a simple class to control print indentation
dynamic, self-adjusting array of int