Convex and discrete geometry Packing and covering Concept
Circle packing
Summary
A circle packing is an arrangement of circles in the plane, or on a surface, whose discs do not overlap. One studies dense packings of equal circles, where the hexagonal packing is optimal by Thue's theorem. One also studies packings with prescribed tangencies, where the circle packing theorem realizes every planar graph. Circle packings give a discrete analogue of conformal maps, and fractal examples such as the Apollonian gasket.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | S360JBEYKD |
|---|---|
| URI | m2://S360JBEYKD |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52C15, 52C26, 05B40 |
| Same as |
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.