Searched defs:e1 (Results 1 - 5 of 5) sorted by relevance
| /inkscape/src/live_effects/ |
| H A D | lpe-ellipse_5pts.cpp | 151 double e1 = _det5(mat_e); local
157 {b1/2, c1, e1/2},
158 {d1/2, e1/2, f1}
166 Geom::Ellipse el(a1, b1, c1, d1, e1, f1);
|
| /inkscape/src/libavoid/ |
| H A D | geometry.cpp | 116 // Returns true if the segment e1-e2 intersects the shape boundary
119 bool segmentShapeIntersect(const Point& e1, const Point& e2, const Point& s1, argument
122 if (segmentIntersect(e1, e2, s1, s2))
127 else if ( (((s2 == e1) || pointOnLine(s1, s2, e1)) &&
131 (vecDir(s1, s2, e1) != 0)) )
|
| H A D | visibility.cpp | 458 Point &e1 = (*closestIt).vInf1->point; local
465 lineRGBA(router->avoid_screen, e1.x + canx, e1.y + cany,
|
| H A D | router.cpp | 863 Point e1 = points.first; local
869 inPoly(poly, e1, countBorder) : false;
885 if (segmentShapeIntersect(e1, e2, pi, pn,
1091 double e1, e2; local
1229 e1 = euclideanDist(start, xp);
1231 estdist = e1 + e2;
1239 // e1, e2);
|
| /inkscape/src/2geom/ |
| H A D | toposweep.cpp | 271 bool operator()(TopoGraph::Edge const &e1, TopoGraph::Edge const &e2) const { return s(*e1.section, *e2.section); } argument
566 TopoGraph::Edge &e1 = g[i][0], &e2 = g[i][1];
567 if(e1.section == e2.section) {
569 Section *new_section = new Section(e1.section->curve,
570 e1.section->f, e2.section->t,
571 e1.section->fp, e2.section->tp);
573 e1.other
575 Vertex *v1 = e1.other, *v2 = e2.other;
576 v1->lookup_section(e1
[all...] |
Completed in 26 milliseconds