|50px||This article is need of a clean-up. You can help out Computer Graphics by re-organizing parts of the article, checking grammar and spelling, and doing other helpful things to correct the article.
|50px||This article has one or more broken images (probably the article was copied from Wikipedia, but the images weren't added). You can help out Computer Graphics by uploading the relevant images, or reorganizing the entry.
A polygon (literally "many angle", see Wiktionary for the etymology) is a closed planar path composed of a finite number of sequential line segments. The straight line segments that make up the polygon are called its sides or edges and the points where the sides meet are the polygon's vertices. If a polygon is simple, then its sides (and vertices) constitute the boundary of a polygonal region, and the term polygon sometimes also describes the interior of the polygonal region (the open area that this path encloses) or the union of both the region and its boundary.
Names and types Edit
Polygons are named according to the number of sides, combining a Greek-derived numerical prefix with the suffix -gon, e.g. pentagon, dodecagon. The triangle and quadrilateral are exceptions. For larger numbers, mathematicians write the numeral itself, e.g. 17-gon. A variable can even be used, usually n-gon. This is useful if the number of sides is used in a formula.
|Triangle (or trigon)||3|
|Quadrilateral (or tetragon)||4|
|Hexagon (or sexagon)||6|
|Heptagon (avoid "septagon" = Latin [sept-] + Greek)||7|
|Nonagon (or Enneagon)||9|
|Hendecagon (avoid "undecagon" = Latin [un-] + Greek)||11|
|Dodecagon (avoid "duodecagon" = Latin [duo-] + Greek)||12|
|Tridecagon or Triskaidecagon (MathWorld)||13|
|Tetradecagon or Tetrakaidecagon (MathWorld)||14|
|Pentadecagon (or quindecagon) or Pentakaidecagon||15|
|Hexadecagon or Hexakaidecagon||16|
|Heptadecagon or Heptakaidecagon||17|
|Octadecagon or Octakaidecagon||18|
|Enneadecagon or Enneakaidecagon or Nonadecagon||19|
|Hectagon (also hectogon) (avoid "centagon" = Latin [cent-] + Greek)||100|
Naming polygons Edit
To construct the name of a polygon with more than 20 and less than 100 sides, combine the prefixes as follows
That is, a 42-sided figure would be named as follows:
|Tens||and||Ones||final suffix||full polygon name|
and a 50-sided figure
|Tens||and||Ones||final suffix||full polygon name|
But beyond nonagons and decagons, professional mathematicians prefer the aforementioned numeral notation (for example, MathWorld has articles on 17-gons and 257-gons).
Taxonomic classification Edit
The taxonomic classification of polygons is illustrated by the following graph:
Polygon / \ Simple Complex / \ / Convex Concave / / \ / / Cyclic Equilateral \ / Regular
- A polygon is called simple if it is described by a single, non-intersecting boundary (hence has an inside and an outside); otherwise it is called complex.
- A simple polygon is called convex if it has no internal angles greater than 180°; otherwise it is called concave.
- A simple polygon is called equilateral if all edges are of the same length. (A 5 or more sided polygon can be concave and equilateral)
- A convex polygon is called concyclic or a cyclic polygon if all the vertices lie on a single circle.
- A cyclic and equilateral polygon is called regular; for each number of sides, all regular polygons with the same number of sides are similar.
- A complex polygon may also be defined as regular if it is cyclic and equilateral. These are called star polygons.
The regular polygons most commonly found include:
Somewhat less common are:
See also: tilings of regular polygons
We will assume Euclidean geometry throughout.
In the case of a line of symmetry the latter reduces to n-2.
Let k≥2. For an nk-gon with k-fold rotational symmetry (Ck), there are 2n-2 degrees of freedom for the shape. With additional mirror-image symmetry (Dk) there are n-1 degrees of freedom.
Any polygon, regular or irregular, complex or simple, has as many angles as it has sides. The sum of the inner angles of a simple n-gon is (n−2)π radians (or (n−2)180°), and the inner angle of a regular n-gon is (n−2)π/n radians (or (n−2)180°/n, or (n−2)/(2n) turns). This can be seen in two different ways:
- Moving around a simple n-gon (like a car on a road), the amount one "turns" at a vertex is 180° minus the inner angle. "Driving around" the polygon, one makes one full turn, so the sum of these turns must be 360°, from which the formula follows easily. The reasoning also applies if some inner angles are more than 180°: going clockwise around, it means that one sometime turns left instead of right, which is counted as turning a negative amount. (Thus we consider something like the winding number of the orientation of the sides, where at every vertex the contribution is between -1/2 and 1/2 winding.)
- Any simple n-gon can be considered to be made up of (n−2) triangles, each of which has an angle sum of π radians or 180°.
Several formulas give the area of a regular polygon:
- half the perimeter multiplied by the length of the apothem (the line drawn from the centre of the polygon perpendicular to a side)
The area A of a simple polygon can be computed if the cartesian coordinates (x1, y1), (x2, y2), ..., (xn, yn) of its vertices, listed in order as the area is circulated in counter-clockwise fashion, are known. The formula is
- A = ½ · (x1y2 − x2y1 + x2y3 − x3y2 + ... + xny1 − x1yn)
- = ½ · (x1(y2 − yn) + x2(y3 − y1) + x3(y4 − y2) + ... + xn(y1 − yn−1))
If the polygon can be drawn on an equally-spaced grid such that all its vertices are grid points, Pick's theorem gives a simple formula for the polygon's area based on the numbers of interior and boundary grid points.
If any two simple polygons of equal area are given, then the first can be cut into polygonal pieces which can be reassembled to form the second polygon. This is the Bolyai-Gerwien theorem.
All regular polygons are concyclic, as are all triangles and rectangles (see circumcircle).
Point in polygon test Edit
In computer graphics and computational geometry, it is often necessary to determine whether a given point P = (x0,y0) lies inside a simple polygon given by a sequence of line segments. It is known as Point in polygon test.
Some special cases are:
- Angle of 0° or 180° (degenerate case)
- Two non-adjacent sides are on the same line
- Equilateral polygon: a polygon whose sides are equal (Williams 1979, pp. 31-32)
- Equiangular polygon: a polygon whose vertex angles are equal (Williams 1979, p. 32)
A triangle is equilateral iff it is equiangular.