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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkTreeOrbitLayoutStrategy.cxx
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 (c) Sandia Corporation
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
#include "vtkTreeOrbitLayoutStrategy.h"
#include "vtkAbstractArray.h"
#include "vtkAdjacentVertexIterator.h"
#ifdef VTK_USE_BOOST
#include "vtkBoostBreadthFirstSearchTree.h"
#endif
#include "vtkDataArray.h"
#include "vtkIdTypeArray.h"
#include "vtkIntArray.h"
#include "vtkMath.h"
#include "vtkObjectFactory.h"
#include "vtkPointData.h"
#include "vtkPoints.h"
#include "vtkSmartPointer.h"
#include "vtkTree.h"
#include "vtkTreeDFSIterator.h"
vtkStandardNewMacro(vtkTreeOrbitLayoutStrategy);
vtkTreeOrbitLayoutStrategy::vtkTreeOrbitLayoutStrategy()
{
this->LogSpacingValue = 1.0;
this->LeafSpacing = 1.0;
this->ChildRadiusFactor = .5;
}
vtkTreeOrbitLayoutStrategy::~vtkTreeOrbitLayoutStrategy()
{
}
// Helper method for recursively orbiting children
// around their parents
void vtkTreeOrbitLayoutStrategy::OrbitChildren(vtkTree *t,
vtkPoints *p, vtkIdType parent, double radius)
{
// Get the current position of the parent
double pt[3];
double xCenter,yCenter;
p->GetPoint(parent, pt);
xCenter = pt[0];
yCenter = pt[1];
// Check for leaf_count array
vtkIntArray* leaf_count = vtkIntArray::SafeDownCast(
t->GetVertexData()->GetArray("leaf_count"));
if (!leaf_count)
{
vtkErrorMacro("vtkTreeOrbitLayoutStrategy has to have a leaf_count array");
exit(1);
}
// Get the total number of children for this node
double totalChildren = leaf_count->GetValue(parent);
vtkIdType immediateChildren = t->GetNumberOfChildren(parent);
// Now simply orbit the children around the
// parent's centerpoint
double currentAngle = 0;
for (vtkIdType i=0; i < immediateChildren; ++i)
{
vtkIdType childID = t->GetChild(parent, i);
vtkIdType subChildren = leaf_count->GetValue(childID);
// What angle do I get? If I have a lot of sub children
// then I should get a greater angle 'pizza slice'
double myAngle = subChildren/totalChildren;
// So I want to be in the middle of my pizza slice
double angle = currentAngle + myAngle/2.0;
// Compute coords
double x = cos(2.0*vtkMath::Pi()*angle);
double y = sin(2.0*vtkMath::Pi()*angle);
// Am I a leaf
double radiusFactor;
if (subChildren == 1)
radiusFactor = .1;
else
radiusFactor = log(static_cast<double>(immediateChildren)) / log(totalChildren);
double xOrbit = x * radius * radiusFactor + xCenter;
double yOrbit = y * radius * radiusFactor + yCenter;
p->SetPoint(childID, xOrbit, yOrbit, 0);
// Compute child radius
double childRadius = radius*tan(myAngle)*2.0 * this->ChildRadiusFactor;
// Now recurse with a reduced radius
this->OrbitChildren(t,p,childID,childRadius);
// Accumulate angle
currentAngle += myAngle;
}
}
// Tree layout method
void vtkTreeOrbitLayoutStrategy::Layout()
{
vtkTree* tree = vtkTree::SafeDownCast(this->Graph);
if (tree == NULL)
{
#ifdef VTK_USE_BOOST
// Use the BFS search tree to perform the layout
vtkBoostBreadthFirstSearchTree* bfs = vtkBoostBreadthFirstSearchTree::New();
bfs->CreateGraphVertexIdArrayOn();
bfs->SetInputData(this->Graph);
bfs->Update();
tree = vtkTree::New();
tree->ShallowCopy(bfs->GetOutput());
bfs->Delete();
#else
vtkErrorMacro("Layout only works on vtkTree unless VTK_USE_BOOST is on.");
#endif
}
if (tree->GetNumberOfVertices() == 0)
{
vtkErrorMacro("Tree Input has 0 vertices - Punting...");
return;
}
// Create a new point set
vtkIdType numVertices = tree->GetNumberOfVertices();
vtkPoints *newPoints = vtkPoints::New();
newPoints->SetNumberOfPoints(numVertices);
// Setting the root to position 0,0 but this could
// be whatever you want and should be controllable
// through ivars in the future
vtkIdType currentRoot = tree->GetRoot();
newPoints->SetPoint(currentRoot, 0, 0, 0);
// Now traverse the tree and have all children
// orbit their parents recursively
this->OrbitChildren(tree, newPoints, currentRoot, 1);
// Copy coordinates back into the original graph
if (vtkTree::SafeDownCast(this->Graph))
{
this->Graph->SetPoints(newPoints);
}
#ifdef VTK_USE_BOOST
else
{
// Reorder the points based on the mapping back to graph vertex ids
vtkPoints* reordered = vtkPoints::New();
reordered->SetNumberOfPoints(newPoints->GetNumberOfPoints());
for (vtkIdType i = 0; i < reordered->GetNumberOfPoints(); i++)
{
reordered->SetPoint(i, 0, 0, 0);
}
vtkIdTypeArray* graphVertexIdArr = vtkIdTypeArray::SafeDownCast(
tree->GetVertexData()->GetAbstractArray("GraphVertexId"));
for (vtkIdType i = 0; i < graphVertexIdArr->GetNumberOfTuples(); i++)
{
reordered->SetPoint(graphVertexIdArr->GetValue(i), newPoints->GetPoint(i));
}
this->Graph->SetPoints(reordered);
tree->Delete();
reordered->Delete();
}
#endif
// Clean up.
newPoints->Delete();
}
void vtkTreeOrbitLayoutStrategy::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
os << indent << "LogSpacingValue: " << this->LogSpacingValue << endl;
os << indent << "LeafSpacing: " << this->LeafSpacing << endl;
os << indent << "ChildRadiusFactor: " << this->ChildRadiusFactor << endl;
}
|
