Skew polygon Skew polygon In geometry, a skew polygon is a polygon whose vertices are not all coplanar. Skew polygons must have at least 4 vertices. The "interior" surface (or area) of such a polygon is not uniquely defined. Skew infinite polygons (apeirogons) have vertices which are not all collinear. A zig-zag skew polygon or antiprismatic polygon has vertices which alternate on two parallel planes, and thus must be even-sided. Regular skew polygon in 3 dimensions (and regular skew apeirogons in 2 dimensions) are always zig-zag. A regular skew polygon is isogonal with equal edge lengths. In 3 dimensions a regular skew
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