roughfab1/polygons.cpp at master · StripedAbyss/roughfab1 · GitHub

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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include "polygons.h"

namespace utils {


Polygon_2 Convert_Vector2d1_to_Polygon_2(Vector2d1 v2d)//类型转换Vector2d1转化为Polygon
{
    vector<Point_2> pts;
    for (auto itt = v2d.begin(); itt != v2d.end(); itt++)
    {
        Point_2 temp((*itt).x, (*itt).y);
        pts.push_back(temp);
    }
    Polygon_2 target(pts.begin(), pts.end());
    return target;
}

Vector2d1 Convert_Polygon_2_to_Vector2d1(Polygon_2 p2)//类型转换Polygon转化为Vector2d1
{
    Vector2d1 target;
    for (auto itt = p2.begin(); itt != p2.end(); itt++)
    {
        Vector2d temp((*itt).x(), (*itt).y());
        target.push_back(temp);
    }
    return target;
}

double pointToPolygonDist(const Point_2& p, const Polygon_2& polygon) {//点到多边形的距离;检验完成，没报错
    int count = 0;
    double minDist = INFINITY;

    for (auto e = polygon.edges_begin(); e != polygon.edges_end(); ++e) {
        const Point_2& a = e->source();
        const Point_2& b = e->target();

        // 判断点 p 与线段 ab 是否在同一水平线上，并且 p 在 ab 的左侧
        if ((a.y() > p.y() != b.y() > p.y()) &&
            (p.x() < (b.x() - a.x()) * (p.y() - a.y()) / (b.y() - a.y()) + a.x())) {
            count++;
        }

        // 计算点 p 到线段 ab 的最短距离，并更新最小距离
        Segment_2 s(a, b);
        minDist = std::min(minDist, squared_distance(p, s));
    }

    if (count % 2 == 0) {
        return std::sqrt(abs(minDist));

    }
    return -std::sqrt(abs(minDist));
}

bool doPolygonsCollide2(const Vector2d1& poly1, const vector<Vector2d1>& poly2) {//碰撞检测，多边形求交
    for (const Vector2d1& one_polygon : poly2) {
        if (PL().HGP_2D_Two_Polygons_Intersection_C(poly1, one_polygon) > 0) {
            return true; // 发生碰撞
        }
    }
    return false; // 未发生碰撞
}

Vector2d1 translatePolygon(const Vector2d1& polygon, double dx, double dy) {
    std::vector<Vector2d> translatedVertices;
    // 遍历所有顶点，对每个顶点进行平移操作，并添加到新的顶点列表中
    for (auto it = polygon.begin(); it != polygon.end(); ++it) {

        Vector2d translatedPoint((*it).x + dx, (*it).y + dy);
        translatedVertices.push_back(translatedPoint);
    }
    // 使用新的顶点列表构造一个新的Vector2d1对象并返回
    return Vector2d1(translatedVertices.begin(), translatedVertices.end());
}

pair<int, int> rayExtension(int x1, int y1, int x2, int y2) {
    int deltaY = y2 - y1;
    int deltaX = x2 - x1;
    y2 = y1 + deltaY * 100;
    x2 = x1 + deltaX * 100;
    return pair<int, int>(x2, y2);
}

void GetMarkEdges(const Polygon_2 &poly, vector<pair<Segment_2, int>> &MarkEdges) {

    for (Polygon_2::Edge_const_iterator itt = poly.edges_begin(); itt != poly.edges_end(); ++itt) {
        Point_2 start = itt->source();
        Point_2 end = itt->target();
        Ray ray1(start, end);
        Ray ray2(end, start);
        int nums1 = 0, nums2 = 0;
        for (Polygon_2::Edge_const_iterator w = poly.edges_begin(); w != poly.edges_end(); ++w) {
            if ((w->source() == start && w->target() == end) || (w->source() == end && w->target() == start))continue;
            if (CGAL::do_intersect(ray1, *w))nums1++;
            if (CGAL::do_intersect(ray2, *w))nums2++;

        }
        pair<Segment_2, int> MarkEdge;
        MarkEdge.first = (*itt);
        MarkEdge.second = 0;
        assert(nums1 >= 2);
        assert(nums2 >= 2);
        if (nums1 > 2) {
            MarkEdge.second |= 1;
        }
        if (nums2 > 2) {
            MarkEdge.second |= 2;
        }
        MarkEdges.push_back(MarkEdge);
    }
}

void GetCutDir(const Polygon_2 &poly, vector<pair<int, int>> &cutIndex) {
    int n = poly.size();
    if (n < 3)return;
    for (int i = 0; i < n; ++i) {
        int j = i + 1;
        if (j == n) {
            j = 0;
        }
        Point_2 start = poly[i];
        Point_2 end = poly[j];
        Ray ray1(start, end);
        Ray ray2(end, start);
        int nums1 = 0, nums2 = 0;
        for (Polygon_2::Edge_const_iterator w = poly.edges_begin(); w != poly.edges_end(); ++w) {
            if ((w->source() == start && w->target() == end) || (w->source() == end && w->target() == start))continue;
            if (CGAL::do_intersect(ray1, *w))nums1++;
            if (CGAL::do_intersect(ray2, *w))nums2++;
        }
        if (nums1 == 2) {
            cutIndex.push_back({ i,j });
        }
        else if (nums2 == 2) {
            cutIndex.push_back({ j,i });
        }

    }
}

}