2DPhysicsEngine/logic.cpp at master · loloolk/2DPhysicsEngine · GitHub

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
#include "objects.cpp"

std::vector<std::array<object*, 2>> colliding;

bool doesCollide(object& obj1, object& obj2) { //Broken
    if (obj1.type == "square") {
        if (obj2.type == "square") {
            return collide((square&)obj1, (square&)obj2);
        }
        else if (obj2.type == "rectangle") {
            return collide((square&)obj1, (rectangle&)obj2);
        }
        else if (obj2.type == "circle") {
            return collide((square&)obj1, (circle&)obj2);
        }
    }
    else if (obj1.type == "rectangle") {
        if (obj2.type == "square") {
            return collide((rectangle&)obj1, (square&)obj2);
        }
        else if (obj2.type == "rectangle") {
            return collide((rectangle&)obj1, (rectangle&)obj2);
        }
        else if (obj2.type == "circle") {
            return collide((rectangle&)obj1, (circle&)obj2);
        }
    }
    else if (obj1.type == "circle") {
        if (obj2.type == "square") {
            return collide((circle&)obj1, (square&)obj2);
        }
        else if (obj2.type == "rectangle") {
            return collide((circle&)obj1, (rectangle&)obj2);
        }
        else if (obj2.type == "circle") {
            return collide((circle&)obj1, (circle&)obj2);
        }
    }
    return false;
}

mtn::Vector2 findClosestObject(mtn::Vector2& v) {
    mtn::Vector2 closest;
    float closestDist = 999999999;
    for (int i = 0; i < objects.size(); i++) {
        float dist = sqrt(pow(objects[i]->position.x - v.x, 2) + pow(objects[i]->position.y - v.y, 2));
        if (dist < closestDist && dist != 0) {
            closestDist = dist;
            closest = objects[i]->position;
        }
    }

    return closest;
}

void checkCollisions(object& obj) {
    mtn::Vector2 closest = findClosestObject(obj.position);
    for (int i = 0; i < objects.size(); i++) {
        if (objects[i]->position == closest && !(objects[i] == &obj) && doesCollide(obj, *objects[i])) {
            colliding.push_back({&obj, objects[i]});
        }
    }
}

void collisionLogic(object& obj1, object& obj2) {
   return;
}

void update() {
    //Start: Print out all object's locations
    /*for (int i = 0; i < objects.size(); i++) {
        std::cout << "Object " << i + 1 << ": " << objects[i]->position << std::endl;
    }
    */

    //Start: Check for collisions
    for (int i = 0; i < objects.size(); i++) {
        objects[i]->update();

        checkCollisions(*objects[i]);
    }

    //End: Check for collisions
    for (int i = 0; i < colliding.size(); i++) {
        //std::cout << "Collision with " << colliding[i][0]->position << " and " << colliding[i][1]->position << std::endl;
    }


    colliding.clear();
}

//line detecting where they go for skipover problem
//finalVel.x = (obj1.momentum.x + obj2.momentum.x) / obj1.mass + obj2.mass