converts a tree to a polygonal data representing a tree map More...

#include <vtkTreeMapToPolyData.h>

Inheritance diagram for vtkTreeMapToPolyData:

Collaboration diagram for vtkTreeMapToPolyData:

Public Types
typedef vtkPolyDataAlgorithm	Superclass
Public Member Functions
virtual int	IsA (const char *type)
vtkTreeMapToPolyData *	NewInstance () const
void	PrintSelf (ostream &os, vtkIndent indent)
int	FillInputPortInformation (int port, vtkInformation *info)

virtual void	SetRectanglesArrayName (const char *name)

virtual void	SetLevelArrayName (const char *name)

virtual double	GetLevelDeltaZ ()
virtual void	SetLevelDeltaZ (double)

virtual bool	GetAddNormals ()
virtual void	SetAddNormals (bool)
Static Public Member Functions
static vtkTreeMapToPolyData *	New ()
static int	IsTypeOf (const char *type)
static vtkTreeMapToPolyData *	SafeDownCast (vtkObjectBase *o)
Protected Member Functions
virtual vtkObjectBase *	NewInstanceInternal () const
	vtkTreeMapToPolyData ()
	~vtkTreeMapToPolyData ()
int	RequestData (vtkInformation , vtkInformationVector , vtkInformationVector )
Protected Attributes
double	LevelDeltaZ
bool	AddNormals

Detailed Description

converts a tree to a polygonal data representing a tree map

This algorithm requires that the vtkTreeMapLayout filter has already applied to the data in order to create the quadruple array (min x, max x, min y, max y) of bounds for each vertex of the tree.

Tests:: vtkTreeMapToPolyData (Tests)

Definition at line 38 of file vtkTreeMapToPolyData.h.

Member Typedef Documentation

typedef vtkPolyDataAlgorithm vtkTreeMapToPolyData::Superclass

Reimplemented from vtkPolyDataAlgorithm.

Definition at line 42 of file vtkTreeMapToPolyData.h.

Constructor & Destructor Documentation

vtkTreeMapToPolyData::vtkTreeMapToPolyData ( ) [protected]

vtkTreeMapToPolyData::~vtkTreeMapToPolyData ( ) [protected]

Member Function Documentation

static vtkTreeMapToPolyData* vtkTreeMapToPolyData::New ( ) [static]

Create an object with Debug turned off, modified time initialized to zero, and reference counting on.

Reimplemented from vtkPolyDataAlgorithm.

static int vtkTreeMapToPolyData::IsTypeOf ( const char * name ) [static]

Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkPolyDataAlgorithm.

virtual int vtkTreeMapToPolyData::IsA ( const char * name ) [virtual]

Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkPolyDataAlgorithm.

static vtkTreeMapToPolyData* vtkTreeMapToPolyData::SafeDownCast ( vtkObjectBase * o ) [static]

Reimplemented from vtkPolyDataAlgorithm.

virtual vtkObjectBase* vtkTreeMapToPolyData::NewInstanceInternal ( ) const [protected, virtual]

Reimplemented from vtkPolyDataAlgorithm.

vtkTreeMapToPolyData* vtkTreeMapToPolyData::NewInstance ( ) const

Reimplemented from vtkPolyDataAlgorithm.

void vtkTreeMapToPolyData::PrintSelf	(	ostream &	os,
		vtkIndent	indent
	)		`[virtual]`

Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes.

Reimplemented from vtkPolyDataAlgorithm.

virtual void vtkTreeMapToPolyData::SetRectanglesArrayName ( const char * name ) [inline, virtual]

The field containing quadruples of the form (min x, max x, min y, max y) representing the bounds of the rectangles for each vertex. This array may be added to the tree using vtkTreeMapLayout.

Definition at line 49 of file vtkTreeMapToPolyData.h.

virtual void vtkTreeMapToPolyData::SetLevelArrayName ( const char * name ) [inline, virtual]

The field containing the level of each tree node. This can be added using vtkTreeLevelsFilter before this filter. If this is not present, the filter simply calls tree->GetLevel(v) for each vertex, which will produce the same result, but may not be as efficient.

Definition at line 58 of file vtkTreeMapToPolyData.h.

virtual double vtkTreeMapToPolyData::GetLevelDeltaZ ( ) [virtual]

The spacing along the z-axis between tree map levels.

virtual void vtkTreeMapToPolyData::SetLevelDeltaZ ( double ) [virtual]

The spacing along the z-axis between tree map levels.

virtual bool vtkTreeMapToPolyData::GetAddNormals ( ) [virtual]

The spacing along the z-axis between tree map levels.

virtual void vtkTreeMapToPolyData::SetAddNormals ( bool ) [virtual]

The spacing along the z-axis between tree map levels.

int vtkTreeMapToPolyData::FillInputPortInformation	(	int	port,
		vtkInformation *	info
	)		`[virtual]`

Fill the input port information objects for this algorithm. This is invoked by the first call to GetInputPortInformation for each port so subclasses can specify what they can handle.

Reimplemented from vtkPolyDataAlgorithm.

int vtkTreeMapToPolyData::RequestData	(	vtkInformation *	request,
		vtkInformationVector **	inputVector,
		vtkInformationVector *	outputVector
	)		`[protected, virtual]`