Difference between revisions of "Polygon"
(category) |
|||
(11 intermediate revisions by 5 users not shown) | |||
Line 1: | Line 1: | ||
− | + | A '''polygon''' is a closed [[planar figure]] consisting of straight [[line segment]]s. There are two types of polygons: [[convex polygon|convex]] and [[concave polygon|concave]]. | |
− | + | A polygon can be [[regular polygon| regular]] or irregular. A polygon is regular if all sides are the same length and all angles are [[congruent]]. | |
− | A | ||
In their most general form, polygons are an ordered [[set]] of [[vertex|vertices]], <math>\{A_1, A_2, \ldots, A_n\}</math>, <math>n \geq 3</math>, with [[edge]]s <math>\{\overline{A_1A_2}, \overline{A_2A_3}, \ldots, \overline{A_nA_1}\}</math> joining consecutive vertices. Most frequently, one deals with ''simple polygons'' in which no two edges are allowed to intersect. (In fact, the adjective "simple" is almost always omitted, so the term "polygon" should be understood to mean "simple polygon" unless otherwise noted.) | In their most general form, polygons are an ordered [[set]] of [[vertex|vertices]], <math>\{A_1, A_2, \ldots, A_n\}</math>, <math>n \geq 3</math>, with [[edge]]s <math>\{\overline{A_1A_2}, \overline{A_2A_3}, \ldots, \overline{A_nA_1}\}</math> joining consecutive vertices. Most frequently, one deals with ''simple polygons'' in which no two edges are allowed to intersect. (In fact, the adjective "simple" is almost always omitted, so the term "polygon" should be understood to mean "simple polygon" unless otherwise noted.) | ||
Line 8: | Line 7: | ||
A [[degenerate]] polygon is one in which some vertex lies on an edge joining two other vertices. This can happen in one of two ways: either the vertices <math>A_{i - 1},A_i</math> and <math>A_{i+1}</math> can be colinear or the vertices <math>A_i</math> and <math>A_{i + 1}</math> can overlap (fail to be distinct). In either of these cases, our polygon of <math>n</math> vertices will appear to have <math>n - 1</math> or fewer -- it will have "degenerated" from an <math>n</math>-gon to an <math>(n - 1)</math>-gon. (In the case of triangles, this will result in either a line segment or a point.) | A [[degenerate]] polygon is one in which some vertex lies on an edge joining two other vertices. This can happen in one of two ways: either the vertices <math>A_{i - 1},A_i</math> and <math>A_{i+1}</math> can be colinear or the vertices <math>A_i</math> and <math>A_{i + 1}</math> can overlap (fail to be distinct). In either of these cases, our polygon of <math>n</math> vertices will appear to have <math>n - 1</math> or fewer -- it will have "degenerated" from an <math>n</math>-gon to an <math>(n - 1)</math>-gon. (In the case of triangles, this will result in either a line segment or a point.) | ||
− | The | + | |
+ | == Angles in Polygons == | ||
+ | ===Exterior=== | ||
+ | In any simple convex polygon, the sum of the [[exterior angle|exterior angles]] is equal to <math>360^\circ</math>. | ||
+ | |||
+ | ===Interior=== | ||
+ | The sum of interior angles can be given by the formula <math>180(n-2)^\circ</math>, where <math>n</math> is the number of sides. Thus in regular polygons, any angle is <math>\frac{180(n-2)}{n}^\circ</math>. | ||
+ | {| class="wikitable" | ||
+ | |- | ||
+ | ! Number of Sides | ||
+ | ! Sum of Interior angles | ||
+ | ! Individual angle measure in regular polygon | ||
+ | |- | ||
+ | | [[Triangle|3]] | ||
+ | | <math>180^\circ</math> | ||
+ | | <math>60^\circ</math> | ||
+ | |- | ||
+ | | [[quadrilateral|4]] | ||
+ | | <math>360^\circ</math> | ||
+ | | <math>90^\circ</math> | ||
+ | |- | ||
+ | |[[pentagon|5]] | ||
+ | |<math>540^\circ</math> | ||
+ | |<math>108^\circ</math> | ||
+ | |- | ||
+ | |6 | ||
+ | |<math>720^\circ</math> | ||
+ | |<math>120^\circ</math> | ||
+ | |- | ||
+ | |8 | ||
+ | |<math>1080^\circ</math> | ||
+ | |<math>135^\circ</math> | ||
+ | |} | ||
== See also == | == See also == | ||
* [[Geometry]] | * [[Geometry]] | ||
+ | {{stub}} | ||
+ | [[Category:Definition]] | ||
[[Category:Geometry]] | [[Category:Geometry]] |
Latest revision as of 19:04, 30 May 2015
A polygon is a closed planar figure consisting of straight line segments. There are two types of polygons: convex and concave.
A polygon can be regular or irregular. A polygon is regular if all sides are the same length and all angles are congruent.
In their most general form, polygons are an ordered set of vertices, ,
, with edges
joining consecutive vertices. Most frequently, one deals with simple polygons in which no two edges are allowed to intersect. (In fact, the adjective "simple" is almost always omitted, so the term "polygon" should be understood to mean "simple polygon" unless otherwise noted.)
A degenerate polygon is one in which some vertex lies on an edge joining two other vertices. This can happen in one of two ways: either the vertices and
can be colinear or the vertices
and
can overlap (fail to be distinct). In either of these cases, our polygon of
vertices will appear to have
or fewer -- it will have "degenerated" from an
-gon to an
-gon. (In the case of triangles, this will result in either a line segment or a point.)
Angles in Polygons
Exterior
In any simple convex polygon, the sum of the exterior angles is equal to .
Interior
The sum of interior angles can be given by the formula , where
is the number of sides. Thus in regular polygons, any angle is
.
Number of Sides | Sum of Interior angles | Individual angle measure in regular polygon |
---|---|---|
3 | ![]() |
![]() |
4 | ![]() |
![]() |
5 | ![]() |
![]() |
6 | ![]() |
![]() |
8 | ![]() |
![]() |
See also
This article is a stub. Help us out by expanding it.