public void Partition()
{
Vector2f[] points = new Vector2f[]
{
new Vector2f(391, 374),
new Vector2f(240, 431),
new Vector2f(252, 340),
new Vector2f(374, 320),
new Vector2f(289, 214),
new Vector2f(134, 390),
new Vector2f(68, 186),
new Vector2f(154, 259),
new Vector2f(161, 107),
new Vector2f(435, 108),
new Vector2f(208, 148),
new Vector2f(295, 160),
new Vector2f(421, 212),
new Vector2f(441, 303)
};
Polygon2f polygon = new Polygon2f(points);
List <Polygon2f> partition = PolygonPartition2.Partition(polygon, PARTITION_METHOD.OPTIMAL);
foreach (Polygon2f poly in partition)
{
Assert.IsTrue(poly.IsSimple);
Assert.IsTrue(poly.IsConvex);
Assert.IsTrue(poly.IsCCW);
}
}
protected override void OnPolygonComplete(Polygon2f input)
{
polygon = input;
polygon.MakeCCW();
polygon.BuildIndices();
polygon.BuildHoleIndices();
if (polygon.IsSimple && !polygon.HasHoles)
{
partition = PolygonPartition2.Partition(polygon, PARTITION_METHOD.OPTIMAL);
}
else
{
partition = new List <Polygon2f>();
}
foreach (var poly in partition)
{
poly.MakeCCW();
poly.BuildIndices();
poly.BuildHoleIndices();
}
}