crossing.cpp revision 8001ba81cb851b38d86650a2fef5817facffb763
namespace Geom {
//bool edge_involved_in(Edge const &e, Crossing const &c) {
// if(e.path == c.a) {
// } else if(e.path == c.b) {
// }
// return false;
//}
if(rev) {
} else {
}
} else {
} else {
}
}
}
unsigned j = 0;
}
}
}
if(d < best) {
best = d;
bix = k;
}
}
}
}
bix = i;
}
}
}
return ret;
/* Various incoherent code bits
// list of sets of edges, each set corresponding to those emanating from the path
CrossingGraph ret;
std::vector<Edge> edges(crs.size());
std::vector<std::vector<bool> > used;
unsigned i, j;
do {
first_false(used, i, j);
CrossingNode cn;
do {
unsigned di = i, dj = j;
crossing_dual(di, dj);
if(!used[di,dj]) {
}
}
} while(!used[i,j])
for(unsigned j = 0; j < crs[i].size(); j++) {
edges.push_back(Edge(i, crs[i][j].getOtherTime(i), false));
edges.push_back(Edge(i, crs[i][j].getOtherTime(i), true));
}
std::sort(edges.begin(), edges.end(), TimeOrder());
for(unsigned j = 0; j < edges.size(); ) {
CrossingNode cn;
double t = edges[j].time;
while(j < edges.size() && are_near(edges[j].time, t)) {
cn.edges.push_back(edges[j]);
}
}
*/
}
Crossings n;
sort_crossings(b, i);
a = n;
}
}
}
}
return ret;
}
!i->dir));
}
return ret;
}
}
return ret;
}
}
return ret;
}
/* if(cr_a.empty()) return;
//Remove anything with dupes
for(Eraser<Crossings> i(&cr_a); !i.ended(); i++) {
const Crossing cur = *i;
Eraser<Crossings> next(i);
next++;
if(are_near(cur, *next)) {
cr_b.erase(std::find(cr_b.begin(), cr_b.end(), cur));
for(i = next; near(*i, cur); i++) {
cr_b.erase(std::find(cr_b.begin(), cr_b.end(), *i));
}
continue;
}
}
*/
}
}
/*
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=8:softtabstop=4:encoding=utf-8:textwidth=99 :