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
142
143
|
#include <mbgl/util/geometry_within.hpp>
#include <mbgl/util/logging.hpp>
namespace mbgl {
namespace {
bool rayIntersect(const Point<double>& p, const Point<double>& p1, const Point<double>& p2) {
return ((p1.y > p.y) != (p2.y > p.y)) && (p.x < (p2.x - p1.x) * (p.y - p1.y) / (p2.y - p1.y) + p1.x);
}
// a, b are end point for line segment1, c and d are end points for line segment2
bool lineIntersectLine(const Point<double>& a,
const Point<double>& b,
const Point<double>& c,
const Point<double>& d) {
const auto perp = [](const Point<double>& v1, const Point<double>& v2) {
return (v1.x * v2.y - v1.y * v2.x);
};
// check if p1 and p2 are in different sides of line segment q1->q2
const auto twoSided = [](const Point<double>& p1,
const Point<double>& p2,
const Point<double>& q1,
const Point<double>& q2) {
double x1, y1, x2, y2, x3, y3;
// q1->p1 (x1, y1), q1->p2 (x2, y2), q1->q2 (x3, y3)
x1 = p1.x - q1.x;
y1 = p1.y - q1.y;
x2 = p2.x - q1.x;
y2 = p2.y - q1.y;
x3 = q2.x - q1.x;
y3 = q2.y - q1.y;
if ((x1 * y3 - x3 * y1) * (x2 * y3 - x3 * y2) < 0) return true;
return false;
};
auto vectorP = Point<double>(b.x - a.x, b.y - a.y);
auto vectorQ = Point<double>(d.x - c.x, d.y - c.y);
// check if two segments are parallel or not
// precondition is end point a, b is inside polygon, if they line a->b is
// parallel to edge c->d, then a->b won't intersect with c->d
if (perp(vectorQ, vectorP) == 0) return false;
// check if there are intersecting with each other
// a and b lie in separate side of segment c->d
// c and d lie in separate side of segment a->b
if (twoSided(a, b, c, d) && twoSided(c, d, a, b)) return true;
return false;
}
bool lineIntersectPolygon(const Point<double>& p1,
const Point<double>& p2,
const Polygon<double>& polygon) {
for (auto ring : polygon) {
auto length = ring.size();
// loop through every edge of the ring
for (std::size_t i = 0; i < length - 1; ++i) {
if (lineIntersectLine(p1, p2, ring[i], ring[i + 1])) {
return true;
}
}
}
return false;
}
}
void printPolygon(const Polygon<double>& polygon) {
mbgl::Log::Debug(mbgl::Event::General, "-------Print Polygon------");
for (auto ring : polygon) {
auto length = ring.size();
mbgl::Log::Debug(mbgl::Event::General, "-------Print New ring with size: %d ------", length);
// loop through every edge of the ring
for (std::size_t i = 0; i < length - 1; ++i) {
mbgl::Log::Debug(mbgl::Event::General, "point [%.15f, %.15f],", ring[i].x, ring[i].y);
}
}
}
void printLine(const LineString<double>& lineString) {
mbgl::Log::Debug(mbgl::Event::General, "-------Print LineString------");
for (std::size_t i = 0; i < lineString.size(); ++i) {
mbgl::Log::Debug(mbgl::Event::General, "point [%.15f, %.15f],", lineString[i].x, lineString[i].y);
}
}
// ray casting algorithm for detecting if point is in polygon
bool pointWithinPolygon(const Point<double>& point, const Polygon<double>& polygon) {
bool within = false;
for (const auto& ring : polygon) {
const auto length = ring.size();
// loop through every edge of the ring
for (std::size_t i = 0; i < length - 1; ++i) {
if (rayIntersect(point, ring[i], ring[i + 1])) {
within = !within;
}
}
}
return within;
}
bool pointWithinPolygons(const Point<double>& point, const MultiPolygon<double>& polygons) {
for (const auto& polygon : polygons) {
if (pointWithinPolygon(point, polygon)) return true;
}
return false;
}
bool lineStringWithinPolygon(const LineString<double>& line,
const Polygon<double>& polygon) {
const auto length = line.size();
// First, check if endpoints of line are all inside polygon
for (std::size_t i = 0; i < length; ++i) {
if (!pointWithinPolygon(line[i], polygon)) {
mbgl::Log::Debug(mbgl::Event::General, "point %.15f, %.15f is not inside polygon", line[i].x, line[i].y);
return false;
}
}
// Second, check if there is line segment intersecting polygon edge
for (std::size_t i = 0; i < length - 1; ++i) {
if (lineIntersectPolygon(line[i], line[i + 1], polygon)) {
mbgl::Log::Debug(mbgl::Event::General,
"---------line [%.15f, %.15f] to [%.15f, %.15f] is not inside polygon",
line[i].x,
line[i].y,
line[i + 1].x,
line[i + 1].y);
return false;
}
}
return true;
}
bool lineStringWithinPolygons(const LineString<double>& line, const MultiPolygon<double>& polygons) {
for (const auto& polygon : polygons) {
if (lineStringWithinPolygon(line, polygon)) return true;
}
return false;
}
}
|
