/// <summary>
/// Divide the source polygon to compute link distance.
/// </summary>
public void Divide()
{
LineSegment2D entrance = this.LastDiviser;
LineSegment2D path = new LineSegment2D(entrance.FirstPoint, this.LastPoint);
if (this.CurrentPolygon.Contains(path))
{
return;
}
path = new LineSegment2D(entrance.LastPoint, this.LastPoint);
if (this.CurrentPolygon.Contains(path))
{
return;
}
for (int i = 0; i < this.CurrentPolygon.VertexCount; i++)
{
if (this.CurrentPolygon.GetPoint(i) == entrance.FirstPoint)
{
continue;
}
LineSegment2D lineSegment = new LineSegment2D(entrance.FirstPoint, this.CurrentPolygon.GetPoint(i));
if (!this.CurrentPolygon.Contains(lineSegment) && !this.CurrentPolygon.isEdge(lineSegment))
{
continue;
}
LineSegment2D lineDiviser = this.ChooseDiviser(lineSegment);
if (lineDiviser == null)
{
continue;
}
Polygon2D testPoly = new Polygon2D(this.CurrentPolygon);
if (!testPoly.isVertex(lineDiviser.LastPoint))
{
testPoly.Add(lineDiviser.LastPoint, testPoly.OnEdge(lineDiviser.LastPoint));
}
Polygon2D polygon = this.DividedBy(lineDiviser, testPoly);
if (polygon.isVertex(this.LastPoint))
{
testPoly = this.CurrentPolygon;
this.SubDivision.Remove(this.SubDivision.Count - 1);
}
else
{
testPoly = polygon;
polygon = this.CurrentPolygon;
this.SubDivision.Remove(this.SubDivision.Count - 1);
}
if (entrance.FirstPoint == entrance.LastPoint)
{
this.SubDivision.Remove(this.SubDivision.Count - 1);
this.SubDivision.Add(testPoly);
this.SubDivision.Add(polygon);
}
else
{
LineSegment2D testLine = new LineSegment2D(entrance.LastPoint, lineDiviser.FirstPoint);
if (!testLine.isRegular)
{
entrance = new LineSegment2D(entrance.LastPoint, entrance.LastPoint);
continue;
}
if (this.CurrentPolygon.Contains(testLine))
{
testLine = this.ChooseDiviser(testLine);
if (testLine != null && !testPoly.Contains(testLine))
{
lineDiviser = testLine;
testPoly = new Polygon2D(this.CurrentPolygon);
if (!testPoly.isVertex(lineDiviser.LastPoint))
{
testPoly.Add(lineDiviser.LastPoint, testPoly.OnEdge(lineDiviser.LastPoint));
}
polygon = this.DividedBy(lineDiviser, testPoly);
testPoly = this.CurrentPolygon;
this.SubDivision.Remove(this.SubDivision.Count - 1);
}
else if (testLine == null)
{
continue;
}
}
if (!polygon.isVertex(this.LastPoint))
{
this.SubDivision.Remove(this.SubDivision.Count - 1);
this.SubDivision.Add(polygon);
this.SubDivision.Add(testPoly);
}
else
{
this.SubDivision.Remove(this.SubDivision.Count - 1);
this.SubDivision.Add(testPoly);
this.SubDivision.Add(polygon);
}
}
this.Divisers.Add(lineDiviser);
this.Divide();
return;
}
}
/// <summary>
/// Divide the source polygon to compute link distance.
/// </summary>
public void Divide()
{
LineSegment2D entrance = this.LastDiviser;
LineSegment2D path = new LineSegment2D(entrance.FirstPoint, this.LastPoint);
if (this.CurrentPolygon.Contains(path))
{
return;
}
path = new LineSegment2D(entrance.LastPoint, this.LastPoint);
if (this.CurrentPolygon.Contains(path))
{
return;
}
for (int i = 0; i < this.CurrentPolygon.VertexCount; i++)
{
if (this.CurrentPolygon.GetPoint(i) == entrance.FirstPoint)
{
continue;
}
LineSegment2D lineSegment = new LineSegment2D(entrance.FirstPoint, this.CurrentPolygon.GetPoint(i));
if(!this.CurrentPolygon.Contains(lineSegment) && !this.CurrentPolygon.isEdge(lineSegment))
{
continue;
}
LineSegment2D lineDiviser = this.ChooseDiviser(lineSegment);
if (lineDiviser == null)
{
continue;
}
Polygon2D testPoly = new Polygon2D(this.CurrentPolygon);
if (!testPoly.isVertex(lineDiviser.LastPoint))
{
testPoly.Add(lineDiviser.LastPoint, testPoly.OnEdge(lineDiviser.LastPoint));
}
Polygon2D polygon = this.DividedBy(lineDiviser, testPoly);
if (polygon.isVertex(this.LastPoint))
{
testPoly = this.CurrentPolygon;
this.SubDivision.Remove(this.SubDivision.Count - 1);
}
else
{
testPoly = polygon;
polygon = this.CurrentPolygon;
this.SubDivision.Remove(this.SubDivision.Count - 1);
}
if (entrance.FirstPoint == entrance.LastPoint)
{
this.SubDivision.Remove(this.SubDivision.Count - 1);
this.SubDivision.Add(testPoly);
this.SubDivision.Add(polygon);
}
else
{
LineSegment2D testLine = new LineSegment2D(entrance.LastPoint, lineDiviser.FirstPoint);
if (!testLine.isRegular)
{
entrance = new LineSegment2D(entrance.LastPoint, entrance.LastPoint);
continue;
}
if (this.CurrentPolygon.Contains(testLine))
{
testLine = this.ChooseDiviser(testLine);
if (testLine != null && !testPoly.Contains(testLine))
{
lineDiviser = testLine;
testPoly = new Polygon2D(this.CurrentPolygon);
if (!testPoly.isVertex(lineDiviser.LastPoint))
{
testPoly.Add(lineDiviser.LastPoint, testPoly.OnEdge(lineDiviser.LastPoint));
}
polygon = this.DividedBy(lineDiviser, testPoly);
testPoly = this.CurrentPolygon;
this.SubDivision.Remove(this.SubDivision.Count - 1);
}
else if (testLine == null)
{
continue;
}
}
if (!polygon.isVertex(this.LastPoint))
{
this.SubDivision.Remove(this.SubDivision.Count - 1);
this.SubDivision.Add(polygon);
this.SubDivision.Add(testPoly);
}
else
{
this.SubDivision.Remove(this.SubDivision.Count - 1);
this.SubDivision.Add(testPoly);
this.SubDivision.Add(polygon);
}
}
this.Divisers.Add(lineDiviser);
this.Divide();
return;
}
}
