When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Hexagonal prism - Wikipedia

    en.wikipedia.org/wiki/Hexagonal_prism

    3D model of a uniform hexagonal prism. In geometry, the hexagonal prism is a prism with hexagonal base. Prisms are polyhedrons; this polyhedron has 8 faces, 18 edges, and 12 vertices. [1] Since it has 8 faces, it is an octahedron. However, the term octahedron is primarily used to refer to the regular octahedron, which has eight triangular faces.

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    The hexagonal packing of circles on a 2-dimensional Euclidean plane. These problems are mathematically distinct from the ideas in the circle packing theorem.The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere.

  4. Random close pack - Wikipedia

    en.wikipedia.org/wiki/Random_close_pack

    Random close packing (RCP) of spheres is an empirical parameter used to characterize the maximum volume fraction of solid objects obtained when they are packed randomly. For example, when a solid container is filled with grain, shaking the container will reduce the volume taken up by the objects, thus allowing more grain to be added to the container.

  5. List of formulas in elementary geometry - Wikipedia

    en.wikipedia.org/wiki/List_of_formulas_in...

    Cylinder. Sphere. Ellipsoid. This is a list of volume formulas of basic shapes: [4]: 405–406 ...

  6. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    To form an A-B-A-B-... hexagonal close packing of spheres, the coordinate points of the lattice will be the spheres' centers. Suppose, the goal is to fill a box with spheres according to HCP. The box would be placed on the x-y-z coordinate space. First form a row of spheres. The centers will all lie on a straight line.

  7. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    As the local density of a packing in an infinite space can vary depending on the volume over which it is measured, the problem is usually to maximise the average or asymptotic density, measured over a large enough volume. For equal spheres in three dimensions, the densest packing uses approximately 74% of the volume.

  8. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    In the two-dimensional Euclidean plane, Joseph Louis Lagrange proved in 1773 that the highest-density lattice packing of circles is the hexagonal packing arrangement, [1] in which the centres of the circles are arranged in a hexagonal lattice (staggered rows, like a honeycomb), and each circle is

  9. List of centroids - Wikipedia

    en.wikipedia.org/wiki/List_of_centroids

    Volume Cuboid: a, b = the sides of the cuboid's base c = the third side of the cuboid ... Right circular cylinder: r = the radius of the cylinder