Search Results for ""

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

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

A honeycomb-like packing that forms hexagons.

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.

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

A parallelogram (parallelepiped) containing the minimum repeatable elements of a circle (sphere) packing.