Lines Matching defs:lines
456 // we simply re-use the procedure for lines and filter out
507 // determined by mu Q + R is reducible to a product of two lines. If it's not,
509 // lines with the original ellipses (if there are any) give the coordinates
513 // Out of three possible pairs of lines that go through four points of intersection
514 // of two ellipses, this corresponds to cross-lines. These intersect the ellipses
539 Line lines[2];
548 lines[0] = Line(1, q, alpha);
549 lines[1] = Line(1, s, beta);
557 lines[0] = Line(q, 1, alpha);
558 lines[1] = Line(s, 1, beta);
560 lines[0] = Line(ee, 0, dd);
561 lines[1] = Line(0, 1, cc/ee);
564 // intersect with the obtained lines and report intersections
566 std::vector<ShapeIntersection> as = intersect(lines[li]);
567 std::vector<ShapeIntersection> bs = other.intersect(lines[li]);