Lines Matching defs:distance
75 double distance = Geom::distance( curve[1], curve[0] );
77 (distance * distance * distance);
84 // std::cout << "Start k: " << k << " d: " << distance << " normal: " << normal << std::endl;
86 double distance = Geom::distance( curve[3], curve[2] );
88 (distance * distance * distance);
95 // std::cout << "End k: " << k << " d: " << distance << " normal: " << normal << std::endl;
166 // SVG defines miter length as distance between inner intersection and outer intersection,
167 // which is twice the distance from p to point_on_path but width is half stroke width.
168 satisfied = distance(p, point_on_path) <= miter * width;
254 Geom::Coord d0 = Geom::distance(chord2_pts[0].point(),start_pt);
255 Geom::Coord d1 = Geom::distance(chord2_pts[1].point(),start_pt);
265 Geom::Coord d2 = Geom::distance(chord3_pts[0].point(),d);
266 Geom::Coord d3 = Geom::distance(chord3_pts[1].point(),d);
280 Geom::Coord r_new = Geom::distance( center_new[0].point(), start_pt );
347 if( abs( Geom::distance( p0, circle2.center() ) - circle2.radius() ) <
348 abs( Geom::distance( p1, circle2.center() ) - circle2.radius() ) ) {
423 if (circle1.radius() < width && distance( circle1.center(), node_on_path ) < width) {
426 if (circle2.radius() < width && distance( circle2.center(), node_on_path ) < width) {
565 if (Geom::distance(point_on_path, sol) > miter_limit) {
575 Geom::Coord radius = distance(center, point_on_path);