-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
136 lines (112 loc) · 3.71 KB
/
main.cpp
File metadata and controls
136 lines (112 loc) · 3.71 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
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
#include <iostream>
#include "wall.h"
using namespace std;
int main() {
float length = 22; // actual max x
float width = 20; // actual max y
float step = 80;
float maxDist = 1;
vector<wall> walls = {
wall(make_tuple(0,0), make_tuple(0,20), 20, maxDist),
wall(make_tuple(0,0), make_tuple(22,0), 22, maxDist),
wall(make_tuple(0,20), make_tuple(22,20), 22, maxDist),
wall(make_tuple(22,0), make_tuple(22,20), 20, maxDist),
wall(make_tuple(5,10), make_tuple(7,20), maxDist),
wall(make_tuple(0,10), make_tuple(5,10), maxDist),
};
tuple<int,int> pCO = {0,20};
tuple<int,int> pCT = {22,0};
// include +1 so both 0 and boundary are in range
vector<vector<int>> iP((width+1) * step, vector<int>((length+1) * step));
vector<vector<int>> iCO((width+1) * step, vector<int>((length+1) * step));
vector<vector<int>> iCT((width+1) * step, vector<int>((length+1) * step));
vector<vector<int>> iC((width+1) * step, vector<int>((length+1) * step));
vector<vector<int>> iF((width+1) * step, vector<int>((length+1) * step));
// Fill iP
for (int i = 0; i < iP.size(); i++) {
for (int j = 0; j < iP[i].size(); j++) {
for (wall w : walls) {
iP[i][j] = w.isNearWall(make_tuple(j / step, i / step))
? 1 + iP[i][j] : iP[i][j];
}
}
}
// // Print iP (from top row down)
// for (int i = iP.size()-1; i >= 0; i--) {
// for (int j = 0; j < iP[i].size(); j++) {
// cout << iP[i][j] << " ";
// }
// cout << endl;
// }
//
// cout << "\n\n\n";
// Fill iCO
for (int i = 0; i < iCO.size(); i++) {
for (int j = 0; j < iCO[i].size(); j++) {
for (wall w : walls) {
if (!w.isVisible(pCO, make_tuple(j / step, i / step))) {
iCO[i][j] = 0;
break;
}
iCO[i][j] = 1;
}
}
}
// Fill iCT
for (int i = 0; i < iCT.size(); i++) {
for (int j = 0; j < iCT[i].size(); j++) {
for (wall w : walls) {
if (!w.isVisible(pCT, make_tuple(j / step, i / step))) {
iCT[i][j] = 0;
break;
}
iCT[i][j] = 1;
}
}
}
for (int i = 0; i < iC.size(); i++) {
for (int j = 0; j < iC[i].size(); j++) {
iC[i][j] = iCO[i][j] + iCT[i][j];
}
}
for (int i = 0; i < iF.size(); i++) {
for (int j = 0; j < iF[i].size(); j++) {
iF[i][j] = iC[i][j] * iP[i][j];
}
}
// // Print iCO
// for (int i = iC.size()-1; i >= 0; i--) {
// for (int j = 0; j < iC[i].size(); j++) {
// cout << iC[i][j] << " ";
// }
// cout << endl;
// }
// cout << endl;
// cout << endl;
// cout << endl;
// cout << endl;
// cout << endl;
// for (int i = iF.size()-1; i >= 0; i--) {
// for (int j = 0; j < iF[i].size(); j++) {
// cout << iF[i][j] << " ";
// }
// cout << endl;
//
// }
float wallspace = 0;
for (int i = 0; i < iP.size(); i++) {
for (int j = 0; j < iP[i].size(); j++) {
wallspace += iP[i][j];
}
}
float total =0;
for (int i = 0; i < iF.size(); i++) {
for (int j = 0; j < iF[i].size(); j++) {
total += iF[i][j];
}
}
std::cout << "Total Wall: " << wallspace / step / step << std::endl;
std::cout << "Final Eval: " << total / step / step << std::endl;
std::cout << "Ratio of Final Eval to Total Wall: " << total / (wallspace * 2) << std::endl;
return 0;
}