When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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.

  3. Digon - Wikipedia

    en.wikipedia.org/wiki/Digon

    Any straight-sided digon is regular even though it is degenerate, because its two edges are the same length and its two angles are equal (both being zero degrees). As such, the regular digon is a constructible polygon. [3] Some definitions of a polygon do not consider the digon to be a proper polygon because of its degeneracy in the Euclidean ...

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

  5. List of polygons - Wikipedia

    en.wikipedia.org/wiki/List_of_polygons

    These segments are called its edges or sides, and the points where two of the edges meet are the polygon's vertices (singular: vertex) or corners. The word polygon comes from Late Latin polygōnum (a noun), from Greek πολύγωνον ( polygōnon/polugōnon ), noun use of neuter of πολύγωνος ( polygōnos/polugōnos , the masculine ...

  6. Vertex (geometry) - Wikipedia

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

    In geometry, a vertex (pl.: vertices or vertexes) is a point where two or more curves, lines, or edges meet or intersect. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices.

  7. Rhombicosidodecahedron - Wikipedia

    en.wikipedia.org/wiki/Rhombicosidodecahedron

    In the mathematical field of graph theory, a rhombicosidodecahedral graph is the graph of vertices and edges of the rhombicosidodecahedron, one of the Archimedean solids. It has 60 vertices and 120 edges, and is a quartic graph Archimedean graph. [5] Square centered Schlegel diagram

  8. Dodecahedron - Wikipedia

    en.wikipedia.org/wiki/Dodecahedron

    Some dodecahedra have the same combinatorial structure as the regular dodecahedron (in terms of the graph formed by its vertices and edges), but their pentagonal faces are not regular: The pyritohedron, a common crystal form in pyrite, has pyritohedral symmetry, while the tetartoid has tetrahedral symmetry.

  9. Dual polyhedron - Wikipedia

    en.wikipedia.org/wiki/Dual_polyhedron

    The vertices and edges of a convex polyhedron form a graph (the 1-skeleton of the polyhedron), embedded on the surface of the polyhedron (a topological sphere). This graph can be projected to form a Schlegel diagram on a flat plane. The graph formed by the vertices and edges of the dual polyhedron is the dual graph of the original graph.