Vertices Class |
Inheritance HierarchyNamespace: Internal.nkast.Aether.Physics2D.Common
Assembly: NeoAxis.Core (in NeoAxis.Core.dll) Version: 2026.1.1.0 (2026.1.1.0)
SyntaxC#
public class Vertices : List
The Vertices type exposes the following members.
Constructors| Name | Description | |
|---|---|---|
 | Vertices | Initializes a new instance of the Vertices class |
| Vertices(IEnumerableVector2) | Initializes a new instance of the Vertices class |
| Vertices(Int32) | Initializes a new instance of the Vertices class |
Properties| Name | Description | |
|---|---|---|
 | Holes | You can add holes to this collection. It will get respected by some of the triangulation algoithms, but otherwise not used. |
Methods| Name | Description | |
|---|---|---|
| CheckPolygon | 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 |
| ForceCounterClockWise | Forces the vertices to be counter clock wise order. |
| GetAABB | Returns an AABB that fully contains this polygon. |
| GetArea | Gets the area. |
| GetCentroid | Gets the centroid. |
| GetSignedArea | Gets the signed area. If the area is less than 0, it indicates that the polygon is clockwise winded. |
| IsConvex | 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 |
| IsCounterClockWise | 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. |
| IsSimple | Checks if the vertices forms an simple polygon by checking for edge crossings. |
| NextIndex | Gets the next index. Used for iterating all the edges with wrap-around. |
| NextVertex | Gets the next vertex. Used for iterating all the edges with wrap-around. |
| PointInPolygon | Winding number test for a point in a polygon. |
| PointInPolygonAngle | 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 |
| PreviousIndex | Gets the previous index. Used for iterating all the edges with wrap-around. |
| PreviousVertex | Gets the previous vertex. Used for iterating all the edges with wrap-around. |
| ProjectToAxis | Projects to axis. |
| Rotate | 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. |
| Scale(Vector2) | Scales the vertices with the specified vector. |
| Scale(Vector2) | Scales the vertices with the specified vector. |
| ToString | |
| Translate(Vector2) | Translates the vertices with the specified vector. |
| Translate(Vector2) | Translates the vertices with the specified vector. |
See Also