Lines Matching defs:crs
511 std::vector<Point> crs = crossings(bnd);
512 if(crs.size() == 1) {
513 Point A = crs[0];
521 else if(crs.size() >= 2 && crs.size() < 4) {
522 Point A = crs[0];
523 Point C = crs[1];
524 if(crs.size() == 3) {
525 if(distance(A, crs[2]) > distance(A, C))
526 C = crs[2];
527 else if(distance(C, crs[2]) > distance(A, C))
528 A = crs[2];
1442 std::vector<Point> crs = intersect (*this, G);
1444 //std::cout << "NEAREST POINT: crs.size = " << crs.size() << std::endl;
1445 if (crs.empty()) return points;
1448 double mindist = distanceSq (crs[0], P);
1452 for (size_t i = 1; i < crs.size(); ++i)
1454 dist.push_back (distanceSq (crs[i], P));
1462 points.push_back (crs[idx]);
1463 for (size_t i = 0; i < crs.size(); ++i)
1467 points.push_back (crs[i]);