Convex Shape
   HOME

TheInfoList



OR:

In
geometry Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician w ...
, a convex polygon is a
polygon In geometry, a polygon () is a plane figure made up of line segments connected to form a closed polygonal chain. The segments of a closed polygonal chain are called its '' edges'' or ''sides''. The points where two edges meet are the polygon ...
that is the boundary of a
convex set In geometry, a set of points is convex if it contains every line segment between two points in the set. For example, a solid cube (geometry), cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is n ...
. This means that the
line segment In geometry, a line segment is a part of a line (mathematics), straight line that is bounded by two distinct endpoints (its extreme points), and contains every Point (geometry), point on the line that is between its endpoints. It is a special c ...
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 Intersection (Euclidean geometry), intersect itself and has no holes. That is, it is a Piecewise linear curve, piecewise-linear Jordan curve consisting of finitely many line segments. The ...
(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.


Strictly convex polygon

A convex polygon is ''strictly'' convex if no line contains more than two vertices of the polygon. 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 adjacent edge (geometry), sides. For a simple polygon (non-self-intersecting), regardless of whether it is Polygon#Convexity and non-convexity, convex or non-convex, this angle is called an ...
is less than or equal to 180 degrees. *Every point on every
line segment In geometry, a line segment is a part of a line (mathematics), straight line that is bounded by two distinct endpoints (its extreme points), and contains every Point (geometry), point on the line that is between its endpoints. It is a special c ...
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 In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, ...
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 In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations ...
through a
fan triangulation In computational geometry, a fan triangulation is a simple way to Polygon triangulation, triangulate a polygon by choosing a Vertex (geometry), vertex and drawing Edge (geometry), edges to all of the other vertices of the polygon. Not every poly ...
, 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 ...
: 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 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 arbitra ...
: A convex polygon is the
convex hull In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, ...
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 on ...
: 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 2A. Equality holds (exclusively) for a
parallelogram In Euclidean geometry, a parallelogram is a simple polygon, simple (non-list of self-intersecting polygons, self-intersecting) quadrilateral with two pairs of Parallel (geometry), parallel sides. The opposite or facing sides of a parallelogram a ...
. *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 non-degenerate
triangle A triangle is a polygon with three corners and three sides, one of the basic shapes in geometry. The corners, also called ''vertices'', are zero-dimensional points while the sides connecting them, also called ''edges'', are one-dimension ...
is strictly convex.


See also

* * * * * *


References


External links

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