enow.com Web Search

Search results

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

  3. Method of exhaustion - Wikipedia

    en.wikipedia.org/wiki/Method_of_exhaustion

    Proposition 2: The area of circles is proportional to the square of their diameters. [3] Proposition 5: The volumes of two tetrahedra of the same height are proportional to the areas of their triangular bases. [4] Proposition 10: The volume of a cone is a third of the volume of the corresponding cylinder which has the same base and height. [5]

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

  6. Regular polytope - Wikipedia

    en.wikipedia.org/wiki/Regular_polytope

    In two dimensions, there are infinitely many regular polygons, namely the regular n-sided polygon for n ≥ 3. The triangle is the 2-simplex. The square is both the 2-hypercube and the 2-orthoplex. The n-sided polygons for n ≥ 5 are exceptional. In three and four dimensions, there are several more exceptional regular polyhedra and 4-polytopes ...

  7. Euclidean tilings by convex regular polygons - Wikipedia

    en.wikipedia.org/wiki/Euclidean_tilings_by...

    For example: 3 6; 3 6; 3 4.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a ‘3-uniform (2-vertex types)’ tiling. Broken down, 3 6 ; 3 6 (both of different transitivity class), or (3 6 ) 2 , tells us that there are 2 vertices (denoted by the superscript 2), each with 6 equilateral 3-sided ...

  8. Pick's theorem - Wikipedia

    en.wikipedia.org/wiki/Pick's_theorem

    After relating area to the number of triangles in this way, the proof concludes by using Euler's polyhedral formula to relate the number of triangles to the number of grid points in the polygon. [5] Tiling of the plane by copies of a triangle with three integer vertices and no other integer points, as used in the proof of Pick's theorem

  9. Regular polygon - Wikipedia

    en.wikipedia.org/wiki/Regular_polygon

    A non-convex regular polygon is a regular star polygon. The most common example is the pentagram , which has the same vertices as a pentagon , but connects alternating vertices. For an n -sided star polygon, the Schläfli symbol is modified to indicate the density or "starriness" m of the polygon, as { n / m }.