private static void finalizationPolygon(DTSweepContext tcx)
{
// Get an Internal triangle to start with
DelaunayTriangle t = tcx.aFront.head.next.triangle;
TriangulationPoint p = tcx.aFront.head.next.point;
while (!t.getConstrainedEdgeCW(p))
{
t = t.neighborCCW(p);
}
// Collect interior triangles constrained by edges
tcx.meshClean(t);
}
/// <summary>
/// Rotates a triangle pair one vertex CW
/// <code>
/// n2 n2
/// P +-----+ P +-----+
/// | t /| |\ t |
/// | / | | \ |
/// n1| / |n3 n1| \ |n3
/// | / | after CW | \ |
/// |/ oT | | oT \|
/// +-----+ oP +-----+
/// n4 n4
/// </code>
/// </summary>
private static void rotateTrianglePair(DelaunayTriangle t,
TriangulationPoint p,
DelaunayTriangle ot,
TriangulationPoint op)
{
DelaunayTriangle n1, n2, n3, n4;
n1 = t.neighborCCW(p);
n2 = t.neighborCW(p);
n3 = ot.neighborCCW(op);
n4 = ot.neighborCW(op);
bool ce1, ce2, ce3, ce4;
ce1 = t.getConstrainedEdgeCCW(p);
ce2 = t.getConstrainedEdgeCW(p);
ce3 = ot.getConstrainedEdgeCCW(op);
ce4 = ot.getConstrainedEdgeCW(op);
bool de1, de2, de3, de4;
de1 = t.getDelunayEdgeCCW(p);
de2 = t.getDelunayEdgeCW(p);
de3 = ot.getDelunayEdgeCCW(op);
de4 = ot.getDelunayEdgeCW(op);
t.legalize(p, op);
ot.legalize(op, p);
// Remap dEdge
ot.setDelunayEdgeCCW(p, de1);
t.setDelunayEdgeCW(p, de2);
t.setDelunayEdgeCCW(op, de3);
ot.setDelunayEdgeCW(op, de4);
// Remap cEdge
ot.setConstrainedEdgeCCW(p, ce1);
t.setConstrainedEdgeCW(p, ce2);
t.setConstrainedEdgeCCW(op, ce3);
ot.setConstrainedEdgeCW(op, ce4);
// Remap neighbors
// XXX: might optimize the markNeighbor by keeping track of
// what side should be assigned to what neighbor after the
// rotation. Now mark neighbor does lots of testing to find
// the right side.
t.clearNeighbors();
ot.clearNeighbors();
if (n1 != null)
{
ot.markNeighbor(n1);
}
if (n2 != null)
{
t.markNeighbor(n2);
}
if (n3 != null)
{
t.markNeighbor(n3);
}
if (n4 != null)
{
ot.markNeighbor(n4);
}
t.markNeighbor(ot);
}