When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Regular polygon - Wikipedia

    en.wikipedia.org/wiki/Regular_polygon

    A non-convex regular polygon is a regular star polygon. The most common example is the pentagram , which has the same vertices as a pentagon , but connects alternating vertices. For an n -sided star polygon, the Schläfli symbol is modified to indicate the density or "starriness" m of the polygon, as { n / m }.

  3. Polygon - Wikipedia

    en.wikipedia.org/wiki/Polygon

    Polygons have been known since ancient times. The regular polygons were known to the ancient Greeks, with the pentagram, a non-convex regular polygon (star polygon), appearing as early as the 7th century B.C. on a krater by Aristophanes, found at Caere and now in the Capitoline Museum. [40] [41]

  4. Constructible polygon - Wikipedia

    en.wikipedia.org/wiki/Constructible_polygon

    A regular polygon with n sides can be constructed with ruler, compass, and angle trisector if and only if =, where r, s, k ≥ 0 and where the p i are distinct Pierpont primes greater than 3 (primes of the form +). [8]: Thm. 2 These polygons are exactly the regular polygons that can be constructed with Conic section, and the regular polygons ...

  5. List of regular polytopes - Wikipedia

    en.wikipedia.org/wiki/List_of_regular_polytopes

    The polytopes of rank 2 (2-polytopes) are called polygons. Regular polygons are equilateral and cyclic. A p-gonal regular polygon is represented by Schläfli symbol {p}. Many sources only consider convex polygons, but star polygons, like the pentagram, when considered, can also be regular. They use the same vertices as the convex forms, but ...

  6. Regular complex polygon - Wikipedia

    en.wikipedia.org/wiki/Regular_complex_polygon

    The regular complex polygons have been completely characterized, and can be described using a symbolic notation developed by Coxeter. A regular complex polygon with all 2-edges can be represented by a graph, while forms with k-edges can only be related by hypergraphs. A k-edge can be seen as a set of vertices, with no order implied. They may be ...

  7. Regular polytope - Wikipedia

    en.wikipedia.org/wiki/Regular_polytope

    In mathematics, a regular polytope is a polytope whose symmetry group acts transitively on its flags, thus giving it the highest degree of symmetry.In particular, all its elements or j-faces (for all 0 ≤ j ≤ n, where n is the dimension of the polytope) — cells, faces and so on — are also transitive on the symmetries of the polytope, and are themselves regular polytopes of dimension j≤ n.

  8. Euclidean tilings by convex regular polygons - Wikipedia

    en.wikipedia.org/wiki/Euclidean_tilings_by...

    Convex regular polygons can also form plane tilings that are not edge-to-edge. Such tilings can be considered edge-to-edge as nonregular polygons with adjacent colinear edges. There are seven families of isogonal figures , each family having a real-valued parameter determining the overlap between sides of adjacent tiles or the ratio between the ...

  9. Digon - Wikipedia

    en.wikipedia.org/wiki/Digon

    Any straight-sided digon is regular even though it is degenerate, because its two edges are the same length and its two angles are equal (both being zero degrees). As such, the regular digon is a constructible polygon. [3] Some definitions of a polygon do not consider the digon to be a proper polygon because of its degeneracy in the Euclidean ...