Lines Matching defs:d0
26 * defined by the points p such that dot(n0, p) == d0 and dot(n1, p) == d1.
32 * defined by n0.X = d0 and x1.X = d1. The algorithm is as follows:
46 * c = d0 f = d1
69 line_intersection(Geom::Point const &n0, double const d0,
74 double X = n1[Geom::Y] * d0 -
76 /* X = (-d1, d0) dot (n0[Y], n1[Y]) */
87 n1[Geom::X] * d0;
172 double d0 = dot(n0,p00);
176 return line_intersection(n0, d0, n1, d1, result);
196 double d0 = dot(n0,p00);
200 return line_intersection(n0, d0, n1, d1, result);
218 double d0 = dot(n0,p00);
222 return line_intersection(n0, d0, n1, d1, result);