|
virtual int | IsA (const char *type) |
|
vtkSquarifyLayoutStrategy * | NewInstance () const |
|
void | PrintSelf (ostream &os, vtkIndent indent) |
|
|
void | Layout (vtkTree *inputTree, vtkDataArray *coordsArray, vtkDataArray *sizeArray) |
|
vtkTreeMapLayoutStrategy * | NewInstance () const |
|
void | PrintSelf (ostream &os, vtkIndent indent) |
|
virtual vtkIdType | FindVertex (vtkTree *tree, vtkDataArray *areaArray, float pnt[2]) |
|
vtkAreaLayoutStrategy * | NewInstance () const |
|
void | PrintSelf (ostream &os, vtkIndent indent) |
|
virtual void | LayoutEdgePoints (vtkTree *inputTree, vtkDataArray *areaArray, vtkDataArray *sizeArray, vtkTree *edgeLayoutTree) |
|
virtual void | SetShrinkPercentage (double) |
|
virtual double | GetShrinkPercentage () |
|
uses the squarify tree map layout algorithm
vtkSquarifyLayoutStrategy partitions the space for child vertices into regions that use all available space and are as close to squares as possible. The algorithm also takes into account the relative vertex size.
- Thanks:
- The squarified tree map algorithm comes from: Bruls, D.M., C. Huizing, J.J. van Wijk. Squarified Treemaps. In: W. de Leeuw, R. van Liere (eds.), Data Visualization 2000, Proceedings of the joint Eurographics and IEEE TCVG Symposium on Visualization, 2000, Springer, Vienna, p. 33-42.
- Tests:
- vtkSquarifyLayoutStrategy (Tests)
Definition at line 47 of file vtkSquarifyLayoutStrategy.h.