Jump to content

Disk covering problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Oleg Alexandrov (talk | contribs) at 04:59, 17 February 2007 (reword for clarity.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The disk covering problem was proposed by Zahn in 1962.

Given an integer $n$ , the problem asks for the smallest number $r(n)$ such that $n$ disks of radius $r(n)$ each are enough to cover the unit disk.

External links

Weisstein, Eric W. "Disk Covering Problem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/DiskCoveringProblem.html

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Disk_covering_problem&oldid=108782357"

Hidden category:

All stub articles