private static void FlipEdgeEvent(DTSweepContext tcx, TriangulationPoint ep, TriangulationPoint eq, DelaunayTriangle t, TriangulationPoint p)
{
DelaunayTriangle delaunayTriangle = t.NeighborAcross(p);
TriangulationPoint triangulationPoint = delaunayTriangle.OppositePoint(t, p);
bool flag = delaunayTriangle == null;
if (flag)
{
throw new InvalidOperationException("[BUG:FIXME] FLIP failed due to missing triangle");
}
bool constrainedEdgeAcross = t.GetConstrainedEdgeAcross(p);
if (constrainedEdgeAcross)
{
throw new Exception("Intersecting Constraints");
}
bool flag2 = TriangulationUtil.InScanArea(p, t.PointCCW(p), t.PointCW(p), triangulationPoint);
bool flag3 = flag2;
if (flag3)
{
DTSweep.RotateTrianglePair(t, p, delaunayTriangle, triangulationPoint);
tcx.MapTriangleToNodes(t);
tcx.MapTriangleToNodes(delaunayTriangle);
bool flag4 = p == eq && triangulationPoint == ep;
if (flag4)
{
bool flag5 = eq == tcx.EdgeEvent.ConstrainedEdge.Q && ep == tcx.EdgeEvent.ConstrainedEdge.P;
if (flag5)
{
bool isDebugEnabled = tcx.IsDebugEnabled;
if (isDebugEnabled)
{
Console.WriteLine("[FLIP] - constrained edge done");
}
t.MarkConstrainedEdge(ep, eq);
delaunayTriangle.MarkConstrainedEdge(ep, eq);
DTSweep.Legalize(tcx, t);
DTSweep.Legalize(tcx, delaunayTriangle);
}
else
{
bool isDebugEnabled2 = tcx.IsDebugEnabled;
if (isDebugEnabled2)
{
Console.WriteLine("[FLIP] - subedge done");
}
}
}
else
{
bool isDebugEnabled3 = tcx.IsDebugEnabled;
if (isDebugEnabled3)
{
Console.WriteLine("[FLIP] - flipping and continuing with triangle still crossing edge");
}
Orientation o = TriangulationUtil.Orient2d(eq, triangulationPoint, ep);
t = DTSweep.NextFlipTriangle(tcx, o, t, delaunayTriangle, p, triangulationPoint);
DTSweep.FlipEdgeEvent(tcx, ep, eq, t, p);
}
}
else
{
TriangulationPoint p2 = DTSweep.NextFlipPoint(ep, eq, delaunayTriangle, triangulationPoint);
DTSweep.FlipScanEdgeEvent(tcx, ep, eq, t, delaunayTriangle, p2);
DTSweep.EdgeEvent(tcx, ep, eq, t, p);
}
}
private static void FinalizationConvexHull(DTSweepContext tcx)
{
AdvancingFrontNode advancingFrontNode = tcx.aFront.Head.Next;
AdvancingFrontNode advancingFrontNode2 = advancingFrontNode.Next;
DTSweep.TurnAdvancingFrontConvex(tcx, advancingFrontNode, advancingFrontNode2);
advancingFrontNode = tcx.aFront.Tail.Prev;
bool flag = advancingFrontNode.Triangle.Contains(advancingFrontNode.Next.Point) && advancingFrontNode.Triangle.Contains(advancingFrontNode.Prev.Point);
DelaunayTriangle delaunayTriangle;
if (flag)
{
delaunayTriangle = advancingFrontNode.Triangle.NeighborAcross(advancingFrontNode.Point);
DTSweep.RotateTrianglePair(advancingFrontNode.Triangle, advancingFrontNode.Point, delaunayTriangle, delaunayTriangle.OppositePoint(advancingFrontNode.Triangle, advancingFrontNode.Point));
tcx.MapTriangleToNodes(advancingFrontNode.Triangle);
tcx.MapTriangleToNodes(delaunayTriangle);
}
advancingFrontNode = tcx.aFront.Head.Next;
bool flag2 = advancingFrontNode.Triangle.Contains(advancingFrontNode.Prev.Point) && advancingFrontNode.Triangle.Contains(advancingFrontNode.Next.Point);
if (flag2)
{
delaunayTriangle = advancingFrontNode.Triangle.NeighborAcross(advancingFrontNode.Point);
DTSweep.RotateTrianglePair(advancingFrontNode.Triangle, advancingFrontNode.Point, delaunayTriangle, delaunayTriangle.OppositePoint(advancingFrontNode.Triangle, advancingFrontNode.Point));
tcx.MapTriangleToNodes(advancingFrontNode.Triangle);
tcx.MapTriangleToNodes(delaunayTriangle);
}
TriangulationPoint point = tcx.aFront.Head.Point;
advancingFrontNode2 = tcx.aFront.Tail.Prev;
delaunayTriangle = advancingFrontNode2.Triangle;
TriangulationPoint triangulationPoint = advancingFrontNode2.Point;
advancingFrontNode2.Triangle = null;
DelaunayTriangle delaunayTriangle2;
while (true)
{
tcx.RemoveFromList(delaunayTriangle);
triangulationPoint = delaunayTriangle.PointCCW(triangulationPoint);
bool flag3 = triangulationPoint == point;
if (flag3)
{
break;
}
delaunayTriangle2 = delaunayTriangle.NeighborCCW(triangulationPoint);
delaunayTriangle.Clear();
delaunayTriangle = delaunayTriangle2;
}
point = tcx.aFront.Head.Next.Point;
triangulationPoint = delaunayTriangle.PointCW(tcx.aFront.Head.Point);
delaunayTriangle2 = delaunayTriangle.NeighborCW(tcx.aFront.Head.Point);
delaunayTriangle.Clear();
delaunayTriangle = delaunayTriangle2;
while (triangulationPoint != point)
{
tcx.RemoveFromList(delaunayTriangle);
triangulationPoint = delaunayTriangle.PointCCW(triangulationPoint);
delaunayTriangle2 = delaunayTriangle.NeighborCCW(triangulationPoint);
delaunayTriangle.Clear();
delaunayTriangle = delaunayTriangle2;
}
tcx.aFront.Head = tcx.aFront.Head.Next;
tcx.aFront.Head.Prev = null;
tcx.aFront.Tail = tcx.aFront.Tail.Prev;
tcx.aFront.Tail.Next = null;
tcx.FinalizeTriangulation();
}
private static void EdgeEvent(DTSweepContext tcx, TriangulationPoint ep, TriangulationPoint eq, DelaunayTriangle triangle, TriangulationPoint point)
{
bool flag = DTSweep.IsEdgeSideOfTriangle(triangle, ep, eq);
if (!flag)
{
TriangulationPoint triangulationPoint = triangle.PointCCW(point);
Orientation orientation = TriangulationUtil.Orient2d(eq, triangulationPoint, ep);
bool flag2 = orientation == Orientation.Collinear;
if (flag2)
{
bool flag3 = triangle.Contains(eq, triangulationPoint);
if (!flag3)
{
throw new PointOnEdgeException("EdgeEvent - Point on constrained edge not supported yet");
}
triangle.MarkConstrainedEdge(eq, triangulationPoint);
tcx.EdgeEvent.ConstrainedEdge.Q = triangulationPoint;
triangle = triangle.NeighborAcross(point);
DTSweep.EdgeEvent(tcx, ep, triangulationPoint, triangle, triangulationPoint);
bool isDebugEnabled = tcx.IsDebugEnabled;
if (isDebugEnabled)
{
Debug.WriteLine("EdgeEvent - Point on constrained edge");
}
}
else
{
TriangulationPoint triangulationPoint2 = triangle.PointCW(point);
Orientation orientation2 = TriangulationUtil.Orient2d(eq, triangulationPoint2, ep);
bool flag4 = orientation2 == Orientation.Collinear;
if (flag4)
{
bool flag5 = triangle.Contains(eq, triangulationPoint2);
if (!flag5)
{
throw new PointOnEdgeException("EdgeEvent - Point on constrained edge not supported yet");
}
triangle.MarkConstrainedEdge(eq, triangulationPoint2);
tcx.EdgeEvent.ConstrainedEdge.Q = triangulationPoint2;
triangle = triangle.NeighborAcross(point);
DTSweep.EdgeEvent(tcx, ep, triangulationPoint2, triangle, triangulationPoint2);
bool isDebugEnabled2 = tcx.IsDebugEnabled;
if (isDebugEnabled2)
{
Debug.WriteLine("EdgeEvent - Point on constrained edge");
}
}
else
{
bool flag6 = orientation == orientation2;
if (flag6)
{
bool flag7 = orientation == Orientation.CW;
if (flag7)
{
triangle = triangle.NeighborCCW(point);
}
else
{
triangle = triangle.NeighborCW(point);
}
DTSweep.EdgeEvent(tcx, ep, eq, triangle, point);
}
else
{
DTSweep.FlipEdgeEvent(tcx, ep, eq, triangle, point);
}
}
}
}
}
