Lines Matching defs:points

40  *  Find rectangle-conic crossing points. They are returned in the
180 // Order crossing points on the rectangle edge clockwise, so two consecutive
181 // crossing points would be the end points of a conic arc all inside or all
211 * Test if two crossing points are the end points of a conic arc inner to the
214 * with the given end-points.
222 * we looks for the points on the conic whose tangent is parallel to the
236 * such points are found intersecating the conic section with the line
276 // we order the crossing points clockwise we have only one extremum
306 * Pair the points contained in the "crossing_points" vector; the paired points
308 * and the next one they are the end points of a conic arc that is inner to the
309 * rectangle. In the "inner_points" are returned points that are inner to the
311 * points with indexes 2k, 2k+1. In case there are unpaired points the are put
326 // to keep trace of which crossing points have been paired
331 // by the way we have ordered crossing points we need to test one point wrt
335 // crossing points that are tangent to the rectangle edge (and inner);
452 // we set paired and inner points by finding the ellipse
484 // else we need to pair crossing points, and to find an arc inner point
492 std::list<Point> points;
500 // in case inner point and end points are near is better not split
512 points.push_back(paired_points[i]);
513 points.push_back(inner_points[j]);
514 points.push_back(paired_points[i+1]);
517 sp = points.begin();
520 rsplit (points, sp, ip, size_t(1u));
521 rsplit (points, ip, fp, size_t(1u));
524 sp = points.begin();
526 while (fp != points.end())
528 rsplit (points, sp, fp, 100.0);
533 sp = points.begin();
536 //DBGPRINT ("CLIP: points ", j)
537 //DBGPRINT ("CLIP: points.size = ", points.size())
538 while (ip != points.end())
553 points.clear();