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
Computational geometry main branches of computational geometry are: The primary goal of research in combinatorial computational geometry is to develop efficient algorithms and data structures for solving problems stated in terms of basic geometrical objects: points, line segments, polygons, polyhedra, etc. Some of these problems seem so simple that they were not regarded as problems at all until the advent of computers. Consider, for example, the "Closest pair problem": One could compute the distances between all the pairs of points, of which there are "n(n-1)/2", then pick the pair with the smallest distance. This brute-force algorithm takes O("n") time; i.e. its execution