enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Euler characteristic - Wikipedia

    en.wikipedia.org/wiki/Euler_characteristic

    Vertex, edge and face of a cube. The Euler characteristic χ was classically defined for the surfaces of polyhedra, according to the formula = + where V, E, and F are respectively the numbers of vertices (corners), edges and faces in the given polyhedron.

  3. Cylinder - Wikipedia

    en.wikipedia.org/wiki/Cylinder

    The definitions and results in this section are taken from the 1913 text Plane and Solid Geometry by George A. Wentworth and David Eugene Smith (Wentworth & Smith 1913).. A cylindrical surface is a surface consisting of all the points on all the lines which are parallel to a given line and which pass through a fixed plane curve in a plane not parallel to the given line.

  4. Eberhard's theorem - Wikipedia

    en.wikipedia.org/wiki/Eberhard's_theorem

    An analogous result to Eberhard's theorem holds for the existence of polyhedra in which all vertices are incident to exactly four edges. In this case the equation derived from Euler's formula is not affected by the number of quadrilaterals, and for every assignment to the numbers of faces of other types that obeys this equation it is possible ...

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

  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. Planar graph - Wikipedia

    en.wikipedia.org/wiki/Planar_graph

    Euler's formula states that if a finite, connected, planar graph is drawn in the plane without any edge intersections, and v is the number of vertices, e is the number of edges and f is the number of faces (regions bounded by edges, including the outer, infinitely large region), then + =

  8. Manifold - Wikipedia

    en.wikipedia.org/wiki/Manifold

    A finite cylinder may be constructed as a manifold by starting with a strip [0,1] × [0,1] and gluing a pair of opposite edges on the boundary by a suitable diffeomorphism. A projective plane may be obtained by gluing a sphere with a hole in it to a Möbius strip along their respective circular boundaries.

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