forked from cp-algorithms/cp-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_points_in_convex_polygon.cpp
More file actions
52 lines (46 loc) · 1.18 KB
/
test_points_in_convex_polygon.cpp
File metadata and controls
52 lines (46 loc) · 1.18 KB
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
#include <bits/stdc++.h>
using namespace std;
#include "points_in_convex_polygon.h"
int main(){
{
vector<pt> p(4);
p[0] = pt(1, 1);
p[1] = pt(0, 1);
p[2] = pt(0, 0);
p[3] = pt(1, 0);
prepare(p);
assert(pointInConvexPolygon(pt(1, 1)));
assert(!pointInConvexPolygon(pt(-1, 0)));
}
{
vector<pt> p(3);
p[0] = pt(3, 0);
p[1] = pt(0, 3);
p[2] = pt(0, 0);
prepare(p);
assert(pointInConvexPolygon(pt(1, 1)));
assert(pointInConvexPolygon(pt(1, 2)));
assert(pointInConvexPolygon(pt(2, 1)));
assert(!pointInConvexPolygon(pt(-1, -1)));
assert(!pointInConvexPolygon(pt(2, 2)));
}
{
vector<pt> p(3);
p[0] = pt(8, 5);
p[1] = pt(5, 8);
p[2] = pt(5, 5);
prepare(p);
assert(pointInConvexPolygon(pt(6, 6)));
assert(!pointInConvexPolygon(pt(1, 1)));
}
{
vector<pt> p(3);
p[0] = pt(0, -3);
p[1] = pt(-3, 0);
p[2] = pt(0, 0);
prepare(p);
assert(pointInConvexPolygon(pt(0, -1)));
assert(!pointInConvexPolygon(pt(2, -1)));
}
return 0;
}