In mathematics, the convex hull or convex envelope of a set X of points in the Euclidean plane or in a Euclidean space (or, more generally, in an affine space over the reals) is the smallest convex set that contains X. For instance, when X is a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around X. (多边形的点的数量必须要至少3个点)
ConvexHull
01 Syntax
Microsoft.VisualBasic.Imaging.Drawing2D.Math2D.ConvexHull.ConvexHull
02 Methods
| Name | Overloads | Summary |
|---|---|---|
| JarvisMatch | 1 | 点的数量必须要多于2个! |
| GrahamScan | 1 | 点的数量必须要多于2个! |
03 Fields
| Name | Overloads | Summary |
|---|---|---|
| TURN__LEFT | 1 | |
| TURN_RIGHT | 1 | |
| TURN_NONE | 1 |
04 Members
JarvisMatch(
IEnumerable(Of PointF))点的数量必须要多于2个!
Parameters
| Name | Type | Description |
|---|---|---|
points | IEnumerable(Of PointF) | - |
GrahamScan(
IEnumerable(Of PointF))点的数量必须要多于2个!
Parameters
| Name | Type | Description |
|---|---|---|
points | IEnumerable(Of PointF) | - |
TURN__LEFT
TURN_RIGHT
TURN_NONE