When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Face (geometry) - Wikipedia

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

    where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of faces is 2 more than the excess of the number of edges over the number of vertices. For example, a cube has 12 edges and 8 vertices, and hence 6 faces.

  3. List of uniform polyhedra - Wikipedia

    en.wikipedia.org/wiki/List_of_uniform_polyhedra

    It follows that all vertices are congruent, and the polyhedron has a high degree of reflectional and rotational symmetry. Uniform polyhedra can be divided between convex forms with convex regular polygon faces and star forms. Star forms have either regular star polygon faces or vertex figures or both. This list includes these:

  4. Vertex (geometry) - Wikipedia

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

    where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of vertices is 2 more than the excess of the number of edges over the number of faces. For example, since a cube has 12 edges and 6 faces, the formula implies that it has eight vertices.

  5. List of uniform polyhedra by vertex figure - Wikipedia

    en.wikipedia.org/wiki/List_of_uniform_polyhedra...

    The relations can be made apparent by examining the vertex figures obtained by listing the faces adjacent to each vertex (remember that for uniform polyhedra all vertices are the same, that is vertex-transitive). For example, the cube has vertex figure 4.4.4, which is to say, three adjacent square faces. The possible faces are 3 - equilateral ...

  6. Edge (geometry) - Wikipedia

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

    where V is the number of vertices, E is the number of edges, and F is the number of faces. This equation is known as Euler's polyhedron formula. Thus the number of edges is 2 less than the sum of the numbers of vertices and faces. For example, a cube has 8 vertices and 6 faces, and hence 12 edges.

  7. Polyhedral combinatorics - Wikipedia

    en.wikipedia.org/wiki/Polyhedral_combinatorics

    The dimension of a face is the dimension of this hull. The 0-dimensional faces are the vertices themselves, and the 1-dimensional faces (called edges) are line segments connecting pairs of vertices. Note that this definition also includes as faces the empty set and the whole polytope P.

  8. Eberhard's theorem - Wikipedia

    en.wikipedia.org/wiki/Eberhard's_theorem

    Since the numbers of angles and sides of the faces are given, one can calculate the three numbers (the total number of vertices), (the total number of edges), and (the total number of faces), by summing over all faces and multiplying by an appropriate factor: [1]

  9. 6-polytope - Wikipedia

    en.wikipedia.org/wiki/6-polytope

    A 6-polytope is a closed six-dimensional figure with vertices, edges, faces, cells (3-faces), 4-faces, and 5-faces. A vertex is a point where six or more edges meet. An edge is a line segment where four or more faces meet, and a face is a polygon where three or more cells meet. A cell is a polyhedron.