Lines Matching refs:tang2
157 Point tang2 = jd.out_tang;
158 Point p = intersection_point(incoming.finalPoint(), tang1, outgoing.initialPoint(), tang2);
184 Point p2 = intersection_point(outgoing.initialPoint(), tang2, point_limit, bisector_versor.cw());
214 Geom::Point pick_solution(std::vector<Geom::ShapeIntersection> points, Geom::Point tang2, Geom::Point endPt)
218 if ( dot(tang2, points[0].point() - endPt) > 0 ) {
221 } else if ( dot(tang2, points[1].point() - endPt) > 0 ) { // points[0] could be good, now check points[1]
366 Geom::Point tang2 = jd.out_tang;
371 // std::cout << " tang1: " << tang1 << " tang2: " << tang2 << std::endl;
372 // std::cout << " dot product: " << Geom::dot( tang1, tang2 ) << std::endl;
399 double side2 = tang2[Geom::X]*( endPt[Geom::Y]-center2[Geom::Y]) - tang2[Geom::Y]*( endPt[Geom::X]-center2[Geom::X]);
454 p = expand_circle( circle2, circle1, endPt, tang2 );
475 Geom::Point apex = adjust_circles( circle1, circle2, startPt, endPt, tang1, tang2 );
492 Geom::Line secant(endPt, endPt + tang2);
508 sol = pick_solution(points, tang2, endPt);
525 sol = pick_solution(points, tang2, endPt);
533 sol = pick_solution(points, tang2, endPt);
599 p1 = pick_solution(points, tang2, endPt);
616 p2 = Geom::intersection_point(endPt, tang2, limit_line.pointAt(0), limit_line.versor());
705 Geom::Point tang2 = outgoing.unitTangentAt(0.);
706 tang[0] = tang1, tang[1] = tang2;
713 Geom::Point tang2 = Geom::rot90(unitTangentAt(reverse(l.toSBasis()), 0.));
716 Geom::Point end = l.finalPoint() - tang2 * width;