1 #ifndef SWEEPNPRUNEALGORITHMMULTI_H
2 #define SWEEPNPRUNEALGORITHMMULTI_H
5 #include <unordered_map>
7 #include "boundingbox.h"
82 void calculateNextTimestep();
85 std::vector<BoundingBox*> boundingBoxes;
86 void insertionSort(std::vector<BoundingBox*>& boxes,
int dimension);
87 std::vector<Boundary*> boundariesX;
88 std::vector<Boundary*> boundariesY;
89 std::vector<Boundary*> boundariesZ;
90 void insertionSort(std::vector<Boundary*>& bounds);
92 std::unordered_map<int, std::pair<BoundingBox*, BoundingBox*>*> possibleCollisions;
94 void updateMap(
int dimension);
97 #endif // SWEEPNPRUNEALGORITHMMULTI_H
The Algorithm class is a parent to all the specific Algorithms we test.
Definition: algorithm.h:16
SweepNPruneAlgorithmMulti(int xIn, int yIn, int numParticles)
Constructs a 2d SweepNPruneAlgorithmMulti.
Definition: sweepnprunealgorithmmulti.cpp:3
The SweepNPruneAlgorithmMulti class executes the sweep and prune method of collision detection in mul...
Definition: sweepnprunealgorithmmulti.h:25