When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Euler_characteristic

    Any convex polyhedron's surface has 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.

  3. Euler's Gem - Wikipedia

    en.wikipedia.org/wiki/Euler's_Gem

    Euler's Gem: The Polyhedron Formula and the Birth of Topology is a book on the formula + = for the Euler characteristic of convex polyhedra and its connections to the history of topology. It was written by David Richeson and published in 2008 by the Princeton University Press , with a paperback edition in 2012.

  4. Regular 4-polytope - Wikipedia

    en.wikipedia.org/wiki/Regular_4-polytope

    The Euler characteristic for all 4-polytopes is zero, we have the 4-dimensional analogue of Euler's polyhedral formula: + = where N k denotes the number of k-faces in the polytope (a vertex is a 0-face, an edge is a 1-face, etc.).

  5. Face (geometry) - Wikipedia

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

    Any convex polyhedron's surface has Euler characteristic + =, 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.

  6. Angular defect - Wikipedia

    en.wikipedia.org/wiki/Angular_defect

    For a polyhedron, the defect at a vertex equals 2π minus the sum of all the angles at the vertex (all the faces at the vertex are included). If a polyhedron is convex, then the defect of each vertex is always positive. If the sum of the angles exceeds a full turn, as occurs in some vertices of many non-convex polyhedra, then the defect is ...

  7. Planar graph - Wikipedia

    en.wikipedia.org/wiki/Planar_graph

    Euler's formula is also valid for convex polyhedra. This is no coincidence: every convex polyhedron can be turned into a connected, simple, planar graph by using the Schlegel diagram of the polyhedron, a perspective projection of the polyhedron onto a plane with the center of perspective chosen near the center of one of the polyhedron's faces ...

  8. Polyhedral combinatorics - Wikipedia

    en.wikipedia.org/wiki/Polyhedral_combinatorics

    From the fact that each facet of a three-dimensional polyhedron has at least three edges, it follows by double counting that 2e ≥ 3f, and using this inequality to eliminate e and f from Euler's formula leads to the further inequalities e ≤ 3v − 6 and f ≤ 2v − 4. By duality, e ≤ 3f − 6 and v ≤ 2f − 4.

  9. List of topics named after Leonhard Euler - Wikipedia

    en.wikipedia.org/wiki/List_of_topics_named_after...

    Euler's formula, e ix = cos x + i sin x; Euler's polyhedral formula for planar graphs or polyhedra: v − e + f = 2, a special case of the Euler characteristic in topology; Euler's formula for the critical load of a column: = ()