-
Notifications
You must be signed in to change notification settings - Fork 0
/
Route.cpp
250 lines (227 loc) · 8.1 KB
/
Route.cpp
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
/**********************************************************
* This software is part of the graphviz toolset *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2005 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
* *
* This version available from *
* http://dynagraph.org *
**********************************************************/
#include "PathPlot.h"
#include "common/Solvers.h"
#include "BezCoeffs.h"
using namespace std;
#define PATHDEBUGGING 1
#define EPSILON1 1E-6
#define EPSILON2 1E-6
namespace Dynagraph {
namespace PathPlot {
struct TnA : Segment {
double t;
TnA() : Segment(Coord(),Coord()),t(0) {}
};
static bool reallyRouteSpline(const SegmentV &barriers,
const Coord *inps, size_t inpn, TnA *tnas, Segment endSlopes,Line &out);
static void mkSpline(const Coord *inps, size_t inpn, TnA *tnas, Segment endSlopes,
Coord *sp0, Coord *sv0, Coord *sp1, Coord *sv1);
static bool splineFits(const SegmentV &barriers,Coord pa, Coord va,
Coord pb, Coord vb, bool forceflag, Line &out);
static bool splineIsInside(const SegmentV &barriers, Coord sps[4]);
bool Route(const SegmentV &barriers, const Line &input,Segment endSlopes,Line &out) {
#if PATHDEBUGGING >= 1
unsigned i,j;
/* validate - input region is not self-intersecting */
for(i = 0; i < barriers.size() - 1; i++)
for(j = i + 1; j < barriers.size(); j++) {
/* tell me this isn't BOGUS */
if(is_vclose(barriers[i].a,barriers[j].a)) continue;
if(is_vclose(barriers[i].a,barriers[j].b)) continue;
// "it's not bogus"
if(is_vclose(barriers[i].b,barriers[j].a)) continue;
if(is_vclose(barriers[i].b,barriers[j].b)) continue;
if(segsIntersect(barriers[i].a,barriers[i].b,barriers[j].a,barriers[j].b)) {
reports[dgr::error] << "input region self-intersection: " << "B" << i << " (" << barriers[i].a << "),(" << barriers[i].b
<< ") X B" << j << " (" << barriers[j].a << "),(" << barriers[j].b << ')' << endl;
return false;
}
}
#endif
/* generate the splines */
endSlopes.a = endSlopes.a.Norm();
endSlopes.b = endSlopes.b.Norm();
out.degree = 3;
out.push_back(input.front());
TnA *tnas = new TnA[input.size()];
if(!reallyRouteSpline(barriers, &input[0],input.size(), tnas, endSlopes,out)) //
return false;
delete [] tnas;
#if DEBUGPATH
reports[dgr::error] << "%%!PS-splinomatic" << endl;
reports[dgr::error] << "%% edges" << endl;
reports[dgr::error] << "0 0 1 setrgbcolor" << endl;
for(int ipi = 0; ipi < barriers.size(); ipi++)
reports[dgr::error] << "newpath %f %f moveto %f %f lineto stroke\n",
edges[ipi].a.x,edges[ipi].a.y,
edges[ipi].b.x,edges[ipi].b.y);
reports[dgr::error] << "%% input path" << endl;
reports[dgr::error] << "1 0 0 setrgbcolor" << endl;
reports[dgr::error] << "newpath";
for(ipi = 0; ipi < input.size(); ipi++) {
reports[dgr::error] << ' ' << inps[ipi].x << ' ' << inps[ipi].y;
if(ipi == 0) reports[dgr::error] << " moveto";
else reports[dgr::error] << " lineto";
}
reports[dgr::error] << " stroke" << endl;
reports[dgr::error] << "%% output spline" << endl;
reports[dgr::error] << "1 .9 .8 setrgbcolor" << endl;
reports[dgr::error] << "newpath";
for(int opi = 0; opi < opl; opi++) {
reports[dgr::error] << ' ' << ops[opi].x << ' ' << ops[opi].y;
if(opi == 0) reports[dgr::error] << " moveto";
else if(opi % 3 == 0) reports[dgr::error] << " curveto";
}
reports[dgr::error] << " stroke" << endl;
#endif
return true;
}
static bool reallyRouteSpline(const SegmentV &barriers,
const Coord *inps, size_t inpn, TnA *tnas, Segment endSlopes,Line &out) {
tnas[0].t = 0;
size_t i;
for(i = 1; i < inpn; i++)
tnas[i].t = tnas[i - 1].t + dist(inps[i], inps[i - 1]);
for(i = 1; i < inpn; i++)
tnas[i].t /= tnas[inpn - 1].t;
for(i = 0; i < inpn; i++) {
tnas[i].a = endSlopes.a*B1(tnas[i].t);
tnas[i].b = endSlopes.b*B2(tnas[i].t);
}
Coord p1,v1,p2,v2;
mkSpline(inps, inpn, tnas, endSlopes, &p1, &v1, &p2, &v2);
if(splineFits(barriers, p1, v1, p2, v2,inpn == 2,out))
return true;
Coord cp1 = p1 + v1/3.0,
cp2 = p2 - v2/3.0;
double maxd=-1;
int maxi=-1;
for(i = 1; i < inpn - 1; i++) {
double t = tnas[i].t;
Coord p = p1*B0(t) + cp1*B1(t) + cp2*B2(t) + p2*B3(t);
double d = dist(p, inps[i]);
if(d > maxd)
maxd = d, maxi = (int)i;
}
int spliti = maxi;
Coord splitv1 = (inps[spliti]-inps[spliti - 1]).Norm(),
splitv2 = (inps[spliti + 1]-inps[spliti]).Norm(),
splitv = (splitv1+splitv2).Norm();
if(!reallyRouteSpline(barriers,inps,spliti + 1,tnas,Segment(endSlopes.a,splitv),out) ||
!reallyRouteSpline(barriers,&inps[spliti],inpn - spliti,tnas,Segment(splitv,endSlopes.b),out))
return false;
return true;
}
static void mkSpline(const Coord *inps, size_t inpn, TnA *tnas, Segment endSlopes,
Coord *sp0, Coord *sv0, Coord *sp1, Coord *sv1) {
const Coord &front = *inps,&back = inps[inpn-1];
double c[2][2] = {{0,0},{0,0}},
x[2] = {0,0};
for(size_t i = 0; i < inpn; i++) {
c[0][0] += tnas[i].a%tnas[i].a;
c[0][1] += tnas[i].a%tnas[i].b;
c[1][0] = c[0][1];
c[1][1] += tnas[i].b%tnas[i].b;
Coord tmp = inps[i]-(front*B01(tnas[i].t)+
back*B23(tnas[i].t));
x[0] += tnas[i].a%tmp;
x[1] += tnas[i].b%tmp;
}
double det01 = c[0][0] * c[1][1] - c[1][0] * c[0][1],
det0X = c[0][0] * x[1] - c[0][1] * x[0],
detX1 = x[0] * c[1][1] - x[1] * c[0][1];
double scale0 = 0.0,
scale3 = 0.0;
if(det01) {
scale0 = detX1 / det01;
scale3 = det0X / det01;
}
if(absol(det01) < EPSILON1 || scale0 <= 0.0 || scale3 <= 0.0) {
double d01 = dist(front, back) / 3.0;
scale0 = d01;
scale3 = d01;
}
*sp0 = front;
*sv0 = endSlopes.a*scale0;
*sp1 = back;
*sv1 = endSlopes.b*scale3;
}
static bool splineFits(const SegmentV &barriers,Coord pa, Coord va,
Coord pb, Coord vb, bool forceflag, Line &out) {
double a, b;
#if 0
double d = dist(pa,pb);
a = d, b = d;
#else
a = b = 4;
#endif
while(1) {
Coord sps[4] = {pa,
pa + va*a/3.0,
pb - vb*b/3.0,
pb};
if(splineIsInside(barriers, sps)) {
out.AddSeg(sps);
reports[dgr::splineRoute] << "success: " << a << ' ' << b << endl;
return true;
}
if(a == 0 && b == 0) {
if(forceflag) {
out.AddSeg(sps);
reports[dgr::splineRoute] << "forced straight line: " << a << ' ' << b << endl;
return true;
}
break;
}
if(a > .01)
a /= 2, b /= 2;
else
a = b = 0;
}
#if DEBUG >= 1
reports[dgr::error] << "failure" << endl;
#endif
return false;
}
static bool splineIsInside(const SegmentV &barriers, Coord sps[4]) {
double roots[4];
for(unsigned ei = 0; ei < barriers.size(); ei++) {
int rootn = splineIntersectsLine(sps, barriers[ei], roots);
if(rootn == 4)
continue; // return 1;
for(int rooti = 0; rooti < rootn; rooti++) {
if(roots[rooti] < EPSILON2 || roots[rooti] > 1 - EPSILON2)
continue;
double t = roots[rooti],
td = B3(t),
tc = B2(t),
tb = B1(t),
ta = B0(t);
Coord ip(ta * sps[0].x + tb * sps[1].x +
tc * sps[2].x + td * sps[3].x,
ta * sps[0].y + tb * sps[1].y +
tc * sps[2].y + td * sps[3].y);
if(dSquared(ip, barriers[ei].a) < EPSILON1 ||
dSquared(ip, barriers[ei].b) < EPSILON1)
continue;
return false;
}
}
return true;
}
} // namespace PathPlot
} // namespace Dynagraph