Polygon

\nA polygon (from the Greek poly, for "many", and gwnos, for "angle") is a closed planar path composed of a finite number of sequential straight line segments. The term polygon sometimes also describes the interior of the polygon (the open area that this path encloses) or the union of both. 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.

Table of contents

1 Names and types 2 Taxonomic classification 3 Properties 4 Point in polygon test 5 External link

Names and types

\n\n\n\n\n\n\n\n\n

A simple non-convex hexagon

A complex polygon

\nPolygons are named according to the number of sides, combining a Greek root with the suffix -gon, e.g. pentagon, dodecagon. The triangle and quadrilateral are exceptions. For larger numbers, mathematicians write the numeral itself, eg 17-gon. A variable can even be used, usually n-gon. This is useful if the number of sides is used in a formula. \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

Polygon names
Note: you can help Wikipedia by putting \n the following polygons in "Category:Polygons".
Name	Sides
triangle	3
quadrilateral	4
pentagon	5
hexagon	6
heptagon (avoid "septagon")	7
octagon	8
enneagon (avoid "nonagon")	9
decagon	10
hendecagon (avoid "undecagon")	11
dodecagon (avoid "duodecagon")	12
triskaidecagon	13
heptakaidecagon	17
enneadecagon	19
icosagon	20
icosikaihenagon	21
icosikaitetragon	24
tricontagon	30
tetracontagon	40
tetracontakaihexagon	46
pentcontagon	50
hexacontagon	60
heptacontagon	70
heptacontakaiheptagon	77
octacontagon	80
enneacontagon	90
hectagon (avoid "centagon")	100
chiliagon	1000
myriagon	10,000
megagon	106
googolgon	10100

Taxonomic classification

The taxonomic classification of polygons is illustrated by the following tree: \n Polygon\n / \\\n Simple Complex\n / \\\n Convex Concave\n /\n Cyclic \n / \n Regular\n

• A polygon is called simple if it is described by a single, non-intersecting boundary; otherwise it is called complex.\n* A simple polygon is called convex if it has no internal angles greater than 180° otherwise it is called concave.\n* A convex polygon is called concyclic or cyclic polygon if all the vertices lie on a single circle.\n* A cyclic polygon is called regular if all its sides are of equal length and all its angles are equal.

Properties

We will assume Euclidean geometry throughout. 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)&pi radians (or (n-2)180°), and the inner angle of a regular n-gon is (n-2)π/n radians (or (n-2)180°/n). This can be seen in two different ways:\n* Moving around a simple n-gon (like a car on a road), the amount one "turns" at a vertex is 180° - 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 a negative amount one turns. \n* 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°. The area A of a simple polygon can be computed if the cartesian coordinates (x₁, y₁), (x₂, y₂), ..., (x_n, y_n) of its vertices, listed in order as the area is circulated in counter-clockwise fashion, are known. The formula is\n:A = 1/2 · (x₁y₂ - x₂y₁ + x₂y₃ - x₃y₂ + ... + x_ny₁ - x₁y_n)\n:  = 1/2 · (x₁(y₂ - y_n) + x₂(y₃ - y₁) + x₃(y₄ - y₂) + ... + x_n(y₁ - y_n-1))\nThe formula was described by Meister in 1769 and by Gauss in 1795. It can be verified by dividing the polygon into triangles, but it can also be seen as a special case of Green's theorem. 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). A regular n-sided polygon can be constructed with ruler and compass if and only if the odd prime factors of n are distinct Fermat primes. See constructible polygon.

Point in polygon test

In computer graphics and computational geometry, it is often necessary to determine whether a given point P = (x₀,y₀) lies inside a simple polygon given by a sequence of line segments. It is known as Point in polygon test. See also: geometric shape, polyhedron, polytope, cyclic polygon, synthetic geometry.

External link

\nOptimized Point-in-Polygon code\nhttp://www.ecse.rpi.edu/Homepages/wrf/research/geom/pnpoly.html Category:Polygons