forked from cp-algorithms/cp-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_minkowski.cpp
More file actions
66 lines (60 loc) · 1.16 KB
/
test_minkowski.cpp
File metadata and controls
66 lines (60 loc) · 1.16 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>
using namespace std;
#include "minkowski.h"
bool equal_polygons(const vector<pt> & p, const vector<pt> & q){
if(p.size() != q.size())
return false;
for(size_t i = 0; i < p.size(); i++){
if(p[i].x != q[i].x || p[i].y != q[i].y)
return false;
}
return true;
}
bool test1(){
vector<pt> p = {
pt{0, 0},
pt{1, 0},
pt{0, 1}
};
vector<pt> q = {
pt{1, 1},
pt{0, 1},
pt{0, 0},
pt{1, 0}
};
return equal_polygons(
minkowski(p, q),
vector<pt>{
pt{0, 0},
pt{2, 0},
pt{2, 1},
pt{1, 2},
pt{0, 2}
});
}
bool test2(){
vector<pt> p = {
pt{1, 1},
pt{0, 1},
pt{0, 0},
pt{1, 0}
};
vector<pt> q = {
pt{2, 2},
pt{0, 2},
pt{0, 0},
pt{2, 0}
};
return equal_polygons(
minkowski(p, q),
vector<pt>{
pt{0, 0},
pt{3, 0},
pt{3, 3},
pt{0, 3}
});
}
int main(){
assert(test1());
assert(test2());
}