Lines Matching defs:n0
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:
44 * a = n0.x d = n1.x
45 * b = n0.y e = n1.y
69 line_intersection(Geom::Point const &n0, double const d0,
73 double denominator = dot(Geom::rot90(n0), n1);
75 n0[Geom::Y] * d1;
76 /* X = (-d1, d0) dot (n0[Y], n1[Y]) */
86 double Y = n0[Geom::X] * d1 -
171 Geom::Point n0 = (p01 - p00).ccw();
172 double d0 = dot(n0,p00);
176 return line_intersection(n0, d0, n1, d1, result);
195 Geom::Point n0 = (p01 - p00).ccw();
196 double d0 = dot(n0,p00);
200 return line_intersection(n0, d0, n1, d1, result);
217 Geom::Point n0 = (p01 - p00).ccw();
218 double d0 = dot(n0,p00);
222 return line_intersection(n0, d0, n1, d1, result);