C#练习题答案: 多边形方向【难度：4级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

本文链接：https://blog.csdn.net/weixin_45444821/article/details/103210833

多边形方向【难度:4级】:

答案1:

using System.Collections.Generic;
using System.Drawing;

public static class Kata
{
  public static bool PolyOrientation(List<PointF> Poly)
  {
    float sum = 0;
    for (int v = 0; v < Poly.Count; v++)
    {
      int v_prev = v > 0 ? v - 1 : Poly.Count - 1;
      sum += (Poly[v].X - Poly[v_prev].X) * (Poly[v].Y + Poly[v_prev].Y);
    }
    return sum > 0;
  }
}

答案2:

using System.Collections.Generic;
using System.Drawing;

public static class Kata
{
    public static bool PolyOrientation(List<PointF> Poly)
    {
        int m = Poly.Count;
        double d = 0;
        for (int i = 0; i < Poly.Count; i++)
        {
            double x1 = Poly[i % m].X, x2 = Poly[(i + 1) % m].X, x3 = Poly[(i + 2) % m].X;
            double y1 = Poly[i % m].Y, y2 = Poly[(i + 1) % m].Y, y3 = Poly[(i + 2) % m].Y;
            d += (x1 * y2 + x2 * y3 + x3 * y1) - (y1 * x2 + y2 * x3 + y3 * x1);
        }
        return (d < 0);
    }
}

答案3:

using System.Collections.Generic;
using System.Drawing;

public static class Kata
{
  public static bool PolyOrientation(List<PointF> Poly)
  {
    float a = 0;
    for (var index = 0; index < Poly.Count; index++)
    {
      var nextPointIndex = (index + 1) % Poly.Count;
      a += (Poly[nextPointIndex].X - Poly[index].X) * (Poly[nextPointIndex].Y + Poly[index].Y);
    }
    return a >= 0;
  }
}