enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Paper bag problem - Wikipedia

    en.wikipedia.org/wiki/Paper_bag_problem

    A cushion filled with stuffing. In geometry, the paper bag problem or teabag problem is to calculate the maximum possible inflated volume of an initially flat sealed rectangular bag which has the same shape as a cushion or pillow, made out of two pieces of material which can bend but not stretch.

  3. Egyptian geometry - Wikipedia

    en.wikipedia.org/wiki/Egyptian_geometry

    The solutions were written out in steps, outlining the process. Egyptian circle. ... (numbers 44, 45, 46) compute the volume of a rectangular granary. [10] [11] ...

  4. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing squares in a square: Optimal solutions have been proven for n from 1-10, 14-16, 22-25, 33-36, 62-64, 79-81, 98-100, and any square integer. The wasted space is asymptotically O(a 3/5). Packing squares in a circle: Good solutions are known for n ≤ 35. The optimal packing of 10 squares in a square

  5. Volume - Wikipedia

    en.wikipedia.org/wiki/Volume

    Some SI units of volume to scale and approximate corresponding mass of water. To ease calculations, a unit of volume is equal to the volume occupied by a unit cube (with a side length of one). Because the volume occupies three dimensions, if the metre (m) is chosen as a unit of length, the corresponding unit of volume is the cubic metre (m 3).

  6. Volume element - Wikipedia

    en.wikipedia.org/wiki/Volume_element

    Consider the linear subspace of the n-dimensional Euclidean space R n that is spanned by a collection of linearly independent vectors , …,. To find the volume element of the subspace, it is useful to know the fact from linear algebra that the volume of the parallelepiped spanned by the is the square root of the determinant of the Gramian matrix of the : (), = ….

  7. Convex volume approximation - Wikipedia

    en.wikipedia.org/wiki/Convex_volume_approximation

    The main result of the paper is a randomized algorithm for finding an approximation to the volume of a convex body in -dimensional Euclidean space by assuming the existence of a membership oracle. The algorithm takes time bounded by a polynomial in n {\displaystyle n} , the dimension of K {\displaystyle K} and 1 / ε {\displaystyle 1 ...

  8. Steinmetz solid - Wikipedia

    en.wikipedia.org/wiki/Steinmetz_solid

    The generation of a bicylinder Calculating the volume of a bicylinder. A bicylinder generated by two cylinders with radius r has the volume =, and the surface area [1] [6] =.. The upper half of a bicylinder is the square case of a domical vault, a dome-shaped solid based on any convex polygon whose cross-sections are similar copies of the polygon, and analogous formulas calculating the volume ...

  9. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    Cannonballs piled on a triangular (front) and rectangular (back) base, both FCC lattices. The problem of close-packing of spheres was first mathematically analyzed by Thomas Harriot around 1587, after a question on piling cannonballs on ships was posed to him by Sir Walter Raleigh on their expedition to America. [ 5 ]