When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Platonic_solid

    In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are congruent (identical in shape and size) regular polygons (all angles congruent and all edges congruent), and the same number of faces meet at each vertex.

  3. Regular polyhedron - Wikipedia

    en.wikipedia.org/wiki/Regular_polyhedron

    A regular polyhedron is identified by its Schläfli symbol of the form {n, m}, where n is the number of sides of each face and m the number of faces meeting at each vertex. There are 5 finite convex regular polyhedra (the Platonic solids), and four regular star polyhedra (the Kepler–Poinsot polyhedra), making nine regular polyhedra in all. In ...

  4. Polyhedron - Wikipedia

    en.wikipedia.org/wiki/Polyhedron

    A convex polyhedron is a polyhedron that bounds a convex set. Every convex polyhedron can be constructed as the convex hull of its vertices, and for every finite set of points, not all on the same plane, the convex hull is a convex polyhedron. Cubes and pyramids are examples of convex polyhedra.

  5. List of Johnson solids - Wikipedia

    en.wikipedia.org/wiki/List_of_Johnson_solids

    A convex polyhedron whose faces are regular polygons is known as a Johnson solid, or sometimes as a Johnson–Zalgaller solid [3]. Some authors exclude uniform polyhedra from the definition. A uniform polyhedron is a polyhedron in which the faces are regular and they are isogonal ; examples include Platonic and Archimedean solids as well as ...

  6. Polyhedral graph - Wikipedia

    en.wikipedia.org/wiki/Polyhedral_graph

    A polyhedral graph is the graph of a simple polyhedron if it is cubic (every vertex has three edges), and it is the graph of a simplicial polyhedron if it is a maximal planar graph. For example, the tetrahedral, cubical, and dodecahedral graphs are simple; the tetrahedral, octahedral, and icosahedral graphs are simplicial.

  7. Euler characteristic - Wikipedia

    en.wikipedia.org/wiki/Euler_characteristic

    This equation, stated by Euler in 1758, [2] is known as Euler's polyhedron formula. [3] It corresponds to the Euler characteristic of the sphere (i.e. = ), and applies identically to spherical polyhedra. An illustration of the formula on all Platonic polyhedra is given below.

  8. Regular icosahedron - Wikipedia

    en.wikipedia.org/wiki/Regular_icosahedron

    The resulting polyhedron has 20 equilateral triangles as its faces, 30 edges, and 12 vertices. It is an example of a Platonic solid and of a deltahedron. The icosahedral graph represents the skeleton of a regular icosahedron. Many polyhedra are constructed from the regular icosahedron.

  9. 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.