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
|
/**
* \brief remove overlaps between a set of rectangles.
*
* Authors:
* Tim Dwyer <tgdwyer@gmail.com>
*
* Copyright (C) 2005 Authors
*
* Released under GNU LGPL. Read the file 'COPYING' for more information.
*/
#include <iostream>
#include <cassert>
#include <vector>
#include <tulip/tulipconf.h>
#include <tulip/ParallelTools.h>
#include "generate-constraints.h"
#include "solve_VPSC.h"
#include "variable.h"
#include "constraint.h"
#ifdef RECTANGLE_OVERLAP_LOGGING
#include <fstream>
#include "blocks.h"
using std::endl;
using std::ios;
using std::ofstream;
#endif
#define EXTRA_GAP 0.0001
using namespace vpsc;
using namespace tlp;
/**
* Takes an array of n rectangles and moves them as little as possible
* such that rectangles are separated by at least xBorder horizontally
* and yBorder vertically
*
* Works in three passes:
* 1) removes some overlap horizontally
* 2) removes remaining overlap vertically
* 3) a last horizontal pass removes all overlap starting from original
* x-positions - this corrects the case where rectangles were moved
* too much in the first pass.
*/
void removeRectangleOverlap(unsigned n, Rectangle rs[], double &xBorder, double &yBorder) {
try {
// The extra gap avoids numerical imprecision problems
xBorder += EXTRA_GAP;
yBorder += EXTRA_GAP;
std::vector<Variable> vs(n);
Constraint **cs;
double *oldX = new double[n];
unsigned m = ConstraintsGenerator(n).generateXConstraints(rs, vs.data(), cs, true);
TLP_PARALLEL_MAP_INDICES(n, [&](unsigned int i) { oldX[i] = vs[i].desiredPosition; });
Solver vpsc_x(n, vs.data(), m, cs);
#ifdef RECTANGLE_OVERLAP_LOGGING
ofstream f(LOGFILE, ios::app);
f << "Calling VPSC: Horizontal pass 1" << endl;
f.close();
#endif
vpsc_x.solve();
TLP_PARALLEL_MAP_INDICES(n, [&](unsigned int i) { rs[i].moveCentreX(vs[i].position()); });
for (unsigned i = 0; i < m; ++i) {
delete cs[i];
}
delete[] cs;
// Removing the extra gap here ensures things that were moved to be adjacent to
// one another above are not considered overlapping
xBorder -= EXTRA_GAP;
m = ConstraintsGenerator(n).generateYConstraints(rs, vs.data(), cs);
Solver vpsc_y(n, vs.data(), m, cs);
#ifdef RECTANGLE_OVERLAP_LOGGING
f.open(LOGFILE, ios::app);
f << "Calling VPSC: Vertical pass" << endl;
f.close();
#endif
vpsc_y.solve();
TLP_PARALLEL_MAP_INDICES(n, [&](unsigned int i) {
rs[i].moveCentreY(vs[i].position());
rs[i].moveCentreX(oldX[i]);
});
delete[] oldX;
for (unsigned i = 0; i < m; ++i) {
delete cs[i];
}
delete[] cs;
yBorder -= EXTRA_GAP;
m = ConstraintsGenerator(n).generateXConstraints(rs, vs.data(), cs, false);
Solver vpsc_x2(n, vs.data(), m, cs);
#ifdef RECTANGLE_OVERLAP_LOGGING
f.open(LOGFILE, ios::app);
f << "Calling VPSC: Horizontal pass 2" << endl;
f.close();
#endif
vpsc_x2.solve();
for (unsigned i = 0; i < m; ++i) {
delete cs[i];
}
delete[] cs;
TLP_PARALLEL_MAP_INDICES(n, [&](unsigned int i) { rs[i].moveCentreX(vs[i].position()); });
} catch (char const *str) {
std::cerr << str << std::endl;
for (unsigned i = 0; i < n; i++) {
std::cerr << rs[i] << std::endl;
}
}
}
void removeRectangleOverlapX(unsigned n, Rectangle rs[], double &xBorder, double &yBorder) {
try {
// The extra gap avoids numerical imprecision problems
yBorder = (xBorder += EXTRA_GAP);
std::vector<Variable> vs(n);
Constraint **cs;
unsigned m = ConstraintsGenerator(n).generateXConstraints(rs, vs.data(), cs, false);
Solver vpsc_x(n, vs.data(), m, cs);
#ifdef RECTANGLE_OVERLAP_LOGGING
ofstream f(LOGFILE, ios::app);
f << "Calling VPSC: Horizontal pass 1" << endl;
f.close();
#endif
vpsc_x.solve();
TLP_PARALLEL_MAP_INDICES(n, [&](unsigned int i) { rs[i].moveCentreX(vs[i].position()); });
for (unsigned i = 0; i < m; ++i) {
delete cs[i];
}
delete[] cs;
} catch (char const *str) {
std::cerr << str << std::endl;
for (unsigned i = 0; i < n; i++) {
std::cerr << rs[i] << std::endl;
}
}
}
void removeRectangleOverlapY(unsigned n, Rectangle rs[], double &yBorder) {
try {
// The extra gap avoids numerical imprecision problems
yBorder += EXTRA_GAP;
std::vector<Variable> vs(n);
Constraint **cs;
unsigned int m = ConstraintsGenerator(n).generateYConstraints(rs, vs.data(), cs);
Solver vpsc_y(n, vs.data(), m, cs);
#ifdef RECTANGLE_OVERLAP_LOGGING
f.open(LOGFILE, ios::app);
f << "Calling VPSC: Vertical pass" << endl;
f.close();
#endif
vpsc_y.solve();
TLP_PARALLEL_MAP_INDICES(n, [&](unsigned int i) { rs[i].moveCentreY(vs[i].position()); });
for (unsigned i = 0; i < m; ++i) {
delete cs[i];
}
delete[] cs;
} catch (char const *str) {
std::cerr << str << std::endl;
for (unsigned i = 0; i < n; i++) {
std::cerr << rs[i] << std::endl;
}
}
}
|
