/// <summary>
/// 多边形决策。
/// </summary>
/// <param name="ls2d"></param>
/// <param name="targetPoint"></param>
/// <param name="middlePoint"></param>
public static bool GetNearPointInEdge(Polygon2D poly, Polygon2D mainPoly_, Polygon2D diffPoly_, Point2D ls2d, Double2 curPoint, List <Double3> listMiddlePoint, ref Double3 nextPoint)
{
if (listMiddlePoint == null || listMiddlePoint.Count == 0)
{
return(false);
}
else
{
int k = 0;
if (curPoint != ls2d.startPoint)
{
for (int i = listMiddlePoint.Count - 1; i >= 0; i--)
{
// 找到了
Double2 temp = new Double2(listMiddlePoint[i].x, listMiddlePoint[i].y);
Double2 diff = curPoint - temp;
bool ret = System.Math.Abs(diff.x) <= MathUtil.kEpsilon && System.Math.Abs(diff.y) <= MathUtil.kEpsilon;
if (ret == true)
{
if (i < listMiddlePoint.Count - 1)
{
k = i + 1;
break;
}
else
{
return(false);
}
}
}
}
else
{
// 过重复点
while (k < listMiddlePoint.Count - 1 && (listMiddlePoint[k].x == listMiddlePoint[k + 1].x && listMiddlePoint[k].y == listMiddlePoint[k + 1].y))
{
k++;
}
}
Point2D otherEdge = PolygonBool.GetOtherEdge(poly, mainPoly_, diffPoly_, (int)listMiddlePoint[k].z);
if (Double2.Cross(ls2d.endPoint - ls2d.startPoint, otherEdge.endPoint - otherEdge.startPoint) == 0 && k < listMiddlePoint.Count - 1)
{
k++;
}
//
nextPoint = listMiddlePoint[k];
if (curPoint == new Double2(nextPoint.x, nextPoint.y))
{
return(false);
}
return(true);
}
}
/// <summary>
/// 求多边形的和。
/// </summary>
/// <param name="mainPoly">逆时针序列</param>
/// <param name="addPoly">逆时针序列</param>
/// <returns></returns>
public static Double2[] CalcPoly(Double2[] mainPoly, Double2[] addPoly)
{
if (mainPoly == null || mainPoly.Length < 3)
{
return(null);
}
if (addPoly == null || addPoly.Length < 3)
{
return(mainPoly);
}
//
Polygon2D mainPoly_ = new Polygon2D(mainPoly);
Polygon2D diffPoly_ = new Polygon2D(addPoly);
// 获取边上的交点
List <Double3>[] mainPolyIntersectArray = new List <Double3> [mainPoly_.GetEdgeNum()];
List <Double3>[] addPolyIntersectArray = new List <Double3> [diffPoly_.GetEdgeNum()];
PolygonBool.GetAllEdgeInterSectPoint(mainPoly_, diffPoly_, ref mainPolyIntersectArray, ref addPolyIntersectArray);
// 没有交点直接返回呗
bool CheckIntersect = false;
foreach (List <Double3> list in mainPolyIntersectArray)
{
if (list != null && list.Count > 0)
{
CheckIntersect = true;
break;
}
}
if (CheckIntersect == false)
{
PolygonBool.ClearPolyIntersectArray(ref mainPolyIntersectArray, ref addPolyIntersectArray);
return(mainPoly);
}
// 有交点的处理
List <Double2> listPoint = new List <Double2>();
int curedge = 0;
Double2 curPoint = Double2.zero;
// 查找在diffpoly外的一个顶点。
if (PolygonBool.FindOutDiffPointPoint(mainPoly_, diffPoly_, ref curPoint, ref curedge) == false)
{
return(mainPoly);
}
// 初始化数据。
Polygon2D poly = mainPoly_;
List <Double3>[] curPolyIntersectArray = mainPolyIntersectArray;
while (poly != null && curedge >= 0 && curedge < poly.GetEdgeNum())
{
Point2D ls2d = poly.GetSimpleEdge(curedge);
if (PolygonBool.AddPoint(listPoint, curPoint) == false)
{
break;
}
Double3 nextPoint = Double3.zero;
bool ret = PolygonBool.GetNearPointInEdge(poly, mainPoly_, diffPoly_, ls2d, curPoint, curPolyIntersectArray[curedge], ref nextPoint);
if (ret == false)
{
curedge++;
if (curedge >= poly.GetEdgeNum())
{
curedge = 0;
}
curPoint = poly.GetEdge(curedge).startPoint;
}
else // 则需要交换了。
{
Point2D otherEdge = PolygonBool.GetOtherEdge(poly, mainPoly_, diffPoly_, (int)nextPoint.z);
if (Double2.Cross(ls2d.endPoint - ls2d.startPoint, otherEdge.endPoint - otherEdge.startPoint) <= 0) // 进一步判断是否需要更换
{
curPoint = new Double2(nextPoint.x, nextPoint.y);
curedge = (int)nextPoint.z;
PolygonBool.ExChangePoly(ref poly, mainPoly_, diffPoly_, ref curPolyIntersectArray, mainPolyIntersectArray, addPolyIntersectArray);
}
else // 不需要变换了。
{
curedge++;
if (curedge >= poly.GetEdgeNum())
{
curedge = 0;
}
curPoint = poly.GetEdge(curedge).startPoint;
}
}
}
PolygonBool.ClearPolyIntersectArray(ref mainPolyIntersectArray, ref addPolyIntersectArray);
return(listPoint.ToArray());
}