Convex Hulls的Gift wrapping算法求解
Convex Hulls
这是MIT软件构造课程的实验中的一道题目。做这道题我卡了挺长时间,所以在完成之后来这里写写总结叭
gitf wrapping算法
这个算法简单理解就是说从最左边的点开始,不断地去寻找偏转角度最小的点,直到把所有点都框起来。
求起始点
那按照这个思路,我们就先找最左边的点,这个时候就得考虑,当多个点的x坐标均为最小值的时候,该怎么办。
可以渐渐前四个点就有三个x为1,所以需要考虑到底哪个点为起始点。为了消除歧义,我选择了左下角的点作为起始点。
求最小偏移量
随后就是求最小偏转量,这里我卡了很久,最后发现是arctan角度关系没理清。也就是提醒大家,arctan的角度范围在 (-90°,90°)。
下面是我写的代码
public static double calculateBearingToPoint2(double currentBearing, double currentX, double currentY,
double targetX, double targetY) {
try {
double degree = 0;
if (targetY - currentY == 0) {
if (targetX - currentX < 0) {
degree = 270 - currentBearing;
} else if (targetX - currentX > 0) {
degree = 90 - currentBearing;
}
if (degree < 0) {
degree += 360;
}
return degree;
}
if (targetX - currentX == 0) {
if (targetY - currentY < 0) {
degree = 180 - currentBearing;
} else if (targetY - currentY > 0) {
degree = 360 - currentBearing;
}
if (degree < 0) {
degree += 360;
}
if (degree == 360) {
degree = 0;
}
return degree;
}
degree = Math.toDegrees(Math.atan((double) (targetY - currentY) / (targetX - currentX)));
if (targetY - currentY > 0) {
if (targetX - currentX > 0) {
degree = degree - currentBearing;
} else if (targetX - currentX < 0) {
degree = degree - currentBearing + 360;
}
} else if (targetY - currentY < 0) {
if (targetX - currentX > 0) {
degree = 90 - degree - currentBearing;
} else if (targetX - currentX < 0) {
degree = 180 + (90-degree) - currentBearing;
}
}
if (degree < 0) {
degree += 360;
}
if (degree == 360) {
degree = 0;
}
return degree;
} catch (Exception e) {
return 0;
}
}
总之,写代码前一定要弄清楚角度关系,不然233333