TOPICS
Search

Search Results for ""


21 - 30 of 146 for packingSearch Results
The polyhedron resulting from letting each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces.
Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...
A parallelogram (parallelepiped) containing the minimum repeatable elements of a circle (sphere) packing.
The kissing number of a sphere is 12. This led Fejes Tóth (1943) to conjecture that in any unit sphere packing, the volume of any Voronoi cell around any sphere is at least ...
A plane shape constructed by Reinhardt (1934) that is conjectured to be the "worst" packer of all centrally-symmetric plane regions. It has a packing density of ...
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 ...
The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...
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.
1|2|3|4|5|6 ... 15 Previous Next

...