Affine-regular polygon properties of regular polygons are invariant under affine transformations, and affine-regular polygons share the same properties. For instance, an affine-regular quadrilateral can be equidissected into formula_1 equal-area triangles if and only if formula_1 is even, by affine invariance of equidissection and Monsky's theorem on equidissections of squares. More generally an formula_3-gon with formula_4 may be equidissected into formula_1 equal-area triangles if and only if formula_1 is a multiple of formula_3. Affine-regular polygon In geometry, an affine-regular polygon or affinely regular polygon is a polygon that is related to a regular polygon by an affine transformation. Affine transformations include translations, uniform
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