Lines Matching refs:tol
78 assert(are_near(e.section->fp, vertices[i].avg, tol) || are_near(e.section->tp, vertices[i].avg, tol));
79 assert(!are_near(e.section->fp, e.section->tp, tol));
149 if(are_near(ap[dim], bp[dim], tol)) {
168 //TODO: should we use tol in these conditions?
174 if(are_near(a.fp[1-dim], b.fp[1-dim], tol)) {
223 unsigned find_vertex(std::vector<TopoGraph::Vertex> const &vertices, Point p, double tol) {
225 if(are_near(vertices[i].avg, p, tol)) return i;
345 TopoGraph::TopoGraph(PathVector const &ps, Dim2 d, double t) : dim(d), tol(t) {
347 ContextAdapter<DerefAdapter<SectionSorter> > s_sort = DerefAdapter<SectionSorter>(SectionSorter(ps, (Dim2)(1-d), tol));
353 EdgeSorter edge_sort = EdgeSorter(ps, (Dim2)(1-d), tol);
374 if(vertices[to_process[i]].avg[d] + tol < lim[d])
393 if(are_near(sec->tp, context[j].section->tp, tol)) {
416 unsigned ix = find_vertex(vertices, s->fp, tol);
452 if(context[context_ix].section->tp[d] - context[context_ix].section->fp[d] <= tol) {
453 if(!are_near(context[context_ix].section->tp, context[context_ix].section->fp, tol)) {
454 ix = find_vertex(vertices, context[context_ix].section->tp, tol);