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. Template:Volume - Wikipedia

    en.wikipedia.org/wiki/Template:Volume

    This template calculates the volume of a three-dimensional space. This is for cubic feet, cubic centimeters, etc., not for converting linear measures to things like gallons. It only accepts numeric input, not units, and does not perform conversions.

  4. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    An a × b rectangle can be packed with 1 × n strips if and only if n divides a or n divides b. [ 15 ] [ 16 ] de Bruijn's theorem : A box can be packed with a harmonic brick a × a b × a b c if the box has dimensions a p × a b q × a b c r for some natural numbers p , q , r (i.e., the box is a multiple of the brick.) [ 15 ]

  5. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    In practice, suboptimal rectangular packings are often used to simplify decoding. Circle packing has become an essential tool in origami design, as each appendage on an origami figure requires a circle of paper. [12] Robert J. Lang has used the mathematics of circle packing to develop computer programs that aid in the design of complex origami ...

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

  7. Hopper (particulate collection container) - Wikipedia

    en.wikipedia.org/wiki/Hopper_(particulate...

    A hopper is a large, inverted pyramidal or conical container used in industrial processes to hold particulate matter or flowable material of any sort (e.g. dust, gravel, nuts, or seeds) and dispense these from the bottom when needed. In some specialized applications even small metal or plastic assembly components can be loaded and dispensed by ...

  8. Minimum bounding box algorithms - Wikipedia

    en.wikipedia.org/wiki/Minimum_bounding_box...

    It is a type of bounding volume. "Smallest" may refer to volume, area, perimeter, etc. of the box. It is sufficient to find the smallest enclosing box for the convex hull of the objects in question. It is straightforward to find the smallest enclosing box that has sides parallel to the coordinate axes; the difficult part of the problem is to ...

  9. Volumetric flow rate - Wikipedia

    en.wikipedia.org/wiki/Volumetric_flow_rate

    The area required to calculate the volumetric flow rate is real or imaginary, flat or curved, either as a cross-sectional area or a surface. The vector area is a combination of the magnitude of the area through which the volume passes through, A , and a unit vector normal to the area, n ^ {\displaystyle {\hat {\mathbf {n} }}} .