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
|
#include <2geom/d2.h>
#include <2geom/intersection-graph.h>
#include <2geom/path.h>
#include <2geom/sbasis.h>
#include <2geom/svg-path-parser.h>
#include <2geom/transforms.h>
#include <toys/path-cairo.h>
#include <toys/toy-framework-2.h>
#include <algorithm>
#include <cstdlib>
using namespace Geom;
class BoolOps : public Toy {
PathVector as, bs;
Line ah, bh;
PointHandle path_handles[4];
std::vector<Toggle> togs;
bool path_handles_inited;
public:
BoolOps()
: path_handles_inited(false)
{}
void draw(cairo_t *cr, std::ostringstream *notify, int width, int height, bool save, std::ostringstream *timer_stream) override {
if (!path_handles_inited) {
Rect vp(Point(10,10), Point(width-10, height-10));
setup_path_handles(vp);
}
Line aht(path_handles[0].pos, path_handles[1].pos);
Line bht(path_handles[2].pos, path_handles[3].pos);
PathVector ast = as * ah.transformTo(aht);
PathVector bst = bs * bh.transformTo(bht);
Timer tm;
tm.start();
PathIntersectionGraph pig(ast, bst);
std::vector<Point> dix, ix, wpoints;
ix = pig.intersectionPoints();
dix = pig.intersectionPoints(true);
wpoints = pig.windingPoints();
PathVector result, f_in, f_out;
if (pig.valid()) {
if (togs[0].on && !togs[1].on && !togs[2].on) {
result = pig.getAminusB();
}
if (!togs[0].on && togs[1].on && !togs[2].on) {
result = pig.getIntersection();
}
if (!togs[0].on && !togs[1].on && togs[2].on) {
result = pig.getBminusA();
}
if (togs[0].on && togs[1].on && !togs[2].on) {
result = ast;
}
if (togs[0].on && !togs[1].on && togs[2].on) {
result = pig.getXOR();
}
if (!togs[0].on && togs[1].on && togs[2].on) {
result = bst;
}
if (togs[0].on && togs[1].on && togs[2].on) {
result = pig.getUnion();
}
}
if (togs[5].on || togs[6].on) {
pig.fragments(f_in, f_out);
}
Timer::Time boolop_time = tm.lap();
cairo_set_line_cap(cr, CAIRO_LINE_CAP_SQUARE);
cairo_set_line_join(cr, CAIRO_LINE_JOIN_BEVEL);
cairo_set_fill_rule(cr, CAIRO_FILL_RULE_EVEN_ODD);
cairo_set_source_rgb(cr, 0.5, 0.5, 0.5);
cairo_path(cr, result);
cairo_fill(cr);
cairo_set_line_width(cr, 1);
cairo_set_source_rgb(cr, 0.5, 0.5, 0.5);
cairo_path(cr, ast);
cairo_stroke(cr);
cairo_set_source_rgb(cr, 0, 0, 0);
cairo_path(cr, bst);
cairo_stroke(cr);
if (togs[5].on) {
cairo_set_source_rgb(cr, 1, 0, 0);
cairo_path(cr, f_in);
cairo_stroke(cr);
}
if (togs[6].on) {
cairo_set_source_rgb(cr, 0, 0, 1);
cairo_path(cr, f_out);
cairo_stroke(cr);
}
//cairo_set_line_width(cr, 1);
if (togs[7].on) {
cairo_set_source_rgb(cr, 0, 1, 1);
for (auto & wpoint : wpoints) {
draw_handle(cr, wpoint);
}
cairo_stroke(cr);
}
if (togs[3].on) {
cairo_set_source_rgb(cr, 0, 1, 0);
for (auto & i : ix) {
draw_handle(cr, i);
}
cairo_stroke(cr);
}
if (togs[4].on) {
cairo_set_source_rgb(cr, 1, 0, 0);
for (auto & i : dix) {
draw_handle(cr, i);
}
cairo_stroke(cr);
}
double x = width - 90, y = height - 40, y2 = height - 80;
Point p(x, y), p2(x, y2), dpoint(25,25), xo(25,0);
togs[0].bounds = Rect(p, p + dpoint);
togs[1].bounds = Rect(p + xo, p + xo + dpoint);
togs[2].bounds = Rect(p + 2*xo, p + 2*xo + dpoint);
togs[3].bounds = Rect(p2 - 2*xo, p2 - 2*xo + dpoint);
togs[4].bounds = Rect(p2 - xo, p2 - xo + dpoint);
togs[5].bounds = Rect(p2, p2 + dpoint);
togs[6].bounds = Rect(p2 + xo, p2 + xo + dpoint);
togs[7].bounds = Rect(p2 + 2*xo, p2 + 2*xo + dpoint);
draw_toggles(cr, togs);
*notify << ix.size() << " intersections";
if (dix.size() != 0) {
*notify << " + " << dix.size() << " defective";
}
if (pig.valid()) {
*notify << "\nboolop time: " << boolop_time << std::endl;
} else {
*notify << "\nboolop failed, time: " << boolop_time << std::endl;
}
Toy::draw(cr, notify, width, height, save,timer_stream);
}
void mouse_pressed(GdkEventButton* e) override {
toggle_events(togs, e);
Toy::mouse_pressed(e);
}
void first_time(int argc, char** argv) override {
const char *path_a_name="svgd/winding.svgd";
const char *path_b_name="svgd/star.svgd";
if(argc > 1)
path_a_name = argv[1];
if(argc > 2)
path_b_name = argv[2];
as = read_svgd(path_a_name);
bs = read_svgd(path_b_name);
OptRect abox = as.boundsExact();
OptRect bbox = bs.boundsExact();
if (!abox) {
std::clog << "Error: path A is empty" << std::endl;
}
if (!bbox) {
std::clog << "Error: path B is empty" << std::endl;
}
if (!abox || !bbox) {
std::exit(1);
}
std::vector<Point> anodes = as.nodes();
std::vector<Point> bnodes = bs.nodes();
typedef std::vector<Point>::iterator Iter;
std::pair<Iter, Iter> apts =
std::minmax_element(anodes.begin(), anodes.end(), Point::LexLess<Y>());
std::pair<Iter, Iter> bpts =
std::minmax_element(bnodes.begin(), bnodes.end(), Point::LexLess<Y>());
ah = Line(*apts.first, *apts.second);
bh = Line(*bpts.first, *bpts.second);
togs.emplace_back("R", true);
togs.emplace_back("&", false);
togs.emplace_back("B", false);
togs.emplace_back("X", true);
togs.emplace_back("D", true);
togs.emplace_back("I", false);
togs.emplace_back("O", false);
togs.emplace_back("W", false);
}
void setup_path_handles(Rect const &viewport) {
Line aht = ah * as.boundsExact()->transformTo(viewport, Aspect(ALIGN_XMID_YMID));
Line bht = bh * bs.boundsExact()->transformTo(viewport, Aspect(ALIGN_XMID_YMID));
path_handles[0] = PointHandle(aht.initialPoint());
path_handles[1] = PointHandle(aht.finalPoint());
path_handles[2] = PointHandle(bht.initialPoint());
path_handles[3] = PointHandle(bht.finalPoint());
for (auto & path_handle : path_handles) {
handles.push_back(&path_handle);
}
path_handles_inited = true;
}
//virtual bool should_draw_numbers() {return false;}
};
int main(int argc, char **argv) {
init(argc, argv, new BoolOps());
return 0;
}
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=4:softtabstop=4:fileencoding=utf-8:textwidth=99 :
|
