获取所有轮廓的首尾点,轮廓间首尾点的距离都小于阈值,将每两个距离最近的首尾点的轮廓连接起来 double minDist = DBL_MAX; Point2f p1, p2; for (int i = 0; i < Contours_points.size(); i++) { for (int j = i + 1; j < Contours_points.size(); j++) { double dist1 = norm(Contours_points[i].front() - Conto
时间: 2024-01-15 08:03:26 浏览: 34
我了解您的问题。您的代码片段中,您需要获取所有轮廓的首尾点,将每两个距离最近的首尾点的轮廓连接起来。在这里,您可以使用以下代码来获取每个轮廓的首尾点,并计算它们之间的距离:
```cpp
vector<Point2f> start_pts, end_pts;
vector<double> min_dists;
for (int i = 0; i < Contours_points.size(); i++) {
// 获取当前轮廓的首尾点
Point2f start_pt = Contours_points[i].front();
Point2f end_pt = Contours_points[i].back();
start_pts.push_back(start_pt);
end_pts.push_back(end_pt);
// 计算当前轮廓的首尾点与其他轮廓的首尾点之间的距离
for (int j = i + 1; j < Contours_points.size(); j++) {
double dist1 = norm(start_pt - start_pts[j]);
double dist2 = norm(start_pt - end_pts[j]);
double dist3 = norm(end_pt - start_pts[j]);
double dist4 = norm(end_pt - end_pts[j]);
double min_dist = min(min(dist1, dist2), min(dist3, dist4));
min_dists.push_back(min_dist);
}
}
```
然后,您可以使用以下代码来找到距离最近的首尾点,并将它们连接起来:
```cpp
// 找到距离最近的首尾点
double min_dist = DBL_MAX;
int min_start_idx, min_end_idx;
for (int i = 0; i < min_dists.size(); i++) {
if (min_dists[i] < min_dist) {
min_dist = min_dists[i];
min_start_idx = i / (Contours_points.size() - 1);
min_end_idx = i % (Contours_points.size() - 1);
if (min_end_idx >= min_start_idx) min_end_idx++;
}
}
// 将距离最近的首尾点连接起来
vector<Point> merged_contour;
merged_contour.insert(merged_contour.end(), Contours_points[min_start_idx].begin(), Contours_points[min_start_idx].end());
merged_contour.insert(merged_contour.end(), Contours_points[min_end_idx].rbegin(), Contours_points[min_end_idx].rend());
```
请注意,您需要在检查每个轮廓的首尾点之间的距离之前,确保它们之间的距离小于阈值。
相关推荐
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)