Vertices Class

Initializes a new instance of the Vertices class

Initializes a new instance of the Vertices class

Initializes a new instance of the Vertices class

Gets or sets the total number of elements the internal data structure can hold without resizing.

Gets the number of elements contained in the ListT.

You can add holes to this collection. It will get respected by some of the triangulation algoithms, but otherwise not used.

Gets or sets the element at the specified index.

Adds an object to the end of the ListT.

Adds the elements of the specified collection to the end of the ListT.

Returns a read-only ReadOnlyCollectionT wrapper for the current collection.

Searches the entire sorted ListT for an element using the default comparer and returns the zero-based index of the element.

Searches the entire sorted ListT for an element using the specified comparer and returns the zero-based index of the element.

Searches a range of elements in the sorted ListT for an element using the specified comparer and returns the zero-based index of the element.

Checks if the polygon is valid for use in the engine. Performs a full check, for simplicity, convexity, orientation, minimum angle, and volume. From Eric Jordan's convex decomposition library

Removes all elements from the ListT.

Determines whether an element is in the ListT.

Converts the elements in the current ListT to another type, and returns a list containing the converted elements.

Copies the entire ListT to a compatible one-dimensional array, starting at the beginning of the target array.

Copies the entire ListT to a compatible one-dimensional array, starting at the specified index of the target array.

Copies a range of elements from the ListT to a compatible one-dimensional array, starting at the specified index of the target array.

Determines whether the specified object is equal to the current object.

Determines whether the ListT contains elements that match the conditions defined by the specified predicate.

Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.

Searches for an element that matches the conditions defined by the specified predicate, and returns the first occurrence within the entire ListT.

Retrieves all the elements that match the conditions defined by the specified predicate.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the entire ListT.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the range of elements in the ListT that extends from the specified index to the last element.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the first occurrence within the range of elements in the ListT that starts at the specified index and contains the specified number of elements.

Searches for an element that matches the conditions defined by the specified predicate, and returns the last occurrence within the entire ListT.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the last occurrence within the entire ListT.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the last occurrence within the range of elements in the ListT that extends from the first element to the specified index.

Searches for an element that matches the conditions defined by the specified predicate, and returns the zero-based index of the last occurrence within the range of elements in the ListT that contains the specified number of elements and ends at the specified index.

Forces the vertices to be counter clock wise order.

Performs the specified action on each element of the ListT.

Returns an AABB that fully contains this polygon.

Gets the area.

Gets the centroid.

Returns an enumerator that iterates through the ListT.

Serves as the default hash function.

Creates a shallow copy of a range of elements in the source ListT.

Gets the signed area. If the area is less than 0, it indicates that the polygon is clockwise winded.

Gets the Type of the current instance.

Searches for the specified object and returns the zero-based index of the first occurrence within the entire ListT.

Searches for the specified object and returns the zero-based index of the first occurrence within the range of elements in the ListT that extends from the specified index to the last element.

Searches for the specified object and returns the zero-based index of the first occurrence within the range of elements in the ListT that starts at the specified index and contains the specified number of elements.

Inserts an element into the ListT at the specified index.

Inserts the elements of a collection into the ListT at the specified index.

Determines whether the polygon is convex. O(n^2) running time. Assumptions: - The polygon is in counter clockwise order - The polygon has no overlapping edges

Indicates if the vertices are in counter clockwise order. Warning: If the area of the polygon is 0, it is unable to determine the winding.

Checks if the vertices forms an simple polygon by checking for edge crossings.

Searches for the specified object and returns the zero-based index of the last occurrence within the entire ListT.

Searches for the specified object and returns the zero-based index of the last occurrence within the range of elements in the ListT that extends from the first element to the specified index.

Searches for the specified object and returns the zero-based index of the last occurrence within the range of elements in the ListT that contains the specified number of elements and ends at the specified index.

Creates a shallow copy of the current Object.

Gets the next index. Used for iterating all the edges with wrap-around.

Gets the next vertex. Used for iterating all the edges with wrap-around.

Winding number test for a point in a polygon.

Compute the sum of the angles made between the test point and each pair of points making up the polygon. If this sum is 2pi then the point is an interior point, if 0 then the point is an exterior point. ref: http://ozviz.wasp.uwa.edu.au/~pbourke/geometry/insidepoly/ - Solution 2

Gets the previous index. Used for iterating all the edges with wrap-around.

Gets the previous vertex. Used for iterating all the edges with wrap-around.

Projects to axis.

Removes the first occurrence of a specific object from the ListT.

Removes all the elements that match the conditions defined by the specified predicate.

Removes the element at the specified index of the ListT.

Removes a range of elements from the ListT.

Reverses the order of the elements in the entire ListT.

Reverses the order of the elements in the specified range.

Rotate the vertices with the defined value in radians. Warning: Using this method on an active set of vertices of a Body, will cause problems with collisions. Use Body.Rotation instead.

Scales the vertices with the specified vector.

Scales the vertices with the specified vector.

Sorts the elements in the entire ListT using the default comparer.

Sorts the elements in the entire ListT using the specified comparer.

Sorts the elements in the entire ListT using the specified ComparisonT.

Sorts the elements in a range of elements in ListT using the specified comparer.

Copies the elements of the ListT to a new array.

Translates the vertices with the specified vector.

Translates the vertices with the specified vector.

Sets the capacity to the actual number of elements in the ListT, if that number is less than a threshold value.

Determines whether every element in the ListT matches the conditions defined by the specified predicate.