Lines Matching defs:pt
32 pt(start)
39 d0 = Geom::dot(normal, pt);
43 pt(line.pt),
51 pt = line.pt;
65 Geom::Coord lambda = (line.d0 - Geom::dot(pt, line.normal)) / denom;
66 return pt + lambda * v_dir;
73 d0 = Geom::dot(normal, pt);
76 Geom::Point Line::closest_to(Geom::Point const &pt)
78 /* return the intersection of this line with a perpendicular line passing through pt */
79 boost::optional<Geom::Point> result = this->intersect(Line(pt, (this->v_dir).ccw(), false));
84 double Line::lambda (Geom::Point const pt)
86 double sign = (Geom::dot (pt - this->pt, this->v_dir) > 0) ? 1.0 : -1.0;
87 double lambda = sign * Geom::L2 (pt - this->pt);
89 // pt lies on the line and thus skip the following test
91 if (!pts_coincide (pt, test)) {
124 bool lies_in_quadrangle (Geom::Point const &A, Geom::Point const &B, Geom::Point const &C, Geom::Point const &D, Geom::Point const &pt)
126 return (lies_in_sector (D - A, B - A, pt - A) && lies_in_sector (D - C, B - C, pt - C));
136 * starting at pt and going into direction dir.
141 Geom::Point const &pt, Geom::Point const &dir)
143 Geom::Point dir_A (A - pt);
144 Geom::Point dir_B (B - pt);
145 Geom::Point dir_C (C - pt);
146 Geom::Point dir_D (D - pt);
192 std::pair <Geom::Point, Geom::Point> e = side_of_intersection (vb.min(), lr, vb.max(), ul, this->pt, this->v_dir);