In geometry a **polygon** ( /ˈpɒlɪɡɒn/) is a flat shape consisting of straight lines that are joined to form a closed chain or *circuit*.

A polygon is traditionally a plane figure that is bounded by a closed path, composed of a finite sequence of straight line segments (i.e., by a closed polygonal chain). These segments are called its *edges* or *sides*, and the points where two edges meet are the polygon's *vertices* (singular: vertex) or *corners*. An ** n-gon** is a polygon with

*n*sides. The interior of the polygon is sometimes called its

*body*. A polygon is a 2-dimensional example of the more general polytope in any number of dimensions.

The word "polygon" derives from the Greek πολύς (*polús*) "much", "many" and γωνία (*gōnía*) "corner", "angle", or γόνυ (*gónu*) "knee".

The basic geometrical notion has been adapted in various ways to suit particular purposes. Mathematicians are often concerned only with the closed polygonal chain and with **simple polygons** which do not self-intersect, and may define a polygon accordingly. Geometrically two edges meeting at a corner are required to form an angle that is not straight (180°); otherwise, the line segments will be considered parts of a single edge – however mathematically, such corners may sometimes be allowed. In fields relating to computation, the term *polygon* has taken on a slightly altered meaning derived from the way the shape is stored and manipulated in computer graphics (image generation). Some other generalizations of polygons are described below.

Read more about Polygon: Generalizations of Polygons, Naming Polygons, History, Polygons in Nature, Polygons in Computer Graphics

### Other articles related to "polygons, polygon":

... The vector date could be points, lines, or

**polygons**... MOSS utilized what at the time was referred to as a "full

**polygon**" representation ... In a full

**polygon**representation, each

**polygon**vertex shared with another

**polygon**...

**Polygon**

... In mathematics, a Moufang

**polygon**, named after Ruth Moufang, is an irreducible building of rank two that admits the action of root groups ... theorem, proved independently by Tits and Weiss, showed that a Moufang

**polygon**must be a generalized 3-gon, 4-gon, 6-gon, or 8-gon, so the purpose of the aforementioned book was to ...

... algorithm, is a mathematical algorithm to determine the area of a simple

**polygon**whose vertices are described by ordered pairs in the plane ... corresponding coordinates to find the area encompassing the

**polygon**, and subtracts it from the surrounding

**polygon**to find the area of the

**polygon**within ... cross-multiplying for the coordinates making up the

**polygon**, like tying shoelaces ...

**Polygon**s in Computer Graphics

... A

**polygon**in a computer graphics (image generation) system is a two-dimensional shape that is modelled and stored within its database ... A

**polygon**can be colored, shaded and textured, and its position in the database is defined by the coordinates of its vertices (corners) ... Naming conventions differ from those of mathematicians A simple

**polygon**does not cross itself ...

... Star

**polygon**, a star drawn with a number of lines equal to the number of points Pentagram, a five-pointed star

**polygon**Five-pointed star, a pentagram with ...