Search results
Results from the WOW.Com Content Network
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]
The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR 2 where R is the circumradius. [4]: p. 73 The sum of the squared distances from the midpoints of the sides of a regular n-gon to any point on the circumcircle is 2nR 2 − 1 / 4 ns 2, where s is the side length and R is the ...
An n-gon is a polygon with n sides; for example, a triangle is a 3-gon. A simple polygon is one which does not intersect itself. More precisely, the only allowed intersections among the line segments that make up the polygon are the shared endpoints of consecutive segments in the polygonal chain.
Individual polygons are named (and sometimes classified) according to the number of sides, combining a Greek-derived numerical prefix with the suffix -gon, e.g. pentagon, dodecagon. The triangle, quadrilateral and nonagon are exceptions, although the regular forms trigon, tetragon, and enneagon are sometimes encountered as well.
It is trivial to triangulate any convex polygon in linear time into a fan triangulation, by adding diagonals from one vertex to all other non-nearest neighbor vertices. The total number of ways to triangulate a convex n-gon by non-intersecting diagonals is the (n−2)nd Catalan number, which equals (+)...
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 regular polygons can also form plane tilings that are not edge-to-edge. Such tilings can be considered edge-to-edge as nonregular polygons with adjacent colinear edges. There are seven families of isogonal figures , each family having a real-valued parameter determining the overlap between sides of adjacent tiles or the ratio between the ...
A regular polyhedron is identified by its Schläfli symbol of the form {n, m}, where n is the number of sides of each face and m the number of faces meeting at each vertex. There are 5 finite convex regular polyhedra (the Platonic solids), and four regular star polyhedra (the Kepler–Poinsot polyhedra), making nine regular polyhedra in all. In ...