void merge_crossings(Crossings &a, Crossings &b, unsigned i) {
Crossings n;
sort_crossings(b, i);
n.resize(a.size() + b.size());
std::merge(a.begin(), a.end(), b.begin(), b.end(), n.begin(), CrossingOrder(i));
a = n;
}
CrossingSet reverse_tb(CrossingSet const &cr, unsigned split, std::vector<double> max) {
CrossingSet ret;
for(unsigned i = 0; i < cr.size(); i++) {
Crossings res = reverse_tb(cr[i], split, max);
if(i >= split) std::reverse(res.begin(), res.end());
ret.push_back(res);
}
return ret;
}
Crossings reverse_ta(Crossings const &cr, std::vector<double> max) {
Crossings ret;
for(Crossings::const_iterator i = cr.begin(); i != cr.end(); ++i) {
double mx = max[i->a];
ret.push_back(Crossing(i->ta > mx+0.01 ? (1 - (i->ta - mx) + mx) : mx - i->ta,
i->tb, !i->dir));
}
return ret;
}
Crossings reverse_tb(Crossings const &cr, unsigned split, std::vector<double> max) {
Crossings ret;
for(Crossings::const_iterator i = cr.begin(); i != cr.end(); ++i) {
double mx = max[i->b - split];
std::cout << i->b << "\n";
ret.push_back(Crossing(i->ta, i->tb > mx+0.01 ? (1 - (i->tb - mx) + mx) : mx - i->tb,
!i->dir));
}
return ret;
}
void mark_crossings(cairo_t *cr, Shape const &a, Shape const &b) {
const Regions ac = a.getContent();
Crossings c = crossings(Path(a[0]), Path(b[0]));
//for(unsigned j = 0; j < cc.size(); j++) {
//Crossings c = cc[j];
for(Crossings::iterator i = c.begin(); i != c.end(); ++i) {
draw_cross(cr, Path(ac[i->a]).pointAt(i->ta));
cairo_stroke(cr);
//draw_text(cr, ac[i->a].getBoundary().pointAt(i->ta), i->dir ? "T" : "F");
}
//}
}