47 #ifndef __vtkCirclePackLayout_h
48 #define __vtkCirclePackLayout_h
91 vtkIdType FindVertex(
double pnt[2],
double *cinfo=0);
95 void GetBoundingCircle(
vtkIdType id,
double *cinfo);
Superclass for algorithms that produce only Tree as output.
vtkCirclePackLayoutStrategy * LayoutStrategy
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
#define VTKINFOVISLAYOUT_EXPORT
virtual void SetSizeArrayName(const char *name)
void PrintSelf(ostream &os, vtkIndent indent)
#define vtkSetStringMacro(name)
#define vtkTypeMacro(thisClass, superclass)
dynamic, self-adjusting array of double
virtual void SetInputArrayToProcess(int idx, int port, int connection, int fieldAssociation, const char *name)
GLuint const GLchar * name
virtual unsigned long GetMTime()
a simple class to control print indentation
abstract superclass for all circle packing layout strategies.
abstract superclass for arrays of numeric data
#define vtkGetStringMacro(name)
#define vtkGetObjectMacro(name, type)
layout a vtkTree as a circle packing.
static vtkTreeAlgorithm * New()
A rooted tree data structure.