When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

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

  4. Vertex figure - Wikipedia

    en.wikipedia.org/wiki/Vertex_figure

    Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance.

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

  6. List of Johnson solids - Wikipedia

    en.wikipedia.org/wiki/List_of_Johnson_solids

    The points, lines, and polygons of a polyhedron are referred to as its vertices, edges, and faces, respectively. [1] A polyhedron is considered to be convex if: [2] The shortest path between any two of its vertices lies either within its interior or on its boundary. None of its faces are coplanar—they do not share the same plane and do not ...

  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. If P itself has dimension d, the faces of P with dimension ...

  8. 4-polytope - Wikipedia

    en.wikipedia.org/wiki/4-polytope

    It comprises vertices (corner points), edges, faces and cells. A cell is the three-dimensional analogue of a face, and is therefore a polyhedron . Each face must join exactly two cells, analogous to the way in which each edge of a polyhedron joins just two faces.

  9. Regular 4-polytope - Wikipedia

    en.wikipedia.org/wiki/Regular_4-polytope

    The non-diagonal numbers say how many of the column's element occur in or at the row's element. For example, there are 2 vertices in each edge (each edge has 2 vertices), and 2 cells meet at each face (each face belongs to 2 cells), in any regular 4-polytope. The configuration for the dual polytope can be obtained by rotating the matrix by 180 ...