The disk covering problem asks for the smallest real number r ( n ) {\displaystyle r(n)} such that n {\displaystyle n} disks of radius r ( n ) {\displaystyle r(n)} can be arranged in such a way as to cover the unit disk. Dually, for a given radius ε, one wishes to find the smallest integer n such that n disks of radius ε can cover the unit disk.
The disk covering problem asks for the smallest real number r ( n ) {\displaystyle r(n)} such that n {\displaystyle n} disks of radius r ( n ) {\displaystyle r(n)} can be arranged in such a way as to cover the unit disk. Dually, for a given radius ε, one wishes to find the smallest integer n such that n disks of radius ε can cover the unit disk.
Source: Wikipedia "Disk covering problem" · CC BY-SA 4.0
Share this article: X · Bluesky