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
|
struct line {
double a, b, c; // ax + by + c = 0; vertikale Line: b = 0, sonst: b = 1
line(pt p, pt q) : a(-imag(q-p)), b(real(q-p)), c(cross({b, -a},p)) {}
};
line pointsToLine(pt p1, pt p2) {
line l;
if (abs(real(p1 - p2)) < EPS) {
l.a = 1; l.b = 0.0; l.c = -real(p1);
} else {
l.a = -imag(p1 - p2) / real(p1 - p2);
l.b = 1.0;
l.c = -(l.a * real(p1)) - imag(p1);
}
return l;
}
bool parallel(line l1, line l2) {
return (abs(l1.a - l2.a) < EPS) && (abs(l1.b - l2.b) < EPS);
}
bool same(line l1, line l2) {
return parallel(l1, l2) && (abs(l1.c - l2.c) < EPS);
}
bool intersect(line l1, line l2, pt& p) {
if (parallel(l1, l2)) return false;
double y, x = (l2.b * l1.c - l1.b * l2.c) / (l2.a * l1.b - l1.a * l2.b);
if (abs(l1.b) > EPS) y = -(l1.a * x + l1.c);
else y = -(l2.a * x + l2.c);
p = {x, y};
return true;
}
|
