/// <summary>
/// Find minium amount of connecting line segments between supplied room center points.
/// </summary>
/// <param name="percentOfSegementsAboveMinThreshold">Percent of extra connecting line segments to return. If 0% then only returns min spanning tree.</param>
/// <returns></returns>
public List <Line> FindConnectingLineSegments(List <Vector2> centerPoints, float percentOfSegementsAboveMinThreshold)
{
Delaunay.Voronoi v = CreateGraph(centerPoints);
List <LineSegment> dTriangulation = v.DelaunayTriangulation();
List <LineSegment> tree = v.SpanningTree(Delaunay.KruskalType.MINIMUM);
int numOfExtraSegments = Mathf.RoundToInt((float)dTriangulation.Count * percentOfSegementsAboveMinThreshold);
List <LineSegment> finalSegments = new List <LineSegment>();
int extraSegCount = 0;
foreach (LineSegment segment in dTriangulation)
{
bool foundInTree = false;
// always add the min spanning tree segments to final.
foreach (LineSegment treeSeg in tree)
{
if (segment.p0.Value == treeSeg.p0.Value &&
segment.p1.Value == treeSeg.p1.Value)
{
finalSegments.Add(segment);
foundInTree = true;
break;
}
}
// Add in the extra segements.
if (!foundInTree && extraSegCount < numOfExtraSegments)
{
finalSegments.Add(segment);
extraSegCount++;
}
}
List <Line> foundLines = new List <Line>();
foreach (LineSegment seg in finalSegments)
{
foundLines.Add(new Line(seg.p0, seg.p1));
}
return(foundLines);
}
