Regular polygon common angle is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots. A "regular skew polygon" in 3-space can be seen as nonplanar paths zig-zagging between two parallel planes, defined as the side-edges of a uniform antiprism. All edges and internal angles are equal. More generally "regular skew polygons" can be defined in "n"-space. Examples include the Petrie polygons, polygonal paths of edges that divide a regular polytope into two halves, and seen as a regular polygon in orthogonal projection. In the infinite limit "regular skew polygons" become
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