1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkCirclePackLayout.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
// .NAME vtkCirclePackLayout - layout a vtkTree as a circle packing.
//
// .SECTION Description
// vtkCirclePackLayout assigns circle shaped regions to each vertex
// in the tree, creating a circle packing layout. The data is added
// as a data array with three components per tuple representing the
// center and radius of the circle using the format (Xcenter, Ycenter, Radius).
//
// This algorithm relies on a helper class to perform the actual layout.
// This helper class is a subclass of vtkCirclePackLayoutStrategy.
//
// An array by default called "size" can be attached to the input tree
// that specifies the size of each leaf node in the tree. The filter will
// calculate the sizes of all interior nodes in the tree based on the sum
// of the leaf node sizes. If no "size" array is given in the input vtkTree,
// a size of 1 is used for all leaf nodes to find the size of the interior nodes.
//
// .SECTION Thanks
// Thanks to Thomas Otahal from Sandia National Laboratories
// for help developing this class.
//
#ifndef vtkCirclePackLayout_h
#define vtkCirclePackLayout_h
#include "vtkInfovisLayoutModule.h" // For export macro
#include "vtkTreeAlgorithm.h"
class vtkCirclePackLayoutStrategy;
class vtkDoubleArray;
class vtkDataArray;
class vtkTree;
class VTKINFOVISLAYOUT_EXPORT vtkCirclePackLayout : public vtkTreeAlgorithm
{
public:
static vtkCirclePackLayout *New();
vtkTypeMacro(vtkCirclePackLayout,vtkTreeAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// The field name to use for storing the circles for each vertex.
// The rectangles are stored in a triple float array
// (Xcenter, Ycenter, Radius).
// Default name is "circles"
vtkGetStringMacro(CirclesFieldName);
vtkSetStringMacro(CirclesFieldName);
// Description:
// The array to use for the size of each vertex.
// Default name is "size".
virtual void SetSizeArrayName(const char* name)
{ this->SetInputArrayToProcess(0, 0, 0, vtkDataObject::FIELD_ASSOCIATION_VERTICES, name); }
// Description:
// The strategy to use when laying out the tree map.
vtkGetObjectMacro(LayoutStrategy, vtkCirclePackLayoutStrategy);
void SetLayoutStrategy(vtkCirclePackLayoutStrategy * strategy);
// Description:
// Returns the vertex id that contains pnt (or -1 if no one contains it)
// pnt[0] is x, and pnt[1] is y.
// If cinfo[3] is provided, then (Xcenter, Ycenter, Radius) of the circle
// containing pnt[2] will be returned.
vtkIdType FindVertex(double pnt[2], double *cinfo=0);
// Description:
// Return the Xcenter, Ycenter, and Radius of the
// vertex's bounding circle
void GetBoundingCircle(vtkIdType id, double *cinfo);
// Description:
// Get the modification time of the layout algorithm.
virtual unsigned long GetMTime();
protected:
vtkCirclePackLayout();
~vtkCirclePackLayout();
char * CirclesFieldName;
vtkCirclePackLayoutStrategy* LayoutStrategy;
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *);
private:
vtkCirclePackLayout(const vtkCirclePackLayout&); // Not implemented.
void operator=(const vtkCirclePackLayout&); // Not implemented.
void prepareSizeArray(vtkDoubleArray* mySizeArray,
vtkTree* tree);
};
#endif
|
