private static List <Vertices> TriangulatePolygon(Vertices vertices, FP tolerance)
{
bool flag = vertices.Count < 3;
List <Vertices> result;
if (flag)
{
result = new List <Vertices>();
}
else
{
List <Vertices> list = new List <Vertices>();
Vertices pin = new Vertices(vertices);
Vertices vertices2;
Vertices vertices3;
bool flag2 = EarclipDecomposer.ResolvePinchPoint(pin, out vertices2, out vertices3, tolerance);
if (flag2)
{
List <Vertices> list2 = EarclipDecomposer.TriangulatePolygon(vertices2, tolerance);
List <Vertices> list3 = EarclipDecomposer.TriangulatePolygon(vertices3, tolerance);
bool flag3 = list2.Count == -1 || list3.Count == -1;
if (flag3)
{
throw new Exception("Can't triangulate your polygon.");
}
for (int i = 0; i < list2.Count; i++)
{
list.Add(new Vertices(list2[i]));
}
for (int j = 0; j < list3.Count; j++)
{
list.Add(new Vertices(list3[j]));
}
result = list;
}
else
{
Vertices[] array = new Vertices[vertices.Count - 2];
int num = 0;
FP[] array2 = new FP[vertices.Count];
FP[] array3 = new FP[vertices.Count];
for (int k = 0; k < vertices.Count; k++)
{
array2[k] = vertices[k].x;
array3[k] = vertices[k].y;
}
int l = vertices.Count;
while (l > 3)
{
int num2 = -1;
FP y = -10f;
for (int m = 0; m < l; m++)
{
bool flag4 = EarclipDecomposer.IsEar(m, array2, array3, l);
if (flag4)
{
int num3 = EarclipDecomposer.Remainder(m - 1, l);
int num4 = EarclipDecomposer.Remainder(m + 1, l);
TSVector2 tSVector = new TSVector2(array2[num4] - array2[m], array3[num4] - array3[m]);
TSVector2 tSVector2 = new TSVector2(array2[m] - array2[num3], array3[m] - array3[num3]);
TSVector2 tSVector3 = new TSVector2(array2[num3] - array2[num4], array3[num3] - array3[num4]);
tSVector.Normalize();
tSVector2.Normalize();
tSVector3.Normalize();
FP fP;
MathUtils.Cross(ref tSVector, ref tSVector2, out fP);
fP = FP.Abs(fP);
FP fP2;
MathUtils.Cross(ref tSVector2, ref tSVector3, out fP2);
fP2 = FP.Abs(fP2);
FP fP3;
MathUtils.Cross(ref tSVector3, ref tSVector, out fP3);
fP3 = FP.Abs(fP3);
FP fP4 = TSMath.Min(fP, TSMath.Min(fP2, fP3));
bool flag5 = fP4 > y;
if (flag5)
{
num2 = m;
y = fP4;
}
}
}
bool flag6 = num2 == -1;
if (flag6)
{
for (int n = 0; n < num; n++)
{
list.Add(array[n]);
}
result = list;
return(result);
}
l--;
FP[] array4 = new FP[l];
FP[] array5 = new FP[l];
int num5 = 0;
for (int num6 = 0; num6 < l; num6++)
{
bool flag7 = num5 == num2;
if (flag7)
{
num5++;
}
array4[num6] = array2[num5];
array5[num6] = array3[num5];
num5++;
}
int num7 = (num2 == 0) ? l : (num2 - 1);
int num8 = (num2 == l) ? 0 : (num2 + 1);
EarclipDecomposer.Triangle triangle = new EarclipDecomposer.Triangle(array2[num2], array3[num2], array2[num8], array3[num8], array2[num7], array3[num7]);
array[num] = triangle;
num++;
array2 = array4;
array3 = array5;
}
EarclipDecomposer.Triangle triangle2 = new EarclipDecomposer.Triangle(array2[1], array3[1], array2[2], array3[2], array2[0], array3[0]);
array[num] = triangle2;
num++;
for (int num9 = 0; num9 < num; num9++)
{
list.Add(new Vertices(array[num9]));
}
result = list;
}
}
return(result);
}
private static bool IsEar(int i, FP[] xv, FP[] yv, int xvLength)
{
bool flag = i >= xvLength || i < 0 || xvLength < 3;
bool result;
if (flag)
{
result = false;
}
else
{
int num = i + 1;
int num2 = i - 1;
bool flag2 = i == 0;
FP x;
FP y;
FP x2;
FP y2;
if (flag2)
{
x = xv[0] - xv[xvLength - 1];
y = yv[0] - yv[xvLength - 1];
x2 = xv[1] - xv[0];
y2 = yv[1] - yv[0];
num2 = xvLength - 1;
}
else
{
bool flag3 = i == xvLength - 1;
if (flag3)
{
x = xv[i] - xv[i - 1];
y = yv[i] - yv[i - 1];
x2 = xv[0] - xv[i];
y2 = yv[0] - yv[i];
num = 0;
}
else
{
x = xv[i] - xv[i - 1];
y = yv[i] - yv[i - 1];
x2 = xv[i + 1] - xv[i];
y2 = yv[i + 1] - yv[i];
}
}
FP x3 = x * y2 - x2 * y;
bool flag4 = x3 > 0;
if (flag4)
{
result = false;
}
else
{
EarclipDecomposer.Triangle triangle = new EarclipDecomposer.Triangle(xv[i], yv[i], xv[num], yv[num], xv[num2], yv[num2]);
for (int j = 0; j < xvLength; j++)
{
bool flag5 = j == i || j == num2 || j == num;
if (!flag5)
{
bool flag6 = triangle.IsInside(xv[j], yv[j]);
if (flag6)
{
result = false;
return(result);
}
}
}
result = true;
}
}
return(result);
}