Convex and discrete geometry Packing and covering Concept
Covering density
Summary
The covering density of a covering of space by bodies measures, on average, how many times each point is covered. It is at least , and the covering problem asks for the smallest possible value, the covering density of the body. It is the counterpart of the packing density, with overlaps allowed and gaps forbidden. For discs in the plane the optimum is , given by the hexagonal lattice arrangement.
Further reading
About this page
| Tag | BWSN2JAMTK |
|---|---|
| URI | m2://BWSN2JAMTK |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C17, 52C15, 11H31 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.