Convex and concave polygons
In geometry, a polygon that is simple (not self-intersecting) can be either convex or concave (synonyms for the latter being non-convex and reentrant). In a convex polygon, a line segment between two points on the boundary never goes outside the polygon.
A convex polygon is a simple polygon whose interior is a convex set. 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.
Properties of convex polygons
The following properties of a simple polygon are all equivalent to convexity:
- Every internal angle is less than or equal to 180 degrees.
- Every point on every line segment between two points inside or on the boundary of the polygon remains inside or on the boundary.
- The polygon is entirely contained in a closed half-plane defined by each of its edges.
- For each edge, the interior points are all on the same side of the line that the edge defines.
- The angle at each vertex contains all other vertices in its edges and interior.
Additional properties of convex polygons include:
- The intersection of two convex polygons is a convex polygon.
- Helly's theorem: For every collection of at least three convex polygons: if the intersection of every three of them is nonempty, then the whole collection has a nonempty intersection.
- 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 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 A can be inscribed in a triangle of area at most equal to 2A. Equality holds (exclusively) for a parallelogram.
- Inscribed/inscribing rectangles property: For every convex body C in the plane, we can inscribe a rectangle r in C such that a homothetic copy R of r is circumscribed about C and the positive homothety ratio is at most 2 and .
- The mean width of a convex polygon is equal to its perimeter divided by pi. 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).
Every nondegenerate triangle is strictly convex.
Concave or non-convex polygons
A simple (non-self-intersecting) polygon that is not convex is called concave, non-convex or reentrant. A simple concave polygon will always have an interior angle with a measure that is greater than 180 degrees. Concave can be remembered by students using one of two easy tricks. First, students can say that one side looks to have "caved" in. The other way is to think of a cave in a mountain side. If you see an entrance to a cave, then the polygon must be concave.
It is always possible to partition a concave polygon into a set of convex polygons. A polynomial-time algorithm for finding a decomposition into as few convex polygons as possible is described by Chazelle & Dobkin (1985).
- Definition and properties of convex polygons with interactive animation.
- -, Christos. "Is the area of intersection of convex polygons always convex?". Math Stack Exchange.
- Weisstein, Eric W. "Triangle Circumscribing". Wolfram Math World.
- Lassak, M. (1993). "Approximation of convex bodies by rectangles". Geometriae Dedicata 47: 111. doi:10.1007/BF01263495.
- Jim Belk. "What's the average width of a convex polygon?". Math Stack Exchange.
- McConnell, Jeffrey J. (2006), Computer Graphics: Theory Into Practice, p. 130, ISBN 0-7637-2250-2.
- Leff, Lawrence (2008), Let's Review: Geometry, Hauppauge, NY: Barron's Educational Series, p. 66, ISBN 978-0-7641-4069-3
- Mason, J.I. (1946), "On the angles of a polygon", The Mathematical Gazette (The Mathematical Association) 30 (291): 237–238, JSTOR 3611229.
- Definition and properties of concave polygons with interactive animation.
- Chazelle, Bernard; Dobkin, David P. (1985), "Optimal convex decompositions", in Toussaint, G.T., Computational Geometry, Elsevier, pp. 63–133.