Search results
Results from the WOW.Com Content Network
A direct equiangular polygon has all angles turning in the same direction in a plane and can include multiple turns. Convex equiangular polygons are always direct. An indirect equiangular polygon can include angles turning right or left in any combination. A skew equiangular polygon may be isogonal, but can't be considered direct since it is ...
A regular hexagon has Schläfli symbol {6} [2] and can also be constructed as a truncated equilateral triangle, t{3}, which alternates two types of edges. A regular hexagon is defined as a hexagon that is both equilateral and equiangular. It is bicentric, meaning that it is both cyclic (has a circumscribed circle) and tangential (has an ...
A non-convex regular polygon is a regular star polygon. The most common example is the pentagram, which has the same vertices as a pentagon, but connects alternating vertices. For an n-sided star polygon, the Schläfli symbol is modified to indicate the density or "starriness" m of the polygon, as {n/m}.
In geometry, a polygon is traditionally a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed chain. These segments are called its edges or sides , and the points where two of the edges meet are the polygon's vertices (singular: vertex) or corners .
An example of a convex polygon: a regular pentagon. In geometry, a convex polygon is a polygon that is the boundary of a convex set. 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 (not self-intersecting). [1]
Except in the triangle case, an equilateral polygon does not need to also be equiangular (have all angles equal), but if it does then it is a regular polygon. If the number of sides is at least four, an equilateral polygon does not need to be a convex polygon: it could be concave or even self-intersecting.
The convex hull of a simple polygon can also be found in linear time, faster than algorithms for finding convex hulls of points that have not been connected into a polygon. [ 6 ] Constructing a triangulation of a simple polygon can also be performed in linear time, although the algorithm is complicated.
Convex geometry is a relatively young mathematical discipline. Although the first known contributions to convex geometry date back to antiquity and can be traced in the works of Euclid and Archimedes, it became an independent branch of mathematics at the turn of the 20th century, mainly due to the works of Hermann Brunn and Hermann Minkowski in dimensions two and three.