enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. List of two-dimensional geometric shapes - Wikipedia

    en.wikipedia.org/wiki/List_of_two-dimensional...

    This is a list of two-dimensional geometric shapes in Euclidean and other geometries. For mathematical objects in more dimensions, see list of mathematical shapes. For a broader scope, see list of shapes.

  3. List of uniform polyhedra - Wikipedia

    en.wikipedia.org/wiki/List_of_uniform_polyhedra

    In geometry, a uniform polyhedron is a polyhedron which has regular polygons as faces and is vertex-transitive (transitive on its vertices, isogonal, i.e. there is an isometry mapping any vertex onto any other). It follows that all vertices are congruent, and the polyhedron has a high degree of reflectional and rotational symmetry.

  4. List of mathematical shapes - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_shapes

    Tessellations of euclidean and hyperbolic space may also be considered regular polytopes. Note that an 'n'-dimensional polytope actually tessellates a space of one dimension less. For example, the (three-dimensional) platonic solids tessellate the 'two'-dimensional 'surface' of the sphere.

  5. 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 a total of 62 faces: 20 regular triangular faces, 30 square faces, 12 regular pentagonal faces, with 60 vertices, and 120 edges.

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

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

  8. Dodecahedron - Wikipedia

    en.wikipedia.org/wiki/Dodecahedron

    There are 6,384,634 topologically distinct convex dodecahedra, excluding mirror images—the number of vertices ranges from 8 to 20. [9] (Two polyhedra are "topologically distinct" if they have intrinsically different arrangements of faces and vertices, such that it is impossible to distort one into the other simply by changing the lengths of ...

  9. Icosahedron - Wikipedia

    en.wikipedia.org/wiki/Icosahedron

    Construction from the vertices of a truncated octahedron, showing internal rectangles. The Cartesian coordinates of the 12 vertices can be defined by the vectors defined by all the possible cyclic permutations and sign-flips of coordinates of the form (2, 1, 0). These coordinates represent the truncated octahedron with alternated vertices deleted.