//Remove the supertriangle
private static void RemoveSuperTriangle(Triangle2 superTriangle, HalfEdgeData2 triangulationData)
{
//The super triangle doesnt exists anymore because we have split it into many new triangles
//But we can use its vertices to figure out which new triangles (or faces belonging to the triangle)
//we should delete
HashSet <HalfEdgeFace2> triangleFacesToDelete = new HashSet <HalfEdgeFace2>();
//Loop through all vertices belongin to the triangulation
foreach (HalfEdgeVertex2 v in triangulationData.vertices)
{
//If the face attached to this vertex already exists in the list of faces we want to delete
//Then dont add it again
if (triangleFacesToDelete.Contains(v.edge.face))
{
continue;
}
MyVector2 v1 = v.position;
//Is this vertex in the triangulation a vertex in the super triangle?
if (v1.Equals(superTriangle.p1) || v1.Equals(superTriangle.p2) || v1.Equals(superTriangle.p3))
{
triangleFacesToDelete.Add(v.edge.face);
}
}
//Debug.Log("Triangles to delete: " + trianglesToDelete.Count);
//Delete the new triangles with vertices attached to the super triangle
foreach (HalfEdgeFace2 f in triangleFacesToDelete)
{
HalfEdgeHelpMethods.DeleteTriangleFace(f, triangulationData, shouldSetOppositeToNull: true);
}
}
//
// Remove all triangles that are inside the constraint
//
//This assumes the vertices in the constraint are ordered clockwise
private static void RemoveSuperfluousTriangles(HalfEdgeData2 triangleData, List <MyVector2> constraints)
{
//This assumes we have at least 3 vertices in the constraint because we cant delete triangles inside a line
if (constraints.Count < 3)
{
return;
}
HashSet <HalfEdgeFace2> trianglesToBeDeleted = FindTrianglesWithinConstraint(triangleData, constraints);
//Delete the triangles
foreach (HalfEdgeFace2 t in trianglesToBeDeleted)
{
HalfEdgeHelpMethods.DeleteTriangleFace(t, triangleData, true);
}
}
