Regular polygon is denoted by its Schläfli symbol {"n"}. For "n" < 3, we have two degenerate cases: In certain contexts all the polygons considered will be regular. In such circumstances it is customary to drop the prefix regular. For instance, all the faces of uniform polyhedra must be regular and the faces will be described simply as triangle, square, pentagon, etc. For a regular convex "n"-gon, each interior angle has a measure of: and each exterior angle (i.e., supplementary to the interior angle) has a measure of formula_5 degrees, with the sum of the exterior angles equal to 360 degrees or
Intersection (Euclidean geometry) and an iteration. See "Examples:" If one wants to determine the intersection points of two polygons, one can check the intersection of any pair of line segments of the polygons (see above). For polygons with many segments this method is rather time-consuming. In practice one accelerates the intersection algorithm by using "window tests". In this case one divides the polygons into small sub-polygons and determines the smallest window (rectangle with sides parallel to the coordinate axes) for any sub-polygon. Before starting the time-consuming determination of the intersection point of two line segments any pair of windows is tested for common