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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
|
#include <math.h>
#include "linespace.hh"
#include "debug.hh"
#include "qlp.hh"
#include "unionfind.hh"
const Real COLFUDGE=1e-3;
//#define COLFUDGE 1e-3
bool
Spacing_problem::contains(const PCol *w)
{
for (int i=0; i< cols.sz(); i++)
if (cols[i].col == w)
return true;
return false;
}
int
Spacing_problem::col_id(const PCol *w)const
{
for (int i=0; i< cols.sz(); i++)
if (cols[i].col == w)
return i;
assert(false);
}
void
Spacing_problem::OK() const
{
#ifndef NDEBUG
Union_find connected(cols.sz());
for (int i=0; i < ideals.sz(); i++) {
assert(ideals[i]->hooke > 0);
int l = col_id(ideals[i]->left);
int r = col_id(ideals[i]->right);
connected.connect(l,r);
}
for (int i = 0; i < cols.sz(); i++) {
assert( connected.equiv(0,i));
}
#endif
}
bool
Spacing_problem::check_constraints(Vector v) const
{
int dim=v.dim();
// mtor << "checking solution " << v << '\n';
for (int i=0; i < dim; i++) {
if (cols[i].fixed&& ABS(cols[i].fixpos - v(i)) > COLFUDGE) {
return false;
}
if (!i)
continue;
Real mindist=cols[i-1].minright()
+cols[i].minleft();
// ugh... compares
Real dif =v(i) - v(i-1)- mindist;
bool b = (dif > - COLFUDGE);
#if 1
if (!b)
return false;
#else
mtor << "dif= "<<dif<<" fudge= " << COLFUDGE<< " dif >fudge= "<<
b << "\n";
/* fucks up for unknown reasons */
if (dif < -COLFUDGE)
return false;
#endif
}
return true;
}
bool
Spacing_problem::check_feasible() const
{
Vector sol(try_initial_solution());
return check_constraints(sol);
}
// generate a solution which obeys the min distances and fixed positions
Vector
Spacing_problem::try_initial_solution() const
{
int dim=cols.sz();
Vector initsol(dim);
for (int i=0; i < dim; i++) {
if (cols[i].fixed) {
initsol(i)=cols[i].fixpos;
} else {
Real mindist=cols[i-1].minright()
+cols[i].minleft();
assert(mindist >= 0.0);
initsol(i)=initsol(i-1)+mindist;
//nog niet
//if (i>0)
// assert(initsol(i) > initsol(i-1));
}
}
return initsol;
}
Vector
Spacing_problem::find_initial_solution() const
{
Vector v(try_initial_solution());
assert(check_constraints(v));
return v;
}
// generate the matrices
void
Spacing_problem::make_matrices(Matrix &quad, Vector &lin, Real &c) const
{
quad.fill(0);
lin.fill(0);
for (int j=0; j < ideals.sz(); j++){
Idealspacing const*i=ideals[j];
int l = col_id(i->left);
int r = col_id(i->right);
quad(r,r) += i->hooke;
quad(r,l) -= i->hooke;
quad(l,r) -= i->hooke;
quad(l,l) += i->hooke;
lin(r) -= i->space*i->hooke;
lin(l) += i->space*i->hooke;
c += sqr(i->space);
}
}
// put the constraints into the LP problem
void
Spacing_problem::make_constraints(Mixed_qp& lp) const
{
int dim=cols.sz();
for (int j=0; j < dim; j++) {
Colinfo *c=&(cols[j]);
if (c->fixed) {
lp.add_fixed_var(j,c->fixpos);
}
if (j > 0){
Vector c1(dim);
c1(j)=1.0 ;
c1(j-1)=-1.0 ;
lp.add_inequality_cons(c1, cols[j-1].minright() +
cols[j].minleft());
}
}
}
svec<Real>
Spacing_problem::solve() const
{
print();
OK();
assert(check_feasible());
/* optimalisatiefunctie */
Mixed_qp lp(cols.sz());
make_matrices(lp.quad,lp.lin, lp.const_term);
make_constraints(lp);
Vector start=find_initial_solution();
Vector sol(lp.solve(start));
if (!check_constraints(sol)) {
WARN << "solution doesn't satisfy constraints.\n" ;
}
svec<Real> posns(sol);
posns.add(lp.eval(sol));
return posns;
}
/*
add one column to the problem.
*/
void
Spacing_problem::add_column(const PCol *col, bool fixed, Real fixpos)
{
Colinfo c;
c.fixed=fixed;
c.fixpos=fixpos;
assert(col);
c.col=col;
cols.add(c);
}
void
Spacing_problem::add_ideal(const Idealspacing *i)
{
const PCol *l =i->left;
const PCol *r= i->right;
if (!contains(l) || !contains(r)) {
return;
}
ideals.add(i);
}
void
Spacing_problem::print_ideal(const Idealspacing*id)const
{
#ifndef NPRINT
int l = col_id(id->left);
int r = col_id(id->right);
mtor << "between " << l <<","<<r<<":" ;
#endif
}
void
Spacing_problem::print() const
{
#ifndef NPRINT
for (int i=0; i < cols.sz(); i++) {
mtor << "col " << i<<' ';
cols[i].print();
}
for (int i=0; i < ideals.sz(); i++) {
print_ideal(ideals[i]);
}
#endif
}
void
Colinfo::print() const
{
#ifndef NPRINT
mtor << "column { ";
if (fixed)
mtor << "fixed at " << fixpos<<", ";
assert(col);
mtor << "[" << minleft() << ", " << minright() << "]";
mtor <<"}\n";
#endif
}
Colinfo::Colinfo()
{
fixed=false;
col=0;
}
|
