HOME

TheInfoList



OR:

In
geometry Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is ...
, a convex polygon is a
polygon In geometry, a polygon () is a plane figure that is described by a finite number of straight line segments connected to form a closed ''polygonal chain'' (or ''polygonal circuit''). The bounded plane region, the bounding circuit, or the two to ...
that is the
boundary Boundary or Boundaries may refer to: * Border, in political geography Entertainment * ''Boundaries'' (2016 film), a 2016 Canadian film * ''Boundaries'' (2018 film), a 2018 American-Canadian road trip film *Boundary (cricket), the edge of the pla ...
of a
convex set In geometry, a subset of a Euclidean space, or more generally an affine space over the reals, is convex if, given any two points in the subset, the subset contains the whole line segment that joins them. Equivalently, a convex set or a convex ...
. This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon. In particular, it is a
simple polygon In geometry, a simple polygon is a polygon that does not intersect itself and has no holes. That is, it is a flat shape consisting of straight, non-intersecting line segments or "sides" that are joined pairwise to form a single closed path. If ...
(not self-intersecting). Equivalently, a polygon is convex if every line that does not contain any edge intersects the polygon in at most two points. 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.


Properties

The following properties of a simple polygon are all equivalent to convexity: *Every
internal angle In geometry, an angle of a polygon is formed by two sides of the polygon that share an endpoint. For a simple (non-self-intersecting) polygon, regardless of whether it is convex or non-convex, this angle is called an interior angle (or ) if ...
is strictly less than 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. *The polygon is the convex hull of its edges. Additional properties of convex polygons include: *The intersection of two convex polygons is a convex polygon. *A convex polygon may be triangulated in linear time through a
fan triangulation In computational geometry, a fan triangulation is a simple way to triangulate a polygon by choosing a vertex and drawing edges to all of the other vertices of the polygon. Not every polygon can be triangulated this way, so this method is usua ...
, consisting in adding diagonals from one vertex to all other vertices. *
Helly's theorem Helly's theorem is a basic result in discrete geometry on the intersection of convex sets. It was discovered by Eduard Helly in 1913,. but not published by him until 1923, by which time alternative proofs by and had already appeared. Helly's t ...
: 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 In the mathematical theory of functional analysis, the Krein–Milman theorem is a proposition about compact convex sets in locally convex topological vector spaces (TVSs). This theorem generalizes to infinite-dimensional spaces and to arbitrar ...
: 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 In geometry, the hyperplane separation theorem is a theorem about disjoint convex sets in ''n''-dimensional Euclidean space. There are several rather similar versions. In one version of the theorem, if both these sets are closed and at least one ...
: 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 ''A'' can be inscribed in a triangle of area at most equal to 2''A''. 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 0.5 \text(R) \leq \text(C) \leq 2 \text(r). *The
mean width In geometry, the mean width is a measure of the "size" of a body; see Hadwiger's theorem for more about the available measures of bodies. In n dimensions, one has to consider (n-1)-dimensional hyperplanes perpendicular to a given direction \hat in ...
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.


Strict convexity

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 A triangle is a polygon with three edges and three vertices. It is one of the basic shapes in geometry. A triangle with vertices ''A'', ''B'', and ''C'' is denoted \triangle ABC. In Euclidean geometry, any three points, when non- colline ...
is strictly convex.


See also

* Convex curve *
Concave polygon A simple polygon that is not convex is called concave, non-convex or reentrant. A concave polygon will always have at least one reflex interior angle—that is, an angle with a measure that is between 180 degrees and 360 degrees exclusive. Polyg ...
a simple polygon that is not convex * Convex polytope *
Cyclic polygon In geometry, the circumscribed circle or circumcircle of a polygon is a circle that passes through all the vertices of the polygon. The center of this circle is called the circumcenter and its radius is called the circumradius. Not every poly ...
* *
Tangential polygon In Euclidean geometry, a tangential polygon, also known as a circumscribed polygon, is a convex polygon that contains an inscribed circle (also called an ''incircle''). This is a circle that is tangent to each of the polygon's sides. The dual pol ...


References


External links

* *http://www.rustycode.com/tutorials/convex.html * {{polygons Convex geometry Types of polygons