When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Euler_characteristic

    The number of vertices and edges has remained the same, but the number of faces has been reduced by 1. Therefore, proving Euler's formula for the polyhedron reduces to proving V − E + F = 1 {\displaystyle \ V-E+F=1\ } for this deformed, planar object.

  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. Regular polyhedron - Wikipedia

    en.wikipedia.org/wiki/Regular_polyhedron

    The property of having a similar arrangement of faces around each vertex can be replaced by any of the following equivalent conditions in the definition: The vertices of a convex regular polyhedron all lie on a sphere. All the dihedral angles of the polyhedron are equal; All the vertex figures of the polyhedron are regular polygons.

  5. Platonic solid - Wikipedia

    en.wikipedia.org/wiki/Platonic_solid

    The high degree of symmetry of the Platonic solids can be interpreted in a number of ways. Most importantly, the vertices of each solid are all equivalent under the action of the symmetry group, as are the edges and faces. One says the action of the symmetry group is transitive on the vertices, edges, and faces.

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

  7. Solid geometry - Wikipedia

    en.wikipedia.org/wiki/Solid_geometry

    A parallelepiped where all edges are the same length; A cube, except that its faces are not squares but rhombi; Cuboid: A convex polyhedron bounded by six quadrilateral faces, whose polyhedral graph is the same as that of a cube [4] Some sources also require that each of the faces is a rectangle (so each pair of adjacent faces meets in a right ...

  8. 4-polytope - Wikipedia

    en.wikipedia.org/wiki/4-polytope

    Just as a 3D shape can be projected onto a flat sheet, so a 4-D shape can be projected onto 3-space or even onto a flat sheet. One common projection is a Schlegel diagram which uses stereographic projection of points on the surface of a 3-sphere into three dimensions, connected by straight edges, faces, and cells drawn in 3-space. Sectioning

  9. Euler operator (digital geometry) - Wikipedia

    en.wikipedia.org/wiki/Euler_operator_(digital...

    Let the number of vertices be V, edges be E, faces be F, components H, shells S, and let the genus be G (S and G correspond to the b 0 and b 2 Betti numbers respectively). Then, to denote a meaningful geometric object, the mesh must satisfy the generalized Euler–Poincaré formula. V – E + F = H + 2 * (S – G) The Euler operators preserve ...