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
|
/*
* Copyright (C) 2021 P. J. McDermott
*
* This file is part of Dodge Balls
*
* Dodge Balls 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.
*
* Dodge Balls 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 Dodge Balls. If not, see <http://www.gnu.org/licenses/>.
*/
#include <SDL.h>
#include "collision.h"
int
db_pt_in_rect(int x, int y, SDL_Rect *rect)
{
if (x < rect->x) {
return 0;
}
if (y < rect->y) {
return 0;
}
if (x > rect->x + rect->w) {
return 0;
}
if (y > rect->y + rect->h) {
return 0;
}
return 1;
}
void
db_closest_pt_on_rect(int x, int y, SDL_Rect *rect,
double *close_x, double *close_y)
{
*close_x = x;
if (x < rect->x) {
*close_x = rect->x;
} else if (x > rect->x + rect->w) {
*close_x = rect->x + rect->w;
}
*close_y = y;
if (y < rect->y) {
*close_y = rect->y;
} else if (y > rect->y + rect->h) {
*close_y = rect->y + rect->h;
}
}
int
db_col_cir_rect(int x, int y, int r, SDL_Rect *rect,
double *col_x, double *col_y)
{
db_closest_pt_on_rect(x, y, rect, col_x, col_y);
return (r * r) >=
((*col_x - x) * (*col_x - x) + (*col_y - y) * (*col_y - y));
}
int
db_col_cir_cir(double x1, double y1, double r1, double x2, double y2, double r2)
{
return ((r1 + r2) * (r1 + r2)) >=
((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
/*
* This function will be called after moving the two balls being checked. A
* more accurate way to handle collisions would be to microstep through
* movements to find the exact point of collision.
*/
int
db_col_pt_cir_cir(double x1, double y1, double r1,
double x2, double y2, double r2, double *col_x, double *col_y)
{
if (db_col_cir_cir(x1, y1, r1, x2, y2, r2)) {
*col_x = (x1 + x2) / 2.0;
*col_y = (y1 + y2) / 2.0;
return 1;
} else {
return 0;
}
}
|
