opencv获得轮廓内的所有坐标

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76

std::vector<std::vector<cv::Point>> fillContour(const std::vector<std::vector<cv::Point>> & _contours) {     // sort as x descent y descent.     std::vector<std::vector<cv::Point>> contours(_contours);     for(size_t i = 0; i<contours.size(); ++i)     {         std::vector<cv::Point> sub(contours[i]);         std::sort(sub.begin(), sub.end(), [&](cv::Point & A, cv::Point & B) {             if (A.x == B.x)                 return A.y < B.y;             else                 return A.x < B.x;         });           contours[i] = sub;     }       // restore as pairs with same ys.     std::vector<std::vector<std::pair<cv::Point, cv::Point>>> contours_pair;     for (size_t i = 0; i < contours.size(); ++i)     {         std::vector<std::pair<cv::Point, cv::Point>> pairs;           for (size_t j = 0; j < contours[i].size(); ++j)         {             // j==0             if (pairs.size() == 0)             {                 pairs.push_back({ contours[i][j],contours[i][j] });                 continue;             }               // j>0             if (contours[i][j].x != pairs[pairs.size() - 1].first.x)             {                 pairs.push_back({ contours[i][j],contours[i][j] });                 continue;             }               if (contours[i][j].x == pairs[pairs.size() - 1].first.x)             {                 if (contours[i][j].y > pairs[pairs.size() - 1].second.y)                     pairs[pairs.size() - 1].second = contours[i][j];                 continue;             }         }           contours_pair.push_back(pairs);     }       // fill contour coordinates.     std::vector<std::vector< cv::Point>> fill_con;     for (auto pair_set : contours_pair)     {         std::vector<cv::Point> pointSet;         for (auto aPair : pair_set)         {             if (aPair.first == aPair.second)             {                 pointSet.push_back(aPair.first);                       }             else             {                 for (int i = aPair.first.y; i <= aPair.second.y; ++i)                 {                     pointSet.push_back(cv::Point(aPair.first.x, i));                 }             }           }         fill_con.push_back(pointSet);     }       return fill_con; }