Search results
Results from the WOW.Com Content Network
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.
In geometry, the napkin-ring problem involves finding the volume of a "band" of specified height around a sphere, i.e. the part that remains after a hole in the shape of a circular cylinder is drilled through the center of the sphere.
List of surface-area-to-volume ratios – Surface area per unit volume; List of surface area formulas – Measure of a two-dimensional surface; List of trigonometric identities; List of volume formulas – Quantity of three-dimensional space
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 ...
In algebraic terms, doubling a unit cube requires the construction of a line segment of length x, where x 3 = 2; in other words, x = , the cube root of two. This is because a cube of side length 1 has a volume of 1 3 = 1, and a cube of twice that volume (a volume of 2) has a side length of the cube root of 2.
Draw a horizontal line to the right of each point and extend it to infinity. Count the number of times the line intersects with polygon edges. A point is inside the polygon if either count of intersections is odd or point lies on an edge of the polygon. If none of the conditions are true, then point lies outside. [4]
The fold-and-cut problem asks what shapes can be obtained by folding a piece of paper flat, and making a single straight complete cut. The solution, known as the fold-and-cut theorem, states that any shape with straight sides can be obtained. A practical problem is how to fold a map so that it may be manipulated with minimal effort or movements.
In particular, for any fixed value of R the volume tends to a limiting value of 0 as n goes to infinity. Which value of n maximizes V n (R) depends upon the value of R; for example, the volume V n (1) is increasing for 0 ≤ n ≤ 5, achieves its maximum when n = 5, and is decreasing for n ≥ 5. [2]