Lines Matching defs:startPt
363 Geom::Point startPt = incoming.finalPoint();
370 // std::cout << " startPt: " << startPt << " endPt: " << endPt << std::endl;
398 double side1 = tang1[Geom::X]*(startPt[Geom::Y]-center1[Geom::Y]) - tang1[Geom::Y]*(startPt[Geom::X]-center1[Geom::X]);
419 Geom::Point node_on_path = startPt + Geom::rot90(tang1)*width;
447 if( circle2.contains( startPt ) && !circle1.contains( endPt ) ) {
449 p = expand_circle( circle1, circle2, startPt, tang1 );
452 } else if( circle1.contains( endPt ) && !circle2.contains( startPt ) ) {
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 );
487 Geom::Line secant(startPt, startPt + tang1);
510 arc1 = circle1.arc(startPt, 0.5*(startPt+sol), sol);
512 seg1 = new Geom::LineSegment(startPt, sol);
534 arc1 = circle1.arc(startPt, 0.5*(sol+startPt), sol);
552 Geom::Point point_on_path = startPt + Geom::rot90(tang1)*width;
553 Geom::Line bisector = make_angle_bisector_line(startPt, point_on_path, endPt);
601 arc1 = circle1.arc(startPt, 0.5*(p1+startPt), p1);
604 p1 = Geom::intersection_point(startPt, tang1, limit_line.pointAt(0), limit_line.versor());