Lines Matching defs:endPt

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]
226 sol = ( distanceSq(endPt, points[0].point()) < distanceSq(endPt, points[1].point()) )
364 Geom::Point endPt = outgoing.initialPoint();
370 // std::cout << " startPt: " << startPt << " endPt: " << endPt << std::endl;
399 double side2 = tang2[Geom::X]*( endPt[Geom::Y]-center2[Geom::Y]) - tang2[Geom::Y]*( endPt[Geom::X]-center2[Geom::X]);
447 if( circle2.contains( startPt ) && !circle1.contains( endPt ) ) {
452 } else if( circle1.contains( endPt ) && !circle2.contains( startPt ) ) {
454 p = expand_circle( circle2, circle1, endPt, tang2 );
472 if( ( circle2.contains( startPt ) && !circle1.contains( endPt ) ) ||
473 ( circle1.contains( endPt ) && !circle2.contains( startPt ) ) ) {
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);
515 arc2 = circle2.arc(sol, 0.5*(sol+endPt), endPt);
517 seg2 = new Geom::LineSegment(sol, endPt);
525 sol = pick_solution(points, tang2, endPt);
526 arc2 = circle2.arc(sol, 0.5*(sol+endPt), endPt);
533 sol = pick_solution(points, tang2, endPt);
553 Geom::Line bisector = make_angle_bisector_line(startPt, point_on_path, endPt);
599 p1 = pick_solution(points, tang2, endPt);
611 p2 = pick_solution(points, tang1, endPt);
613 arc2 = circle2.arc(p2, 0.5*(p2+endPt), endPt);
616 p2 = Geom::intersection_point(endPt, tang2, limit_line.pointAt(0), limit_line.versor());