public Point2DList(Point2DList l)
: this()
{
int numPoints = l.Count;
for (int i = 0; i < numPoints; ++i)
{
MPoints.Add(l[i]);
}
_boundingBox = l.BoundingBox;
Epsilon = l.Epsilon;
_windingOrder = l.WindingOrder;
}
// From Eric Jordan's convex decomposition library
/// <summary>
/// Merges all parallel edges in the list of vertices
/// </summary>
/// <param name="tolerance"></param>
public void MergeParallelEdges(double tolerance)
{
if (Count <= 3)
{
// Can't do anything useful here to a triangle
return;
}
bool[] mergeMe = new bool[Count];
int newNVertices = Count;
//Gather points to process
for (int i = 0; i < Count; ++i)
{
int lower = (i == 0) ? (Count - 1) : (i - 1);
int middle = i;
int upper = (i == Count - 1) ? (0) : (i + 1);
double dx0 = this[middle].X - this[lower].X;
double dy0 = this[middle].Y - this[lower].Y;
double dx1 = this[upper].Y - this[middle].X;
double dy1 = this[upper].Y - this[middle].Y;
double norm0 = Math.Sqrt(dx0 * dx0 + dy0 * dy0);
double norm1 = Math.Sqrt(dx1 * dx1 + dy1 * dy1);
if (!(norm0 > 0.0 && norm1 > 0.0) && newNVertices > 3)
{
//Merge identical points
mergeMe[i] = true;
--newNVertices;
}
dx0 /= norm0;
dy0 /= norm0;
dx1 /= norm1;
dy1 /= norm1;
double cross = dx0 * dy1 - dx1 * dy0;
double dot = dx0 * dx1 + dy0 * dy1;
if (Math.Abs(cross) < tolerance && dot > 0 && newNVertices > 3)
{
mergeMe[i] = true;
--newNVertices;
}
else
{
mergeMe[i] = false;
}
}
if (newNVertices == Count || newNVertices == 0)
{
return;
}
int currIndex = 0;
// Copy the vertices to a new list and clear the old
Point2DList oldVertices = new Point2DList(this);
Clear();
for (int i = 0; i < oldVertices.Count; ++i)
{
if (mergeMe[i] || newNVertices == 0 || currIndex == newNVertices)
{
continue;
}
if (currIndex >= newNVertices)
{
throw new Exception("Point2DList::MergeParallelEdges - currIndex[ " + currIndex + "] >= newNVertices[" + newNVertices + "]");
}
MPoints.Add(oldVertices[i]);
BoundingBox = BoundingBox.AddPoint(oldVertices[i]);
++currIndex;
}
_windingOrder = CalculateWindingOrder();
Epsilon = CalculateEpsilon();
}
/// <summary>
/// Checks if polygon is valid for use in Box2d engine.
/// Last ditch effort to ensure no invalid polygons are
/// added to world geometry.
///
/// Performs a full check, for simplicity, convexity,
/// orientation, minimum angle, and volume. This won't
/// be very efficient, and a lot of it is redundant when
/// other tools in this section are used.
///
/// From Eric Jordan's convex decomposition library
/// </summary>
/// <returns></returns>
public PolygonError CheckPolygon()
{
PolygonError error = PolygonError.None;
if (Count < 3 || Count > MAX_POLYGON_VERTICES)
{
error |= PolygonError.NotEnoughVertices;
// no other tests will be valid at this point, so just return
return(error);
}
if (IsDegenerate())
{
error |= PolygonError.Degenerate;
}
//bool bIsConvex = IsConvex();
//if (!IsConvex())
//{
// error |= PolygonError.NotConvex;
//}
if (!IsSimple())
{
error |= PolygonError.NotSimple;
}
if (GetArea() < MathUtil.EPSILON)
{
error |= PolygonError.AreaTooSmall;
}
// the following tests don't make sense if the polygon is not simple
if ((error & PolygonError.NotSimple) != PolygonError.NotSimple)
{
bool bReversed = false;
const WindingOrderType EXPECTED_WINDING_ORDER = WindingOrderType.AntiClockwise;
const WindingOrderType REVERSE_WINDING_ORDER = WindingOrderType.Clockwise;
if (WindingOrder == REVERSE_WINDING_ORDER)
{
WindingOrder = EXPECTED_WINDING_ORDER;
bReversed = true;
}
//Compute normals
Point2D[] normals = new Point2D[Count];
Point2DList vertices = new Point2DList(Count);
for (int i = 0; i < Count; ++i)
{
vertices.Add(new Point2D(this[i].X, this[i].Y));
int i1 = i;
int i2 = NextIndex(i);
Point2D edge = new Point2D(this[i2].X - this[i1].X, this[i2].Y - this[i1].Y);
normals[i] = Point2D.Perpendicular(edge, 1.0);
normals[i].Normalize();
}
//Required side checks
for (int i = 0; i < Count; ++i)
{
int iminus = PreviousIndex(i);
//Parallel sides check
double cross = Point2D.Cross(normals[iminus], normals[i]);
cross = MathUtil.Clamp(cross, -1.0f, 1.0f);
float angle = (float)Math.Asin(cross);
if (Math.Abs(angle) <= ANGULAR_SLOP)
{
error |= PolygonError.SidesTooCloseToParallel;
break;
}
// For some reason, the following checks do not seem to work
// correctly in all cases - they return false positives.
// //Too skinny check - only valid for convex polygons
// if (bIsConvex)
// {
// for (int j = 0; j < Count; ++j)
// {
// if (j == i || j == NextIndex(i))
// {
// continue;
// }
// Point2D testVector = vertices[j] - vertices[i];
// testVector.Normalize();
// double s = Point2D.Dot(testVector, normals[i]);
// if (s >= -Point2DList.kLinearSlop)
// {
// error |= PolygonError.TooThin;
// }
// }
// Point2D centroid = vertices.GetCentroid();
// Point2D n1 = normals[iminus];
// Point2D n2 = normals[i];
// Point2D v = vertices[i] - centroid;
// Point2D d = new Point2D();
// d.X = Point2D.Dot(n1, v); // - toiSlop;
// d.Y = Point2D.Dot(n2, v); // - toiSlop;
// // Shifting the edge inward by toiSlop should
// // not cause the plane to pass the centroid.
// if ((d.X < 0.0f) || (d.Y < 0.0f))
// {
// error |= PolygonError.TooThin;
// }
// }
}
if (bReversed)
{
WindingOrder = REVERSE_WINDING_ORDER;
}
}
//if (error != PolygonError.None)
//{
// Console.WriteLine("Found invalid polygon: {0} {1}\n", Point2DList.GetErrorString(error), this.ToString());
//}
return(error);
}
public void AddRange(Point2DList l)
{
AddRange(l.MPoints.GetEnumerator(), l.WindingOrder);
}
