When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Hexagon

    The longest diagonals of a regular hexagon, connecting diametrically opposite vertices, are twice the length of one side. From this it can be seen that a triangle with a vertex at the center of the regular hexagon and sharing one side with the hexagon is equilateral, and that the regular hexagon can be partitioned into six equilateral triangles.

  3. 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 }.

  4. Schläfli symbol - Wikipedia

    en.wikipedia.org/wiki/Schläfli_symbol

    Regular polytopes can have star polygon elements, like the pentagram, with symbol {5 ⁄ 2}, represented by the vertices of a pentagon but connected alternately. The Schläfli symbol can represent a finite convex polyhedron , an infinite tessellation of Euclidean space , or an infinite tessellation of hyperbolic space , depending on the angle ...

  5. Constructible polygon - Wikipedia

    en.wikipedia.org/wiki/Constructible_polygon

    In order to reduce a geometric problem to a problem of pure number theory, the proof uses the fact that a regular n-gon is constructible if and only if the cosine ⁡ (/) is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots.

  6. List of polygons - Wikipedia

    en.wikipedia.org/wiki/List_of_polygons

    In geometry, a polygon is traditionally a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed chain. These segments are called its edges or sides, and the points where two of the edges meet are the polygon's vertices (singular: vertex) or corners.

  7. Truncation (geometry) - Wikipedia

    en.wikipedia.org/wiki/Truncation_(geometry)

    A regular polygon uniformly truncated will become another regular polygon: t{n} is {2n}. A complete truncation (or rectification), r{3}, is another regular polygon in its dual position. A regular polygon can also be represented by its Coxeter-Dynkin diagram, , and its uniform truncation , and its complete truncation .

  8. Euclidean tilings by convex regular polygons - Wikipedia

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

    This means that, for every pair of flags, there is a symmetry operation mapping the first flag to the second. This is equivalent to the tiling being an edge-to-edge tiling by congruent regular polygons. There must be six equilateral triangles, four squares or three regular hexagons at a vertex, yielding the three regular tessellations.

  9. Polyhex (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Polyhex_(mathematics)

    One example self-tiling with a pentahex. All of the polyhexes with fewer than five hexagons can form at least one regular plane tiling. In addition, the plane tilings of the dihex and straight polyhexes are invariant under 180 degrees rotation or reflection parallel or perpendicular to the long axis of the dihex (order 2 rotational and order 4 reflection symmetry), and the hexagon tiling and ...