Difference between revisions of "Polygon"

m
Line 5: Line 5:
 
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.)
  
 +
 +
== Angles in Regular Polygons ==
 +
===Exterior===In any regular polygon, the sum of the exterior angle 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 any angle is <math>\frac{180(n-2)}{n}^\circ</math>.
 
== See also ==
 
== See also ==
 
* [[Geometry]]
 
* [[Geometry]]

Revision as of 19:28, 7 March 2014

A polygon is a closed planar figure consisting of straight line segments. There are two types of polygons: convex and concave.

In their most general form, polygons are an ordered set of vertices, $\{A_1, A_2, \ldots, A_n\}$, $n \geq 3$, with edges $\{\overline{A_1A_2}, \overline{A_2A_3}, \ldots, \overline{A_nA_1}\}$ 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 $A_{i - 1},A_i$ and $A_{i+1}$ can be colinear or the vertices $A_i$ and $A_{i + 1}$ can overlap (fail to be distinct). In either of these cases, our polygon of $n$ vertices will appear to have $n - 1$ or fewer -- it will have "degenerated" from an $n$-gon to an $(n - 1)$-gon. (In the case of triangles, this will result in either a line segment or a point.)


Angles in Regular Polygons

===Exterior===In any regular polygon, the sum of the exterior angle is equal to $360^\circ$. ==Interior== The sum of interior angles can be given by the formula $180(n-2)^\circ$, where$n$ is the number of sides. Thus any angle is $\frac{180(n-2)}{n}^\circ$.

See also

This article is a stub. Help us out by expanding it.