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
|
/*
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
#include <tulip/DoubleProperty.h>
#include <tulip/SizeProperty.h>
#include <tulip/StringCollection.h>
#include <tulip/GraphParallelTools.h>
#include "FastOverlapRemoval.h"
#include "generate-constraints.h"
#include "remove_rectangle_overlap.h"
using namespace std;
using namespace tlp;
PLUGIN(FastOverlapRemoval)
static const char *paramHelp[] = {
// overlap removal type
"Overlap removal type.",
// initial layout
"The property used for the input layout of nodes and edges.",
// node size
"The property used for node sizes.",
// Rotation
"The property defining rotation angles of nodes around the z-axis.",
// Iterations
"The algorithm will be applied N times, each time increasing node size to attain original size "
"at the final iteration. This greatly enhances the layout.",
// x border
"The minimal x border value that will separate the graph nodes after application of the "
"algorithm.",
// y border
"The minimal y border value that will separate the graph nodes after application of the "
"algorithm."};
#define OVERLAP_TYPE "X-Y;X;Y"
static const char *overlapRemovalTypeValuesDescription =
"X-Y <i>(Remove overlaps in both X and Y directions)</i><br>"
"X <i>(Remove overlaps only in X direction)</i><br>"
"Y <i>(Remove overlaps only in Y direction)</i>";
FastOverlapRemoval::FastOverlapRemoval(const tlp::PluginContext *context)
: tlp::LayoutAlgorithm(context) {
addInParameter<StringCollection>("overlap removal type", paramHelp[0], OVERLAP_TYPE, true,
overlapRemovalTypeValuesDescription);
addInParameter<LayoutProperty>("initial layout", paramHelp[1], "viewLayout");
addInParameter<SizeProperty>("bounding box", paramHelp[2], "viewSize");
addInParameter<DoubleProperty>("rotation", paramHelp[3], "viewRotation");
addInParameter<int>("number of passes", paramHelp[4], "5");
addInParameter<double>("x border", paramHelp[5], "0.0");
addInParameter<double>("y border", paramHelp[6], "0.0");
}
/**
* The following function transfers the node set into vpsc rectangles
* and runs fast overlap removal. This vpsc code was a port of Dwyer
* used in the InkScape Open Source Software.
*/
bool FastOverlapRemoval::run() {
if (pluginProgress) {
// user cannot interact while computing
pluginProgress->showPreview(false);
pluginProgress->showStops(false);
}
tlp::StringCollection overlap_type(OVERLAP_TYPE);
overlap_type.setCurrent(0);
LayoutProperty *viewLayout = nullptr;
SizeProperty *viewSize = nullptr;
DoubleProperty *viewRot = nullptr;
double xBorder = 0.;
double yBorder = 0.;
int nbPasses = 5;
if (dataSet != nullptr) {
dataSet->get("overlap removal type", overlap_type);
dataSet->get("bounding box", viewSize);
dataSet->get("initial layout", viewLayout);
dataSet->get("rotation", viewRot);
dataSet->get("number of passes", nbPasses);
dataSet->get("x border", xBorder);
dataSet->get("y border", yBorder);
}
if (viewLayout == nullptr)
viewLayout = graph->getProperty<LayoutProperty>("viewLayout");
if (viewSize == nullptr)
viewSize = graph->getProperty<SizeProperty>("viewSize");
if (viewRot == nullptr)
viewRot = graph->getProperty<DoubleProperty>("viewRotation");
// initialize result for edges
result->setAllEdgeValue(viewLayout->getEdgeDefaultValue());
for (auto e : viewLayout->getNonDefaultValuatedEdges())
result->setEdgeValue(e, viewLayout->getEdgeValue(e));
size_t nbNodes = graph->numberOfNodes();
const std::vector<node> &nodes = graph->nodes();
vector<vpsc::Rectangle> nodeRectangles(nbNodes);
for (float passIndex = 1; passIndex <= nbPasses; ++passIndex) {
// initialization
TLP_PARALLEL_MAP_NODES_AND_INDICES(graph, [&](const node &curNode, unsigned int i) {
Size sz = viewSize->getNodeValue(curNode) * passIndex / float(nbPasses);
const Coord &pos = viewLayout->getNodeValue(curNode);
double curRot = viewRot->getNodeValue(curNode);
Size rotSize = Size(sz.getW() * fabs(cos(curRot * M_PI / 180.0)) +
sz.getH() * fabs(sin(curRot * M_PI / 180.0)),
sz.getW() * fabs(sin(curRot * M_PI / 180.0)) +
sz.getH() * fabs(cos(curRot * M_PI / 180.0)),
1.0f);
double maxX = pos.getX() + rotSize.getW() / 2.0;
double maxY = pos.getY() + rotSize.getH() / 2.0;
double minX = pos.getX() - rotSize.getW() / 2.0;
double minY = pos.getY() - rotSize.getH() / 2.0;
nodeRectangles[i] = vpsc::Rectangle(minX, maxX, minY, maxY, xBorder, yBorder);
});
// actually apply fast overlap removal
if (overlap_type.getCurrentString() == "X-Y") {
removeRectangleOverlap(nbNodes, nodeRectangles.data(), xBorder, yBorder);
} else if (overlap_type.getCurrentString() == "X") {
removeRectangleOverlapX(nbNodes, nodeRectangles.data(), xBorder, yBorder);
} else {
removeRectangleOverlapY(nbNodes, nodeRectangles.data(), yBorder);
}
for (unsigned int i = 0; i < nbNodes; ++i) {
Coord newPos(nodeRectangles[i].getCentreX(), nodeRectangles[i].getCentreY(), 0.0);
LayoutAlgorithm::result->setNodeValue(nodes[i], newPos);
}
}
return true;
} // end run
|
