Search Results for ""

Given a unit disk, find the smallest radius r(n) required for n equal disks to completely cover the unit disk. The first few such values are r(1) = 1 (1) r(2) = 1 (2) r(3) = ...

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

A problem is an exercise whose solution is desired. Mathematical "problems" may therefore range from simple puzzles to examination and contest problems to propositions whose ...

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 disk with radius 1. The (open) unit disk can also be considered to be the region in the complex plane defined by {z:|z|<1}, where |z| denotes the complex modulus. (The ...

The Lebesgue covering dimension is an important dimension and one of the first dimensions investigated. It is defined in terms of covering sets, and is therefore also called ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

An n-dimensional closed disk of radius r is the collection of points of distance <=r from a fixed point in n-dimensional Euclidean space. Krantz (1999, p. 3) uses the symbol ...

A Jensen disk is a disk in the complex plane whose diameter joins complex conjugate roots of a polynomial (Trott 2004, p. 22).

An n-dimensional open disk of radius r is the collection of points of distance less than r from a fixed point in Euclidean n-space. Krantz (1999, p. 3) uses the symbol D(x,r) ...