Lines Matching defs:outgoing

114         : res(_res), outgoing(_outgoing), in_tang(_in_tang), out_tang(_out_tang), miter(_miter), width(_width) {};
120 Geom::Path const& outgoing;
131 // Join functions must append the outgoing path
137 jd.res.appendNew<Geom::LineSegment>(jd.outgoing.initialPoint());
138 jd.res.append(jd.outgoing);
143 jd.res.appendNew<Geom::EllipticalArc>(jd.width, jd.width, 0, false, jd.width <= 0, jd.outgoing.initialPoint());
144 jd.res.append(jd.outgoing);
152 Curve const& outgoing = jd.outgoing.front();
158 Point p = intersection_point(incoming.finalPoint(), tang1, outgoing.initialPoint(), tang2);
184 Point p2 = intersection_point(outgoing.initialPoint(), tang2, point_limit, bisector_versor.cw());
196 res.appendNew<LineSegment>(outgoing.initialPoint());
199 bool out_ls = outgoing.degreesOfFreedom() <= 4;
202 res.setFinal(outgoing.finalPoint());
204 res.append(outgoing);
208 res.insert(res.end(), ++jd.outgoing.begin(), jd.outgoing.end());
362 Geom::Curve const& outgoing = jd.outgoing.front();
364 Geom::Point endPt = outgoing.initialPoint();
377 Geom::Circle circle2 = touching_circle(outgoing.toSBasis(), 0);
387 if( Geom::CubicBezier const * out_bezier = dynamic_cast<Geom::CubicBezier const*>(&outgoing) ) {
531 points = circle1.intersect(Line(outgoing.initialPoint(), outgoing.finalPoint()));
635 // Add outgoing
638 res.append(outgoing);
641 res.append(outgoing);
644 res.appendNew<Geom::LineSegment>(outgoing.finalPoint());
648 res.insert(res.end(), ++jd.outgoing.begin(), jd.outgoing.end());
665 Geom::Path const& temp = jd.outgoing;
702 void tangents(Geom::Point tang[2], Geom::Curve const& incoming, Geom::Curve const& outgoing)
705 Geom::Point tang2 = outgoing.unitTangentAt(0.);
969 // Do two curves at a time for efficiency, since the join function needs to know the outgoing curve as well
1018 Geom::Curve const& outgoing = temp.front();
1019 if (Geom::are_near(res.finalPoint(), outgoing.initialPoint())) {