Search Results for ""
41 - 50 of 174 for Hypersphere PackingSearch Results
A generalization of an ordinary two-dimensional surface embedded in three-dimensional space to an (n-1)-dimensional surface embedded in n-dimensional space. A hypersurface is ...
Four-dimensional geometry is Euclidean geometry extended into one additional dimension. The prefix "hyper-" is usually used to refer to the four- (and higher-) dimensional ...
Given n circles and a perimeter p, the total area of the convex hull is A_(Convex Hull)=2sqrt(3)(n-1)+p(1-1/2sqrt(3))+pi(sqrt(3)-1). Furthermore, the actual area equals this ...
A generalization of a solid such as a cube or a sphere to more than three dimensions. A four-dimensional version of a polyhedron is known as a polytope.
An arrangement of overlapping circles which cover the entire plane. A lower bound for a covering using equivalent circles is 2pi/sqrt(27) (Williams 1979, p. 51).
Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).
An a×b rectangle can be packed with 1×n strips iff n|a or n|b.
Maximize the amount of floor space which can be covered with a fixed tile (Hoffman 1998, p. 173).
A box can be packed with a harmonic brick a×ab×abc iff the box has dimensions ap×abq×abcr for some natural numbers p, q, r (i.e., the box is a multiple of the brick).
An n-dimensional disk (sometimes spelled "disc") of radius r is the collection of points of distance <=r (closed disk) or <r (open disk) from a fixed point in Euclidean ...
...
View search results from all Wolfram sites (763 matches)

