enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Eberhard's theorem - Wikipedia

    en.wikipedia.org/wiki/Eberhard's_theorem

    However, Eberhard's theorem states that it should be possible to form a simple polyhedron by adding some number of hexagons, and in this case one hexagon suffices: bisecting a cube on a regular hexagon passing through six of its faces produces two copies of a simple roofless polyhedron with three triangle faces, three pentagon faces, and one ...

  3. Polyhedral combinatorics - Wikipedia

    en.wikipedia.org/wiki/Polyhedral_combinatorics

    Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes. Research in polyhedral combinatorics falls into two distinct areas.

  4. Rhombicosidodecahedron - Wikipedia

    en.wikipedia.org/wiki/Rhombicosidodecahedron

    In geometry, the Rhombicosidodecahedron is an Archimedean solid, one of thirteen convex isogonal nonprismatic solids constructed of two or more types of regular polygon faces. It has 20 regular triangular faces, 30 square faces, 12 regular pentagonal faces, 60 vertices , and 120 edges .

  5. Regular polyhedron - Wikipedia

    en.wikipedia.org/wiki/Regular_polyhedron

    A regular polyhedron is identified by its Schläfli symbol of the form {n, m}, where n is the number of sides of each face and m the number of faces meeting at each vertex. There are 5 finite convex regular polyhedra (the Platonic solids), and four regular star polyhedra (the Kepler–Poinsot polyhedra), making nine regular polyhedra in all. In ...

  6. Polyhedron - Wikipedia

    en.wikipedia.org/wiki/Polyhedron

    For every convex polyhedron, there exists a dual polyhedron having faces in place of the original's vertices and vice versa, and; the same number of edges. The dual of a convex polyhedron can be obtained by the process of polar reciprocation. [34] Dual polyhedra exist in pairs, and the dual of a dual is just the original polyhedron again.

  7. Cauchy's theorem (geometry) - Wikipedia

    en.wikipedia.org/wiki/Cauchy's_theorem_(geometry)

    This is a fundamental result in rigidity theory: one consequence of the theorem is that, if one makes a physical model of a convex polyhedron by connecting together rigid plates for each of the polyhedron faces with flexible hinges along the polyhedron edges, then this ensemble of plates and hinges will necessarily form a rigid structure.

  8. Platonic solid - Wikipedia

    en.wikipedia.org/wiki/Platonic_solid

    In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are congruent (identical in shape and size) regular polygons (all angles congruent and all edges congruent), and the same number of faces meet at each vertex. There are only five such polyhedra:

  9. Polytope compound - Wikipedia

    en.wikipedia.org/wiki/Polytope_compound

    A regular polyhedral compound can be defined as a compound which, like a regular polyhedron, is vertex-transitive, edge-transitive, and face-transitive.Unlike the case of polyhedra, this is not equivalent to the symmetry group acting transitively on its flags; the compound of two tetrahedra is the only regular compound with that property.