/
camera.c
381 lines (329 loc) · 11.8 KB
/
camera.c
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
/*
Copyright (c) 2017-2018 ByteBit
This file is part of BetterSpades.
BetterSpades is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
BetterSpades is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with BetterSpades. If not, see <http://www.gnu.org/licenses/>.
*/
#include "common.h"
unsigned char camera_mode = CAMERAMODE_SPECTATOR;
float frustum[6][4];
float camera_rot_x = 2.04F, camera_rot_y = 1.79F;
float camera_x = 256.0F, camera_y = 60.0F, camera_z = 256.0F;
float camera_vx, camera_vy, camera_vz;
float camera_fov = CAMERA_DEFAULT_FOV;
float camera_size = 0.8F;
float camera_height = 0.8F;
float camera_eye_height = 0.0F;
float camera_movement_x = 0.0F, camera_movement_y = 0.0F, camera_movement_z = 0.0F;
float camera_speed = 32.0F;
long camera_last_key = 0;
float camera_fov_scaled() {
if(camera_mode==CAMERAMODE_FPS && players[local_player_id].held_item==TOOL_GUN && players[local_player_id].input.buttons.rmb && !players[local_player_id].input.keys.sprint) {
return camera_fov*atan(tan((camera_fov/180.0F*PI)/2)/2.0F)*2.0F;
}
return camera_fov;
}
void camera_overflow_adjust() {
if(camera_rot_y<EPSILON) {
camera_rot_y = EPSILON;
}
if(camera_rot_y>3.14F) {
camera_rot_y = 3.14F;
}
if(camera_rot_x>DOUBLEPI) {
camera_rot_x -= DOUBLEPI;
}
if(camera_rot_x<0.0F) {
camera_rot_x += DOUBLEPI;
}
}
void camera_apply(float dt) {
switch(camera_mode) {
case CAMERAMODE_FPS:
cameracontroller_fps(dt);
break;
case CAMERAMODE_BODYVIEW:
cameracontroller_bodyview(dt);
break;
case CAMERAMODE_SPECTATOR:
cameracontroller_spectator(dt);
break;
case CAMERAMODE_SELECTION:
cameracontroller_selection(dt);
break;
}
}
void camera_hit_fromplayer(struct Camera_HitType* hit, int player_id, float range) {
if(player_id!=local_player_id) {
camera_hit(hit,player_id,
players[player_id].physics.eye.x,players[player_id].physics.eye.y+player_height(&players[player_id]),players[player_id].physics.eye.z,
players[player_id].orientation.x,players[player_id].orientation.y,players[player_id].orientation.z,
range);
} else {
camera_hit(hit,player_id,
players[player_id].physics.eye.x,players[player_id].physics.eye.y+player_height(&players[player_id]),players[player_id].physics.eye.z,
sin(camera_rot_x)*sin(camera_rot_y),cos(camera_rot_y),cos(camera_rot_x)*sin(camera_rot_y),
range);
}
}
void camera_hit(struct Camera_HitType* hit, int exclude_player, float x, float y, float z, float ray_x, float ray_y, float ray_z, float range) {
camera_hit_mask(hit,exclude_player,x,y,z,ray_x,ray_y,ray_z,range,0xFF);
}
void camera_hit_mask(struct Camera_HitType* hit, int exclude_player, float x, float y, float z, float ray_x, float ray_y, float ray_z, float range, int mask) {
hit->type = CAMERA_HITTYPE_NONE;
hit->distance = FLT_MAX;
int* pos = camera_terrain_pickEx(1,x,y,z,ray_x,ray_y,ray_z);
if(pos!=NULL && pos[1]>1 && distance2D(x,z,pos[0],pos[2])<=range*range) {
hit->type = CAMERA_HITTYPE_BLOCK;
hit->distance = distance3D(x,y,z,pos[0],pos[1],pos[2]);
hit->x = pos[0];
hit->y = pos[1];
hit->z = pos[2];
hit->xb = pos[3];
hit->yb = pos[4];
hit->zb = pos[5];
}
Ray dir;
dir.origin.x = x;
dir.origin.y = y;
dir.origin.z = z;
dir.direction.x = ray_x;
dir.direction.y = ray_y;
dir.direction.z = ray_z;
float player_nearest = 1e10;
int player_nearest_id, player_nearest_section;
for(int i=0;i<PLAYERS_MAX;i++) {
float l = distance2D(x,z,players[i].pos.x,players[i].pos.z);
if(players[i].connected && players[i].alive && l<range*range && (exclude_player<0 || (exclude_player>=0 && exclude_player!=i))) {
float px = players[i].pos.x-x;
float py = players[i].pos.y-y;
float pz = players[i].pos.z-z;
float angle = acos(((px*ray_x)+(py*ray_y)+(pz*ray_z))/sqrt(px*px+py*py+pz*pz));
if(angle<45.0F/180.0F*PI) {
int intersections = player_render(&players[i],i,&dir,0);
if((intersections&mask) && l<player_nearest) {
player_nearest = distance3D(x,y,z,players[i].pos.x,players[i].pos.y,players[i].pos.z);
player_nearest_id = i;
player_nearest_section = intersections;
}
}
}
}
if(player_nearest<=range*range && player_nearest<hit->distance) {
hit->type = CAMERA_HITTYPE_PLAYER;
hit->x = players[player_nearest_id].pos.x;
hit->y = players[player_nearest_id].pos.y;
hit->z = players[player_nearest_id].pos.z;
hit->player_id = player_nearest_id;
hit->player_section = player_nearest_section;
hit->distance = player_nearest;
}
}
int* camera_terrain_pick(unsigned char mode) {
return camera_terrain_pickEx(mode,camera_x,camera_y,camera_z,sin(camera_rot_x)*sin(camera_rot_y),cos(camera_rot_y),cos(camera_rot_x)*sin(camera_rot_y));
}
//kindly borrowed from https://stackoverflow.com/questions/16505905/walk-a-line-between-two-points-in-a-3d-voxel-space-visiting-all-cells
//adapted, original code by Wivlaro
int* camera_terrain_pickEx(unsigned char mode, float gx0, float gy0, float gz0, float ray_x, float ray_y, float ray_z) {
float gx1 = gx0+ray_x*128.0F;
float gy1 = gy0+ray_y*128.0F;
float gz1 = gz0+ray_z*128.0F;
int gx0idx = floor(gx0);
int gy0idx = floor(gy0);
int gz0idx = floor(gz0);
int gx1idx = floor(gx1);
int gy1idx = floor(gy1);
int gz1idx = floor(gz1);
int sx = gx1idx > gx0idx ? 1 : gx1idx < gx0idx ? -1 : 0;
int sy = gy1idx > gy0idx ? 1 : gy1idx < gy0idx ? -1 : 0;
int sz = gz1idx > gz0idx ? 1 : gz1idx < gz0idx ? -1 : 0;
int gx = gx0idx;
int gy = gy0idx;
int gz = gz0idx;
int gxp = gx0idx + (gx1idx > gx0idx ? 1 : 0);
int gyp = gy0idx + (gy1idx > gy0idx ? 1 : 0);
int gzp = gz0idx + (gz1idx > gz0idx ? 1 : 0);
float vx = gx1 == gx0 ? 1 : gx1 - gx0;
float vy = gy1 == gy0 ? 1 : gy1 - gy0;
float vz = gz1 == gz0 ? 1 : gz1 - gz0;
float vxvy = vx * vy;
float vxvz = vx * vz;
float vyvz = vy * vz;
float errx = (gxp - gx0) * vyvz;
float erry = (gyp - gy0) * vxvz;
float errz = (gzp - gz0) * vxvy;
float derrx = sx * vyvz;
float derry = sy * vxvz;
float derrz = sz * vxvy;
int gx_pre = gx, gy_pre = gy, gz_pre = gz;
static int ret[6];
ret[0] = ret[1] = ret[2] = 0;
ret[3] = ret[4] = ret[5] = 0;
while(1) {
if(gx>=map_size_x || gx<0 || gy<0 || gz>=map_size_z || gz<0) {
return NULL;
}
switch(mode) {
case 0:
if(!map_isair(gx,gy,gz) && map_isair(gx_pre,gy_pre,gz_pre)) {
ret[0] = gx_pre;
ret[1] = gy_pre;
ret[2] = gz_pre;
return ret;
}
break;
case 1:
if(!map_isair(gx,gy,gz)) {
ret[0] = gx;
ret[1] = gy;
ret[2] = gz;
ret[3] = gx_pre;
ret[4] = gy_pre;
ret[5] = gz_pre;
return ret;
}
break;
}
gx_pre = gx;
gy_pre = gy;
gz_pre = gz;
if (gx == gx1idx && gy == gy1idx && gz == gz1idx) break;
int xr = abs(errx);
int yr = abs(erry);
int zr = abs(errz);
if (sx != 0 && (sy == 0 || xr < yr) && (sz == 0 || xr < zr)) {
gx += sx;
errx += derrx;
}
else if (sy != 0 && (sz == 0 || yr < zr)) {
gy += sy;
erry += derry;
}
else if (sz != 0) {
gz += sz;
errz += derrz;
}
}
return NULL;
}
void camera_ExtractFrustum() {
float clip[16];
float t;
matrix_push();
matrix_load(matrix_model);
matrix_multiply(matrix_view);
matrix_multiply(matrix_projection);
memcpy(clip,matrix_current,16*sizeof(float));
matrix_pop();
/* Extract the numbers for the RIGHT plane */
frustum[0][0] = clip[ 3] - clip[ 0];
frustum[0][1] = clip[ 7] - clip[ 4];
frustum[0][2] = clip[11] - clip[ 8];
frustum[0][3] = clip[15] - clip[12];
/* Normalize the result */
t = sqrt( frustum[0][0] * frustum[0][0] + frustum[0][1] * frustum[0][1] + frustum[0][2] * frustum[0][2] );
frustum[0][0] /= t;
frustum[0][1] /= t;
frustum[0][2] /= t;
frustum[0][3] /= t;
/* Extract the numbers for the LEFT plane */
frustum[1][0] = clip[ 3] + clip[ 0];
frustum[1][1] = clip[ 7] + clip[ 4];
frustum[1][2] = clip[11] + clip[ 8];
frustum[1][3] = clip[15] + clip[12];
/* Normalize the result */
t = sqrt( frustum[1][0] * frustum[1][0] + frustum[1][1] * frustum[1][1] + frustum[1][2] * frustum[1][2] );
frustum[1][0] /= t;
frustum[1][1] /= t;
frustum[1][2] /= t;
frustum[1][3] /= t;
/* Extract the BOTTOM plane */
frustum[2][0] = clip[ 3] + clip[ 1];
frustum[2][1] = clip[ 7] + clip[ 5];
frustum[2][2] = clip[11] + clip[ 9];
frustum[2][3] = clip[15] + clip[13];
/* Normalize the result */
t = sqrt( frustum[2][0] * frustum[2][0] + frustum[2][1] * frustum[2][1] + frustum[2][2] * frustum[2][2] );
frustum[2][0] /= t;
frustum[2][1] /= t;
frustum[2][2] /= t;
frustum[2][3] /= t;
/* Extract the TOP plane */
frustum[3][0] = clip[ 3] - clip[ 1];
frustum[3][1] = clip[ 7] - clip[ 5];
frustum[3][2] = clip[11] - clip[ 9];
frustum[3][3] = clip[15] - clip[13];
/* Normalize the result */
t = sqrt( frustum[3][0] * frustum[3][0] + frustum[3][1] * frustum[3][1] + frustum[3][2] * frustum[3][2] );
frustum[3][0] /= t;
frustum[3][1] /= t;
frustum[3][2] /= t;
frustum[3][3] /= t;
/* Extract the FAR plane */
frustum[4][0] = clip[ 3] - clip[ 2];
frustum[4][1] = clip[ 7] - clip[ 6];
frustum[4][2] = clip[11] - clip[10];
frustum[4][3] = clip[15] - clip[14];
/* Normalize the result */
t = sqrt( frustum[4][0] * frustum[4][0] + frustum[4][1] * frustum[4][1] + frustum[4][2] * frustum[4][2] );
frustum[4][0] /= t;
frustum[4][1] /= t;
frustum[4][2] /= t;
frustum[4][3] /= t;
/* Extract the NEAR plane */
frustum[5][0] = clip[ 3] + clip[ 2];
frustum[5][1] = clip[ 7] + clip[ 6];
frustum[5][2] = clip[11] + clip[10];
frustum[5][3] = clip[15] + clip[14];
/* Normalize the result */
t = sqrt( frustum[5][0] * frustum[5][0] + frustum[5][1] * frustum[5][1] + frustum[5][2] * frustum[5][2] );
frustum[5][0] /= t;
frustum[5][1] /= t;
frustum[5][2] /= t;
frustum[5][3] /= t;
}
unsigned char camera_PointInFrustum(float x, float y, float z) {
int p;
for( p = 0; p < 6; p++ )
if( frustum[p][0] * x + frustum[p][1] * y + frustum[p][2] * z + frustum[p][3] <= 0 )
return 0;
return 1;
}
int camera_CubeInFrustum( float x, float y, float z, float size, float size_y) {
int p;
int c;
int c2 = 0;
for( p = 0; p < 6; p++ )
{
c = 0;
if( frustum[p][0] * (x - size) + frustum[p][1] * (y - size) + frustum[p][2] * (z - size) + frustum[p][3] > 0 )
c++;
if( frustum[p][0] * (x + size) + frustum[p][1] * (y - size) + frustum[p][2] * (z - size) + frustum[p][3] > 0 )
c++;
if( frustum[p][0] * (x - size) + frustum[p][1] * (y + size_y) + frustum[p][2] * (z - size) + frustum[p][3] > 0 )
c++;
if( frustum[p][0] * (x + size) + frustum[p][1] * (y + size_y) + frustum[p][2] * (z - size) + frustum[p][3] > 0 )
c++;
if( frustum[p][0] * (x - size) + frustum[p][1] * (y) + frustum[p][2] * (z + size) + frustum[p][3] > 0 )
c++;
if( frustum[p][0] * (x + size) + frustum[p][1] * (y) + frustum[p][2] * (z + size) + frustum[p][3] > 0 )
c++;
if( frustum[p][0] * (x - size) + frustum[p][1] * (y + size_y) + frustum[p][2] * (z + size) + frustum[p][3] > 0 )
c++;
if( frustum[p][0] * (x + size) + frustum[p][1] * (y + size_y) + frustum[p][2] * (z + size) + frustum[p][3] > 0 )
c++;
if( c == 0 )
return 0;
if( c == 8 )
c2++;
}
return (c2 == 6) ? 2 : 1;
}