The symmetry group of an n-sided regular polygon is dihedral group Dn (of order 2n): D2, 4D4, ...
Regular Show | polygon | regular expression | Regular Democratic Organization | regular polygon | Regular Masonic jurisdictions | The Polygon, Southampton | Ruby Wright Regular Girl | Regular sequence (algebra) | Regular sequence | Regular Production Option | Regular isotopy | Regular Hadamard matrix | Polygon triangulation | polygon (computer graphics) | Polygon | Perl Compatible Regular Expressions | General Polygon Clipper | General Association of Regular Baptist Churches |
For instance, the triangulations of regular polygons (with size given by the number of sides of the polygon, and a fixed choice of polygon to triangulate for each size) and the set of unrooted binary plane trees (up to graph isomorphism, with a fixed ordering of the leaves, and with size given by the number of leaves) are both counted by the Catalan numbers, so they form isomorphic combinatorial classes.
In its original definition, it is a polyhedron with regular faces and a symmetry group which is transitive on its vertices, which is more commonly referred to today as a uniform polyhedron (this follows from Thorold Gosset's 1900 definition of the more general semiregular polytope).