一、碰撞检测中的broad phase中的常见算法
该算在 这篇文章 中有比较简单而准确的描述，由于这里描述的思路并不复杂，但是是所有物理引擎中碰撞检测的入门级功课，所以这里写代码加深下对于该简单算法的理解。同样为了避免链接失效，这个地方拷贝下关键内容：
Let's see what this means using the simplest "flavor" of the SAP algorithms, non-persistent single axis SAP:
- Fill a list called "axisList" with all objects in the world. Sort this list on one axis (here the x-axis) by the begin of the bounding box (Sort by Object.BoundingBox.Min.X, With "Min" and "Max" the vectors defining the bounding box). So you know that the most left point of object5 is more left then the most left point on object6 when you look directly at the X-Axis.
- Create a new temporary list called "activeList". You begin on the left of your axisList, adding the first item to the activeList. Now you have a look at the next item in the axisList and compare it with all items currently in the activeList (at the moment just one): If the new item's left is greater then the current activeList-item right, then remove the activeList-item from the activeList – otherwise report a possible collision between the new axisList-item and the current activeList-item. Add the new item itself to the activeList and continue with the next item in the axisList.
二、简单代码验证
下面代码没有在真是环境下运行过，不保证正确性。
1、测试代码
tsecer@harry: cat AABBSAP.cpp
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
struct Box
{
int miMin;
int miMax;
};
bool operator < (const Box &rlhs, const Box &rhs)
{
return rlhs.miMin < rhs.miMin;
}
struct Pair
{
Box mb0;
Box mb1;
};
vector<Box> gstAxisBox, gstActiveBox;
vector<Pair> gstPair;
void addBox(Box &rstBox)
{
for (auto iter = gstActiveBox.begin(); iter != gstActiveBox.end(); )
{
if (iter->miMax < rstBox.miMin)
{
//remove iter form activeBox
iter = gstActiveBox.erase(iter);
continue;
}
else if (iter->miMax > rstBox.miMin)
{
//report collision
gstPair.push_back((Pair){*iter, rstBox});
}
iter++;
}
//add rstBox to activeBox
gstActiveBox.push_back(rstBox);
}
void InitializeBoxList(int iBoxCount, int iRange)
{
srand(time(NULL));
for (int i = 0; i < iBoxCount; i++)
{
int min = rand() % iRange, max = rand() % iRange;
if (min > max)
{
swap(min, max);
}
gstAxisBox.push_back((Box){min, max});
}
}
int main(int argc, char *argv[])
{
InitializeBoxList(argc > 1 ? atoi(argv[1]) : 3,
argc > 2 ? atoi(argv[2]) : 20);
std::sort(gstAxisBox.begin(), gstAxisBox.end());
printf("randomize AxisBox list
");
for (auto iter = gstAxisBox.begin(); iter != gstAxisBox.end(); iter++)
{
printf("box[%d] [%d, %d]
", iter - gstAxisBox.begin(), iter->miMin, iter->miMax);
addBox(*iter);
}
printf("
");
for (auto iter = gstPair.begin(); iter != gstPair.end(); iter++)
{
printf("b0min %d b0max %d b1min %d b1max %d
", iter->mb0.miMin, iter->mb0.miMax, iter->mb1.miMin, iter->mb1.miMax);
}
return 0;
}
2、编译之后运行结果
tsecer@harry: g++ -std=c++11 AABBSAP.cpp
tsecer@harry: ./a.out 5 20
randomize AxisBox list
box[0] [1, 7]
box[1] [2, 16]
box[2] [7, 11]
box[3] [15, 18]
box[4] [16, 17]
b0min 1 b0max 7 b1min 2 b1max 16
b0min 2 b0max 16 b1min 7 b1max 11
b0min 2 b0max 16 b1min 15 b1max 18
b0min 15 b0max 18 b1min 16 b1max 17
tsecer@harry: