A strictly convex polygon is a convex polygon such that no line contains two of its edges. In a convex polygon, all interior angles are less than or equal to 180 degrees, while in a strictly convex polygon all interior angles are strictly less than 180 degrees.
The following properties of a simple polygon are all equivalent to convexity:
Helly's theorem: For every collection of at least three convex polygons: if all intersections of all but one polygon are nonempty, then the intersection of all the polygons is nonempty.
Krein–Milman theorem: A convex polygon is the convex hull of its vertices. Thus it is fully defined by the set of its vertices, and one only needs the corners of the polygon to recover the entire polygon shape.
Hyperplane separation theorem: Any two convex polygons with no points in common have a separator line. If the polygons are closed and at least one of them is compact, then there are even two parallel separator lines (with a gap between them).
Inscribed triangle property: Of all triangles contained in a convex polygon, there exists a triangle with a maximal area whose vertices are all polygon vertices.
Inscribing triangle property: every convex polygon with area can be inscribed in a triangle of area at most equal to . Equality holds (exclusively) for a parallelogram.
Inscribed/inscribing rectangles property: For every convex body in the plane, we can inscribe a rectangle in such that a homothetic copy of is circumscribed about and the positive homothety ratio is at most 2 and .
The mean width of a convex polygon is equal to its perimeter divided by . So its width is the diameter of a circle with the same perimeter as the polygon.
Every polygon inscribed in a circle (such that all vertices of the polygon touch the circle), if not self-intersecting, is convex. However, not every convex polygon can be inscribed in a circle.
The following properties of a simple polygon are all equivalent to strict convexity:
Every internal angle is strictly less than 180 degrees.
Every line segment between two points in the interior, or between two points on the boundary but not on the same edge, is strictly interior to the polygon (except at its endpoints if they are on the edges).
For each edge, the interior points and the boundary points not contained in the edge are on the same side of the line that the edge defines.
The angle at each vertex contains all other vertices in its interior (except the given vertex and the two adjacent vertices).
^Chandran, Sharat; Mount, David M. (1992). "A parallel algorithm for enclosed and enclosing triangles". International Journal of Computational Geometry & Applications. 2 (2): 191–214. doi:10.1142/S0218195992000123. MR1168956.