菜鸟写博客,勿喷;
注:算法的原理描述及图片均来自《地理信息系统算法基础》一书;
原理:这线段的拐向判断方法可以直接由矢量叉积的性质推出,对于有公共端点的线段P0P1和P1P2,通过计算(P2-P0)×(P1-P0)的符号便可确定;具体确定原理如下图所示:
实现:
#region==判断三点组成的折线的拐向==
/// <summary>
/// 判断三点组成的折线的拐点方向
/// </summary>
/// <param name="pt1">点1.</param>
/// <param name="pt2">点2.</param>
/// <param name="pt3">点3.</param>
/// <returns>0:直线;1:右拐;-1:左拐</returns>
public static int brokenlineDirection(Point pt1,Point pt2,Point pt3)
{
double X20, Y20, X10, Y10, vectorValue;
X20 = pt3.X - pt1.X;
Y20 = pt3.Y - pt1.Y;
X10 = pt2.X - pt1.X;
Y10 = pt2.Y - pt1.Y;
vectorValue = X20 * Y10 - Y20 * X10;
if (vectorValue == 0)
return 0;
else if (vectorValue > 0)
return 1;
else
return -1;
}