TOPICS
Search

Search Results for ""


331 - 340 of 1015 for Computational AlgorithmsSearch Results
A honeycomb-like packing that forms hexagons.
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 ...
Finding the densest not necessarily periodic sphere packing.
An a×b rectangle can be packed with 1×n strips iff n|a or n|b.
A lag system, introduced by Wang (1963), is a sort of opposite to a tag system. Lag systems allow dependence on more than just the first element, but remove only the first ...
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 ...
The conjecture that the maximum local density is given by rho_(dodecahedron).
In abstract topology, a machine is method for producing infinite loop spaces and spectra. In automata theory, an abstract machine that is implemented in hardware is simply ...
The mean tetrahedron volume V^_ is the average volume of a tetrahedron in tetrahedron picking within some given shape. As summarized in the following table, it is possible to ...
1 ... 31|32|33|34|35|36|37 ... 102 Previous Next

...