Digon by a line segment, without affecting the overall characteristics. The cyclic groups may be obtained as rotation symmetries of polygons: the rotational symmetries of the digon provide the group C. Digon In geometry, a digon is a polygon with two sides (edges) and two vertices. Its construction is degenerate in a Euclidean plane because either the two sides would coincide or one or both would have to be curved; however, it can be easily visualised in elliptic space. A regular digon has both angles equal and both sides equal and is represented by Schläfli symbol {2}. It may be constructed
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