Name | Description | |
---|---|---|
NPolygonF Constructor | Overloaded. |
The following tables list the members exposed by NPolygonF.
Name | Description | |
---|---|---|
NPolygonF Constructor | Overloaded. |
Name | Description | |
---|---|---|
Area | Gets the area of the polygon. | |
AreaSigned | Gets the signed area of the polygon. | |
Barycenter | Gets the barycenter of the polygon. | |
Bounds | Gets the minimal enclosing rectangle | |
BoundsRange | Gets the minimal enclosing 2D range | |
Centroid | Gets the centroid (that is the center of mass) of the polygon. | |
IsConvex | Determines whether this polygon is convex | |
IsFlat | Determines whether this is a flat primitive. | |
Vertices | Gets/sets the polygon vertices |
Name | Description | |
---|---|---|
AddToGraphicsPath | Appends the primitive to the specified graphics path | |
AreaIntersectsWith | Determines whether this polygon area intersects with the specified rectangle area. | |
Contains | Overloaded. Determines whether the primitive interior contains the specified point | |
ContainsOnOutline | Overloaded. Determines whether the outline of the polygon contains the specified point | |
FromRect | Creates a polygon from the given rectangle. | |
GetConvexHull | Computes the convex hull of the polygon using the Graham Scan algorithm. Returns the points forming the convex hull in counterclockwise order. | |
GetLongestLine | Overloaded. Gets the longest horizontal inner line in the polygon. | |
GetMinimumEnclosingCircle | Computes the minimal enclosing circle (a.k.a the bomb problem) using the Welzl's algorithm. | |
IntersectsWith | Overloaded. Determines whether this polygon intersects with the specified line. | |
IntersectWith | Overloaded. Checks if this polygon intersect with the given line segment and returns the intersection points if it does. | |
InvalidateCache | Invalidates any cached information about the polygon. | |
OutlineIntersectsWith | /Determines whether this polygon outline intersects with the specified rectangle. | |
ScanlineCrossingCounts | Obtains the number of clockwise and counterwise crossings of a scanline with the polygon segments. | |
Simplify | Returns a simplified version of this polygon using an improved version Douglas and Peucker algorithm (uses path hulls) which improves the worst case running time from O(n^2) to O(n * log2(n)). Topology is preserved. | |
Translate | Overloaded. Translates the primitive with the specified amounts |